2006-03-20 17:12:09 +00:00
|
|
|
/*
|
2014-06-01 17:55:23 +00:00
|
|
|
* Portions of this file are copyright Rebirth contributors and licensed as
|
|
|
|
* described in COPYING.txt.
|
|
|
|
* Portions of this file are copyright Parallax Software and licensed
|
|
|
|
* according to the Parallax license below.
|
|
|
|
* See COPYING.txt for license details.
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
|
|
|
|
SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
|
|
|
|
END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
|
|
|
|
ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
|
|
|
|
IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
|
|
|
|
SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
|
|
|
|
FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
|
|
|
|
CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
|
|
|
|
AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
|
|
|
|
COPYRIGHT 1993-1999 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Include file for functions which need to access segment data structure.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _SEGMENT_H
|
|
|
|
#define _SEGMENT_H
|
|
|
|
|
2014-07-20 01:09:55 +00:00
|
|
|
#include <physfs.h>
|
2006-03-20 17:12:09 +00:00
|
|
|
#include "pstypes.h"
|
2012-07-01 02:54:33 +00:00
|
|
|
#include "maths.h"
|
2006-03-20 17:12:09 +00:00
|
|
|
#include "vecmat.h"
|
2013-11-17 00:17:58 +00:00
|
|
|
#include "dxxsconf.h"
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2012-11-11 22:12:51 +00:00
|
|
|
#ifdef __cplusplus
|
2014-07-20 01:09:55 +00:00
|
|
|
#include <cassert>
|
2013-12-26 22:21:16 +00:00
|
|
|
#include <cstdint>
|
2013-11-17 00:17:58 +00:00
|
|
|
#include <stdexcept>
|
2013-12-11 23:59:36 +00:00
|
|
|
#include "countarray.h"
|
2013-12-29 04:28:07 +00:00
|
|
|
#include "objnum.h"
|
|
|
|
#include "segnum.h"
|
2012-11-11 22:12:51 +00:00
|
|
|
|
2014-07-20 01:09:55 +00:00
|
|
|
#include "compiler-type_traits.h"
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
// Version 1 - Initial version
|
|
|
|
// Version 2 - Mike changed some shorts to bytes in segments, so incompatible!
|
|
|
|
|
|
|
|
#define SIDE_IS_QUAD 1 // render side as quadrilateral
|
|
|
|
#define SIDE_IS_TRI_02 2 // render side as two triangles, triangulated along edge from 0 to 2
|
|
|
|
#define SIDE_IS_TRI_13 3 // render side as two triangles, triangulated along edge from 1 to 3
|
|
|
|
|
|
|
|
// Set maximum values for segment and face data structures.
|
|
|
|
#define MAX_VERTICES_PER_SEGMENT 8
|
|
|
|
#define MAX_SIDES_PER_SEGMENT 6
|
|
|
|
#define MAX_VERTICES_PER_POLY 4
|
|
|
|
#define WLEFT 0
|
|
|
|
#define WTOP 1
|
|
|
|
#define WRIGHT 2
|
|
|
|
#define WBOTTOM 3
|
|
|
|
#define WBACK 4
|
|
|
|
#define WFRONT 5
|
|
|
|
|
2011-05-04 13:07:57 +00:00
|
|
|
#define MAX_SEGMENTS_ORIGINAL 900
|
|
|
|
#define MAX_SEGMENT_VERTICES_ORIGINAL (4*MAX_SEGMENTS_ORIGINAL)
|
|
|
|
#define MAX_SEGMENTS 9000
|
|
|
|
#define MAX_SEGMENT_VERTICES (4*MAX_SEGMENTS)
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
//normal everyday vertices
|
|
|
|
|
|
|
|
#define DEFAULT_LIGHTING 0 // (F1_0/2)
|
|
|
|
|
|
|
|
#ifdef EDITOR //verts for the new segment
|
|
|
|
# define NUM_NEW_SEG_VERTICES 8
|
|
|
|
# define NEW_SEGMENT_VERTICES (MAX_SEGMENT_VERTICES)
|
|
|
|
# define MAX_VERTICES (MAX_SEGMENT_VERTICES+NUM_NEW_SEG_VERTICES)
|
|
|
|
#else //No editor
|
|
|
|
# define MAX_VERTICES (MAX_SEGMENT_VERTICES)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// Returns true if segnum references a child, else returns false.
|
|
|
|
// Note that -1 means no connection, -2 means a connection to the outside world.
|
2014-06-07 17:46:32 +00:00
|
|
|
static inline bool IS_CHILD(segnum_t s)
|
|
|
|
{
|
|
|
|
return s != segment_none && s != segment_exit;
|
|
|
|
}
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
//Structure for storing u,v,light values.
|
|
|
|
//NOTE: this structure should be the same as the one in 3d.h
|
2013-12-22 22:03:07 +00:00
|
|
|
struct uvl
|
|
|
|
{
|
2006-03-20 17:12:09 +00:00
|
|
|
fix u, v, l;
|
2013-12-22 22:03:07 +00:00
|
|
|
};
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2013-12-22 22:03:07 +00:00
|
|
|
struct side
|
|
|
|
{
|
2006-03-20 17:12:09 +00:00
|
|
|
sbyte type; // replaces num_faces and tri_edge, 1 = quad, 2 = 0:2 triangulation, 3 = 1:3 triangulation
|
|
|
|
ubyte pad; //keep us longword alligned
|
|
|
|
short wall_num;
|
|
|
|
short tmap_num;
|
|
|
|
short tmap_num2;
|
|
|
|
uvl uvls[4];
|
|
|
|
vms_vector normals[2]; // 2 normals, if quadrilateral, both the same.
|
2013-12-22 22:03:07 +00:00
|
|
|
};
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2013-03-16 02:54:33 +00:00
|
|
|
struct segment {
|
2006-03-20 17:12:09 +00:00
|
|
|
#ifdef EDITOR
|
2013-12-29 04:28:07 +00:00
|
|
|
segnum_t segnum; // segment number, not sure what it means
|
2013-03-16 02:54:33 +00:00
|
|
|
short group; // group number to which the segment belongs.
|
2006-03-20 17:12:09 +00:00
|
|
|
#endif
|
2013-12-29 04:28:07 +00:00
|
|
|
objnum_t objects; // pointer to objects in this segment
|
2014-08-16 18:14:00 +00:00
|
|
|
array<segnum_t, MAX_SIDES_PER_SEGMENT> children; // indices of 6 children segments, front, left, top, right, bottom, back
|
2013-12-31 04:05:48 +00:00
|
|
|
// If bit n (1 << n) is set, then side #n in segment has had light subtracted from original (editor-computed) value.
|
|
|
|
ubyte light_subtracted;
|
2014-08-16 18:14:00 +00:00
|
|
|
array<side, MAX_SIDES_PER_SEGMENT> sides; // 6 sides
|
|
|
|
array<int, MAX_VERTICES_PER_SEGMENT> verts; // vertex ids of 4 front and 4 back vertices
|
2013-03-17 18:55:32 +00:00
|
|
|
ubyte special; // what type of center this is
|
|
|
|
sbyte matcen_num; // which center segment is associated with.
|
2013-03-03 01:03:33 +00:00
|
|
|
#if defined(DXX_BUILD_DESCENT_I)
|
|
|
|
short value;
|
|
|
|
#elif defined(DXX_BUILD_DESCENT_II)
|
2013-03-17 18:55:32 +00:00
|
|
|
sbyte value;
|
|
|
|
ubyte s2_flags;
|
2013-03-03 01:03:33 +00:00
|
|
|
#endif
|
2013-11-10 23:21:49 +00:00
|
|
|
fix static_light;
|
2013-03-16 02:54:33 +00:00
|
|
|
};
|
|
|
|
|
2013-03-03 01:03:33 +00:00
|
|
|
#if defined(DXX_BUILD_DESCENT_II)
|
2013-03-17 18:55:32 +00:00
|
|
|
#define segment2 segment
|
|
|
|
|
2013-03-03 01:03:33 +00:00
|
|
|
#define Segment2s Segments
|
|
|
|
// Get pointer to the segment2 for the given segment pointer
|
|
|
|
#define s2s2(segp) (segp)
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
#define S2F_AMBIENT_WATER 0x01
|
|
|
|
#define S2F_AMBIENT_LAVA 0x02
|
2013-03-03 01:03:33 +00:00
|
|
|
#endif
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
//values for special field
|
|
|
|
#define SEGMENT_IS_NOTHING 0
|
|
|
|
#define SEGMENT_IS_FUELCEN 1
|
|
|
|
#define SEGMENT_IS_REPAIRCEN 2
|
|
|
|
#define SEGMENT_IS_CONTROLCEN 3
|
|
|
|
#define SEGMENT_IS_ROBOTMAKER 4
|
2013-03-03 01:03:33 +00:00
|
|
|
#if defined(DXX_BUILD_DESCENT_I)
|
|
|
|
#define MAX_CENTER_TYPES 5
|
|
|
|
#elif defined(DXX_BUILD_DESCENT_II)
|
2006-03-20 17:12:09 +00:00
|
|
|
#define SEGMENT_IS_GOAL_BLUE 5
|
|
|
|
#define SEGMENT_IS_GOAL_RED 6
|
|
|
|
#define MAX_CENTER_TYPES 7
|
2013-03-03 01:03:33 +00:00
|
|
|
#endif
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
|
|
|
|
// Local segment data.
|
|
|
|
// This is stuff specific to a segment that does not need to get
|
|
|
|
// written to disk. This is a handy separation because we can add to
|
|
|
|
// this structure without obsoleting existing data on disk.
|
|
|
|
|
|
|
|
#define SS_REPAIR_CENTER 0x01 // Bitmask for this segment being part of repair center.
|
|
|
|
|
|
|
|
//--repair-- typedef struct {
|
|
|
|
//--repair-- int special_type;
|
|
|
|
//--repair-- short special_segment; // if special_type indicates repair center, this is the base of the repair center
|
|
|
|
//--repair-- } lsegment;
|
|
|
|
|
2013-12-11 23:59:36 +00:00
|
|
|
struct count_segment_array_t : public count_array_t<short, MAX_SEGMENTS> {};
|
|
|
|
|
2013-12-11 23:59:36 +00:00
|
|
|
struct group
|
|
|
|
{
|
2013-12-11 23:59:36 +00:00
|
|
|
struct segment_array_type_t : public count_segment_array_t {};
|
2013-12-11 23:59:36 +00:00
|
|
|
struct vertex_array_type_t : public count_array_t<int, MAX_VERTICES> {};
|
|
|
|
segment_array_type_t segments;
|
|
|
|
vertex_array_type_t vertices;
|
|
|
|
void clear()
|
|
|
|
{
|
|
|
|
segments.clear();
|
|
|
|
vertices.clear();
|
|
|
|
}
|
|
|
|
};
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2014-07-12 20:54:36 +00:00
|
|
|
struct segment_array_t : public array<segment, MAX_SEGMENTS>
|
|
|
|
{
|
|
|
|
unsigned highest;
|
|
|
|
#define Highest_segment_index Segments.highest
|
|
|
|
typedef array<segment, MAX_SEGMENTS> array_t;
|
|
|
|
template <typename T>
|
|
|
|
typename tt::enable_if<tt::is_integral<T>::value, reference>::type operator[](T n)
|
|
|
|
{
|
|
|
|
return array_t::operator[](n);
|
|
|
|
}
|
|
|
|
template <typename T>
|
|
|
|
typename tt::enable_if<tt::is_integral<T>::value, const_reference>::type operator[](T n) const
|
|
|
|
{
|
|
|
|
return array_t::operator[](n);
|
|
|
|
}
|
|
|
|
template <typename T>
|
|
|
|
typename tt::enable_if<!tt::is_integral<T>::value, reference>::type operator[](T) const = delete;
|
|
|
|
segment_array_t() = default;
|
|
|
|
segment_array_t(const segment_array_t &) = delete;
|
|
|
|
segment_array_t &operator=(const segment_array_t &) = delete;
|
|
|
|
};
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
// Globals from mglobal.c
|
2013-03-17 18:55:32 +00:00
|
|
|
#define Segment2s Segments
|
2012-11-11 00:12:17 +00:00
|
|
|
extern vms_vector Vertices[MAX_VERTICES];
|
2014-07-12 20:54:36 +00:00
|
|
|
extern segment_array_t Segments;
|
2006-03-20 17:12:09 +00:00
|
|
|
extern int Num_segments;
|
|
|
|
extern int Num_vertices;
|
|
|
|
|
2013-12-29 04:28:07 +00:00
|
|
|
static inline segnum_t operator-(const segment *s, const segment_array_t &S)
|
2013-12-12 21:48:34 +00:00
|
|
|
{
|
2013-12-29 04:28:07 +00:00
|
|
|
return segnum_t(static_cast<uint16_t>(s - (&*S.begin())));
|
2013-12-12 21:48:34 +00:00
|
|
|
}
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
// Get pointer to the segment2 for the given segment pointer
|
2013-03-17 18:55:32 +00:00
|
|
|
#define s2s2(segp) (segp)
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2013-07-14 21:47:36 +00:00
|
|
|
extern const sbyte Side_to_verts[MAX_SIDES_PER_SEGMENT][4]; // Side_to_verts[my_side] is list of vertices forming side my_side.
|
|
|
|
extern const int Side_to_verts_int[MAX_SIDES_PER_SEGMENT][4]; // Side_to_verts[my_side] is list of vertices forming side my_side.
|
2012-11-11 00:12:17 +00:00
|
|
|
extern const char Side_opposite[MAX_SIDES_PER_SEGMENT]; // Side_opposite[my_side] returns side opposite cube from my_side.
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
#define SEG_PTR_2_NUM(segptr) (Assert((unsigned) (segptr-Segments)<MAX_SEGMENTS),(segptr)-Segments)
|
|
|
|
|
2013-03-03 01:03:33 +00:00
|
|
|
#if defined(DXX_BUILD_DESCENT_II)
|
2006-03-20 17:12:09 +00:00
|
|
|
// New stuff, 10/14/95: For shooting out lights and monitors.
|
|
|
|
// Light cast upon vert_light vertices in segnum:sidenum by some light
|
2013-12-22 22:03:07 +00:00
|
|
|
struct delta_light {
|
2013-12-29 04:28:07 +00:00
|
|
|
segnum_t segnum;
|
2006-03-20 17:12:09 +00:00
|
|
|
sbyte sidenum;
|
|
|
|
sbyte dummy;
|
|
|
|
ubyte vert_light[4];
|
2013-12-22 22:03:07 +00:00
|
|
|
};
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
// Light at segnum:sidenum casts light on count sides beginning at index (in array Delta_lights)
|
2013-12-22 22:03:07 +00:00
|
|
|
struct dl_index {
|
2013-12-29 04:28:07 +00:00
|
|
|
segnum_t segnum;
|
2006-03-20 17:12:09 +00:00
|
|
|
sbyte sidenum;
|
|
|
|
sbyte count;
|
|
|
|
short index;
|
2013-12-22 22:03:07 +00:00
|
|
|
};
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
#define MAX_DL_INDICES 500
|
|
|
|
#define MAX_DELTA_LIGHTS 10000
|
|
|
|
|
|
|
|
#define DL_SCALE 2048 // Divide light to allow 3 bits integer, 5 bits fraction.
|
|
|
|
|
|
|
|
extern dl_index Dl_indices[MAX_DL_INDICES];
|
|
|
|
extern delta_light Delta_lights[MAX_DELTA_LIGHTS];
|
|
|
|
extern int Num_static_lights;
|
|
|
|
|
2013-12-29 04:28:07 +00:00
|
|
|
int subtract_light(segnum_t segnum, int sidenum);
|
|
|
|
int add_light(segnum_t segnum, int sidenum);
|
2006-03-20 17:12:09 +00:00
|
|
|
extern void restore_all_lights_in_mine(void);
|
|
|
|
extern void clear_light_subtracted(void);
|
2013-03-03 01:03:33 +00:00
|
|
|
#endif
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// --------------------- Segment interrogation functions ----------------------
|
|
|
|
// Do NOT read the segment data structure directly. Use these
|
|
|
|
// functions instead. The segment data structure is GUARANTEED to
|
|
|
|
// change MANY TIMES. If you read the segment data structure
|
|
|
|
// directly, your code will break, I PROMISE IT!
|
|
|
|
|
|
|
|
// Return a pointer to the list of vertex indices for face facenum in
|
|
|
|
// vp and the number of vertices in *nv.
|
2011-06-30 10:23:38 +00:00
|
|
|
extern void med_get_face_vertex_list(segment *s,int side, int facenum,int *nv,int **vp);
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
// Set *nf = number of faces in segment s.
|
|
|
|
extern void med_get_num_faces(segment *s,int *nf);
|
|
|
|
|
|
|
|
void med_validate_segment_side(segment *sp,int side);
|
|
|
|
|
|
|
|
// Delete segment from group
|
|
|
|
extern void delete_segment_from_group(int segment_num, int group_num);
|
|
|
|
|
|
|
|
// Add segment to group
|
|
|
|
extern void add_segment_to_group(int segment_num, int group_num);
|
|
|
|
|
2013-03-03 01:03:33 +00:00
|
|
|
#if defined(DXX_BUILD_DESCENT_II)
|
2006-03-20 17:12:09 +00:00
|
|
|
/*
|
2011-06-01 07:59:55 +00:00
|
|
|
* reads a segment2 structure from a PHYSFS_file
|
2006-03-20 17:12:09 +00:00
|
|
|
*/
|
2011-06-01 07:59:55 +00:00
|
|
|
void segment2_read(segment2 *s2, PHYSFS_file *fp);
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
/*
|
2011-06-01 07:59:55 +00:00
|
|
|
* reads a delta_light structure from a PHYSFS_file
|
2006-03-20 17:12:09 +00:00
|
|
|
*/
|
2011-06-01 07:59:55 +00:00
|
|
|
void delta_light_read(delta_light *dl, PHYSFS_file *fp);
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
/*
|
2011-06-01 07:59:55 +00:00
|
|
|
* reads a dl_index structure from a PHYSFS_file
|
2006-03-20 17:12:09 +00:00
|
|
|
*/
|
2011-06-01 07:59:55 +00:00
|
|
|
void dl_index_read(dl_index *di, PHYSFS_file *fp);
|
2006-03-20 17:12:09 +00:00
|
|
|
|
|
|
|
void segment2_write(segment2 *s2, PHYSFS_file *fp);
|
|
|
|
void delta_light_write(delta_light *dl, PHYSFS_file *fp);
|
|
|
|
void dl_index_write(dl_index *di, PHYSFS_file *fp);
|
2013-03-03 01:03:33 +00:00
|
|
|
#endif
|
2006-03-20 17:12:09 +00:00
|
|
|
|
2013-11-17 00:17:58 +00:00
|
|
|
template <typename T, unsigned bits>
|
|
|
|
class visited_segment_mask_t
|
|
|
|
{
|
|
|
|
static_assert(bits == 1 || bits == 2 || bits == 4, "bits must align in bytes");
|
|
|
|
protected:
|
|
|
|
enum
|
|
|
|
{
|
|
|
|
divisor = 8 / bits,
|
|
|
|
};
|
|
|
|
typedef array<ubyte, (MAX_SEGMENTS + (divisor - 1)) / divisor> array_t;
|
|
|
|
typedef typename array_t::size_type size_type;
|
|
|
|
array_t a;
|
|
|
|
struct base_maskproxy_t
|
|
|
|
{
|
|
|
|
unsigned m_shift;
|
2012-12-02 18:57:09 +00:00
|
|
|
unsigned shift() const
|
|
|
|
{
|
|
|
|
return m_shift * bits;
|
|
|
|
}
|
|
|
|
static unsigned bitmask_low_aligned()
|
|
|
|
{
|
|
|
|
return (1 << bits) - 1;
|
|
|
|
}
|
2013-11-17 00:17:58 +00:00
|
|
|
typename array_t::value_type mask() const
|
|
|
|
{
|
2012-12-02 18:57:09 +00:00
|
|
|
return bitmask_low_aligned() << shift();
|
2013-11-17 00:17:58 +00:00
|
|
|
}
|
|
|
|
base_maskproxy_t(unsigned shift) :
|
|
|
|
m_shift(shift)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
};
|
|
|
|
template <typename R>
|
|
|
|
struct tmpl_maskproxy_t : public base_maskproxy_t
|
|
|
|
{
|
|
|
|
R m_byte;
|
|
|
|
tmpl_maskproxy_t(R byte, unsigned shift) :
|
|
|
|
base_maskproxy_t(shift), m_byte(byte)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
};
|
|
|
|
template <typename R, typename A>
|
|
|
|
static R make_maskproxy(A &a, size_type segnum)
|
|
|
|
{
|
|
|
|
size_type idx = segnum / divisor;
|
|
|
|
if (idx >= a.size())
|
|
|
|
throw std::out_of_range("index exceeds segment range");
|
|
|
|
size_type bit = segnum % divisor;
|
|
|
|
return R(a[idx], bit);
|
|
|
|
}
|
|
|
|
public:
|
2013-12-22 05:27:46 +00:00
|
|
|
visited_segment_mask_t()
|
|
|
|
{
|
|
|
|
clear();
|
|
|
|
}
|
2013-11-17 00:17:58 +00:00
|
|
|
void clear()
|
|
|
|
{
|
|
|
|
a.fill(0);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class visited_segment_bitarray_t : public visited_segment_mask_t<bool, 1>
|
|
|
|
{
|
|
|
|
template <typename R>
|
|
|
|
struct tmpl_bitproxy_t : public tmpl_maskproxy_t<R>
|
|
|
|
{
|
|
|
|
tmpl_bitproxy_t(R byte, unsigned shift) :
|
|
|
|
tmpl_maskproxy_t<R>(byte, shift)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
dxx_explicit_operator_bool operator bool() const
|
|
|
|
{
|
|
|
|
return !!(this->m_byte & this->mask());
|
|
|
|
}
|
|
|
|
operator int() const DXX_CXX11_EXPLICIT_DELETE;
|
|
|
|
};
|
2014-06-30 03:25:47 +00:00
|
|
|
struct bitproxy_t : public tmpl_bitproxy_t<array_t::reference>
|
2013-11-17 00:17:58 +00:00
|
|
|
{
|
2014-06-30 03:25:47 +00:00
|
|
|
bitproxy_t(array_t::reference byte, unsigned shift) :
|
|
|
|
tmpl_bitproxy_t<array_t::reference>(byte, shift)
|
2013-11-17 00:17:58 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
bitproxy_t& operator=(bool b)
|
|
|
|
{
|
|
|
|
if (b)
|
|
|
|
this->m_byte |= this->mask();
|
|
|
|
else
|
|
|
|
this->m_byte &= ~this->mask();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
bitproxy_t& operator=(int) DXX_CXX11_EXPLICIT_DELETE;
|
|
|
|
};
|
2014-06-30 03:25:47 +00:00
|
|
|
typedef tmpl_bitproxy_t<array_t::const_reference> const_bitproxy_t;
|
2013-11-17 00:17:58 +00:00
|
|
|
public:
|
|
|
|
bitproxy_t operator[](size_type segnum)
|
|
|
|
{
|
|
|
|
return make_maskproxy<bitproxy_t>(a, segnum);
|
|
|
|
}
|
|
|
|
const_bitproxy_t operator[](size_type segnum) const
|
|
|
|
{
|
|
|
|
return make_maskproxy<const_bitproxy_t>(a, segnum);
|
|
|
|
}
|
|
|
|
};
|
2012-12-02 18:57:09 +00:00
|
|
|
|
|
|
|
template <unsigned bits>
|
|
|
|
class visited_segment_multibit_array_t : public visited_segment_mask_t<unsigned, bits>
|
|
|
|
{
|
|
|
|
typedef typename visited_segment_mask_t<unsigned, bits>::array_t array_t;
|
|
|
|
typedef typename visited_segment_mask_t<unsigned, bits>::size_type size_type;
|
|
|
|
template <typename R>
|
|
|
|
struct tmpl_multibit_proxy_t : public visited_segment_mask_t<unsigned, bits>::template tmpl_maskproxy_t<R>
|
|
|
|
{
|
|
|
|
tmpl_multibit_proxy_t(R byte, unsigned shift) :
|
|
|
|
visited_segment_mask_t<unsigned, bits>::template tmpl_maskproxy_t<R>(byte, shift)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
dxx_explicit_operator_bool operator bool() const
|
|
|
|
{
|
|
|
|
return !!(this->m_byte & this->mask());
|
|
|
|
}
|
|
|
|
operator unsigned() const
|
|
|
|
{
|
|
|
|
return (this->m_byte >> this->shift()) & this->bitmask_low_aligned();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct bitproxy_t : public tmpl_multibit_proxy_t<typename array_t::reference>
|
|
|
|
{
|
|
|
|
bitproxy_t(typename array_t::reference byte, unsigned shift) :
|
|
|
|
tmpl_multibit_proxy_t<typename array_t::reference>(byte, shift)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
bitproxy_t& operator=(unsigned u)
|
|
|
|
{
|
|
|
|
assert(!(u & ~this->bitmask_low_aligned()));
|
|
|
|
this->m_byte = (this->m_byte & ~this->mask()) | (u << this->shift());
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
typedef tmpl_multibit_proxy_t<typename array_t::const_reference> const_bitproxy_t;
|
|
|
|
public:
|
|
|
|
bitproxy_t operator[](size_type segnum)
|
|
|
|
{
|
|
|
|
return this->template make_maskproxy<bitproxy_t>(this->a, segnum);
|
|
|
|
}
|
|
|
|
const_bitproxy_t operator[](size_type segnum) const
|
|
|
|
{
|
|
|
|
return this->template make_maskproxy<const_bitproxy_t>(this->a, segnum);
|
|
|
|
}
|
|
|
|
};
|
2012-11-11 22:12:51 +00:00
|
|
|
#endif
|
|
|
|
|
2006-03-20 17:12:09 +00:00
|
|
|
#endif
|