HomeSort by relevance Sort by last modified time
    Searched full:edge (Results 251 - 275 of 3660) sorted by null

<<11121314151617181920>>

  /frameworks/support/design/tests/src/android/support/design/testutils/
DrawerLayoutActions.java 29 * Opens the drawer at the specified edge gravity.
57 * Closes the drawer at the specified edge gravity.
  /hardware/bsp/intel/peripheral/libmraa/examples/
isr_pin6.c 51 mraa_gpio_edge_t edge = MRAA_GPIO_EDGE_BOTH; local
53 mraa_gpio_isr(x, edge, &interrupt, NULL);
  /hardware/bsp/intel/peripheral/libmraa/examples/java/
Isr.java 26 import mraa.Edge;
45 gpio.isr(Edge.EDGE_RISING, callback);
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
LL1DFA.java 39 * predicates to resolve edge set collisions.
43 * an LL(1) DFA. One edge per set.
87 IntervalSet edge = (IntervalSet)it.next(); local
88 List<Integer> alts = edgeMap.get(edge);
90 //System.out.println(edge+" -> "+alts);
93 Label e = getLabelForSet(edge);
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
objectgraph.rst 52 *edge_data* is associated with the edge.
114 Return the edge data associated with the edge from *fromNode*
115 to *toNode*. Raises :exc:`KeyError` when no such edge exists.
121 Replace the data associated with the edge from *fromNode* to
124 Raises :exc:`KeyError` when the edge does not exist.
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_bvgraph.h 43 // Returns true if a new edge was added.
49 // Returns true if at least one new edge was added.
64 // Returns true if an edge from=>to exist.
71 // Returns true if the edge from=>to was removed.
76 // Returns true if at least one edge *=>to was removed.
86 // Returns true if at least one edge from=>* was removed.
  /external/llvm/test/Transforms/SampleProfile/
discriminator.ll 37 ; CHECK: edge while.cond -> while.body probability is 0x7ebb907a / 0x80000000 = 99.01% [HOT edge]
38 ; CHECK: edge while.cond -> while.end probability is 0x01446f86 / 0x80000000 = 0.99%
44 ; CHECK: edge while.body -> if.then probability is 0x06666666 / 0x80000000 = 5.00%
45 ; CHECK: edge while.body -> if.end probability is 0x7999999a / 0x80000000 = 95.00% [HOT edge]
calls.ll 55 ; CHECK: edge while.cond -> while.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
56 ; CHECK: edge while.cond -> while.end probability is 0x00000000 / 0x80000000 = 0.00%
64 ; the edge while.body->if.then is taken most of the time.
66 ; CHECK: edge while.body -> if.then probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
67 ; CHECK: edge while.body -> if.else probability is 0x00000000 / 0x80000000 = 0.00%
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/
omxVCM4P10_FilterDeblockingChroma_HorEdge_I.c 51 * contains the threshold for the external horizontal edge, and the
53 * edge. Per [ISO14496-10] alpha values must be in the range
56 * contains the threshold for the external horizontal edge, and the
58 * horizontal edge. Per [ISO14496-10] beta values must be in the
61 * horizontal edge of each 2x4 chroma block, arranged in horizontal
132 /* Filter horizontal edge with q0 at (X,Y) */
omxVCM4P10_FilterDeblockingChroma_VerEdge_I.c 51 * threshold for external vertical edge, and the second item is for
52 * internal vertical edge); per [ISO14496-10] alpha values must be
55 * threshold for the external vertical edge, and the second item is
56 * for the internal vertical edge); per [ISO14496-10] beta values
59 * vertical edge of each 4x2 chroma block, arranged in vertical
133 /* Filter vertical edge with q0 at (X,Y) */
omxVCM4P10_FilterDeblockingLuma_HorEdge_I.c 51 * threshold for the external vertical edge, and the second item is
52 * for the internal horizontal edge); per [ISO14496-10] alpha
55 * threshold for the external horizontal edge, and the second item
56 * is for the internal horizontal edge). Per [ISO14496-10] beta
59 * horizontal edge of each 4x4 block, arranged in horizontal block
127 /* Filter horizontal edge with q0 at (X,Y) */
omxVCM4P10_FilterDeblockingLuma_VerEdge_I.c 51 * threshold for the external vertical edge, and the second item is
52 * for the internal vertical edge); per [ISO14496-10] alpha values
55 * threshold for the external vertical edge, and the second item is
56 * for the internal vertical edge); per [ISO14496-10] beta values
59 * edge of each 4x4 block, arranged in vertical block order); must
130 /* Filter vertical edge with q0 at (X,Y) */
  /frameworks/support/design/tests/src/android/support/design/widget/
