| /frameworks/support/v17/leanback/tests/java/android/support/v17/leanback/widget/ |
| SingleRowTest.java | 59 assertEquals(mProvider.getEdge(0), 0);
60 assertEquals(mProvider.getEdge(1), 100);
61 assertEquals(mProvider.getEdge(2), 200);
62 assertEquals(mProvider.getEdge(3), 250);
63 assertEquals(mProvider.getEdge(4), 370);
64 assertEquals(mProvider.getEdge(5), 430);
104 assertEquals(mProvider.getEdge(0), 0);
105 assertEquals(mProvider.getEdge(1), -100);
106 assertEquals(mProvider.getEdge(2), -200);
107 assertEquals(mProvider.getEdge(3), -250)
[all...] |
| GridTest.java | 61 public int getEdge(int index) {
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| SingleRow.java | 85 edge = mProvider.getEdge(index + 1) + mMargin + size;
87 edge = mProvider.getEdge(index + 1) - mMargin - size;
118 edge = mProvider.getEdge(index - 1) - mProvider.getSize(index - 1) - mMargin;
120 edge = mProvider.getEdge(index - 1) + mProvider.getSize(index - 1) + mMargin;
148 return mReversedFlow ? mProvider.getEdge(indexLimit) - mProvider.getSize(indexLimit)
149 : mProvider.getEdge(indexLimit);
158 return mReversedFlow ? mProvider.getEdge(indexLimit)
159 : mProvider.getEdge(indexLimit) + mProvider.getSize(indexLimit);
|
| Grid.java | 85 public abstract int getEdge(int index);
388 boolean offEnd = !mReversedFlow ? mProvider.getEdge(mLastVisibleIndex) >= toLimit
389 : mProvider.getEdge(mLastVisibleIndex) <= toLimit;
405 boolean offFront = !mReversedFlow ? mProvider.getEdge(mFirstVisibleIndex)
407 : mProvider.getEdge(mFirstVisibleIndex)
|
| StaggeredGrid.java | 152 edge = mProvider.getEdge(mFirstVisibleIndex);
189 edge = mProvider.getEdge(itemIndex);
250 int oldFirstEdge = mProvider.getEdge(mFirstIndex);
308 edge = mProvider.getEdge(mLastVisibleIndex);
344 edge = mProvider.getEdge(itemIndex);
383 offset = location - mProvider.getEdge(mLastVisibleIndex);
|
| StaggeredGridDefault.java | 33 int edge = mProvider.getEdge(mFirstVisibleIndex);
45 int edge = mProvider.getEdge(mLastVisibleIndex);
70 int edge = mProvider.getEdge(mLastVisibleIndex);
83 int edge = mProvider.getEdge(mFirstVisibleIndex);
105 int edge = mProvider.getEdge(indexLimit);
157 int edge = mProvider.getEdge(indexLimit);
|
| /external/opencv3/modules/imgproc/src/ |
| subdivision2d.cpp | 62 int Subdiv2D::getEdge(int edge, int nextEdgeType) const
191 splice(edge, getEdge(edgeA, NEXT_AROUND_LEFT));
201 int a = getEdge(edge, PREV_AROUND_ORG);
202 int b = getEdge(sedge, PREV_AROUND_ORG);
209 splice(edge, getEdge(a, NEXT_AROUND_LEFT));
210 splice(sedge, getEdge(b, NEXT_AROUND_LEFT));
244 splice( edge, getEdge(edge, PREV_AROUND_ORG) );
246 splice(sedge, getEdge(sedge, PREV_AROUND_ORG) );
303 int dprev_edge = getEdge( edge, PREV_AROUND_DST );
427 recentEdge = curr_edge = getEdge( curr_edge, PREV_AROUND_ORG )
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btConvexTriangleMeshShape.h | 53 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const;
|
| btTetrahedronShape.h | 58 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const;
|
| btTriangleShape.h | 56 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const
146 getEdge(i,pa,pb);
|
| btConvexHullShape.h | 85 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const;
|
| btConvexPointCloudShape.h | 93 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const;
|
| btPolyhedralConvexShape.h | 61 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const = 0;
|
| btConvexPointCloudShape.cpp | 112 void btConvexPointCloudShape::getEdge(int i,btVector3& pa,btVector3& pb) const
|
| btTetrahedronShape.cpp | 113 void btBU_Simplex1to4::getEdge(int i,btVector3& pa,btVector3& pb) const
|
| btBox2dShape.h | 241 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const
242 //virtual void getEdge(int i,Edge& edge) const
|
| btBoxShape.h | 183 virtual void getEdge(int i,btVector3& pa,btVector3& pb) const
184 //virtual void getEdge(int i,Edge& edge) const
|
| btConvexHullShape.cpp | 143 void btConvexHullShape::getEdge(int i,btVector3& pa,btVector3& pb) const
|
| btConvexTriangleMeshShape.cpp | 167 void btConvexTriangleMeshShape::getEdge(int ,btVector3& ,btVector3& ) const
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 90 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
203 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
204 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
232 EdgeEntry &NE = getEdge(EId);
519 getEdge(EId).Costs = AllocatedCosts;
531 return getEdge(EId).Costs;
538 return *getEdge(EId).Costs;
542 return getEdge(EId).Metadata;
546 return getEdge(EId).Metadata;
553 return getEdge(EId).getN1Id()
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/ |
| btPolyhedralConvexShape.java | 82 public void getEdge(int i, Vector3 pa, Vector3 pb) {
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 95 inline Edge *getEdge() const { return e; }
|
| nv50_ir_print.cpp | 594 ei.getEdge()->typeStr());
610 ei.getEdge()->typeStr());
|
| /external/opencv3/samples/cpp/ |
| delaunay2.cpp | 69 e = subdiv.getEdge(e, Subdiv2D::NEXT_AROUND_LEFT);
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| SphereTriangleDetector.cpp | 133 m_triangle->getEdge(i,pa,pb);
|
