|
BRL-CAD
|
Files | |
| file | defines.h |
Macros | |
| #define | ID_NULL 0 |
| Unused. More... | |
| #define | ID_TOR 1 |
| Toroid. More... | |
| #define | ID_TGC 2 |
| Generalized Truncated General Cone. More... | |
| #define | ID_ELL 3 |
| Ellipsoid. More... | |
| #define | ID_ARB8 4 |
| Generalized ARB. V + 7 vectors. More... | |
| #define | ID_ARS 5 |
| ARS. More... | |
| #define | ID_HALF 6 |
| Half-space. More... | |
| #define | ID_REC 7 |
| Right Elliptical Cylinder [TGC special]. More... | |
| #define | ID_POLY 8 |
| Polygonal faceted object. More... | |
| #define | ID_BSPLINE 9 |
| B-spline object. More... | |
| #define | ID_SPH 10 |
| Sphere. More... | |
| #define | ID_NMG 11 |
| n-Manifold Geometry solid More... | |
| #define | ID_EBM 12 |
| Extruded bitmap solid. More... | |
| #define | ID_VOL 13 |
| 3-D Volume More... | |
| #define | ID_ARBN 14 |
| ARB with N faces. More... | |
| #define | ID_PIPE 15 |
| Pipe (wire) solid. More... | |
| #define | ID_PARTICLE 16 |
| Particle system solid. More... | |
| #define | ID_RPC 17 |
| Right Parabolic Cylinder More... | |
| #define | ID_RHC 18 |
| Right Hyperbolic Cylinder More... | |
| #define | ID_EPA 19 |
| Elliptical Paraboloid More... | |
| #define | ID_EHY 20 |
| Elliptical Hyperboloid More... | |
| #define | ID_ETO 21 |
| Elliptical Torus More... | |
| #define | ID_GRIP 22 |
| Pseudo Solid Grip. More... | |
| #define | ID_JOINT 23 |
| Pseudo Solid/Region Joint. More... | |
| #define | ID_HF 24 |
| Height Field. More... | |
| #define | ID_DSP 25 |
| Displacement map. More... | |
| #define | ID_SKETCH 26 |
| 2D sketch More... | |
| #define | ID_EXTRUDE 27 |
| Solid of extrusion. More... | |
| #define | ID_SUBMODEL 28 |
| Instanced submodel. More... | |
| #define | ID_CLINE 29 |
| FASTGEN4 CLINE solid. More... | |
| #define | ID_BOT 30 |
| Bag o' triangles. More... | |
| #define | ID_MAX_SOLID 47 |
| Maximum defined ID_xxx for solids. More... | |
| #define | ID_COMBINATION 31 |
| Combination Record. More... | |
| #define | ID_UNUSED1 32 |
| UNUSED (placeholder) More... | |
| #define | ID_BINUNIF 33 |
| Uniform-array binary. More... | |
| #define | ID_UNUSED2 34 |
| UNUSED (placeholder) More... | |
| #define | ID_CONSTRAINT 39 |
| Constraint object. More... | |
| #define | ID_MATERIAL 46 |
| Material object. More... | |
| #define | ID_SUPERELL 35 |
| Superquadratic ellipsoid. More... | |
| #define | ID_METABALL 36 |
| Metaball. More... | |
| #define | ID_BREP 37 |
| B-rep object. More... | |
| #define | ID_HYP 38 |
| Hyperboloid of one sheet. More... | |
| #define | ID_REVOLVE 40 |
| Solid of Revolution. More... | |
| #define | ID_PNTS 41 |
| Collection of Points. More... | |
| #define | ID_ANNOT 42 |
| Annotation. More... | |
| #define | ID_HRT 43 |
| Heart. More... | |
| #define | ID_DATUM 44 |
| Datum references. More... | |
| #define | ID_SCRIPT 45 |
| Script. More... | |
| #define | ID_MAXIMUM 47 |
| Maximum defined ID_xxx value. More... | |
| #define | RT_DBNHASH 8192 |
| hash table is an array of linked lists with this many array pointer elements (Memory use for 32-bit: 32KB, 64-bit: 64KB) More... | |
| #define | RT_DBHASH(sum) ((size_t)(sum) & ((RT_DBNHASH)-1)) |
| #define | RT_DEFAULT_MINPIECES 32 |
| #define | RT_DEFAULT_TRIS_PER_PIECE 4 |
| #define | RT_DEFAULT_MINTIE 0 /* TODO: find the best value */ |
| #define | BACKING_DIST (-2.0) |
| mm to look behind start point More... | |
| #define | OFFSET_DIST 0.01 |
| mm to advance point into box More... | |
| #define | RT_BADNUM(n) (!((n) >= -INFINITY && (n) <= INFINITY)) |
| #define | RT_BADVEC(v) (RT_BADNUM((v)[X]) || RT_BADNUM((v)[Y]) || RT_BADNUM((v)[Z])) |
| #define | RT_MAXLINE 10240 |
| #define | RT_PART_NUBSPT 0 |
Common definitions for LIBRT
| #define ID_MAX_SOLID 47 |
| #define RT_DBNHASH 8192 |
hash table is an array of linked lists with this many array pointer elements (Memory use for 32-bit: 32KB, 64-bit: 64KB)
DEPRECATED: external applications should use other LIBRT API to access database objects.
The directory is organized as forward linked lists hanging off of one of RT_DBNHASH headers in the db_i structure.
FIXME: this should not be public API, push container and iteration down into LIBRT. External applications should not use this.
| #define RT_DBHASH | ( | sum | ) | ((size_t)(sum) & ((RT_DBNHASH)-1)) |
| #define RT_DEFAULT_MINTIE 0 /* TODO: find the best value */ |