HomeSort by relevance Sort by last modified time
    Searched full:edges (Results 226 - 250 of 1319) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/skia/tests/
ClipperTest.cpp 112 // edges
131 // extended edges
  /frameworks/base/packages/WallpaperCropper/src/com/android/gallery3d/glrenderer/
BasicTexture.java 118 // actual content. This is used to avoid jigged edges.
120 // The jigged edges appear because we use GL_CLAMP_TO_EDGE for texture wrap
  /frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/
AmPmCirclesView.java 168 // Line up the horizontal edges of the AM/PM circles with the horizontal edges
  /frameworks/support/v4/java/android/support/v4/widget/
AutoScrollHelper.java 60 * horizontal edges.
341 * <li>{@link #EDGE_TYPE_INSIDE} for edges that respond to touches inside
344 * <li>{@link #EDGE_TYPE_INSIDE_EXTEND} for inside edges that continued to
346 * <li>{@link #EDGE_TYPE_OUTSIDE} for edges that only respond to touches
361 * If both relative and maximum edges are specified, the maximum edge will
381 * If relative edge size is not specified, activation edges will always be
382 * the maximum edge size. If both relative and maximum edges are specified,
606 // For now, leading and trailing edges are always the same size.
    [all...]
ViewDragHelper.java 84 * Edge flag set indicating all edges should be affected.
204 * Called when one of the subscribed edges in the parent view has been touched
220 * unlocked. The default behavior is to leave edges unlocked.
231 * of the subscribed edges in the parent view while no child view is currently captured.
425 * Enable edge tracking for the selected edges of the parent view.
428 * for edges for which edge tracking has been enabled.
430 * @param edgeFlags Combination of edge flags describing the edges to watch
441 * Return the size of an edge. This is the range in pixels along the edges of this view
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/glrenderer/
BasicTexture.java 118 // actual content. This is used to avoid jigged edges.
120 // The jigged edges appear because we use GL_CLAMP_TO_EDGE for texture wrap
  /packages/apps/Gallery2/src/com/android/gallery3d/ui/
EdgeView.java 67 // Set up transforms for the four edges. Without transforms an
69 // is some factor < 1. For other edges we need to move, rotate, and
  /packages/apps/Launcher3/WallpaperPicker/src/com/android/gallery3d/glrenderer/
BasicTexture.java 118 // actual content. This is used to avoid jigged edges.
120 // The jigged edges appear because we use GL_CLAMP_TO_EDGE for texture wrap
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/
CPP.stg 881 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
885 <edges; separator="\nelse ">
904 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
908 <edges; separator="\nelse ">
917 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
921 <edges; separator="\nelse "><\n>
949 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
951 <edges; separator="\n">
963 dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
965 <edges; separator="\n"
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
Ruby.stg 763 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
765 <edges; separator="\nels">
787 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
789 <edges; separator="\nels">
802 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
804 <edges; separator="\nels"><\n>
833 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
835 <edges; separator="\n">
851 dfaOptionalBlockStateSwitch(k, edges, eotPredictsAlt, description, stateNumber, semPredState) ::= <<
853 <edges; separator="\n"
    [all...]
  /external/clang/test/Analysis/diagnostics/
undef-value-param.m 84 // CHECK-NEXT: <key>edges</key>
161 // CHECK-NEXT: <key>edges</key>
195 // CHECK-NEXT: <key>edges</key>
229 // CHECK-NEXT: <key>edges</key>
292 // CHECK-NEXT: <key>edges</key>
326 // CHECK-NEXT: <key>edges</key>
389 // CHECK-NEXT: <key>edges</key>
481 // CHECK-NEXT: <key>edges</key>
590 // CHECK-NEXT: <key>edges</key>
667 // CHECK-NEXT: <key>edges</key
    [all...]
undef-value-param.c 102 // CHECK-NEXT: <key>edges</key>
179 // CHECK-NEXT: <key>edges</key>
213 // CHECK-NEXT: <key>edges</key>
276 // CHECK-NEXT: <key>edges</key>
339 // CHECK-NEXT: <key>edges</key>
373 // CHECK-NEXT: <key>edges</key>
453 // CHECK-NEXT: <key>edges</key>
530 // CHECK-NEXT: <key>edges</key>
564 // CHECK-NEXT: <key>edges</key>
627 // CHECK-NEXT: <key>edges</key
    [all...]
  /external/chromium_org/chrome/browser/ui/views/location_bar/
location_bar_view.h 325 // edges(i.e. the height of the edit control inside). If
339 // edges.
342 // Thickness of the edges of the omnibox background images, in normal mode.
370 // The same, but for the top and bottom edges.
530 // the widget so that we can draw the curved edges that attach to the toolbar
  /external/llvm/lib/IR/
Dominators.cpp 166 // edges, the callers can normally handle them more efficiently.
217 // edges, the callers can normally handle them more efficiently.
243 // their operands on edges; simulate this by thinking of the use
259 // Invoke instructions define their return values on the edges
296 // PHI nodes use their operands on their incoming edges.
GCOV.cpp 125 // read edges.
176 Edges.clear();
198 if (!Edges.empty()) {
200 for (SmallVectorImpl<uint32_t>::iterator I = Edges.begin(), E = Edges.end();
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
basic-block.h 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
basic-block.h 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
basic-block.h 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
basic-block.h 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
    [all...]
  /external/clang/test/Analysis/
malloc-plist.c 201 // CHECK-NEXT: <key>edges</key>
264 // CHECK-NEXT: <key>edges</key>
298 // CHECK-NEXT: <key>edges</key>
361 // CHECK-NEXT: <key>edges</key>
426 // CHECK-NEXT: <key>edges</key>
460 // CHECK-NEXT: <key>edges</key>
523 // CHECK-NEXT: <key>edges</key>
588 // CHECK-NEXT: <key>edges</key>
651 // CHECK-NEXT: <key>edges</key>
685 // CHECK-NEXT: <key>edges</key
    [all...]
null-deref-path-notes.m 61 // CHECK-NEXT: <key>edges</key>
124 // CHECK-NEXT: <key>edges</key>
187 // CHECK-NEXT: <key>edges</key>
221 // CHECK-NEXT: <key>edges</key>
330 // CHECK-NEXT: <key>edges</key>
364 // CHECK-NEXT: <key>edges</key>
427 // CHECK-NEXT: <key>edges</key>
461 // CHECK-NEXT: <key>edges</key>
526 // CHECK-NEXT: <key>edges</key>
560 // CHECK-NEXT: <key>edges</key
    [all...]
retain-release.m     [all...]
cxx-for-range.cpp 107 // CHECK-NEXT: <key>edges</key>
170 // CHECK-NEXT: <key>edges</key>
204 // CHECK-NEXT: <key>edges</key>
238 // CHECK-NEXT: <key>edges</key>
272 // CHECK-NEXT: <key>edges</key>
306 // CHECK-NEXT: <key>edges</key>
340 // CHECK-NEXT: <key>edges</key>
432 // CHECK-NEXT: <key>edges</key>
466 // CHECK-NEXT: <key>edges</key>
500 // CHECK-NEXT: <key>edges</key
    [all...]
NewDelete-path-notes.cpp 38 // CHECK-NEXT: <key>edges</key>
101 // CHECK-NEXT: <key>edges</key>
135 // CHECK-NEXT: <key>edges</key>
198 // CHECK-NEXT: <key>edges</key>
261 // CHECK-NEXT: <key>edges</key>
384 // CHECK-NEXT: <key>edges</key>
476 // CHECK-NEXT: <key>edges</key>
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3collections.h 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:

Completed in 1110 milliseconds

1 2 3 4 5 6 7 8 91011>>