Home
last modified time | relevance | path

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

12

/dports/graphics/ogre3d/ogre-1.11.6/PlugIns/BSPSceneManager/src/
H A DOgreBspNode.cpp37 BspNode::BspNode(BspLevel* owner, bool inIsLeaf) in BspNode() function in Ogre::BspNode
44 BspNode::BspNode() in BspNode() function in Ogre::BspNode
48 BspNode::~BspNode() in ~BspNode()
53 bool BspNode::isLeaf(void) const in isLeaf()
59 BspNode* BspNode::getFront(void) const in getFront()
69 BspNode* BspNode::getBack(void) const in getBack()
102 int BspNode::getNumFaceGroups(void) const in getNumFaceGroups()
112 int BspNode::getFaceGroupStart(void) const in getFaceGroupStart()
122 bool BspNode::isLeafVisible(const BspNode* leaf) const in isLeafVisible()
138 BspNode* BspNode::getNextNode(const Vector3& point) const in getNextNode()
[all …]
H A DOgreBspSceneManager.cpp251 BspNode* BspSceneManager::walkTree(Camera* camera, in walkTree()
264 BspNode* nd = mLevel->mRootNode + mLevel->mLeafStart; in walkTree()
323 void BspSceneManager::processVisibleLeaf(BspNode* leaf, Camera* cam, in processVisibleLeaf()
372 const BspNode::IntersectingObjectSet& objects = leaf->getObjects(); in processVisibleLeaf()
373 BspNode::IntersectingObjectSet::const_iterator oi, oiend; in processVisibleLeaf()
635 BspNode* leaf = lvl->getLeafStart(); in execute()
643 BspNode::IntersectingObjectSet::const_iterator a, b, theEnd; in execute()
683 BspNode::NodeBrushList::const_iterator bi, biend; in execute()
819 BspNode::IntersectingObjectSet::const_iterator i, iend; in processLeaf()
853 BspNode::NodeBrushList::const_iterator bi, biend; in processLeaf()
[all …]
H A DOgreBspLevel.cpp501 mRootNode = OGRE_NEW BspNode[mNumNodes]; in loadQuake3Level()
526 BspNode* node = &mRootNode[i]; in loadQuake3Level()
604 BspNode::Brush *pBrush = &(mBrushes[i]); in loadQuake3Level()
658 BspNode* node = &mRootNode[i + mLeafStart]; in loadQuake3Level()
689 BspNode::Brush *pBrush = &(mBrushes[realBrushIdx]); in loadQuake3Level()
799 bool BspLevel::isLeafVisible(const BspNode* from, const BspNode* to) const in isLeafVisible()
839 const BspNode* BspLevel::getRootNode(void) in getRootNode()
844 BspNode* BspLevel::findLeaf(const Vector3& point) const in findLeaf()
846 BspNode* node = mRootNode; in findLeaf()
931 std::list<BspNode*>::iterator nodeit, nodeitend; in _notifyObjectMoved()
[all …]
/dports/graphics/ogre3d19/sinbad-ogre-dd30349ea667/PlugIns/BSPSceneManager/src/
H A DOgreBspNode.cpp37 BspNode::BspNode(BspLevel* owner, bool inIsLeaf) in BspNode() function in Ogre::BspNode
44 BspNode::BspNode() in BspNode() function in Ogre::BspNode
48 BspNode::~BspNode() in ~BspNode()
53 bool BspNode::isLeaf(void) const in isLeaf()
59 BspNode* BspNode::getFront(void) const in getFront()
69 BspNode* BspNode::getBack(void) const in getBack()
102 int BspNode::getNumFaceGroups(void) const in getNumFaceGroups()
112 int BspNode::getFaceGroupStart(void) const in getFaceGroupStart()
122 bool BspNode::isLeafVisible(const BspNode* leaf) const in isLeafVisible()
138 BspNode* BspNode::getNextNode(const Vector3& point) const in getNextNode()
[all …]
H A DOgreBspSceneManager.cpp298 BspNode* BspSceneManager::walkTree(Camera* camera, in walkTree()
311 BspNode* nd = mLevel->mRootNode + mLevel->mLeafStart; in walkTree()
370 void BspSceneManager::processVisibleLeaf(BspNode* leaf, Camera* cam, in processVisibleLeaf()
419 const BspNode::IntersectingObjectSet& objects = leaf->getObjects(); in processVisibleLeaf()
420 BspNode::IntersectingObjectSet::const_iterator oi, oiend; in processVisibleLeaf()
682 BspNode* leaf = lvl->getLeafStart(); in execute()
690 BspNode::IntersectingObjectSet::const_iterator a, b, theEnd; in execute()
730 BspNode::NodeBrushList::const_iterator bi, biend; in execute()
866 BspNode::IntersectingObjectSet::const_iterator i, iend; in processLeaf()
900 BspNode::NodeBrushList::const_iterator bi, biend; in processLeaf()
[all …]
H A DOgreBspLevel.cpp501 mRootNode = OGRE_NEW BspNode[mNumNodes]; in loadQuake3Level()
526 BspNode* node = &mRootNode[i]; in loadQuake3Level()
604 BspNode::Brush *pBrush = &(mBrushes[i]); in loadQuake3Level()
658 BspNode* node = &mRootNode[i + mLeafStart]; in loadQuake3Level()
799 bool BspLevel::isLeafVisible(const BspNode* from, const BspNode* to) const in isLeafVisible()
839 const BspNode* BspLevel::getRootNode(void) in getRootNode()
844 BspNode* BspLevel::findLeaf(const Vector3& point) const in findLeaf()
846 BspNode* node = mRootNode; in findLeaf()
931 list<BspNode*>::type::iterator nodeit, nodeitend; in _notifyObjectMoved()
954 MovableToNodeMap::value_type(mov, list<BspNode*>::type())); in tagNodesWithMovable()
[all …]
/dports/graphics/ogre3d19/sinbad-ogre-dd30349ea667/PlugIns/BSPSceneManager/include/
H A DOgreBspNode.h51 class BspNode : public NodeAlloc
57 BspNode(BspLevel* owner, bool isLeaf);
59 BspNode();
60 ~BspNode();
77 BspNode* getFront(void) const;
83 BspNode* getBack(void) const;
96 BspNode* getNextNode(const Vector3& point) const;
132 bool isLeafVisible(const BspNode* leaf) const;
134 friend std::ostream& operator<< (std::ostream& o, BspNode& n);
169 BspNode* mFront;
[all …]
H A DOgreBspLevel.h66 bool isLeafVisible(const BspNode* from, const BspNode* to) const;
69 const BspNode* getRootNode(void);
74 BspNode* findLeaf(const Vector3& point) const;
84 BspNode* getLeafStart(void) {return &mRootNode[mLeafStart]; } in getLeafStart()
117 BspNode* mRootNode;
158 BspNode::Brush *mBrushes;
193 typedef map<const MovableObject*, list<BspNode*>::type >::type MovableToNodeMap;
197 void tagNodesWithMovable(BspNode* node, const MovableObject* mov, const Vector3& pos);
H A DOgreBspSceneManager.h91 …BspNode* walkTree(Camera* camera, VisibleObjectsBoundsInfo* visibleBounds, bool onlyShadowCasters);
93 void processVisibleLeaf(BspNode* leaf, Camera* cam,
255 … bool processNode(const BspNode* node, const Ray& tracingRay, RaySceneQueryListener* listener,
260 … bool processLeaf(const BspNode* node, const Ray& tracingRay, RaySceneQueryListener* listener,
/dports/graphics/ogre3d/ogre-1.11.6/PlugIns/BSPSceneManager/include/
H A DOgreBspNode.h58 class BspNode : public NodeAlloc
64 BspNode(BspLevel* owner, bool isLeaf);
66 BspNode();
67 ~BspNode();
84 BspNode* getFront(void) const;
90 BspNode* getBack(void) const;
103 BspNode* getNextNode(const Vector3& point) const;
139 bool isLeafVisible(const BspNode* leaf) const;
141 friend std::ostream& operator<< (std::ostream& o, BspNode& n);
176 BspNode* mFront;
[all …]
H A DOgreBspLevel.h75 bool isLeafVisible(const BspNode* from, const BspNode* to) const;
78 const BspNode* getRootNode(void);
83 BspNode* findLeaf(const Vector3& point) const;
93 BspNode* getLeafStart(void) {return &mRootNode[mLeafStart]; } in getLeafStart()
126 BspNode* mRootNode;
167 BspNode::Brush *mBrushes;
202 typedef std::map<const MovableObject*, std::list<BspNode*> > MovableToNodeMap;
206 void tagNodesWithMovable(BspNode* node, const MovableObject* mov, const Vector3& pos);
H A DOgreBspSceneManager.h96 …BspNode* walkTree(Camera* camera, VisibleObjectsBoundsInfo* visibleBounds, bool onlyShadowCasters);
98 void processVisibleLeaf(BspNode* leaf, Camera* cam,
262 … bool processNode(const BspNode* node, const Ray& tracingRay, RaySceneQueryListener* listener,
267 … bool processLeaf(const BspNode* node, const Ray& tracingRay, RaySceneQueryListener* listener,
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/viz/service/display/
H A Dbsp_tree.h20 struct BspNode { struct
27 std::unique_ptr<BspNode> back_child; argument
28 std::unique_ptr<BspNode> front_child; argument
30 explicit BspNode(std::unique_ptr<DrawPolygon> data);
31 ~BspNode();
37 std::unique_ptr<BspNode>& root() { return root_; } in root()
49 std::unique_ptr<BspNode> root_;
52 void BuildTree(BspNode* node,
64 const BspNode* node, in WalkInOrderVisitNodes()
65 const BspNode* first_child, in WalkInOrderVisitNodes()
[all …]
H A Dbsp_tree.cc17 BspNode::BspNode(std::unique_ptr<DrawPolygon> data) in BspNode() function in viz::BspNode
20 BspNode::~BspNode() = default;
26 root_ = std::make_unique<BspNode>(cc::PopFront(list)); in BspTree()
39 BspNode* node, in BuildTree()
71 node->back_child = std::make_unique<BspNode>(cc::PopFront(&back_list)); in BuildTree()
77 node->front_child = std::make_unique<BspNode>(cc::PopFront(&front_list)); in BuildTree()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/viz/service/display/
H A Dbsp_tree.h20 struct BspNode { struct
27 std::unique_ptr<BspNode> back_child; argument
28 std::unique_ptr<BspNode> front_child; argument
30 explicit BspNode(std::unique_ptr<DrawPolygon> data);
31 ~BspNode();
37 std::unique_ptr<BspNode>& root() { return root_; } in root()
49 std::unique_ptr<BspNode> root_;
52 void BuildTree(BspNode* node,
64 const BspNode* node, in WalkInOrderVisitNodes()
65 const BspNode* first_child, in WalkInOrderVisitNodes()
[all …]
H A Dbsp_tree.cc17 BspNode::BspNode(std::unique_ptr<DrawPolygon> data) in BspNode() function in viz::BspNode
20 BspNode::~BspNode() = default;
26 root_ = std::make_unique<BspNode>(cc::PopFront(list)); in BspTree()
39 BspNode* node, in BuildTree()
71 node->back_child = std::make_unique<BspNode>(cc::PopFront(&back_list)); in BuildTree()
77 node->front_child = std::make_unique<BspNode>(cc::PopFront(&front_list)); in BuildTree()
/dports/lang/spidermonkey60/firefox-60.9.0/third_party/rust/binary-space-partition/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { implementation
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { impl
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/www/geckodriver/mozilla-central-e9783a644016aa9b317887076618425586730d73/testing/geckodriver/cargo-crates/binary-space-partition-0.1.2/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { implementation
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { impl
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/www/firefox/firefox-99.0/third_party/rust/binary-space-partition/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { impl
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { implementation
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/binary-space-partition/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { impl
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { implementation
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/binary-space-partition/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { implementation
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { implementation
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/binary-space-partition/src/
H A Dlib.rs41 fn add_side<T: Plane>(side: &mut Option<Box<BspNode<T>>>, mut planes: Vec<T>) { in add_side()
44 *side = Some(Box::new(BspNode::new())); in add_side()
56 pub struct BspNode<T> { struct
58 front: Option<Box<BspNode<T>>>, argument
59 back: Option<Box<BspNode<T>>>, argument
62 impl<T> BspNode<T> { impl
65 BspNode { in new()
94 impl<T: Plane> BspNode<T> { impl
187 let mut node = BspNode::new(); in test_insert_depth()
204 let mut node = BspNode::new(); in test_order()
/dports/lang/spidermonkey60/firefox-60.9.0/third_party/rust/plane-split/src/
H A Dbsp.rs1 use binary_space_partition::{BspNode, Plane, PlaneCut};
70 tree: BspNode<Polygon<T, U>>,
78 tree: BspNode::new(), in new()
92 self.tree = BspNode::new(); in reset()
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/libdoomsday/src/world/
H A Dbspnode.cpp26 BspNode::BspNode(Partition const &partition) : Partition(partition) in BspNode() function in world::BspNode
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/libdoomsday/include/doomsday/world/
H A Dbspnode.h48 class LIBDOOMSDAY_PUBLIC BspNode : public BspElement, public de::Partition
51 BspNode(de::Partition const &partition);

12