| /frameworks/rs/java/tests/VrDemo/src/com/example/android/rs/vr/engine/ |
| rasterize.rs | 112 // float test = edge(0 , test1) * edge(0 , test2)* edge(0 , test3);
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/util/ |
| StateMachine.java | 129 * Add two States to StateMachine and create an edge between this two.
195 // for each toState that having an incoming edge from "state":
200 // remove edge from graph
|
| /packages/apps/Camera2/src/com/android/camera/data/ |
| FilmstripItemUtils.java | 119 // Step 2: scale maximum edge down to MAXIMUM_TEXTURE_SIZE.
136 // Step 2: scale maximum edge down to maximum texture size.
137 // If Bitmap maximum edge > MAXIMUM_TEXTURE_SIZE, which can happen for panoramas,
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| EdgeView.java | 35 // Each edge effect has a transform matrix, and each matrix has 16 elements.
68 // EdgeEffect draws the TOP edge from (0, 0) to (w, Y * h) where Y
101 // Called when the content is pulled away from the edge.
|
| /packages/apps/Messaging/src/com/android/messaging/datamodel/media/ |
| AvatarGroupRequestDescriptor.java | 124 * radius of the circle, this is the length of edge b. Also we know that the
125 * distance from image zero to image two's center is 2 * radius, edge c. From this
127 * edge a, is equal to radius * squareRoot(3) due to this triangle being a 30-60-90
|
| /packages/screensavers/PhotoTable/res/values/ |
| config.xml | 89 <!-- distance from edge to start a valid edge swipe as a fraction of
93 <!-- minimum length of a valid edge swipe as a fraction of
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| predict.def | 32 HITRATE is the probability that edge predicted by predictor as taken
79 /* Loopback edge is taken. */
83 /* Edge causing loop to terminate is probably not taken. */
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFA.java | 171 /** Map an edge transition table to a unique set number; ordered so
188 /** The unique edge transition class number; every time we see a new
191 * some of the big edge transition tables are seen about 57 times.
215 /** just the Vector<Integer> indicating which unique edge table is at
504 Transition edge = (Transition) s.transition(j);
505 Label label = edge.label;
555 Transition edge = (Transition) s.transition(j);
556 Label label = edge.label;
560 Utils.integer(edge.target.stateNumber));
570 Utils.integer(edge.target.stateNumber))
[all...] |
| NFAState.java | 65 * alternative block decision node at the left edge. The (...)* is
67 * node at the extreme left edge. This is not how they get generated
127 // knows about the label of the incoming edge.
131 ErrorManager.internalError("Clobbered incident edge");
157 * and so on, but for walking the NFA to get a sequence of edge
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/ |
| b2World.cpp | 253 b2ContactEdge* edge = bodyB->GetContactList(); local
254 while (edge)
256 if (edge->other == bodyA)
260 edge->contact->FlagForFiltering();
263 edge = edge->next;
352 b2ContactEdge* edge = bodyB->GetContactList(); local
353 while (edge)
355 if (edge->other == bodyA)
359 edge->contact->FlagForFiltering()
[all...] |
| b2Fixture.cpp | 191 b2ContactEdge* edge = m_body->GetContactList(); local
192 while (edge)
194 b2Contact* contact = edge->contact;
202 edge = edge->next;
|
| /art/test/482-checker-loop-back-edge-use/src/ |
| Main.java | 62 // 'incoming' only needs a use at the outer loop's back edge.
75 // 'incoming' has no loop use, so should not have back edge uses.
115 // 'incoming' must have a use only at the first loop's back edge.
140 System.nanoTime(); // beat back edge splitting
161 System.nanoTime(); // beat back edge splitting
|
| /external/ImageMagick/www/api/ |
| shear.html | 10 <meta http-equiv="X-UA-Compatible" content="IE=edge" />
71 <p>If the artifact "deskew:auto-crop" is given the image will be automatically cropped of the excess background. The value is the border width of all pixels around the edge that will be used to determine an average border color for the automatic trim.</p>
121 <p>ShearImage() creates a new image that is a shear_image copy of an existing one. Shearing slides one edge of an image along the X or Y axis, creating a parallelogram. An X direction shear slides an edge along the X axis, while a Y direction shear slides an edge along the Y axis. The amount of the shear is controlled by a shear angle. For X direction shears, x_shear is measured relative to the Y axis, and similarly, for Y direction shears y_shear is measured relative to the X axis. Empty triangles left over from shearing the image are filled with the background color defined by member 'background_color' of the image.. ShearImage() allocates the memory necessary for the new Image structure and returns a pointer to the new image.</p>
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/ |
| Fixture.java | 152 ContactEdge edge = m_body.getContactList(); local
153 while (edge != null) {
154 Contact contact = edge.contact;
160 edge = edge.next;
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btConvexPolyhedron.cpp | 118 btVector3 edge = m_vertices[vp.m_v1]-m_vertices[vp.m_v0]; local
119 edge.normalize();
126 if (IsAlmostZero(m_uniqueEdges[p]-edge) ||
127 IsAlmostZero(m_uniqueEdges[p]+edge))
136 m_uniqueEdges.push_back(edge);
|
| /external/libpcap/ |
| gencode.h | 238 struct edge { struct
244 struct edge *next; /* link list of incoming edges for a node */
257 struct edge et;
258 struct edge ef;
263 struct edge *in_edges;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 43 /// involved in the split of a critical edge.
51 /// The splitting of a critical edge is local and thus, it is possible
55 /// edge splitting.
221 /// \brief Record that the critical edge (FromBB, ToBB) has been
239 "A basic block inserted via edge splitting cannot appear twice");
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 56 /// edgeTargetsEdgeSource - This method returns true if this outgoing edge
57 /// should actually target another edge source, not a node. If this method
65 /// called to determine which outgoing edge of Node is the target of this
66 /// edge.
96 /// edge, override this method.
|
| /external/skia/gm/ |
| convexpaths.cpp | 180 // triangle where one edge is a degenerate quad
187 // triangle where one edge is a quad with a repeated point
192 // triangle where one edge is a cubic with a 2x repeated point
199 // triangle where one edge is a quad with a nearly repeated point
205 // triangle where one edge is a cubic with a 3x nearly repeated point
|
| /external/skia/src/gpu/effects/ |
| GrConvexPolyEffect.cpp | 199 fragBuilder->codeAppend("\t\tfloat edge;\n");
205 fragBuilder->codeAppend("\t\tedge = clamp(edge, 0.0, 1.0);\n");
207 fragBuilder->codeAppend("\t\tedge = edge >= 0.5 ? 1.0 : 0.0;\n");
209 fragBuilder->codeAppend("\t\talpha *= edge;\n");
319 // Outset the edges by 0.5 so that a pixel with center on an edge is 50% covered in the AA case
|
| /frameworks/base/core/java/android/text/ |
| Selection.java | 45 * Return the offset of the selection edge or cursor, or -1 if
64 * Set the selection anchor to <code>start</code> and the selection edge
98 * Move the selection edge to offset <code>index</code>.
211 * at the left edge of the line and there is not another line to move it to.
235 * at the right edge of the line and there is not another line
|
| /prebuilts/tools/linux-x86_64/kythe/ |
| RELEASES.md | 23 - xrefs service: add `ordinal` field to each EdgeSet edge
97 - xrefs.Edges: correctly return empty page_token on last page (when filtering by edge kinds)
123 - C++ indexer: rename `/kythe/edge/defines` to `/kythe/edge/defines/binding`
188 - kwazthis: return `/kythe/edge/typed` target ticket for each node
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DependencyGraph.java | 47 * is away from a parent edge) such that we can prioritize connections which
155 * @param vertical if true, look for vertical edge dependencies, otherwise look for
156 * horizontal edge dependencies
283 * an edge in the dependency graph.
292 // are closer to a parent edge:
|
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 83 #define CV_GET_ADJ_VTX( vertex, edge ) \
85 assert(edge->vtx[0]==vertex||edge->vtx[1] == vertex ), \
86 (edge->vtx[0] == vertex)?edge->vtx[1]:edge->vtx[0] \
173 CvGraphEdge* edge = cvFindGraphEdgeByPtr( graph, ver1, ver2 );
174 if( edge )
176 assert( ((CvGraphWeightedEdge*)edge)->weight >= 0 );
178 finder->edge_weights[ j * graph->total + i ] = ((CvGraphWeightedEdge*)edge)->weight
[all...] |
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| Delaunay.cpp | 129 // Quad-edge manipulation primitives
189 // Quad-edge storage allocation
216 // Edge storage management
622 void CDelaunay::linkNeighbors(SEdgeVector *edge, int nedge, int nsite)
627 sa[i].setNeighbor(edge);
629 for (; edge->first == i && nedge; edge++, nedge--) {
|
