| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 130 * and <em>bottom</em> edges. To be more precise, GridLayout treats each of its layout
199 * is made between the edges of each component's raw
219 * to their margins, before the edges of the resulting rectangle are aligned.
[all...] |
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| GridLayout.java | 128 * and <em>bottom</em> edges. To be more precise, GridLayout treats each of its layout
187 * is made between the edges of each component's raw
207 * to their margins, before the edges of the resulting rectangle are aligned.
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| C.stg | [all...] |
| /build/tools/releasetools/ |
| blockimgdiff.py | 837 # At this point our digraph is acyclic; we reversed any edges that
876 print("Removing backward edges...")
912 print("Reversing backward edges...")
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFA.java | 62 /** How many edges can each DFA state have before a "special" state
189 * set of edges emanating from a state, we number it so we can reuse
630 // can't do a switch if the edges have preds or are going to
803 * for gated edges, which occur for nonambig input sequences).
[all...] |
| /external/opencv/cxcore/include/ |
| cxtypes.h | [all...] |
| /external/opencv3/modules/core/include/opencv2/core/ |
| types_c.h | [all...] |
| /external/opencv3/modules/imgproc/src/ |
| hough.cpp | 1009 cv::Ptr<CvMat> edges, accum, dist_buf; local
[all...] |
| rotcalipers.cpp | 179 /* all of edges will be checked while rotating calipers by 90 degrees */
195 /* number of calipers edges, that has minimal angle with edge */
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 211 // back edges. This works for normal cases but not for unreachable blocks as
229 // edges which simplifies the CFG.
348 /// edges across a loop header. For example, threading a jump from outside the
357 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
358 FindFunctionBackedges(F, Edges);
360 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
361 LoopHeaders.insert(const_cast<BasicBlock*>(Edges[i].second));
[all...] |
| CorrelatedValuePropagation.cpp | 262 // If this was the first edge to be visited, record that all other edges
269 // If this case is known to fire for some edges and known not to fire for
|
| /external/v8/src/profiler/ |
| heap-snapshot-generator.cc | 67 snapshot_->edges().Add(edge);
76 snapshot_->edges().Add(edge);
275 children().Allocate(edges().length());
281 DCHECK(edges().length() == children_index);
282 for (int i = 0; i < edges().length(); ++i) {
283 HeapGraphEdge* edge = &edges()[i];
2846 List<HeapGraphEdge*>& edges = snapshot_->children(); local
[all...] |
| /art/test/559-checker-irreducible-loop/smali/ |
| IrreducibleLoop.smali | 19 # Back-edges in the ascii-art graphs are represented with dash '-'.
452 # ensure the order at which we find the back edges does not matter.
|
| /development/samples/devbytes/graphics/FoldingLayout/src/com/example/android/foldinglayout/ |
| FoldingLayout.java | 46 * the fold takes place. It is important to note that there are jagged edges about
50 * out the edges.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| DirectSearchOptimizer.java | 128 * vertex moving only along the box edges. The first vertex of the box will
135 * @param steps steps along the canonical axes representing box edges,
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 163 // Process predecessors, handling back edges last
208 // Process successors, handling back edges first.
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 316 // Record the number of incoming edges for each module. When we
317 // encounter a module with no incoming edges, push it into the queue
|
| /external/libavc/encoder/ |
| ih264e_process.c | [all...] |
| /external/libpcap/ |
| optimize.c | 121 struct edge **edges; variable in typeref:struct:edge
1363 target = fold_edge(ep->succ, edges[k]);
[all...] |
| /external/llvm/lib/Analysis/ |
| CallGraph.cpp | 136 // functions (ie, there are no edges in it's CGN). The easiest way to do this
217 // removeAnyCallEdgeTo - This method removes any call edges from this node to
|
| /external/llvm/test/Transforms/Inline/ |
| inline_invoke.ll | 252 ;; Test 3 - Deal correctly with split unwind edges.
286 ;; Test 4 - Split unwind edges with a dominance problem
|
| /external/opencv/cv/src/ |
| cvrotcalipers.cpp | 181 /* all of edges will be checked while rotating calipers by 90 degrees */
197 /* number of calipers edges, that has minimal angle with edge */
|
| /external/opencv3/doc/py_tutorials/py_calib3d/py_calibration/ |
| py_calibration.markdown | 18 the center of image. For example, one image is shown below, where two edges of a chess board are
200 You can see in the result that all the edges are straight.
|
| /external/skia/include/gpu/ |
| GrTypes.h | 416 * Some textures will be stored such that the upper and left edges of the content meet at the
417 * the origin (in texture coord space) and for other textures the lower and left edges meet at
|
| /external/v8/src/compiler/ |
| node.h | 387 // A forward iterator to visit the edges for the input dependencies of a node.
476 // A forward iterator to visit the uses edges of a node.
|
