| /frameworks/support/v7/gridlayout/res/values/ |
| attrs.xml | 43 causes alignment to take place between the edges of the view.
167 Additional option that can be set to have the top and/or bottom edges of
170 edge, a bottom gravity will clip the top edge, and neither will clip both edges.
174 Additional option that can be set to have the left and/or right edges of
177 edge, a right gravity will clip the left edge, and neither will clip both edges.
|
| /sdk/testapps/gridlayoutTest/v7-gridlayout/res/values/ |
| attrs.xml | 43 causes alignment to take place between the edges of the view.
178 Additional option that can be set to have the top and/or bottom edges of
181 edge, a bottom gravity will clip the top edge, and neither will clip both edges.
185 Additional option that can be set to have the left and/or right edges of
188 edge, a right gravity will clip the left edge, and neither will clip both edges.
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 152 // forest. The set of edges in this forest are the cluster pairs.
161 // edges are the number of 3D points/e_blocks visible in both the
225 // pairs/edges, including self edges, the check can be reduced to
352 // all the cells in the preconditioner corresponding to the edges in
363 // belong to the edges of the degree-2 forest. In the CLUSTER_JACOBI
379 // to edges in the degree-2 forest are off diagonal entries of this
469 // Convert a graph into a list of edges that includes self edges for
478 // Add all the cluster pairs corresponding to the edges in th
[all...] |
| graph_algorithms.h | 81 // vertices that have no edges connecting them. The maximum
266 // empty edge set. We then iterate over the edges of G in decreasing
275 // Array of edges sorted in decreasing order of their weights.
283 // Sort of the edges in the graph in decreasing order of their
309 // edge>. Sorting it using the reverse iterators gives us the edges
310 // in decreasing order of edges.
313 // Greedily add edges to the spanning tree/forest as long as they do
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 109 * states and edges attributes.
150 dot.add("edges", st);
157 * states and edges attributes. We know this is an NFA
158 * for a rule so don't traverse edges to other rules and
222 dot.add("edges", edgeST);
239 dot.add("edges", edgeST);
295 // look for gated predicates; don't add gated to simple sempred edges
|
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 288 // We also verify that at least some of the edges changed because of
291 std::string edges[2]; local
317 edges[i].append(reinterpret_cast<char *>(&bb), sizeof(bb));
352 SANDBOX_ASSERT(edges[0] != edges[1]);
354 SANDBOX_ASSERT(edges[0] == edges[1]);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRegion_path.cpp | 437 edge++; // skip over "used" edges
490 SkTDArray<Edge> edges;
493 Edge* edge = edges.append(2);
497 qsort(edges.begin(), edges.count(), sizeof(Edge), SkCastForQSort(EdgeProc));
499 int count = edges.count();
500 Edge* start = edges.begin();
|
| /external/icu4c/common/unicode/ |
| stringtriebuilder.h | 197 * Traverses the Node graph and numbers branch edges, with rightmost edges first.
201 * Most branch edges "jump" to other nodes but the rightmost branch edges
207 * This function visits and marks right branch edges first.
208 * Edges are numbered with increasingly negative values because we share the
210 * A branch edge also remembers the first number for any of its edges.
|
| /external/skia/src/core/ |
| SkRegion_path.cpp | 437 edge++; // skip over "used" edges
490 SkTDArray<Edge> edges;
493 Edge* edge = edges.append(2);
497 qsort(edges.begin(), edges.count(), sizeof(Edge), SkCastForQSort(EdgeProc));
499 int count = edges.count();
500 Edge* start = edges.begin();
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/chromium_org/ash/wm/workspace/ |
| workspace_window_resizer.cc | 149 // the edges |edges|. |edges| is a bitmask of the MagnetismEdges.
726 const uint32 edges = WindowComponentToMagneticEdge(details_.window_component); local
727 if (UpdateMagnetismWindow(*bounds, edges)) {
738 uint32 edges) {
742 MagnetismMatcher matcher(bounds_in_screen, edges);
745 // around when close to multiple edges.
872 const uint32 edges = WindowComponentToMagneticEdge(details_.window_component); local
877 if (edges & MAGNETISM_EDGE_TOP &
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ActionScript.stg | 818 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
820 <edges; separator="\nelse ">
837 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
839 <edges; separator="\nelse ">
848 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
850 <edges; separator="\nelse "><\n>
852 <if(!edges)>
853 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
880 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
882 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Java.stg | 892 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
894 <edges; separator="\nelse ">
913 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
915 <edges; separator="\nelse ">
924 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
926 <edges; separator="\nelse "><\n>
928 <if(!edges)>
929 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
956 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
958 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| JavaScript.stg | 827 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
829 <edges; separator="\nelse ">
848 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
850 <edges; separator="\nelse ">
859 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
861 <edges; separator="\nelse "><\n>
863 <if(!edges)>
864 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
891 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
893 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| Perl5.stg | 851 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
853 <edges; separator="\nels">
877 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
879 <edges; separator="\nels">
888 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
890 <edges; separator="\nels"><\n>
892 <if(!edges)>
893 $alt<decisionNumber> = <eotPredictsAlt>; <! if no edges, don't gen ELSE !>
920 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
922 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| Python.stg | 977 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
979 <edges; separator="\nel">
996 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
998 <edges; separator="\nel">
1007 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
1009 <edges; separator="\nel"><\n>
1011 <if(!edges)>
1012 alt<decisionNumber> = <eotPredictsAlt> <! if no edges, don't gen ELSE !>
1038 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
1046 <edges; separator="\nel"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| Scala.stg | 886 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
888 <edges; separator="\nelse ">
906 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
908 <edges; separator="\nelse ">
917 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
919 <edges; separator="\nelse "><\n>
921 <if(!edges)>
922 alt<decisionNumber>=<eotPredictsAlt> <! if no edges, don't gen ELSE !>
949 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
951 <edges; separator="\n"
[all...] |
| /external/chromium_org/third_party/freetype/src/cff/ |
| cf2blues.c | 148 * Construct hint edges suitable for synthetic ghost hints at top
211 /* adjust both edges of top zone upward by twice darkening amount */
340 /* adjust edges of top zone upward by twice darkening amount */
449 * Zero, one or both edges may be valid; only valid edges can be
560 /* move both edges and flag them `locked' */
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
37 * During the "simplify" process, any any node with fewer edges than
40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
63 * basic graph coloring test of "fewer edges from this node than there
512 * "count number of edges" approach of traditional graph coloring,
|
| /external/freetype/src/cff/ |
| cf2blues.c | 148 * Construct hint edges suitable for synthetic ghost hints at top
211 /* adjust both edges of top zone upward by twice darkening amount */
340 /* adjust edges of top zone upward by twice darkening amount */
449 * Zero, one or both edges may be valid; only valid edges can be
560 /* move both edges and flag them `locked' */
|
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
37 * During the "simplify" process, any any node with fewer edges than
40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
63 * basic graph coloring test of "fewer edges from this node than there
512 * "count number of edges" approach of traditional graph coloring,
|
| /external/valgrind/main/auxprogs/ |
| DotToScc.hs | 34 = do edges <- read_dot_file dot_file_name
35 let sccs = gen_sccs edges
52 -- Read a .dot file and return a list of edges
57 let edges = [(s,d) | Just (s,d) <- map maybe_mk_edge linez]
58 return edges
69 -- Take the list of edges and return a topologically sorted list of
|
| /external/opencv/cxcore/src/ |
| cxdrawing.cpp | 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges,
66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color );
943 CvContour* edges;
948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st ));
954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT ));
955 CV_CALL( icvFillEdgeCollection( img, edges, color ));
999 int edges = npts;
2423 CvContour* edges = 0; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 63 // the default templates for generating a state and its edges
150 dfaST.add("edges", edgeST);
184 dfaST.add("edges", edgeST);
|
| /external/clang/lib/Analysis/ |
| CallGraph.cpp | 25 STATISTIC(NumObjCCallEdges, "Number of Objective-C method call edges");
26 STATISTIC(NumBlockCallEdges, "Number of block call edges");
67 // Adds may-call edges for the ObjC message sends.
|
