| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| basic-block.h | 180 /* The edges into and out of the block. */
300 /* Number of edges in this flow graph. */
495 /* Number of edges in the compressed edge list. */
574 /* Iterator object for edges. */
683 vector of predecessor or successor edges. It must not be used when
883 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
898 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
913 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
915 find_fallthru_edge (vec<edge, va_gc> *edges)
920 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_set.py | [all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_set.py | [all...] |
| /external/chromium_org/cc/resources/ |
| task_graph_runner_unittest.cc | 98 new_graph.edges.push_back(
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| thingsToDo.txt | 104 context), we can't know whether to keep the coincident edges or not.
145 once the edges are exhausted, remaining must be disjoint contours
438 // this needs to walk both spans in lock step, skipping edges that
446 // cancel coincident edges in lock step
|
| /external/skia/experimental/Intersection/ |
| thingsToDo.txt | 104 context), we can't know whether to keep the coincident edges or not.
145 once the edges are exhausted, remaining must be disjoint contours
438 // this needs to walk both spans in lock step, skipping edges that
446 // cancel coincident edges in lock step
|
| /external/chromium_org/v8/src/ |
| heap-snapshot-generator.cc | 69 snapshot_->edges().Add(edge);
78 snapshot_->edges().Add(edge);
273 children().Allocate(edges().length());
279 ASSERT(edges().length() == children_index);
280 for (int i = 0; i < edges().length(); ++i) {
281 HeapGraphEdge* edge = &edges()[i];
2880 List<HeapGraphEdge*>& edges = snapshot_->children(); local
[all...] |
| heap-snapshot-generator.h | 162 List<HeapGraphEdge>& edges() { return edges_; } function in class:v8::internal::HeapSnapshot
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
| HeapSnapshot.js | 497 edges: function()
823 this._containmentEdges = profile.edges;
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Grammar.java | 293 /** The NFA that represents the grammar with edges labelled with tokens
486 * incident edges can have synpreds. Same is try for
1206 List<IntervalSet> edges = new ArrayList<IntervalSet>(); local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.ant.core_3.2.200.v20100427.jar | |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| DFA.as | 110 // what about predicated edges coming from EOT
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afloader.c | 195 AF_Edge edge1 = axis->edges; /* leftmost edge */
|
| /external/freetype/src/autofit/ |
| afloader.c | 206 AF_Edge edge1 = axis->edges; /* leftmost edge */
|
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 322 * - edges are state transitions, implemented as calls to the pending
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
[all...] |
| /external/chromium_org/third_party/jstemplate/ |
| jstemplate.js | 304 * - edges are state transitions, implemented as calls to the pending
306 * - pre-order function calls are downward edges (recursion into call).
307 * - post-order function calls are upward edges (return from call).
|
| /external/chromium_org/third_party/d3/src/ |
| d3.js | [all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-heap-profiler.cc | 148 i::List<i::HeapGraphEdge>& edges = heap_snapshot->edges(); local
149 for (int i = 0; i < edges.length(); ++i) {
151 reinterpret_cast<void*>(edges[i].to()),
152 static_cast<uint32_t>(reinterpret_cast<uintptr_t>(edges[i].to())),
848 CHECK(parsed_snapshot->Has(v8_str("edges")));
[all...] |
| /external/chromium_org/tools/gyp/pylib/gyp/generator/ |
| msvs.py | [all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| spannable_test.js | 302 // Note: we should keep zero-length spans, even at the edges of the range.
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 765 ;# Two pass filtering. First pass is Horizontal edges, second pass is vertical
766 ;# edges. One of the filters can be null, but both won't be. Needs to use a
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 765 ;# Two pass filtering. First pass is Horizontal edges, second pass is vertical
766 ;# edges. One of the filters can be null, but both won't be. Needs to use a
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 765 ;# Two pass filtering. First pass is Horizontal edges, second pass is vertical
766 ;# edges. One of the filters can be null, but both won't be. Needs to use a
|
| /external/chromium_org/remoting/webapp/ |
| client_session.js | [all...] |
