Home
last modified time | relevance | path

Searched refs:QuadNode (Results 1 – 25 of 25) sorted by relevance

/dports/games/py-fife/fifengine-0.4.2/engine/core/util/structures/
H A Dquadtree.h41 class QuadNode {
43 QuadNode *m_parent;
44 QuadNode *m_nodes[4];
55 QuadNode(QuadNode* parent, int32_t x, int32_t y, int32_t size) in QuadNode() function
60 ~QuadNode() { in ~QuadNode()
79 QuadNode* find_container(const Rect& rect) { in find_container()
133 QuadNode* parent() { return m_parent; }; in parent()
152 typedef QuadNode<DataType,MinimumSize> Node;
253 QuadNode<DataType,MinimumSize>*
297 QuadNode<DataType,MinimumSize>*
[all …]
/dports/graphics/gource/gource-0.51/src/core/
H A Dquadtree.cpp38 bool QuadNode::allowMoreItems() { in allowMoreItems()
107 void QuadNode::getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum) { in getLeavesInFrustum()
211 void QuadNode::visitLeavesInFrustum(const Frustum& frustum, VisitFunctor<QuadNode> & visit){ in visitLeavesInFrustum()
282 bool QuadNode::empty() { in empty()
302 QuadNode::QuadNode(QuadTree* tree, QuadNode* parent, Bounds2D bounds, int parent_depth) { in QuadNode() function in QuadNode
315 QuadNode::~QuadNode() { in ~QuadNode()
333 int QuadNode::usedChildren() { in usedChildren()
370 void QuadNode::generateLists() { in generateLists()
397 void QuadNode::outline() { in outline()
411 QuadNode* c = children[i]; in outline()
[all …]
H A Dquadtree.h55 class QuadNode {
60 std::vector<QuadNode*> children;
70 QuadNode* parent;
75 QuadNode(QuadTree* tree, QuadNode* parent, Bounds2D itembounds, int parent_depth);
76 ~QuadNode();
81 void getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum);
88 void visitLeavesInFrustum(const Frustum & frustum, VisitFunctor<QuadNode> & visit);
100 QuadNode* root;
109 void getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum);
114 void visitLeavesInFrustum(const Frustum & frustum, VisitFunctor<QuadNode> & visit);
/dports/sysutils/logstalgia/Logstalgia-logstalgia-1.1.2/src/core/
H A Dquadtree.cpp38 bool QuadNode::allowMoreItems() { in allowMoreItems()
107 void QuadNode::getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum) { in getLeavesInFrustum()
211 void QuadNode::visitLeavesInFrustum(const Frustum& frustum, VisitFunctor<QuadNode> & visit){ in visitLeavesInFrustum()
282 bool QuadNode::empty() { in empty()
302 QuadNode::QuadNode(QuadTree* tree, QuadNode* parent, Bounds2D bounds, int parent_depth) { in QuadNode() function in QuadNode
315 QuadNode::~QuadNode() { in ~QuadNode()
333 int QuadNode::usedChildren() { in usedChildren()
370 void QuadNode::generateLists() { in generateLists()
397 void QuadNode::outline() { in outline()
411 QuadNode* c = children[i]; in outline()
[all …]
H A Dquadtree.h55 class QuadNode {
60 std::vector<QuadNode*> children;
70 QuadNode* parent;
75 QuadNode(QuadTree* tree, QuadNode* parent, Bounds2D itembounds, int parent_depth);
76 ~QuadNode();
81 void getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum);
88 void visitLeavesInFrustum(const Frustum & frustum, VisitFunctor<QuadNode> & visit);
100 QuadNode* root;
109 void getLeavesInFrustum(std::set<QuadNode*>& nodeset, Frustum& frustum);
114 void visitLeavesInFrustum(const Frustum & frustum, VisitFunctor<QuadNode> & visit);
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/aabb-quadtree-0.1.0/src/
H A Dlib.rs49 root: QuadNode,
56 enum QuadNode { enum
71 impl Clone for QuadNode { implementation
72 fn clone(&self) -> QuadNode { in clone() argument
74 &QuadNode::Branch { in clone()
87 QuadNode::Branch { in clone()
95 &QuadNode::Leaf { in clone()
99 } => QuadNode::Leaf { in clone()
238 impl QuadNode { implementation
247 QuadNode::Leaf { in new_leaf()
[all …]
/dports/graphics/glosm/glosm-glosm-0.0.2/libglosm-client/include/glosm/
H A DTileManager.hh77 struct QuadNode { struct in TileManager
82 QuadNode* childs[4]; argument
84 QuadNode() : tile(NULL), generation(0), bbox(BBoxi::ForGeoTile(0, 0, 0)) { in QuadNode() argument
126 typedef std::vector<QuadNode**> GCQueue;
141 QuadNode root_;
185 …void RecLoadTilesBBox(RecLoadTilesInfo& info, QuadNode** pnode, int level = 0, int x = 0, int y = …
190 void RecPlaceTile(QuadNode* node, Tile* tile, int level = 0, int x = 0, int y = 0);
195 void RecRenderTiles(QuadNode* node, const Viewer& viewer);
200 void RecDestroyTiles(QuadNode* node);
205 void RecGarbageCollectTiles(QuadNode* node, GCQueue& gcqueue);
[all …]
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/far/
H A DpatchMap.h82 struct QuadNode { struct
83 QuadNode() { std::memset(this, 0, sizeof(QuadNode)); } in QuadNode() argument
99 typedef std::vector<QuadNode> QuadTree; argument
102 void assignRootNode(QuadNode * node, int index);
103 QuadNode * assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quad, int index);
118 std::vector<QuadNode> _quadtree; // quadtree nodes
202 QuadNode const * node = &_quadtree[faceid - _minPatchFace]; in FindPatch()
H A DpatchMap.cpp40 PatchMap::QuadNode::SetChildren(int index) { in SetChildren()
51 PatchMap::QuadNode::SetChild(int quadrant, int index, bool isLeaf) { in SetChild()
60 PatchMap::assignRootNode(QuadNode * node, int index) { in assignRootNode()
66 inline PatchMap::QuadNode *
67 PatchMap::assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quadrant, int index) { in assignLeafOrChildNode()
80 _quadtree.push_back(QuadNode()); in assignLeafOrChildNode()
162 QuadNode * node = &_quadtree[param.GetFaceId() - _minPatchFace]; in initializeQuadtree()
/dports/editors/ted/Ted-2.23/appUtil/
H A DgeoQuadTree.c84 static void qnFree( QuadNode * qn, in qnFree()
137 rval->qtRootNode= (QuadNode *)0; in qtMakeTree()
180 static QuadNode * qnMake( QuadNode * parent, in qnMake()
185 QuadNode * rval= (QuadNode *)malloc( sizeof(QuadNode) ); in qnMake()
188 { XDEB(rval); return (QuadNode *)0; } in qnMake()
196 { rval->qnChildren[i]= (QuadNode *)0; } in qnMake()
269 QuadNode * qn; in qtPut()
356 QuadNode * qn= qt->qtRootNode; in qtGetExact()
410 const QuadNode ** pFound, in qnGetNearest()
553 const QuadNode * found= (const QuadNode *)0; in qtGetNearest()
[all …]
H A DgeoQuadTree.h40 typedef struct QuadNode struct
45 struct QuadNode * qn_parent; argument
46 struct QuadNode * qnChildren[QTquad_COUNT]; argument
51 } QuadNode; argument
57 QuadNode * qtRootNode;
/dports/graphics/glosm/glosm-glosm-0.0.2/libglosm-client/src/
H A DTileManager.cc91 void TileManager::RecLoadTilesBBox(RecLoadTilesInfo& info, QuadNode** pnode, int level, int x, int … in RecLoadTilesBBox()
92 QuadNode* node; in RecLoadTilesBBox()
99 node = *pnode = new QuadNode; in RecLoadTilesBBox()
140 QuadNode* node; in RecLoadTilesLocality()
149 node = *pnode = new QuadNode; in RecLoadTilesLocality()
202 void TileManager::RecPlaceTile(QuadNode* node, Tile* tile, int level, int x, int y) { in RecPlaceTile()
227 void TileManager::RecDestroyTiles(QuadNode* node) { in RecDestroyTiles()
247 void TileManager::RecGarbageCollectTiles(QuadNode* node, GCQueue& gcqueue) { in RecGarbageCollectTiles()
262 void TileManager::RecRenderTiles(QuadNode* node, const Viewer& viewer) { in RecRenderTiles()
387 QuadNode* root = &root_; in Load()
[all …]
/dports/editors/ted/Ted-2.23/bitmap/
H A Dquad.h17 } QuadNode; typedef
21 QuadNode * qt_root;
/dports/astro/kstars/kstars-3.5.6/kstars/htmesh/
H A DSpatialIndex.h103 struct QuadNode struct
139 std::vector<QuadNode> nodes_; // the array of nodes
H A DNOTES24 // Slow: const struct SpatialIndex::QuadNode &indexNode = index_->nodes_[id];
25 const struct SpatialIndex::QuadNode *indexNode = &index_->nodes_[id]; //faster
H A DRangeConvex.cpp636 const struct SpatialIndex::QuadNode *indexNode = &index_->nodes_[id]; in testTrixel()
791 const struct SpatialIndex::QuadNode *indexNode = &index_->nodes_[id]; in testNode()
H A DSpatialIndex.cpp270 std::vector<QuadNode> oldnodes(nodes_); // create a copy of the node list in sortIndex()
/dports/games/py-fife/fifengine-0.4.2/engine/core/view/renderers/
H A Dquadtreerenderer.h48 template<typename T> bool visit(QuadNode<T,InstanceTree::MIN_TREE_SIZE>* node, int32_t d);
H A Dquadtreerenderer.cpp75 …template<typename T> bool RenderVisitor::visit(QuadNode<T,InstanceTree::MIN_TREE_SIZE>* node, int3… in visit()
/dports/games/tesseract-data/tesseract/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() function
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
333 QuadNode vmats(0, 0, worldsize); in optimizematsurfs()
/dports/games/tesseract/tesseract/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() argument
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
333 QuadNode vmats(0, 0, worldsize); in optimizematsurfs()
/dports/games/redeclipse/base-2.0.0/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() function
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
328 QuadNode vmats(0, 0, worldsize); in optimizematsurfs()
/dports/games/redeclipse16/base-1.6.0/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() argument
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
337 QuadNode vmats(0, 0, hdr.worldsize); in optimizematsurfs()
/dports/games/bloodfrontier/bloodfrontier/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() function
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
308 QuadNode vmats(0, 0, hdr.worldsize); in optimizematsurfs()
/dports/games/sauerbraten/sauerbraten/src/engine/
H A Dmaterial.cpp3 struct QuadNode struct
7 QuadNode *child[4]; argument
9 QuadNode(int x, int y, int size) : x(x), y(y), size(size), filled(0) { loopi(4) child[i] = 0; } in QuadNode() function
16 ~QuadNode() in ~QuadNode() argument
36 if(!child[i]) child[i] = new QuadNode(i&1 ? x+csize : x, i&2 ? y+csize : y, csize); in insert() argument
335 QuadNode vmats(0, 0, worldsize); in optimizematsurfs()