b2_island.h 2.6 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. // MIT License
  2. // Copyright (c) 2019 Erin Catto
  3. // Permission is hereby granted, free of charge, to any person obtaining a copy
  4. // of this software and associated documentation files (the "Software"), to deal
  5. // in the Software without restriction, including without limitation the rights
  6. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. // copies of the Software, and to permit persons to whom the Software is
  8. // furnished to do so, subject to the following conditions:
  9. // The above copyright notice and this permission notice shall be included in all
  10. // copies or substantial portions of the Software.
  11. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  12. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  13. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  14. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  15. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  16. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  17. // SOFTWARE.
  18. #ifndef B2_ISLAND_H
  19. #define B2_ISLAND_H
  20. #include "box2d/b2_body.h"
  21. #include "box2d/b2_math.h"
  22. #include "box2d/b2_time_step.h"
  23. class b2Contact;
  24. class b2Joint;
  25. class b2StackAllocator;
  26. class b2ContactListener;
  27. struct b2ContactVelocityConstraint;
  28. struct b2Profile;
  29. /// This is an internal class.
  30. class b2Island
  31. {
  32. public:
  33. b2Island(int32 bodyCapacity, int32 contactCapacity, int32 jointCapacity,
  34. b2StackAllocator* allocator, b2ContactListener* listener);
  35. ~b2Island();
  36. void Clear()
  37. {
  38. m_bodyCount = 0;
  39. m_contactCount = 0;
  40. m_jointCount = 0;
  41. }
  42. void Solve(b2Profile* profile, const b2TimeStep& step, const b2Vec2& gravity, bool allowSleep);
  43. void SolveTOI(const b2TimeStep& subStep, int32 toiIndexA, int32 toiIndexB);
  44. void Add(b2Body* body)
  45. {
  46. b2Assert(m_bodyCount < m_bodyCapacity);
  47. body->m_islandIndex = m_bodyCount;
  48. m_bodies[m_bodyCount] = body;
  49. ++m_bodyCount;
  50. }
  51. void Add(b2Contact* contact)
  52. {
  53. b2Assert(m_contactCount < m_contactCapacity);
  54. m_contacts[m_contactCount++] = contact;
  55. }
  56. void Add(b2Joint* joint)
  57. {
  58. b2Assert(m_jointCount < m_jointCapacity);
  59. m_joints[m_jointCount++] = joint;
  60. }
  61. void Report(const b2ContactVelocityConstraint* constraints);
  62. b2StackAllocator* m_allocator;
  63. b2ContactListener* m_listener;
  64. b2Body** m_bodies;
  65. b2Contact** m_contacts;
  66. b2Joint** m_joints;
  67. b2Position* m_positions;
  68. b2Velocity* m_velocities;
  69. int32 m_bodyCount;
  70. int32 m_jointCount;
  71. int32 m_contactCount;
  72. int32 m_bodyCapacity;
  73. int32 m_contactCapacity;
  74. int32 m_jointCapacity;
  75. };
  76. #endif