ynkmr/Sourcetrail
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

logic: added type usage edge for types that occur as template arguments

Browse Source
This commit is contained in:
mlangkabel
2018-11-02 13:27:44 +01:00
parent 05649977a6
commit bff7b0d70a
20 changed files with 491 additions and 127 deletions
Download Patch File Download Diff File Expand all files Collapse all files
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Collision_b2BroadPhase.txt
+4 -2
View File
@@ -1976,13 +1976,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -2043,13 +2044,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Collision_b2DynamicTree.txt
+4 -2
View File
@@ -1916,13 +1916,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -1983,13 +1984,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_Contacts_b2Contact.txt
+4 -2
View File
@@ -4349,13 +4349,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -4416,13 +4417,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_Contacts_b2ContactSolver.txt
+4 -2
View File
@@ -3978,13 +3978,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -4045,13 +4046,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_Joints_b2Joint.txt
+4 -2
View File
@@ -5018,13 +5018,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -5085,13 +5086,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_b2Body.txt
+4 -2
View File
@@ -3752,13 +3752,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -3819,13 +3820,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_b2ContactManager.txt
+6 -3
View File
@@ -2647,13 +2647,14 @@ REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, co
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<b2BroadPhase>(b2BroadPhase *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -2714,13 +2715,14 @@ REFERENCE_TYPE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> u
REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2AABB b2TreeNode::aabb [b2DynamicTree.h <165:26 165:29>]
REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <165:9 165:15>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -2781,13 +2783,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_b2Fixture.txt
+4 -2
View File
@@ -3927,13 +3927,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -3994,13 +3995,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_b2Island.txt
+4 -2
View File
@@ -4038,13 +4038,14 @@ REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2Tree
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -4105,13 +4106,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
bin/test/data/CxxIndexSampleProjectsTestSuite/Box2D/expected_output/Box2D_Dynamics_b2World.txt
+8 -4
View File
@@ -3531,13 +3531,14 @@ REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQuer
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TEMPLATE_ARGUMENT: b2GrowableStack<int, 256> -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<b2WorldQueryWrapper>(b2WorldQueryWrapper *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -3612,13 +3613,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCa
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<b2WorldRayCastWrapper>(b2WorldRayCastWrapper *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]
@@ -3680,13 +3682,14 @@ REFERENCE_TYPE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> u
REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2AABB b2TreeNode::aabb [b2DynamicTree.h <165:26 165:29>]
REFERENCE_USAGE: const b2AABB & b2DynamicTree::GetFatAABB(int32) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <165:9 165:15>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <171:2 171:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <171:18 171:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <171:30 171:34>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <172:8 172:11>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <196:11 196:14>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <197:11 197:14>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <172:13 172:18>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <174:15 174:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int32 [b2DynamicTree.h <176:3 176:7>]
REFERENCE_CALL: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <176:24 176:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode [b2DynamicTree.h <182:9 182:18>]
REFERENCE_USAGE: void b2DynamicTree::Query<typename T>(T *, const b2AABB &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <182:28 182:34>]
@@ -3747,13 +3750,14 @@ REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInp
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <226:28 226:32>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2Vec2 b2Max(const b2Vec2 &, const b2Vec2 &) [b2DynamicTree.h <278:30 278:34>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2GrowableStack<int, 256> [b2DynamicTree.h <229:2 229:16>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <229:18 229:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::b2GrowableStack() [b2DynamicTree.h <229:30 229:34>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <230:8 230:11>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <283:10 283:13>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> void b2GrowableStack<int, 256>::Push(const int &) [b2DynamicTree.h <284:10 284:13>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2DynamicTree::m_root [b2DynamicTree.h <230:13 230:18>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 b2GrowableStack<int, 256>::GetCount() [b2DynamicTree.h <232:15 232:22>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int32 [b2DynamicTree.h <234:3 234:7>]
REFERENCE_CALL: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> int b2GrowableStack<int, 256>::Pop() [b2DynamicTree.h <234:24 234:26>]
REFERENCE_TYPE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode [b2DynamicTree.h <240:9 240:18>]
REFERENCE_USAGE: void b2DynamicTree::RayCast<typename T>(T *, const b2RayCastInput &) const -> b2TreeNode * b2DynamicTree::m_nodes [b2DynamicTree.h <240:28 240:34>]