OpenMesh
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
VHierarchyNodeIndex.hh
1 /* ========================================================================= *
2  * *
3  * OpenMesh *
4  * Copyright (c) 2001-2015, RWTH-Aachen University *
5  * Department of Computer Graphics and Multimedia *
6  * All rights reserved. *
7  * www.openmesh.org *
8  * *
9  *---------------------------------------------------------------------------*
10  * This file is part of OpenMesh. *
11  *---------------------------------------------------------------------------*
12  * *
13  * Redistribution and use in source and binary forms, with or without *
14  * modification, are permitted provided that the following conditions *
15  * are met: *
16  * *
17  * 1. Redistributions of source code must retain the above copyright notice, *
18  * this list of conditions and the following disclaimer. *
19  * *
20  * 2. Redistributions in binary form must reproduce the above copyright *
21  * notice, this list of conditions and the following disclaimer in the *
22  * documentation and/or other materials provided with the distribution. *
23  * *
24  * 3. Neither the name of the copyright holder nor the names of its *
25  * contributors may be used to endorse or promote products derived from *
26  * this software without specific prior written permission. *
27  * *
28  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
29  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
30  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
31  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
32  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
33  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
34  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
35  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
36  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
37  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
38  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
39  * *
40  * ========================================================================= */
41 
42 /*===========================================================================*\
43  * *
44  * $Revision$ *
45  * $Date$ *
46  * *
47 \*===========================================================================*/
48 
49 //=============================================================================
50 //
51 // CLASS newClass
52 //
53 //=============================================================================
54 
55 #ifndef OPENMESH_VDPROGMESH_VHIERARCHYNODEINDEX_HH
56 #define OPENMESH_VDPROGMESH_VHIERARCHYNODEINDEX_HH
57 
58 //== INCLUDES =================================================================
59 
60 #include <vector>
61 #include <cassert>
62 
63 //== FORWARDDECLARATIONS ======================================================
64 
65 
66 //== NAMESPACES ===============================================================
67 
68 namespace OpenMesh {
69 namespace VDPM {
70 
71 //== CLASS DEFINITION =========================================================
72 
73 
79 {
80 private:
81  unsigned int value_;
82 
83 public:
84 
85  static const VHierarchyNodeIndex InvalidIndex;
86 
87 public:
88 
90  { value_ = 0; }
91 
92  VHierarchyNodeIndex(unsigned int _value)
93  { value_ = _value; }
94 
96  { value_ = _other.value_; }
97 
98  VHierarchyNodeIndex(unsigned int _tree_id,
99  unsigned int _node_id,
100  unsigned short _tree_id_bits)
101  {
102  assert(_tree_id < ((unsigned int) 0x00000001 << _tree_id_bits));
103  assert(_node_id < ((unsigned int) 0x00000001 << (32 - _tree_id_bits)));
104  value_ = (_tree_id << (32 - _tree_id_bits)) | _node_id;
105  }
106 
107  bool is_valid(unsigned short _tree_id_bits) const
108  { return node_id(_tree_id_bits) != 0 ? true : false; }
109 
110  unsigned int tree_id(unsigned short _tree_id_bits) const
111  { return value_ >> (32 - _tree_id_bits); }
112 
113  unsigned int node_id(unsigned short _tree_id_bits) const
114  { return value_ & ((unsigned int) 0xFFFFFFFF >> _tree_id_bits); }
115 
116  bool operator< (const VHierarchyNodeIndex &other) const
117  { return (value_ < other.value_) ? true : false; }
118 
119  unsigned int value() const
120  { return value_; }
121 };
122 
123 
125 typedef std::vector<VHierarchyNodeIndex> VHierarchyNodeIndexContainer;
126 
127 
128 //=============================================================================
129 } // namespace VDPM
130 } // namespace OpenMesh
131 //=============================================================================
132 #endif // OPENMESH_VDPROGMESH_VHIERARCHYNODEINDEX_HH defined
133 //=============================================================================
std::vector< VHierarchyNodeIndex > VHierarchyNodeIndexContainer
Container for vertex hierarchy node indices.
Definition: VHierarchyNodeIndex.hh:125
Index of vertex hierarchy node.
Definition: VHierarchyNodeIndex.hh:78
Contains all the mesh ingredients like the polygonal mesh, the triangle mesh, different mesh kernels ...
Definition: MeshItems.hh:64

Project OpenMesh, ©  Computer Graphics Group, RWTH Aachen. Documentation generated using doxygen .