CollisionGroupTests.cpp 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  1. // Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
  2. // SPDX-FileCopyrightText: 2021 Jorrit Rouwe
  3. // SPDX-License-Identifier: MIT
  4. #include "UnitTestFramework.h"
  5. #include <Jolt/Physics/Collision/GroupFilterTable.h>
  6. #include "Layers.h"
  7. TEST_SUITE("CollisionGroupTests")
  8. {
  9. TEST_CASE("TestCollisionGroup1")
  10. {
  11. // Test group filter with no sub groups
  12. Ref<GroupFilterTable> group_filter = new GroupFilterTable;
  13. // Check that doesn't collide with self
  14. CollisionGroup g1(group_filter, 0, 0);
  15. CHECK(!g1.CanCollide(g1));
  16. // Check that collides with other group
  17. CollisionGroup g2(group_filter, 1, 0);
  18. CHECK(g1.CanCollide(g2));
  19. CHECK(g2.CanCollide(g1));
  20. }
  21. TEST_CASE("TestCollisionGroup2")
  22. {
  23. // Test group filter with no sub groups
  24. Ref<GroupFilterTable> group_filter1 = new GroupFilterTable(10);
  25. Ref<GroupFilterTable> group_filter2 = new GroupFilterTable(10);
  26. // Disable some pairs
  27. using SubGroupPair = pair<CollisionGroup::SubGroupID, CollisionGroup::SubGroupID>;
  28. Array<SubGroupPair> pairs = {
  29. SubGroupPair(CollisionGroup::SubGroupID(1), CollisionGroup::SubGroupID(2)),
  30. SubGroupPair(CollisionGroup::SubGroupID(9), CollisionGroup::SubGroupID(5)),
  31. SubGroupPair(CollisionGroup::SubGroupID(3), CollisionGroup::SubGroupID(7)),
  32. SubGroupPair(CollisionGroup::SubGroupID(6), CollisionGroup::SubGroupID(1)),
  33. SubGroupPair(CollisionGroup::SubGroupID(8), CollisionGroup::SubGroupID(1))
  34. };
  35. for (const SubGroupPair &p : pairs)
  36. {
  37. group_filter1->DisableCollision(p.first, p.second);
  38. group_filter2->DisableCollision(p.first, p.second);
  39. }
  40. for (CollisionGroup::SubGroupID i = 0; i < 10; ++i)
  41. for (CollisionGroup::SubGroupID j = 0; j < 10; ++j)
  42. {
  43. // Check that doesn't collide with self
  44. CollisionGroup g1(group_filter1, 0, i);
  45. CHECK(!g1.CanCollide(g1));
  46. // Same filter, same group, check if pairs collide
  47. CollisionGroup g2(group_filter1, 0, j);
  48. if (i == j
  49. || find(pairs.begin(), pairs.end(), SubGroupPair(i, j)) != pairs.end()
  50. || find(pairs.begin(), pairs.end(), SubGroupPair(j, i)) != pairs.end())
  51. {
  52. CHECK(!g1.CanCollide(g2));
  53. CHECK(!g2.CanCollide(g1));
  54. }
  55. else
  56. {
  57. CHECK(g1.CanCollide(g2));
  58. CHECK(g2.CanCollide(g1));
  59. }
  60. // Using different group always collides
  61. CollisionGroup g3(group_filter1, 1, j);
  62. CHECK(g1.CanCollide(g3));
  63. CHECK(g3.CanCollide(g1));
  64. // Using different filter with equal group should not collide
  65. CollisionGroup g4(group_filter2, 0, j);
  66. CHECK(!g1.CanCollide(g4));
  67. CHECK(!g4.CanCollide(g1));
  68. // Using different filter with non-equal group should collide
  69. CollisionGroup g5(group_filter2, 1, j);
  70. CHECK(g1.CanCollide(g5));
  71. CHECK(g5.CanCollide(g1));
  72. }
  73. }
  74. }