B3_DBVT_INLINE (reference) in projects: dports

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:B3_DBVT_INLINE (Results 1 – 8 of 8) sorted by relevance

/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/
H A D	b3DynamicBvh.h	54 #define B3_DBVT_INLINE B3_FORCE_INLINE macro 144 B3_DBVT_INLINE void Expand(const b3Vector3& e); 145 B3_DBVT_INLINE void SignedExpand(const b3Vector3& e); 146 B3_DBVT_INLINE bool Contain(const b3DbvtAabbMm& a) const; 166 B3_DBVT_INLINE b3Vector3& tMins() { return (mi); } in tMins() 167 B3_DBVT_INLINE b3Vector3& tMaxs() { return (mx); } in tMaxs() 567 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 590 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 612 B3_DBVT_INLINE int b3Select(const b3DbvtAabbMm& o, in b3Select() 691 B3_DBVT_INLINE void b3Merge(const b3DbvtAabbMm& a, in b3Merge() [all …]
H A D	b3DynamicBvh.cpp	31 static B3_DBVT_INLINE int b3IndexOf(const b3DbvtNode* node) in b3IndexOf() 37 static B3_DBVT_INLINE b3DbvtVolume b3Merge(const b3DbvtVolume& a, in b3Merge() 51 static B3_DBVT_INLINE b3Scalar b3Size(const b3DbvtVolume& a) in b3Size() 71 static B3_DBVT_INLINE void b3DeleteNode(b3DynamicBvh* pdbvt, in b3DeleteNode() 92 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 113 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 124 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 414 static B3_DBVT_INLINE b3DbvtNode* b3Sort(b3DbvtNode* n, b3DbvtNode& r) in b3Sort() 445 static B3_DBVT_INLINE b3DbvtNode walkup(b3DbvtNode* n,int count)
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/BroadPhaseCollision/
H A D	b3DynamicBvh.h	54 #define B3_DBVT_INLINE B3_FORCE_INLINE macro 144 B3_DBVT_INLINE void Expand(const b3Vector3& e); 145 B3_DBVT_INLINE void SignedExpand(const b3Vector3& e); 146 B3_DBVT_INLINE bool Contain(const b3DbvtAabbMm& a) const; 166 B3_DBVT_INLINE b3Vector3& tMins() { return (mi); } in tMins() 167 B3_DBVT_INLINE b3Vector3& tMaxs() { return (mx); } in tMaxs() 567 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 590 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 612 B3_DBVT_INLINE int b3Select(const b3DbvtAabbMm& o, in b3Select() 691 B3_DBVT_INLINE void b3Merge(const b3DbvtAabbMm& a, in b3Merge() [all …]
H A D	b3DynamicBvh.cpp	31 static B3_DBVT_INLINE int b3IndexOf(const b3DbvtNode* node) in b3IndexOf() 37 static B3_DBVT_INLINE b3DbvtVolume b3Merge(const b3DbvtVolume& a, in b3Merge() 51 static B3_DBVT_INLINE b3Scalar b3Size(const b3DbvtVolume& a) in b3Size() 71 static B3_DBVT_INLINE void b3DeleteNode(b3DynamicBvh* pdbvt, in b3DeleteNode() 92 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 113 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 124 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 414 static B3_DBVT_INLINE b3DbvtNode* b3Sort(b3DbvtNode* n, b3DbvtNode& r) in b3Sort() 445 static B3_DBVT_INLINE b3DbvtNode walkup(b3DbvtNode* n,int count)
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/BroadPhaseCollision/
H A D	b3DynamicBvh.h	54 #define B3_DBVT_INLINE B3_FORCE_INLINE macro 144 B3_DBVT_INLINE void Expand(const b3Vector3& e); 145 B3_DBVT_INLINE void SignedExpand(const b3Vector3& e); 146 B3_DBVT_INLINE bool Contain(const b3DbvtAabbMm& a) const; 166 B3_DBVT_INLINE b3Vector3& tMins() { return (mi); } in tMins() 167 B3_DBVT_INLINE b3Vector3& tMaxs() { return (mx); } in tMaxs() 567 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 590 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 612 B3_DBVT_INLINE int b3Select(const b3DbvtAabbMm& o, in b3Select() 691 B3_DBVT_INLINE void b3Merge(const b3DbvtAabbMm& a, in b3Merge() [all …]
H A D	b3DynamicBvh.cpp	31 static B3_DBVT_INLINE int b3IndexOf(const b3DbvtNode* node) in b3IndexOf() 37 static B3_DBVT_INLINE b3DbvtVolume b3Merge(const b3DbvtVolume& a, in b3Merge() 51 static B3_DBVT_INLINE b3Scalar b3Size(const b3DbvtVolume& a) in b3Size() 71 static B3_DBVT_INLINE void b3DeleteNode(b3DynamicBvh* pdbvt, in b3DeleteNode() 92 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 113 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 124 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 414 static B3_DBVT_INLINE b3DbvtNode* b3Sort(b3DbvtNode* n, b3DbvtNode& r) in b3Sort() 445 static B3_DBVT_INLINE b3DbvtNode walkup(b3DbvtNode* n,int count)
/dports/devel/bullet/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/
H A D	b3DynamicBvh.h	54 #define B3_DBVT_INLINE B3_FORCE_INLINE macro 144 B3_DBVT_INLINE void Expand(const b3Vector3& e); 145 B3_DBVT_INLINE void SignedExpand(const b3Vector3& e); 146 B3_DBVT_INLINE bool Contain(const b3DbvtAabbMm& a) const; 166 B3_DBVT_INLINE b3Vector3& tMins() { return (mi); } in tMins() 167 B3_DBVT_INLINE b3Vector3& tMaxs() { return (mx); } in tMaxs() 567 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 590 B3_DBVT_INLINE bool b3Intersect(const b3DbvtAabbMm& a, in b3Intersect() 612 B3_DBVT_INLINE int b3Select(const b3DbvtAabbMm& o, in b3Select() 691 B3_DBVT_INLINE void b3Merge(const b3DbvtAabbMm& a, in b3Merge() [all …]
H A D	b3DynamicBvh.cpp	31 static B3_DBVT_INLINE int b3IndexOf(const b3DbvtNode* node) in b3IndexOf() 37 static B3_DBVT_INLINE b3DbvtVolume b3Merge(const b3DbvtVolume& a, in b3Merge() 51 static B3_DBVT_INLINE b3Scalar b3Size(const b3DbvtVolume& a) in b3Size() 71 static B3_DBVT_INLINE void b3DeleteNode(b3DynamicBvh* pdbvt, in b3DeleteNode() 92 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 113 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 124 static B3_DBVT_INLINE b3DbvtNode* b3CreateNode(b3DynamicBvh* pdbvt, in b3CreateNode() 414 static B3_DBVT_INLINE b3DbvtNode* b3Sort(b3DbvtNode* n, b3DbvtNode& r) in b3Sort() 445 static B3_DBVT_INLINE b3DbvtNode walkup(b3DbvtNode* n,int count)