reflexion 0.1.11 → 0.1.16
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +5 -5
- data/.doc/ext/reflex/application.cpp +9 -5
- data/.doc/ext/reflex/capture_event.cpp +4 -9
- data/.doc/ext/reflex/contact_event.cpp +17 -13
- data/.doc/ext/reflex/draw_event.cpp +3 -8
- data/.doc/ext/reflex/ellipse_shape.cpp +51 -24
- data/.doc/ext/reflex/event.cpp +0 -4
- data/.doc/ext/reflex/filter.cpp +81 -0
- data/.doc/ext/reflex/focus_event.cpp +9 -13
- data/.doc/ext/reflex/frame_event.cpp +47 -14
- data/.doc/ext/reflex/image_view.cpp +1 -10
- data/.doc/ext/reflex/key_event.cpp +9 -14
- data/.doc/ext/reflex/line_shape.cpp +99 -0
- data/.doc/ext/reflex/motion_event.cpp +73 -0
- data/.doc/ext/reflex/native.cpp +18 -18
- data/.doc/ext/reflex/pointer_event.cpp +27 -25
- data/.doc/ext/reflex/polygon_shape.cpp +65 -0
- data/.doc/ext/reflex/rect_shape.cpp +102 -23
- data/.doc/ext/reflex/reflex.cpp +24 -3
- data/.doc/ext/reflex/scroll_event.cpp +8 -15
- data/.doc/ext/reflex/selector.cpp +43 -15
- data/.doc/ext/reflex/shape.cpp +211 -0
- data/.doc/ext/reflex/style.cpp +359 -185
- data/.doc/ext/reflex/style_length.cpp +163 -35
- data/.doc/ext/reflex/timer.cpp +101 -0
- data/.doc/ext/reflex/timer_event.cpp +123 -0
- data/.doc/ext/reflex/update_event.cpp +12 -8
- data/.doc/ext/reflex/view.cpp +548 -144
- data/.doc/ext/reflex/wheel_event.cpp +5 -28
- data/.doc/ext/reflex/window.cpp +7 -15
- data/LICENSE +21 -0
- data/README.md +1 -1
- data/Rakefile +14 -12
- data/VERSION +1 -1
- data/ext/reflex/application.cpp +10 -5
- data/ext/reflex/capture_event.cpp +4 -9
- data/ext/reflex/contact_event.cpp +18 -13
- data/ext/reflex/defs.h +5 -2
- data/ext/reflex/draw_event.cpp +3 -8
- data/ext/reflex/ellipse_shape.cpp +56 -25
- data/ext/reflex/event.cpp +0 -4
- data/ext/reflex/extconf.rb +1 -2
- data/ext/reflex/filter.cpp +86 -0
- data/ext/reflex/focus_event.cpp +11 -15
- data/ext/reflex/frame_event.cpp +52 -14
- data/ext/reflex/image_view.cpp +1 -10
- data/ext/reflex/key_event.cpp +9 -14
- data/ext/reflex/line_shape.cpp +104 -0
- data/ext/reflex/motion_event.cpp +77 -0
- data/ext/reflex/native.cpp +18 -18
- data/ext/reflex/pointer_event.cpp +27 -25
- data/ext/reflex/polygon_shape.cpp +68 -0
- data/ext/reflex/rect_shape.cpp +113 -24
- data/ext/reflex/reflex.cpp +24 -3
- data/ext/reflex/scroll_event.cpp +8 -15
- data/ext/reflex/selector.cpp +46 -16
- data/ext/reflex/selector.h +130 -0
- data/ext/reflex/shape.cpp +231 -0
- data/ext/reflex/style.cpp +363 -192
- data/ext/reflex/style_length.cpp +164 -37
- data/ext/reflex/timer.cpp +108 -0
- data/ext/reflex/timer_event.cpp +133 -0
- data/ext/reflex/update_event.cpp +13 -8
- data/ext/reflex/view.cpp +594 -150
- data/ext/reflex/wheel_event.cpp +5 -30
- data/ext/reflex/window.cpp +7 -15
- data/include/reflex.h +5 -4
- data/include/reflex/application.h +2 -0
- data/include/reflex/debug.h +22 -0
- data/include/reflex/defs.h +45 -2
- data/include/reflex/event.h +55 -11
- data/include/reflex/exception.h +17 -2
- data/include/reflex/filter.h +56 -0
- data/include/reflex/image_view.h +1 -1
- data/include/reflex/ruby.h +6 -4
- data/include/reflex/ruby/application.h +17 -9
- data/include/reflex/ruby/event.h +22 -0
- data/include/reflex/ruby/filter.h +69 -0
- data/include/reflex/ruby/reflex.h +1 -0
- data/include/reflex/ruby/selector.h +1 -1
- data/include/reflex/ruby/shape.h +140 -0
- data/include/reflex/ruby/style.h +1 -1
- data/include/reflex/ruby/timer.h +69 -0
- data/include/reflex/ruby/view.h +43 -76
- data/include/reflex/ruby/window.h +17 -32
- data/include/reflex/selector.h +54 -2
- data/include/reflex/shape.h +211 -0
- data/include/reflex/style.h +136 -76
- data/include/reflex/timer.h +73 -0
- data/include/reflex/view.h +181 -59
- data/include/reflex/window.h +4 -3
- data/lib/reflex.rb +13 -6
- data/lib/reflex/application.rb +6 -3
- data/lib/reflex/button.rb +2 -2
- data/lib/reflex/{texture.rb → camera.rb} +2 -2
- data/lib/reflex/capture_event.rb +7 -6
- data/lib/reflex/contact_event.rb +10 -12
- data/lib/reflex/draw_event.rb +6 -1
- data/lib/reflex/ellipse_shape.rb +27 -0
- data/lib/reflex/filter.rb +18 -0
- data/lib/reflex/fixture.rb +4 -0
- data/lib/reflex/focus_event.rb +10 -12
- data/lib/reflex/frame_event.rb +1 -1
- data/lib/reflex/helper.rb +17 -29
- data/lib/reflex/key_event.rb +13 -11
- data/lib/reflex/line_shape.rb +18 -0
- data/lib/reflex/matrix.rb +13 -0
- data/lib/reflex/module.rb +4 -19
- data/lib/reflex/pointer_event.rb +28 -35
- data/lib/reflex/polygon.rb +14 -0
- data/lib/reflex/polygon_shape.rb +23 -0
- data/lib/reflex/polyline.rb +13 -0
- data/lib/reflex/rect_shape.rb +20 -0
- data/lib/reflex/reflex.rb +1 -3
- data/lib/reflex/scroll_event.rb +1 -1
- data/lib/reflex/selector.rb +2 -2
- data/lib/reflex/shape.rb +62 -0
- data/lib/reflex/style.rb +78 -11
- data/lib/reflex/style_length.rb +0 -11
- data/lib/reflex/text_view.rb +7 -24
- data/lib/reflex/timer.rb +30 -0
- data/lib/reflex/timer_event.rb +29 -0
- data/lib/reflex/update_event.rb +1 -1
- data/lib/reflex/view.rb +127 -32
- data/lib/reflex/wheel_event.rb +9 -1
- data/lib/reflex/window.rb +29 -9
- data/lib/reflexion.rb +23 -7
- data/reflex.gemspec +7 -8
- data/samples/bats.rb +4 -4
- data/samples/camera.rb +32 -0
- data/samples/fans.rb +1 -1
- data/samples/fps.rb +5 -3
- data/samples/hello.rb +4 -6
- data/samples/image.rb +5 -4
- data/samples/ios/hello/hello.xcodeproj/project.pbxproj +0 -2
- data/samples/layout.rb +16 -7
- data/samples/model.rb +10 -7
- data/samples/physics.rb +22 -20
- data/samples/reflexion/breakout.rb +4 -5
- data/samples/reflexion/hello.rb +2 -2
- data/samples/reflexion/jump_action.rb +191 -0
- data/samples/reflexion/noise.rb +23 -0
- data/samples/reflexion/paint.rb +7 -6
- data/samples/reflexion/physics.rb +15 -8
- data/samples/reflexion/pulse.rb +24 -10
- data/samples/shader.rb +8 -6
- data/samples/shapes.rb +79 -14
- data/samples/tree.rb +9 -10
- data/samples/views.rb +3 -3
- data/samples/visuals.rb +2 -5
- data/src/body.cpp +146 -345
- data/src/body.h +91 -0
- data/src/event.cpp +65 -15
- data/src/exception.cpp +13 -3
- data/src/filter.cpp +76 -0
- data/src/fixture.cpp +164 -39
- data/src/fixture.h +85 -0
- data/src/image_view.cpp +4 -4
- data/src/ios/app_delegate.h +5 -10
- data/src/ios/app_delegate.mm +79 -41
- data/src/ios/application.h +32 -0
- data/src/ios/application.mm +35 -25
- data/src/ios/event.mm +8 -4
- data/src/ios/reflex.mm +0 -7
- data/src/ios/view_controller.h +37 -0
- data/src/ios/view_controller.mm +424 -0
- data/src/ios/window.h +40 -0
- data/src/ios/window.mm +59 -250
- data/src/osx/app_delegate.h +5 -10
- data/src/osx/app_delegate.mm +52 -55
- data/src/osx/application.h +32 -0
- data/src/osx/application.mm +44 -39
- data/src/osx/native_window.h +0 -15
- data/src/osx/native_window.mm +127 -127
- data/src/osx/opengl_view.h +0 -2
- data/src/osx/opengl_view.mm +12 -3
- data/src/osx/reflex.mm +0 -9
- data/src/osx/window.h +42 -0
- data/src/osx/window.mm +45 -252
- data/src/selector.cpp +232 -7
- data/src/selector.h +52 -0
- data/src/shape.cpp +1191 -0
- data/src/shape.h +61 -0
- data/src/style.cpp +573 -376
- data/src/style.h +39 -0
- data/src/timer.cpp +288 -0
- data/src/timer.h +55 -0
- data/src/view.cpp +1624 -984
- data/src/view.h +56 -0
- data/src/win32/window.cpp +3 -4
- data/src/window.cpp +302 -20
- data/src/window.h +94 -0
- data/src/world.cpp +112 -111
- data/src/world.h +34 -53
- data/task/box2d.rake +31 -10
- data/test/test_capture_event.rb +8 -6
- data/test/test_pointer_event.rb +130 -0
- data/test/test_selector.rb +1 -1
- data/test/test_shape.rb +71 -0
- data/test/test_style.rb +77 -11
- data/test/test_style_length.rb +42 -13
- data/test/test_view.rb +138 -14
- metadata +118 -202
- data/.doc/ext/reflex/arc_shape.cpp +0 -89
- data/.doc/ext/reflex/body.cpp +0 -299
- data/.doc/ext/reflex/fixture.cpp +0 -101
- data/.doc/ext/reflex/shape_view.cpp +0 -153
- data/ext/reflex/arc_shape.cpp +0 -94
- data/ext/reflex/body.cpp +0 -328
- data/ext/reflex/fixture.cpp +0 -108
- data/ext/reflex/shape_view.cpp +0 -161
- data/include/reflex/bitmap.h +0 -20
- data/include/reflex/body.h +0 -128
- data/include/reflex/bounds.h +0 -20
- data/include/reflex/color.h +0 -20
- data/include/reflex/color_space.h +0 -20
- data/include/reflex/fixture.h +0 -117
- data/include/reflex/font.h +0 -20
- data/include/reflex/image.h +0 -20
- data/include/reflex/matrix.h +0 -20
- data/include/reflex/painter.h +0 -20
- data/include/reflex/point.h +0 -24
- data/include/reflex/ruby/body.h +0 -41
- data/include/reflex/ruby/fixture.h +0 -41
- data/include/reflex/ruby/shape_view.h +0 -96
- data/include/reflex/shader.h +0 -20
- data/include/reflex/shape_view.h +0 -146
- data/include/reflex/texture.h +0 -20
- data/lib/reflex/body.rb +0 -22
- data/lib/reflex/flags.rb +0 -18
- data/lib/reflex/shape_view.rb +0 -25
- data/src/ios/application_data.h +0 -45
- data/src/ios/native_window.h +0 -39
- data/src/ios/native_window.mm +0 -224
- data/src/ios/opengl_view.h +0 -13
- data/src/ios/opengl_view.mm +0 -139
- data/src/ios/window_data.h +0 -75
- data/src/osx/application_data.h +0 -45
- data/src/osx/window_data.h +0 -75
- data/src/physics/Box2D/Box2D.h +0 -68
- data/src/physics/Box2D/Collision/Shapes/b2ChainShape.cpp +0 -193
- data/src/physics/Box2D/Collision/Shapes/b2ChainShape.h +0 -105
- data/src/physics/Box2D/Collision/Shapes/b2CircleShape.cpp +0 -99
- data/src/physics/Box2D/Collision/Shapes/b2CircleShape.h +0 -91
- data/src/physics/Box2D/Collision/Shapes/b2EdgeShape.cpp +0 -138
- data/src/physics/Box2D/Collision/Shapes/b2EdgeShape.h +0 -74
- data/src/physics/Box2D/Collision/Shapes/b2PolygonShape.cpp +0 -467
- data/src/physics/Box2D/Collision/Shapes/b2PolygonShape.h +0 -101
- data/src/physics/Box2D/Collision/Shapes/b2Shape.h +0 -101
- data/src/physics/Box2D/Collision/b2BroadPhase.cpp +0 -119
- data/src/physics/Box2D/Collision/b2BroadPhase.h +0 -257
- data/src/physics/Box2D/Collision/b2CollideCircle.cpp +0 -154
- data/src/physics/Box2D/Collision/b2CollideEdge.cpp +0 -698
- data/src/physics/Box2D/Collision/b2CollidePolygon.cpp +0 -239
- data/src/physics/Box2D/Collision/b2Collision.cpp +0 -252
- data/src/physics/Box2D/Collision/b2Collision.h +0 -277
- data/src/physics/Box2D/Collision/b2Distance.cpp +0 -603
- data/src/physics/Box2D/Collision/b2Distance.h +0 -141
- data/src/physics/Box2D/Collision/b2DynamicTree.cpp +0 -778
- data/src/physics/Box2D/Collision/b2DynamicTree.h +0 -289
- data/src/physics/Box2D/Collision/b2TimeOfImpact.cpp +0 -486
- data/src/physics/Box2D/Collision/b2TimeOfImpact.h +0 -58
- data/src/physics/Box2D/Common/b2BlockAllocator.cpp +0 -215
- data/src/physics/Box2D/Common/b2BlockAllocator.h +0 -62
- data/src/physics/Box2D/Common/b2Draw.cpp +0 -44
- data/src/physics/Box2D/Common/b2Draw.h +0 -86
- data/src/physics/Box2D/Common/b2GrowableStack.h +0 -85
- data/src/physics/Box2D/Common/b2Math.cpp +0 -94
- data/src/physics/Box2D/Common/b2Math.h +0 -720
- data/src/physics/Box2D/Common/b2Settings.cpp +0 -44
- data/src/physics/Box2D/Common/b2Settings.h +0 -151
- data/src/physics/Box2D/Common/b2StackAllocator.cpp +0 -83
- data/src/physics/Box2D/Common/b2StackAllocator.h +0 -60
- data/src/physics/Box2D/Common/b2Timer.cpp +0 -101
- data/src/physics/Box2D/Common/b2Timer.h +0 -50
- data/src/physics/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.cpp +0 -53
- data/src/physics/Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.cpp +0 -53
- data/src/physics/Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Contacts/b2CircleContact.cpp +0 -52
- data/src/physics/Box2D/Dynamics/Contacts/b2CircleContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Contacts/b2Contact.cpp +0 -247
- data/src/physics/Box2D/Dynamics/Contacts/b2Contact.h +0 -349
- data/src/physics/Box2D/Dynamics/Contacts/b2ContactSolver.cpp +0 -838
- data/src/physics/Box2D/Dynamics/Contacts/b2ContactSolver.h +0 -95
- data/src/physics/Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.cpp +0 -49
- data/src/physics/Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.cpp +0 -49
- data/src/physics/Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.cpp +0 -49
- data/src/physics/Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h +0 -38
- data/src/physics/Box2D/Dynamics/Contacts/b2PolygonContact.cpp +0 -52
- data/src/physics/Box2D/Dynamics/Contacts/b2PolygonContact.h +0 -39
- data/src/physics/Box2D/Dynamics/Joints/b2DistanceJoint.cpp +0 -260
- data/src/physics/Box2D/Dynamics/Joints/b2DistanceJoint.h +0 -169
- data/src/physics/Box2D/Dynamics/Joints/b2FrictionJoint.cpp +0 -251
- data/src/physics/Box2D/Dynamics/Joints/b2FrictionJoint.h +0 -119
- data/src/physics/Box2D/Dynamics/Joints/b2GearJoint.cpp +0 -419
- data/src/physics/Box2D/Dynamics/Joints/b2GearJoint.h +0 -125
- data/src/physics/Box2D/Dynamics/Joints/b2Joint.cpp +0 -211
- data/src/physics/Box2D/Dynamics/Joints/b2Joint.h +0 -226
- data/src/physics/Box2D/Dynamics/Joints/b2MotorJoint.cpp +0 -304
- data/src/physics/Box2D/Dynamics/Joints/b2MotorJoint.h +0 -133
- data/src/physics/Box2D/Dynamics/Joints/b2MouseJoint.cpp +0 -222
- data/src/physics/Box2D/Dynamics/Joints/b2MouseJoint.h +0 -129
- data/src/physics/Box2D/Dynamics/Joints/b2PrismaticJoint.cpp +0 -629
- data/src/physics/Box2D/Dynamics/Joints/b2PrismaticJoint.h +0 -196
- data/src/physics/Box2D/Dynamics/Joints/b2PulleyJoint.cpp +0 -348
- data/src/physics/Box2D/Dynamics/Joints/b2PulleyJoint.h +0 -152
- data/src/physics/Box2D/Dynamics/Joints/b2RevoluteJoint.cpp +0 -502
- data/src/physics/Box2D/Dynamics/Joints/b2RevoluteJoint.h +0 -204
- data/src/physics/Box2D/Dynamics/Joints/b2RopeJoint.cpp +0 -241
- data/src/physics/Box2D/Dynamics/Joints/b2RopeJoint.h +0 -114
- data/src/physics/Box2D/Dynamics/Joints/b2WeldJoint.cpp +0 -344
- data/src/physics/Box2D/Dynamics/Joints/b2WeldJoint.h +0 -126
- data/src/physics/Box2D/Dynamics/Joints/b2WheelJoint.cpp +0 -419
- data/src/physics/Box2D/Dynamics/Joints/b2WheelJoint.h +0 -210
- data/src/physics/Box2D/Dynamics/b2Body.cpp +0 -549
- data/src/physics/Box2D/Dynamics/b2Body.h +0 -860
- data/src/physics/Box2D/Dynamics/b2ContactManager.cpp +0 -296
- data/src/physics/Box2D/Dynamics/b2ContactManager.h +0 -52
- data/src/physics/Box2D/Dynamics/b2Fixture.cpp +0 -303
- data/src/physics/Box2D/Dynamics/b2Fixture.h +0 -345
- data/src/physics/Box2D/Dynamics/b2Island.cpp +0 -539
- data/src/physics/Box2D/Dynamics/b2Island.h +0 -93
- data/src/physics/Box2D/Dynamics/b2TimeStep.h +0 -70
- data/src/physics/Box2D/Dynamics/b2World.cpp +0 -1339
- data/src/physics/Box2D/Dynamics/b2World.h +0 -354
- data/src/physics/Box2D/Dynamics/b2WorldCallbacks.cpp +0 -36
- data/src/physics/Box2D/Dynamics/b2WorldCallbacks.h +0 -155
- data/src/physics/Box2D/Rope/b2Rope.cpp +0 -259
- data/src/physics/Box2D/Rope/b2Rope.h +0 -115
- data/src/shape_view.cpp +0 -306
@@ -1,101 +0,0 @@
|
|
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
|
-
|
19
|
-
#ifndef B2_POLYGON_SHAPE_H
|
20
|
-
#define B2_POLYGON_SHAPE_H
|
21
|
-
|
22
|
-
#include <Box2D/Collision/Shapes/b2Shape.h>
|
23
|
-
|
24
|
-
/// A convex polygon. It is assumed that the interior of the polygon is to
|
25
|
-
/// the left of each edge.
|
26
|
-
/// Polygons have a maximum number of vertices equal to b2_maxPolygonVertices.
|
27
|
-
/// In most cases you should not need many vertices for a convex polygon.
|
28
|
-
class b2PolygonShape : public b2Shape
|
29
|
-
{
|
30
|
-
public:
|
31
|
-
b2PolygonShape();
|
32
|
-
|
33
|
-
/// Implement b2Shape.
|
34
|
-
b2Shape* Clone(b2BlockAllocator* allocator) const;
|
35
|
-
|
36
|
-
/// @see b2Shape::GetChildCount
|
37
|
-
int32 GetChildCount() const;
|
38
|
-
|
39
|
-
/// Create a convex hull from the given array of local points.
|
40
|
-
/// The count must be in the range [3, b2_maxPolygonVertices].
|
41
|
-
/// @warning the points may be re-ordered, even if they form a convex polygon
|
42
|
-
/// @warning collinear points are handled but not removed. Collinear points
|
43
|
-
/// may lead to poor stacking behavior.
|
44
|
-
void Set(const b2Vec2* points, int32 count);
|
45
|
-
|
46
|
-
/// Build vertices to represent an axis-aligned box centered on the local origin.
|
47
|
-
/// @param hx the half-width.
|
48
|
-
/// @param hy the half-height.
|
49
|
-
void SetAsBox(float32 hx, float32 hy);
|
50
|
-
|
51
|
-
/// Build vertices to represent an oriented box.
|
52
|
-
/// @param hx the half-width.
|
53
|
-
/// @param hy the half-height.
|
54
|
-
/// @param center the center of the box in local coordinates.
|
55
|
-
/// @param angle the rotation of the box in local coordinates.
|
56
|
-
void SetAsBox(float32 hx, float32 hy, const b2Vec2& center, float32 angle);
|
57
|
-
|
58
|
-
/// @see b2Shape::TestPoint
|
59
|
-
bool TestPoint(const b2Transform& transform, const b2Vec2& p) const;
|
60
|
-
|
61
|
-
/// Implement b2Shape.
|
62
|
-
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
63
|
-
const b2Transform& transform, int32 childIndex) const;
|
64
|
-
|
65
|
-
/// @see b2Shape::ComputeAABB
|
66
|
-
void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const;
|
67
|
-
|
68
|
-
/// @see b2Shape::ComputeMass
|
69
|
-
void ComputeMass(b2MassData* massData, float32 density) const;
|
70
|
-
|
71
|
-
/// Get the vertex count.
|
72
|
-
int32 GetVertexCount() const { return m_count; }
|
73
|
-
|
74
|
-
/// Get a vertex by index.
|
75
|
-
const b2Vec2& GetVertex(int32 index) const;
|
76
|
-
|
77
|
-
/// Validate convexity. This is a very time consuming operation.
|
78
|
-
/// @returns true if valid
|
79
|
-
bool Validate() const;
|
80
|
-
|
81
|
-
b2Vec2 m_centroid;
|
82
|
-
b2Vec2 m_vertices[b2_maxPolygonVertices];
|
83
|
-
b2Vec2 m_normals[b2_maxPolygonVertices];
|
84
|
-
int32 m_count;
|
85
|
-
};
|
86
|
-
|
87
|
-
inline b2PolygonShape::b2PolygonShape()
|
88
|
-
{
|
89
|
-
m_type = e_polygon;
|
90
|
-
m_radius = b2_polygonRadius;
|
91
|
-
m_count = 0;
|
92
|
-
m_centroid.SetZero();
|
93
|
-
}
|
94
|
-
|
95
|
-
inline const b2Vec2& b2PolygonShape::GetVertex(int32 index) const
|
96
|
-
{
|
97
|
-
b2Assert(0 <= index && index < m_count);
|
98
|
-
return m_vertices[index];
|
99
|
-
}
|
100
|
-
|
101
|
-
#endif
|
@@ -1,101 +0,0 @@
|
|
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
|
-
|
19
|
-
#ifndef B2_SHAPE_H
|
20
|
-
#define B2_SHAPE_H
|
21
|
-
|
22
|
-
#include <Box2D/Common/b2BlockAllocator.h>
|
23
|
-
#include <Box2D/Common/b2Math.h>
|
24
|
-
#include <Box2D/Collision/b2Collision.h>
|
25
|
-
|
26
|
-
/// This holds the mass data computed for a shape.
|
27
|
-
struct b2MassData
|
28
|
-
{
|
29
|
-
/// The mass of the shape, usually in kilograms.
|
30
|
-
float32 mass;
|
31
|
-
|
32
|
-
/// The position of the shape's centroid relative to the shape's origin.
|
33
|
-
b2Vec2 center;
|
34
|
-
|
35
|
-
/// The rotational inertia of the shape about the local origin.
|
36
|
-
float32 I;
|
37
|
-
};
|
38
|
-
|
39
|
-
/// A shape is used for collision detection. You can create a shape however you like.
|
40
|
-
/// Shapes used for simulation in b2World are created automatically when a b2Fixture
|
41
|
-
/// is created. Shapes may encapsulate a one or more child shapes.
|
42
|
-
class b2Shape
|
43
|
-
{
|
44
|
-
public:
|
45
|
-
|
46
|
-
enum Type
|
47
|
-
{
|
48
|
-
e_circle = 0,
|
49
|
-
e_edge = 1,
|
50
|
-
e_polygon = 2,
|
51
|
-
e_chain = 3,
|
52
|
-
e_typeCount = 4
|
53
|
-
};
|
54
|
-
|
55
|
-
virtual ~b2Shape() {}
|
56
|
-
|
57
|
-
/// Clone the concrete shape using the provided allocator.
|
58
|
-
virtual b2Shape* Clone(b2BlockAllocator* allocator) const = 0;
|
59
|
-
|
60
|
-
/// Get the type of this shape. You can use this to down cast to the concrete shape.
|
61
|
-
/// @return the shape type.
|
62
|
-
Type GetType() const;
|
63
|
-
|
64
|
-
/// Get the number of child primitives.
|
65
|
-
virtual int32 GetChildCount() const = 0;
|
66
|
-
|
67
|
-
/// Test a point for containment in this shape. This only works for convex shapes.
|
68
|
-
/// @param xf the shape world transform.
|
69
|
-
/// @param p a point in world coordinates.
|
70
|
-
virtual bool TestPoint(const b2Transform& xf, const b2Vec2& p) const = 0;
|
71
|
-
|
72
|
-
/// Cast a ray against a child shape.
|
73
|
-
/// @param output the ray-cast results.
|
74
|
-
/// @param input the ray-cast input parameters.
|
75
|
-
/// @param transform the transform to be applied to the shape.
|
76
|
-
/// @param childIndex the child shape index
|
77
|
-
virtual bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
78
|
-
const b2Transform& transform, int32 childIndex) const = 0;
|
79
|
-
|
80
|
-
/// Given a transform, compute the associated axis aligned bounding box for a child shape.
|
81
|
-
/// @param aabb returns the axis aligned box.
|
82
|
-
/// @param xf the world transform of the shape.
|
83
|
-
/// @param childIndex the child shape
|
84
|
-
virtual void ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const = 0;
|
85
|
-
|
86
|
-
/// Compute the mass properties of this shape using its dimensions and density.
|
87
|
-
/// The inertia tensor is computed about the local origin.
|
88
|
-
/// @param massData returns the mass data for this shape.
|
89
|
-
/// @param density the density in kilograms per meter squared.
|
90
|
-
virtual void ComputeMass(b2MassData* massData, float32 density) const = 0;
|
91
|
-
|
92
|
-
Type m_type;
|
93
|
-
float32 m_radius;
|
94
|
-
};
|
95
|
-
|
96
|
-
inline b2Shape::Type b2Shape::GetType() const
|
97
|
-
{
|
98
|
-
return m_type;
|
99
|
-
}
|
100
|
-
|
101
|
-
#endif
|
@@ -1,119 +0,0 @@
|
|
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
|
-
|
19
|
-
#include <Box2D/Collision/b2BroadPhase.h>
|
20
|
-
|
21
|
-
b2BroadPhase::b2BroadPhase()
|
22
|
-
{
|
23
|
-
m_proxyCount = 0;
|
24
|
-
|
25
|
-
m_pairCapacity = 16;
|
26
|
-
m_pairCount = 0;
|
27
|
-
m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
|
28
|
-
|
29
|
-
m_moveCapacity = 16;
|
30
|
-
m_moveCount = 0;
|
31
|
-
m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
|
32
|
-
}
|
33
|
-
|
34
|
-
b2BroadPhase::~b2BroadPhase()
|
35
|
-
{
|
36
|
-
b2Free(m_moveBuffer);
|
37
|
-
b2Free(m_pairBuffer);
|
38
|
-
}
|
39
|
-
|
40
|
-
int32 b2BroadPhase::CreateProxy(const b2AABB& aabb, void* userData)
|
41
|
-
{
|
42
|
-
int32 proxyId = m_tree.CreateProxy(aabb, userData);
|
43
|
-
++m_proxyCount;
|
44
|
-
BufferMove(proxyId);
|
45
|
-
return proxyId;
|
46
|
-
}
|
47
|
-
|
48
|
-
void b2BroadPhase::DestroyProxy(int32 proxyId)
|
49
|
-
{
|
50
|
-
UnBufferMove(proxyId);
|
51
|
-
--m_proxyCount;
|
52
|
-
m_tree.DestroyProxy(proxyId);
|
53
|
-
}
|
54
|
-
|
55
|
-
void b2BroadPhase::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement)
|
56
|
-
{
|
57
|
-
bool buffer = m_tree.MoveProxy(proxyId, aabb, displacement);
|
58
|
-
if (buffer)
|
59
|
-
{
|
60
|
-
BufferMove(proxyId);
|
61
|
-
}
|
62
|
-
}
|
63
|
-
|
64
|
-
void b2BroadPhase::TouchProxy(int32 proxyId)
|
65
|
-
{
|
66
|
-
BufferMove(proxyId);
|
67
|
-
}
|
68
|
-
|
69
|
-
void b2BroadPhase::BufferMove(int32 proxyId)
|
70
|
-
{
|
71
|
-
if (m_moveCount == m_moveCapacity)
|
72
|
-
{
|
73
|
-
int32* oldBuffer = m_moveBuffer;
|
74
|
-
m_moveCapacity *= 2;
|
75
|
-
m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
|
76
|
-
memcpy(m_moveBuffer, oldBuffer, m_moveCount * sizeof(int32));
|
77
|
-
b2Free(oldBuffer);
|
78
|
-
}
|
79
|
-
|
80
|
-
m_moveBuffer[m_moveCount] = proxyId;
|
81
|
-
++m_moveCount;
|
82
|
-
}
|
83
|
-
|
84
|
-
void b2BroadPhase::UnBufferMove(int32 proxyId)
|
85
|
-
{
|
86
|
-
for (int32 i = 0; i < m_moveCount; ++i)
|
87
|
-
{
|
88
|
-
if (m_moveBuffer[i] == proxyId)
|
89
|
-
{
|
90
|
-
m_moveBuffer[i] = e_nullProxy;
|
91
|
-
}
|
92
|
-
}
|
93
|
-
}
|
94
|
-
|
95
|
-
// This is called from b2DynamicTree::Query when we are gathering pairs.
|
96
|
-
bool b2BroadPhase::QueryCallback(int32 proxyId)
|
97
|
-
{
|
98
|
-
// A proxy cannot form a pair with itself.
|
99
|
-
if (proxyId == m_queryProxyId)
|
100
|
-
{
|
101
|
-
return true;
|
102
|
-
}
|
103
|
-
|
104
|
-
// Grow the pair buffer as needed.
|
105
|
-
if (m_pairCount == m_pairCapacity)
|
106
|
-
{
|
107
|
-
b2Pair* oldBuffer = m_pairBuffer;
|
108
|
-
m_pairCapacity *= 2;
|
109
|
-
m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
|
110
|
-
memcpy(m_pairBuffer, oldBuffer, m_pairCount * sizeof(b2Pair));
|
111
|
-
b2Free(oldBuffer);
|
112
|
-
}
|
113
|
-
|
114
|
-
m_pairBuffer[m_pairCount].proxyIdA = b2Min(proxyId, m_queryProxyId);
|
115
|
-
m_pairBuffer[m_pairCount].proxyIdB = b2Max(proxyId, m_queryProxyId);
|
116
|
-
++m_pairCount;
|
117
|
-
|
118
|
-
return true;
|
119
|
-
}
|
@@ -1,257 +0,0 @@
|
|
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
|
-
|
19
|
-
#ifndef B2_BROAD_PHASE_H
|
20
|
-
#define B2_BROAD_PHASE_H
|
21
|
-
|
22
|
-
#include <Box2D/Common/b2Settings.h>
|
23
|
-
#include <Box2D/Collision/b2Collision.h>
|
24
|
-
#include <Box2D/Collision/b2DynamicTree.h>
|
25
|
-
#include <algorithm>
|
26
|
-
|
27
|
-
struct b2Pair
|
28
|
-
{
|
29
|
-
int32 proxyIdA;
|
30
|
-
int32 proxyIdB;
|
31
|
-
};
|
32
|
-
|
33
|
-
/// The broad-phase is used for computing pairs and performing volume queries and ray casts.
|
34
|
-
/// This broad-phase does not persist pairs. Instead, this reports potentially new pairs.
|
35
|
-
/// It is up to the client to consume the new pairs and to track subsequent overlap.
|
36
|
-
class b2BroadPhase
|
37
|
-
{
|
38
|
-
public:
|
39
|
-
|
40
|
-
enum
|
41
|
-
{
|
42
|
-
e_nullProxy = -1
|
43
|
-
};
|
44
|
-
|
45
|
-
b2BroadPhase();
|
46
|
-
~b2BroadPhase();
|
47
|
-
|
48
|
-
/// Create a proxy with an initial AABB. Pairs are not reported until
|
49
|
-
/// UpdatePairs is called.
|
50
|
-
int32 CreateProxy(const b2AABB& aabb, void* userData);
|
51
|
-
|
52
|
-
/// Destroy a proxy. It is up to the client to remove any pairs.
|
53
|
-
void DestroyProxy(int32 proxyId);
|
54
|
-
|
55
|
-
/// Call MoveProxy as many times as you like, then when you are done
|
56
|
-
/// call UpdatePairs to finalized the proxy pairs (for your time step).
|
57
|
-
void MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement);
|
58
|
-
|
59
|
-
/// Call to trigger a re-processing of it's pairs on the next call to UpdatePairs.
|
60
|
-
void TouchProxy(int32 proxyId);
|
61
|
-
|
62
|
-
/// Get the fat AABB for a proxy.
|
63
|
-
const b2AABB& GetFatAABB(int32 proxyId) const;
|
64
|
-
|
65
|
-
/// Get user data from a proxy. Returns NULL if the id is invalid.
|
66
|
-
void* GetUserData(int32 proxyId) const;
|
67
|
-
|
68
|
-
/// Test overlap of fat AABBs.
|
69
|
-
bool TestOverlap(int32 proxyIdA, int32 proxyIdB) const;
|
70
|
-
|
71
|
-
/// Get the number of proxies.
|
72
|
-
int32 GetProxyCount() const;
|
73
|
-
|
74
|
-
/// Update the pairs. This results in pair callbacks. This can only add pairs.
|
75
|
-
template <typename T>
|
76
|
-
void UpdatePairs(T* callback);
|
77
|
-
|
78
|
-
/// Query an AABB for overlapping proxies. The callback class
|
79
|
-
/// is called for each proxy that overlaps the supplied AABB.
|
80
|
-
template <typename T>
|
81
|
-
void Query(T* callback, const b2AABB& aabb) const;
|
82
|
-
|
83
|
-
/// Ray-cast against the proxies in the tree. This relies on the callback
|
84
|
-
/// to perform a exact ray-cast in the case were the proxy contains a shape.
|
85
|
-
/// The callback also performs the any collision filtering. This has performance
|
86
|
-
/// roughly equal to k * log(n), where k is the number of collisions and n is the
|
87
|
-
/// number of proxies in the tree.
|
88
|
-
/// @param input the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
|
89
|
-
/// @param callback a callback class that is called for each proxy that is hit by the ray.
|
90
|
-
template <typename T>
|
91
|
-
void RayCast(T* callback, const b2RayCastInput& input) const;
|
92
|
-
|
93
|
-
/// Get the height of the embedded tree.
|
94
|
-
int32 GetTreeHeight() const;
|
95
|
-
|
96
|
-
/// Get the balance of the embedded tree.
|
97
|
-
int32 GetTreeBalance() const;
|
98
|
-
|
99
|
-
/// Get the quality metric of the embedded tree.
|
100
|
-
float32 GetTreeQuality() const;
|
101
|
-
|
102
|
-
/// Shift the world origin. Useful for large worlds.
|
103
|
-
/// The shift formula is: position -= newOrigin
|
104
|
-
/// @param newOrigin the new origin with respect to the old origin
|
105
|
-
void ShiftOrigin(const b2Vec2& newOrigin);
|
106
|
-
|
107
|
-
private:
|
108
|
-
|
109
|
-
friend class b2DynamicTree;
|
110
|
-
|
111
|
-
void BufferMove(int32 proxyId);
|
112
|
-
void UnBufferMove(int32 proxyId);
|
113
|
-
|
114
|
-
bool QueryCallback(int32 proxyId);
|
115
|
-
|
116
|
-
b2DynamicTree m_tree;
|
117
|
-
|
118
|
-
int32 m_proxyCount;
|
119
|
-
|
120
|
-
int32* m_moveBuffer;
|
121
|
-
int32 m_moveCapacity;
|
122
|
-
int32 m_moveCount;
|
123
|
-
|
124
|
-
b2Pair* m_pairBuffer;
|
125
|
-
int32 m_pairCapacity;
|
126
|
-
int32 m_pairCount;
|
127
|
-
|
128
|
-
int32 m_queryProxyId;
|
129
|
-
};
|
130
|
-
|
131
|
-
/// This is used to sort pairs.
|
132
|
-
inline bool b2PairLessThan(const b2Pair& pair1, const b2Pair& pair2)
|
133
|
-
{
|
134
|
-
if (pair1.proxyIdA < pair2.proxyIdA)
|
135
|
-
{
|
136
|
-
return true;
|
137
|
-
}
|
138
|
-
|
139
|
-
if (pair1.proxyIdA == pair2.proxyIdA)
|
140
|
-
{
|
141
|
-
return pair1.proxyIdB < pair2.proxyIdB;
|
142
|
-
}
|
143
|
-
|
144
|
-
return false;
|
145
|
-
}
|
146
|
-
|
147
|
-
inline void* b2BroadPhase::GetUserData(int32 proxyId) const
|
148
|
-
{
|
149
|
-
return m_tree.GetUserData(proxyId);
|
150
|
-
}
|
151
|
-
|
152
|
-
inline bool b2BroadPhase::TestOverlap(int32 proxyIdA, int32 proxyIdB) const
|
153
|
-
{
|
154
|
-
const b2AABB& aabbA = m_tree.GetFatAABB(proxyIdA);
|
155
|
-
const b2AABB& aabbB = m_tree.GetFatAABB(proxyIdB);
|
156
|
-
return b2TestOverlap(aabbA, aabbB);
|
157
|
-
}
|
158
|
-
|
159
|
-
inline const b2AABB& b2BroadPhase::GetFatAABB(int32 proxyId) const
|
160
|
-
{
|
161
|
-
return m_tree.GetFatAABB(proxyId);
|
162
|
-
}
|
163
|
-
|
164
|
-
inline int32 b2BroadPhase::GetProxyCount() const
|
165
|
-
{
|
166
|
-
return m_proxyCount;
|
167
|
-
}
|
168
|
-
|
169
|
-
inline int32 b2BroadPhase::GetTreeHeight() const
|
170
|
-
{
|
171
|
-
return m_tree.GetHeight();
|
172
|
-
}
|
173
|
-
|
174
|
-
inline int32 b2BroadPhase::GetTreeBalance() const
|
175
|
-
{
|
176
|
-
return m_tree.GetMaxBalance();
|
177
|
-
}
|
178
|
-
|
179
|
-
inline float32 b2BroadPhase::GetTreeQuality() const
|
180
|
-
{
|
181
|
-
return m_tree.GetAreaRatio();
|
182
|
-
}
|
183
|
-
|
184
|
-
template <typename T>
|
185
|
-
void b2BroadPhase::UpdatePairs(T* callback)
|
186
|
-
{
|
187
|
-
// Reset pair buffer
|
188
|
-
m_pairCount = 0;
|
189
|
-
|
190
|
-
// Perform tree queries for all moving proxies.
|
191
|
-
for (int32 i = 0; i < m_moveCount; ++i)
|
192
|
-
{
|
193
|
-
m_queryProxyId = m_moveBuffer[i];
|
194
|
-
if (m_queryProxyId == e_nullProxy)
|
195
|
-
{
|
196
|
-
continue;
|
197
|
-
}
|
198
|
-
|
199
|
-
// We have to query the tree with the fat AABB so that
|
200
|
-
// we don't fail to create a pair that may touch later.
|
201
|
-
const b2AABB& fatAABB = m_tree.GetFatAABB(m_queryProxyId);
|
202
|
-
|
203
|
-
// Query tree, create pairs and add them pair buffer.
|
204
|
-
m_tree.Query(this, fatAABB);
|
205
|
-
}
|
206
|
-
|
207
|
-
// Reset move buffer
|
208
|
-
m_moveCount = 0;
|
209
|
-
|
210
|
-
// Sort the pair buffer to expose duplicates.
|
211
|
-
std::sort(m_pairBuffer, m_pairBuffer + m_pairCount, b2PairLessThan);
|
212
|
-
|
213
|
-
// Send the pairs back to the client.
|
214
|
-
int32 i = 0;
|
215
|
-
while (i < m_pairCount)
|
216
|
-
{
|
217
|
-
b2Pair* primaryPair = m_pairBuffer + i;
|
218
|
-
void* userDataA = m_tree.GetUserData(primaryPair->proxyIdA);
|
219
|
-
void* userDataB = m_tree.GetUserData(primaryPair->proxyIdB);
|
220
|
-
|
221
|
-
callback->AddPair(userDataA, userDataB);
|
222
|
-
++i;
|
223
|
-
|
224
|
-
// Skip any duplicate pairs.
|
225
|
-
while (i < m_pairCount)
|
226
|
-
{
|
227
|
-
b2Pair* pair = m_pairBuffer + i;
|
228
|
-
if (pair->proxyIdA != primaryPair->proxyIdA || pair->proxyIdB != primaryPair->proxyIdB)
|
229
|
-
{
|
230
|
-
break;
|
231
|
-
}
|
232
|
-
++i;
|
233
|
-
}
|
234
|
-
}
|
235
|
-
|
236
|
-
// Try to keep the tree balanced.
|
237
|
-
//m_tree.Rebalance(4);
|
238
|
-
}
|
239
|
-
|
240
|
-
template <typename T>
|
241
|
-
inline void b2BroadPhase::Query(T* callback, const b2AABB& aabb) const
|
242
|
-
{
|
243
|
-
m_tree.Query(callback, aabb);
|
244
|
-
}
|
245
|
-
|
246
|
-
template <typename T>
|
247
|
-
inline void b2BroadPhase::RayCast(T* callback, const b2RayCastInput& input) const
|
248
|
-
{
|
249
|
-
m_tree.RayCast(callback, input);
|
250
|
-
}
|
251
|
-
|
252
|
-
inline void b2BroadPhase::ShiftOrigin(const b2Vec2& newOrigin)
|
253
|
-
{
|
254
|
-
m_tree.ShiftOrigin(newOrigin);
|
255
|
-
}
|
256
|
-
|
257
|
-
#endif
|