| /external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
| position_util.js | 156 // align right edges
160 // align left edges
169 // align left edges
173 // align right edges
186 // align top edges
190 // align bottom edges
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| position_util.js | 156 // align right edges
160 // align left edges
169 // align left edges
173 // align right edges
186 // align top edges
190 // align bottom edges
|
| /external/chromium/chrome/browser/chromeos/ |
| low_battery_observer.cc | 48 // This is a simple state machine with two states and three edges:
50 // Edges: hide: is visible_ to !visible_ triggered if we transition
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkBlitter_Sprite.cpp | 61 and respect that by blending the edges of the bitmap against the device. To support
64 (which does respect soft edges).
|
| SkEdgeBuilder.h | 23 // returns the number of built edges. The array of those edge pointers
|
| /external/skia/src/core/ |
| SkBlitter_Sprite.cpp | 61 and respect that by blending the edges of the bitmap against the device. To support
64 (which does respect soft edges).
|
| /frameworks/base/test-runner/src/android/test/ |
| ViewAsserts.java | 128 * Assert that two views are right aligned, that is that their right edges
146 * Assert that two views are right aligned, that is that their right edges
165 * Assert that two views are left aligned, that is that their left edges
183 * Assert that two views are left aligned, that is that their left edges
202 * Assert that two views are bottom aligned, that is that their bottom edges
220 * Assert that two views are bottom aligned, that is that their bottom edges
239 * Assert that two views are top aligned, that is that their top edges
257 * Assert that two views are top aligned, that is that their top edges
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afcjk.c | 918 /* We begin by generating a sorted table of edges for the current */
927 /* Note that the edges table is sorted along the segment/edge */
949 AF_Edge edge = axis->edges + ee;
1049 AF_Edge edges = axis->edges; local
1050 AF_Edge edge_limit = edges + axis->num_edges;
1054 for ( edge = edges; edge < edge_limit; edge++ )
1678 AF_Edge edges = axis->edges; local
2022 AF_Edge edges = axis->edges; local
[all...] |
| /external/freetype/src/autofit/ |
| afcjk.c | 918 /* We begin by generating a sorted table of edges for the current */
927 /* Note that the edges table is sorted along the segment/edge */
949 AF_Edge edge = axis->edges + ee;
1049 AF_Edge edges = axis->edges; local
1050 AF_Edge edge_limit = edges + axis->num_edges;
1054 for ( edge = edges; edge < edge_limit; edge++ )
1678 AF_Edge edges = axis->edges; local
2022 AF_Edge edges = axis->edges; local
[all...] |
| /external/llvm/lib/Analysis/ |
| PathNumbering.cpp | 12 // edges to obtain a DAG, and thus the unique path numbers [Ball96].
14 // The purpose of this analysis is to enumerate the edges in a CFG in order
16 // [Ball96] edges can be enumerated such that given a path number by following
79 // Returns an iterator over predecessor edges. Includes phony and
90 // Returns the number of predecessor edges. Includes phony and
96 // Returns an iterator over successor edges. Includes phony and
107 // Returns the number of successor edges. Includes phony and
289 // Iterate through each successor edge, adding phony edges
304 // split on this edge and reference it's exit/root phony edges
363 // Processes one node and its imediate edges for building the DAG
[all...] |
| /external/opencv/cv/src/ |
| cvsubdivision2d.cpp | 88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
182 cvSetRemoveByPtr( (CvSet*)(subdiv->edges), quadedge );
533 cvClearSet( (CvSet *) (subdiv->edges) );
585 total = subdiv->edges->total;
586 elem_size = subdiv->edges->elem_size;
588 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 );
640 total = subdiv->edges->total;
641 elem_size = subdiv->edges->elem_size;
645 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 );
650 /* skip first three edges (bounding triangle) *
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| GuidelineHandler.java | 116 * is a constraint between two horizontal edges)
123 * is a constraint between two vertical edges)
134 * All horizontal segments in the relative layout - top and bottom edges, baseline
135 * edges, and top and bottom edges offset by the applicable margins in each direction
140 * All vertical segments in the relative layout - left and right edges, and left and
141 * right edges offset by the applicable margins in each direction
147 * they only match other center edges.
153 * since they only match other center edges.
316 /** Records the matchable outside edges for the given node to the potential match list *
[all...] |
| /device/google/accessory/demokit/hardware/fab/shield/ |
| README.txt | 34 on left and right edges. There is 1 6-pin header and 5 8-pin headers. These
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 33 " $edges$\n" +
|
| /external/chromium/chrome/browser/ui/views/ |
| dropdown_bar_view.h | 47 // the widget so that we can draw the curved edges that attach to the toolbar
|
| /external/chromium_org/ash/wm/ |
| frame_border_hit_test_controller.h | 28 // hovers over |frame|'s edges.
|
| resize_shadow.h | 40 // Shows resize effects for one or more edges based on a |hit_test| code, such
|
| /external/chromium_org/chrome/browser/ui/cocoa/autofill/ |
| autofill_dialog_constants.h | 21 // The space between the edges of a notification bar and the text within (in
|
| /external/chromium_org/third_party/mesa/src/src/gallium/docs/source/ |
| glossary.rst | 10 smooth the edges of polygons.
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpSpan.h | 23 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
|
| /external/jpeg/ |
| transupp.h | 55 * image edges are padded out to the next iMCU boundary with junk data; but
56 * no padding is possible at the top and left edges. If we were to flip
65 * right and bottom edges completely cleanly. flip_h can flip partial iMCUs
76 * followed by -rot 180 -trim trims both edges.)
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileDataLoader.h | 12 // data to control flow edges.
32 // Helper for dumping edges to dbgs().
37 /// profiling data to control flow edges.
130 /// numbers with no mappings to edges.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 11 // given set of weighted edges. The type parameter T is the type of a node.
39 // A comparing class for comparing weighted edges.
68 /// MaximumSpanningTree() - Takes a vector of weighted edges and returns a
86 // Iterate over the sorted edges, biggest first.
|
| /external/mesa3d/src/gallium/docs/source/ |
| glossary.rst | 10 smooth the edges of polygons.
|
| /external/opencv/cvaux/src/ |
| extendededges.cpp | 123 //iplSet(image, 0 ); // this can cause double edges if two contours have common edge
127 //approx contour by single edges
153 //second pass - create separate edges
224 //approx contour by single edges
|
