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

<<21222324252627282930>>

  /external/chromium-trace/catapult/tracing/docs/
coordinate-systems.md 22 padding so the edges of boxes do not sit against the edge of the world. For
  /external/clang/INPUTS/
cfg-nested-var-scopes.cpp 2 // implicit destructors triggered at each edge.
  /external/curl/tests/unit/
unit1305.c 138 /* To do: test retrieval, deletion, edge conditions */
  /external/deqp/doc/testspecs/GLES31/
functional.tessellation.txt 78 and their x coordinates are inspected to see whether the edge is split into
131 The shared-edge cases draw multiple primitives (with the "triangles" or "quads"
133 each pair of primitives sharing an edge, that edge has the same tessellation
  /external/drm_hwcomposer/
separate_rects.cpp 36 // left edge of the rectangle.
78 // The sweep stops at each vertical edge of each input rectangle in sorted
92 // Events are when the sweep line encounters the starting or ending edge of
97 // A started rect is a rectangle whose left, top, bottom edge, and set of
99 // (except the left edge is never used to determine key equivalence or
134 // During this event, we have encountered a vertical starting or ending edge
163 // Peeks ahead to see if there are other rectangles sharing a vertical edge
182 // example if the current sweep line were the left edge of a scene with only
276 // right edge is exactly the current event's x-coordinate. With this, we
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/calendar/
IndianTest.java 265 errln("Incorrect calendar value for year edge test");
269 errln("Incorrect calendar value for year edge test");
273 errln("Incorrect calendar value for year edge test");
277 errln("Incorrect calendar value for year edge test");
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/calendar/
IndianTest.java 261 errln("Incorrect calendar value for year edge test");
265 errln("Incorrect calendar value for year edge test");
269 errln("Incorrect calendar value for year edge test");
273 errln("Incorrect calendar value for year edge test");
  /external/libchrome/base/posix/
file_descriptor_shuffle.h 10 // desired descriptors) is very simple, but wrong: it won't handle edge cases
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/contacts/
EdgeAndCircleContact.java 43 assert (m_fixtureA.getType() == ShapeType.EDGE);
EdgeAndPolygonContact.java 43 assert (m_fixtureA.getType() == ShapeType.EDGE);
  /external/libhevc/decoder/
ihevcd_deblk.c 166 * ctb_size/4 is the number of BS values needed per edge
215 /* Luma Vertical Edge */
232 * Vertical edge processing is done by shifting the CTB up by four pixels */
356 /* Luma Horizontal Edge */
373 * Horizontal edge processing is done by shifting the CTB left by four pixels */
497 /* Chroma Veritcal Edge */
515 * Vertical edge processing is done by shifting the CTB up by four pixels */
644 /* Chroma Horizontal Edge */
662 * Vertical edge processing is done by shifting the CTB up by four pixels (8 here beacuse UV are interleaved) */
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 280 /// an early exit edge jumps out of.
319 /// Probability weight for an edge in the graph (including the
326 /// In addition to the raw weight amount, Weight stores the type of the edge
328 /// Is this a local edge within the loop, an exit from the loop, or a
344 /// This class collates the successor edge weights for later processing.
371 /// cases, adjacent edge weights are combined by sorting WeightList and
372 /// combining adjacent weights. However, for very large edge lists an
392 /// successor edge.
398 /// \brief Add an edge to the distribution.
400 /// Adds an edge to Succ to Dist. If \c LoopHead.isValid(), then whether th
    [all...]
  /external/llvm/include/llvm/Support/
GraphWriter.h 67 // Writes the edge labels of the node to O and returns true if there are any
68 // edge labels not equal to the empty string "".
246 // Figure out which edge this targets...
284 /// emitEdge - Output an edge from a simple node into the graph...
  /external/llvm/lib/Analysis/
TypeBasedAliasAnalysis.cpp 87 // char (!1) -- edge to Root
88 // short (!2) -- edge to char
89 // A (!3) -- edge with offset 0 to short
90 // B (!4) -- edge with offset 0 to short and edge with offset 4 to A
93 // of tagX, follow the edge with the correct offset in the type DAG and adjust
538 // Start from the base type of A, follow the edge with the correct offset in
553 // Follow the edge with the correct offset, OffsetA will be adjusted to
569 // Follow the edge with the correct offset, OffsetB will be adjusted to
  /external/llvm/test/CodeGen/Mips/
2011-05-26-BranchKillsVreg.ll 4 ; PHI elimination splits the critical edge from %while.end415 to %if.end427.
  /external/llvm/test/CodeGen/X86/
sink-blockfreq.ll 7 ; can't be used as to avoid breaking a non profitable critical edge. By using
switch-edge-weight.ll 60 ; In this switch statement, there is an edge from jump table to default
122 ; In this switch statement, there is no edge from jump table to default
182 ; In this switch statement, there is no edge from bit test to default basic
232 ; In this switch statement, there is an edge from jump table to default basic
  /external/llvm/test/DebugInfo/X86/
DW_AT_specification.ll 4 ; test that the DW_AT_specification is a back edge in the file.
  /external/llvm/test/Verifier/
invoke.ll 75 ; CHECK: Block containing LandingPadInst must be jumped to only by the unwind edge of an invoke.
  /external/mesa3d/bin/
.cherry-ignore 5 41e105d5beb78c42993a602cc58d0f990739b088 nvc0: add missing call to map edge flag in push_vbo
  /external/mesa3d/src/gallium/auxiliary/draw/
draw_pipe_clip.c 319 * Note: at this point we can't just use the per-vertex edge flags.
320 * We have to observe the edge flag bits set in header->flags which
322 * an edge flags array which parallels the vertex array.
323 * Later, in the 'unfilled' pipeline stage we'll draw the edge if both
349 boolean *edge = &inEdges[i]; local
384 /* Whether or not to set edge flag for the new vert depends
389 /* we want to see an edge along the clip plane */
394 /* we don't want to see an edge along the frustum clip plane */
413 edge_prev = edge;
  /external/mesa3d/src/gallium/state_trackers/vega/
vg_state.h 70 /* Edge fill color for VG_TILE_FILL tiling mode */
  /external/mockito/cglib-and-asm/src/org/mockito/asm/
Label.java 158 * flow graph contains one node per "basic block", and one edge per "jump"
162 * the graph, as a linked list of Edge objects.
223 * are stored in a linked list of {@link Edge Edge} objects, linked to each
224 * other by their {@link Edge#next} field.
226 Edge successors;
486 Edge e = new Edge();
502 Edge e = successors;
  /external/opencv/cv/include/
cvtypes.h 200 /* get the next edge with the same origin point (counterwise) */
201 #define CV_SUBDIV2D_NEXT_EDGE( edge ) (((CvQuadEdge2D*)((edge) & ~3))->next[(edge)&3])
  /external/opencv3/doc/tutorials/introduction/windows_visual_studio_image_watch/
windows_visual_studio_image_watch.markdown 30 In this example, we use a minimal test program that loads an image from a file and runs an edge
50 << "image from a file and runs the Canny edge detector. " << endl
143 over the *cv::Canny()* call, you will see a thumbnail of the edge image appear in the image list.
147 clearly defined edge:

Completed in 1299 milliseconds

<<21222324252627282930>>