b2Island.h 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. * Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
  3. *
  4. * This software is provided 'as-is', without any express or implied
  5. * warranty. In no event will the authors be held liable for any damages
  6. * arising from the use of this software.
  7. * Permission is granted to anyone to use this software for any purpose,
  8. * including commercial applications, and to alter it and redistribute it
  9. * freely, subject to the following restrictions:
  10. * 1. The origin of this software must not be misrepresented; you must not
  11. * claim that you wrote the original software. If you use this software
  12. * in a product, an acknowledgment in the product documentation would be
  13. * appreciated but is not required.
  14. * 2. Altered source versions must be plainly marked as such, and must not be
  15. * misrepresented as being the original software.
  16. * 3. This notice may not be removed or altered from any source distribution.
  17. */
  18. #ifndef B2_ISLAND_H
  19. #define B2_ISLAND_H
  20. #include <Box2D/Common/b2Math.h>
  21. #include <Box2D/Dynamics/b2Body.h>
  22. #include <Box2D/Dynamics/b2TimeStep.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