AppBarWithAnchoredFabMarginsTest.java 56 // the anchor. Since our FAB is far enough from the bottom edge of CoordinatorLayout,
57 // we are expecting the vertical center of the FAB to be aligned with the bottom edge
83 // the anchor. Since our FAB is far enough from the bottom edge of CoordinatorLayout,
84 // we are expecting the vertical center of the FAB to be aligned with the bottom edge
110 // FAB's vertical center should be aligned with the bottom edge of its anchor (app bar).
136 // FAB's vertical center should be aligned with the bottom edge of its anchor (app bar).
  /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/
BaseGridView.java 56 * The first item is aligned with the low edge of the viewport. When
60 * For HorizontalGridView, low edge refers to left edge when RTL is false or
61 * right edge when RTL is true.
62 * For VerticalGridView, low edge refers to top edge.
71 * The last item is aligned with the high edge of the viewport when
75 * For HorizontalGridView, high edge refers to right edge when RTL is false or
76 * left edge when RTL is true
    [all...]
ItemAlignmentFacet.java 58 * Sets number of pixels to offset. Can be negative for alignment from the high edge, or
59 * positive for alignment from the low edge.
66 * Gets number of pixels to offset. Can be negative for alignment from the high edge, or
67 * positive for alignment from the low edge.
91 * means 40% of the width from the low edge. Use {@link #ITEM_ALIGN_OFFSET_PERCENT_DISABLED}
104 * means 40% of the width from the low edge. Use {@link #ITEM_ALIGN_OFFSET_PERCENT_DISABLED}
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
cfgloop.h 80 /* The exit edge. */
81 edge e;
227 void rescan_loop_exit (edge, bool, bool);
257 extern vec<edge> get_loop_exit_edges (const struct loop *);
258 extern edge single_exit (const struct loop *);
259 extern edge single_likely_exit (struct loop *loop);
262 extern edge loop_preheader_edge (const struct loop *);
263 extern edge loop_latch_edge (const struct loop *);
310 extern edge create_empty_if_region_on_edge (edge, tree)
    [all...]
  /external/v8/src/compiler/
node.h 18 class Edge;
112 typedef Edge value_type;
148 typedef Edge value_type;
322 friend class Edge;
350 class Edge final {
360 bool operator==(const Edge& other) { return input_ptr_ == other.input_ptr_; }
361 bool operator!=(const Edge& other) { return !(*this == other); }
376 Edge(Node::Use* use, Node** input_ptr) : use_(use), input_ptr_(input_ptr) {
392 typedef Edge value_type;
393 typedef Edge* pointer
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/ui/
EdgeEffect.java 30 // (1) Copy the images (overscroll_{edge|glow}.png) to local resources.
42 * instance for each edge that should show the effect, feed it input data using
46 * false after drawing, the edge effect's animation is not yet complete and the widget
52 * The edge effect may then be drawn on top of the view's content using the
116 // How much dragging should effect the height of the edge image.
145 * Set the size of this edge effect in pixels.
175 * A view should call this when content is pulled away from an edge by the user.
182 * back toward the edge reached to initiate the effect.
271 // The edge should always be at least partially visible, regardless
283 // Edge should never get larger than the size of its asset
    [all...]
  /external/llvm/lib/Analysis/
CFG.cpp 26 /// The output is added to Result, as pairs of <from,to> edge info.
52 // Successor is in VisitStack, it's a back edge.
79 assert(i != e && "Didn't find edge?");
85 /// isCriticalEdge - Return true if the specified edge is a critical edge.
90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
96 // If there is more than one predecessor, this is a critical edge...
97 assert(I != E && "No preds, but we have an edge to the block?");
99 ++I; // Skip one edge due to the incoming arc from TI.
103 // If AllowIdenticalEdges is true, then we allow this edge to be considere
    [all...]
  /packages/apps/Launcher3/src/com/android/launcher3/util/
LauncherEdgeEffect.java 103 * Set the size of this edge effect in pixels.
142 * A view should call this when content is pulled away from an edge by the user.
152 * back toward the edge reached to initiate the effect.
159 * A view should call this when content is pulled away from an edge by the user.
166 * back toward the edge reached to initiate the effect.
263 * Set the color of this edge effect in argb.
272 * Return the color of this edge effect in argb.
273 * @return The color of this edge effect in argb
312 * Return the maximum height that the edge effect will be drawn at given the original
314 * @return The maximum height of the edge effec
    [all...]
  /external/opencv3/modules/core/test/
test_ds.cpp 232 static void cvTsSimpleGraphAddEdge( CvTsSimpleGraph* graph, int idx1, int idx2, void* edge )
245 memcpy( graph->matrix + ofs + 1, edge, graph->edge_size - 1 );
280 char* edge = graph->matrix + (idx1 * graph->vtx->max_count + idx2)*graph->edge_size; local
281 if( edge[0] ) return edge + 1;
1449 CvGraphEdge* edge = 0, *edge2 = 0; local
1960 CvGraphEdge* edge; local
    [all...]
  /external/mesa3d/src/mesa/swrast/
s_tritemp.h 74 * 1/16 of a pixel. If we're walking up a long, nearly vertical edge
76 * GLfixed to walk the edge without error. If the maximum viewport
125 GLint lines; /* number of lines to be sampled on this edge */
220 /* vertex/edge relationship */
225 /* compute deltas for each edge: vertex[upper] - vertex[lower] */
249 /* Edge setup. For a triangle strip these could be reused... */
287 * separated by a perfectly horizontal line. The edge that is
289 * call it a ``major'' edge. The other two edges are the
290 * ``top'' edge (for the upper subtriangle) and the ``bottom''
291 * edge (for the lower subtriangle). If either of these tw
    [all...]
  /external/opencv/cvaux/src/
cvlcm.cpp 68 CvVoronoiEdge2D* edge; member in struct:CvLCMComplexNodeData
91 #define _CV_IS_EDGE_REFLEX( EDGE ) (( (EDGE)->site[0]->node[0] == (EDGE)->site[0]->node[0] ) || \
92 ( (EDGE)->site[1]->node[0] == (EDGE)->site[1]->node[0] ) )
94 #define _CV_INITIALIZE_CVLCMDATA(STRUCT,SITE,EDGE,NODE)\
95 { (STRUCT)->psite = SITE ; (STRUCT)->pedge = EDGE; (STRUCT)->pnode = NODE;}
117 // pLCMEdge: in, input edge of hybrid model
134 // pLCMEdge: in, input edge of hybrid mode
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/
btAxisSweep3InternalInt.java 61 static public class Edge extends BulletBase {
64 protected Edge(final String className, long cPtr, boolean cMemoryOwn) {
69 /** Construct a new Edge, normally you should not need this constructor it's intended for low-level usage. */
70 public Edge(long cPtr, boolean cMemoryOwn) {
71 this("Edge", cPtr, cMemoryOwn);
82 public static long getCPtr(Edge obj) {
124 public Edge() {
btAxisSweep3InternalShort.java 61 static public class Edge extends BulletBase {
64 protected Edge(final String className, long cPtr, boolean cMemoryOwn) {
69 /** Construct a new Edge, normally you should not need this constructor it's intended for low-level usage. */
70 public Edge(long cPtr, boolean cMemoryOwn) {
71 this("Edge", cPtr, cMemoryOwn);
82 public static long getCPtr(Edge obj) {
124 public Edge() {

Completed in 1447 milliseconds

<<11121314151617181920>>