OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:proxyId
(Results
1 - 6
of
6
) sorted by null
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/
FixtureProxy.java
37
int
proxyId
;
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2BroadPhase.cpp
44
int32
proxyId
= m_tree.CreateProxy(aabb, userData);
46
BufferMove(
proxyId
);
47
return
proxyId
;
50
void b2BroadPhase::DestroyProxy(int32
proxyId
)
52
UnBufferMove(
proxyId
);
54
m_tree.DestroyProxy(
proxyId
);
57
void b2BroadPhase::MoveProxy(int32
proxyId
, const b2AABB& aabb, const b2Vec2& displacement)
59
bool buffer = m_tree.MoveProxy(
proxyId
, aabb, displacement);
62
BufferMove(
proxyId
);
66
void b2BroadPhase::TouchProxy(int32
proxyId
)
[
all
...]
b2DynamicTree.cpp
110
int32
proxyId
= AllocateNode();
114
m_nodes[
proxyId
].aabb.lowerBound = aabb.lowerBound - r;
115
m_nodes[
proxyId
].aabb.upperBound = aabb.upperBound + r;
116
m_nodes[
proxyId
].userData = userData;
117
m_nodes[
proxyId
].height = 0;
119
InsertLeaf(
proxyId
);
121
return
proxyId
;
124
void b2DynamicTree::DestroyProxy(int32
proxyId
)
126
b2Assert(0 <=
proxyId
&&
proxyId
< m_nodeCapacity)
[
all
...]
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/
b2Fixture.h
99
int32
proxyId
;
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
DefaultBroadPhaseBuffer.java
79
int
proxyId
= m_tree.createProxy(aabb, userData);
81
bufferMove(
proxyId
);
82
return
proxyId
;
86
public final void destroyProxy(int
proxyId
) {
87
unbufferMove(
proxyId
);
89
m_tree.destroyProxy(
proxyId
);
93
public final void moveProxy(int
proxyId
, final AABB aabb, final Vec2 displacement) {
94
boolean buffer = m_tree.moveProxy(
proxyId
, aabb, displacement);
96
bufferMove(
proxyId
);
101
public void touchProxy(int
proxyId
) {
[
all
...]
DynamicTree.java
82
int
proxyId
= node.id;
91
insertLeaf(
proxyId
);
93
return
proxyId
;
97
public final void destroyProxy(int
proxyId
) {
98
assert (0 <=
proxyId
&&
proxyId
< m_nodeCapacity);
99
DynamicTreeNode node = m_nodes[
proxyId
];
107
public final boolean moveProxy(int
proxyId
, final AABB aabb, Vec2 displacement) {
109
assert (0 <=
proxyId
&&
proxyId
< m_nodeCapacity)
[
all
...]
Completed in 2923 milliseconds