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

1 2 3 4 56 7 8 91011>>

  /external/chromium_org/cc/layers/
nine_patch_layer.h 36 // on the edges of the layer. The corners are unscaled, the top and bottom
  /external/chromium_org/chrome/browser/ui/gtk/
nine_box.h 30 // of the edges and corners.
  /external/chromium_org/chrome/browser/ui/views/
dropdown_bar_view.h 54 // the widget so that we can draw the curved edges that attach to the toolbar
  /external/chromium_org/components/browser_context_keyed_service/
dependency_graph.h 58 // Keeps track of edges of the dependency graph.
  /external/chromium_org/tools/telemetry/telemetry/core/heap/
chrome_js_heap_snapshot_parser_unittest.py 19 'edges': edge_list,
  /external/llvm/utils/
DSAclean.py 9 #10/12/2005: now it only removes nodes and edges for which the label is %tmp.# rather
  /external/v8/test/mjsunit/
count-based-osr.js 28 // Flags: --count-based-interrupts --interrupt-budget=10 --weighted-back-edges --allow-natives-syntax
  /frameworks/base/packages/Keyguard/res/values/
attrs.xml 46 <!-- Additional option that can be set to have the top and/or bottom edges of
49 edge, a bottom gravity will clip the top edge, and neither will clip both edges. -->
51 <!-- Additional option that can be set to have the left and/or right edges of
54 edge, a right gravity will clip the left edge, and neither will clip both edges. -->
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
dot.rb 79 | <%= @edges.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
158 tree_template[ :edges ] << edge_template
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
MachineProbe.java 61 // for (Edge e : startState.edges) { // walk edges looking for valid
174 // for (Edge e : d.edges) {
  /external/ceres-solver/internal/ceres/
canonical_views_clustering_test.cc 56 // Create self edges.
62 // Create three edges.
66 // edges.
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 118 inline Node *parent() const; // returns NULL if count(incident edges) != 1
125 inline int incidentCountFwd() const; // count of incident non-back edges
163 // safe iterators are unaffected by changes to the *edges* of the graph
  /external/eigen/Eigen/src/Core/arch/AltiVec/
PacketMath.h 306 Packet16uc MSQ, LSQ, edges; local
311 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
312 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
314 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
315 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
324 Packet16uc MSQ, LSQ, edges; local
329 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
330 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
    [all...]
  /external/jmonkeyengine/engine/src/core-effects/com/jme3/post/filters/
CartoonEdgeFilter.java 114 * defines how much depth will influence edges, default is 10
156 * Defineshow visilble will be the outlined edges
167 * returns the width of the edges
  /external/llvm/lib/Transforms/Instrumentation/
EdgeProfiling.cpp 31 STATISTIC(NumEdgesInserted, "The # of edges inserted.");
71 // edges!
83 // Instrument all of the edges...
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_graph.h 118 inline Node *parent() const; // returns NULL if count(incident edges) != 1
125 inline int incidentCountFwd() const; // count of incident non-back edges
163 // safe iterators are unaffected by changes to the *edges* of the graph
  /external/skia/gm/
polygons.cpp 18 // trapezoid, diamond, polygons with lots of edges, several concave polygons...
42 SkPoint p4[32]; // circle-like polygons with 32-edges.
43 SkPoint p5[] = {{0, 0}, {20, 20}, {0, 40}, {60, 20}}; // concave polygon with 4 edges
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/
omxVCM4P10_DeblockChroma_I.c 28 * Performs in-place deblocking filtering on all edges of the chroma
49 * for vertical edges and then horizontal edges); valid in the
omxVCM4P10_DeblockLuma_I.c 30 * vertical edges of a luma macroblock (16x16).
50 * order for vertical edges and then horizontal edges; valid in the
  /frameworks/compile/mclinker/include/mcld/Fragment/
FragmentGraph.h 63 /// getEdges - given a node, get the list of edges which are the fan-out of
65 /// @param pEdges - the edge list which contains the found edges
170 /// m_NumOfEdges - number of edges
  /packages/apps/DeskClock/res/values-sw600dp/
dimens.xml 91 <!-- Empty space at the edges of the +1 and reset button icons. Based off of 56dip width.-->
93 <!-- Empty space at the edges of the delete button icons. Based off of 56dip width. -->
95 <!-- Empty space at the edges of the delete button icons. Based off of 56dip width, only nonzero for tablets. -->
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-inline.h 29 /* Indicate the desired behavior wrt call graph edges. We can either
31 parallelization), or move the edges of the clones (saving). */
91 /* What to do with call graph edges. */
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-inline.h 29 /* Indicate the desired behavior wrt call graph edges. We can either
31 parallelization), or move the edges of the clones (saving). */
91 /* What to do with call graph edges. */
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-inline.h 29 /* Indicate the desired behavior wrt call graph edges. We can either
31 parallelization), or move the edges of the clones (saving). */
91 /* What to do with call graph edges. */
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-inline.h 29 /* Indicate the desired behavior wrt call graph edges. We can either
31 parallelization), or move the edges of the clones (saving). */
91 /* What to do with call graph edges. */

Completed in 739 milliseconds

1 2 3 4 56 7 8 91011>>