| /packages/apps/Launcher3/res/values-sw600dp/ |
| config.xml | 12 workspace screens run nearly flush to the edge of the screen-->
|
| /frameworks/support/v4/java/android/support/v4/widget/ |
| AutoScrollHelper.java | 32 * AutoScrollHelper is a utility class for adding automatic edge-triggered
46 * As the user touches closer to the extreme edge of the activation area,
47 * scrolling accelerates up to a maximum velocity. When using the default edge
109 * Edge type that specifies an activation area starting at the view bounds
117 * Edge type that specifies an activation area starting at the view bounds
126 * Edge type that specifies an activation area starting at the view bounds
148 /** Edge insets used to activate auto-scrolling. */
151 /** Clamping values for edge insets used to activate auto-scrolling. */
154 /** The type of edge being used. */
157 /** Delay after entering an activation edge before auto-scrolling begins. *
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 98 * It can yield states that have only a single edge on EOT to an accept
105 * for keyword versus ID as the state with EOT edge emanating from it will
106 * also have another edge.
192 Transition edge = (Transition) d.transition(i); local
193 DFAState edgeTarget = ((DFAState)edge.target);
196 edge.label.toString(d.dfa.nfa.grammar)+"->"+
221 Transition edge = (Transition) d.transition(i); local
222 DFAState edgeTarget = ((DFAState)edge.target);
225 edge.label.toString(d.dfa.nfa.grammar)+"->"+
228 // if only one edge coming out, it is EOT, and target is accept prun
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicBase.h | 29 /// change to the cost matrix on the given edge (by R2).
31 /// costs on the given edge.
33 /// edge into the PBQP graph (by R2).
35 /// disconnection of the given edge from the given node.
49 /// node/edge in the PBQP graph.
201 /// \brief Prepare a change in the costs on the given edge.
202 /// @param eItr Edge iterator.
207 /// \brief Handle the change in the costs on the given edge.
208 /// @param eItr Edge iterator.
213 /// \brief Handle the addition of a new edge into the PBQP graph
[all...] |
| /external/llvm/lib/Analysis/ |
| ProfileDataLoaderPass.cpp | 65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge,
92 /// readEdge - Take the value from a profile counter and assign it to an edge.
94 ProfileData &PB, ProfileData::Edge e,
102 DEBUG(dbgs() << "-- Read Edge Counter for " << e
107 /// matchEdges - Link every profile counter with an edge.
131 /// edge into branch weights for each conditional branch (a branch with 2 or
152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); local
153 Weights[s] = (uint32_t)PB.getEdgeWeight(edge);
154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight
[all...] |
| /external/chromium_org/ash/wm/dock/ |
| docked_window_resizer_unittest.cc | 160 // horizontally to the edge with an added offset from the edge of |dx|.
161 void DragRelativeToEdge(DockedEdge edge,
165 edge,
171 void DragToVerticalPositionAndToEdge(DockedEdge edge,
174 DragToVerticalPositionRelativeToEdge(edge, window, 0, y);
177 void DragToVerticalPositionRelativeToEdge(DockedEdge edge,
182 DragVerticallyAndRelativeToEdge(edge, window, dx, y - initial_bounds.y());
186 // horizontally to the edge with an added offset from the edge of |dx|
[all...] |
| /external/chromium/chrome/browser/ui/cocoa/ |
| image_utils.mm | 23 // The lower edge of the image is as far from the origin as the
24 // upper edge was, plus it's on the other side of the origin.
|
| /external/chromium_org/ash/ |
| ash_constants.h | 22 // 16 px at the end of each edge triggers diagonal resizing.
26 // extends to the edge of the window. We consider a small region outside the
|
| /external/chromium_org/ash/display/ |
| shared_display_edge_indicator.h | 31 // the edge that a window can be dragged into another display.
47 // Used to show the displays' shared edge where a window can be moved across.
|
| /external/chromium_org/ash/wm/ |
| resize_shadow.h | 29 // A class to render the resize edge effect when the user moves their mouse
30 // over a sizing edge. This is just a visual effect; the actual resize is
|
| /external/chromium_org/ui/views/widget/ |
| monitor_win.cc | 27 HWND GetTopmostAutoHideTaskbarForEdge(UINT edge, HMONITOR monitor) {
29 APPBARDATA taskbar_data = { sizeof(APPBARDATA), NULL, 0, edge };
|
| /external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/ |
| CartoonEdge.frag | 47 // Does this pixel lie on an edge?
50 // Apply the edge detection result to the main scene color.
|
| CartoonEdge15.frag | 49 // Does this pixel lie on an edge?
52 // Apply the edge detection result to the main scene color.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge;
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
50 // Equal edge weights: break ties by comparing block sizes.
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
93 // So we know now that the edge is not already in a subtree, so we push
94 // the edge to the MST.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| scev-invalid.ll | 3 ; PR15570: SEGV: SCEV back-edge info invalid after dead code removal.
5 ; Indvars creates a SCEV expression for the loop's back edge taken
|
| /external/llvm/utils/ |
| DSAextract.py | 4 #the associated edges. An edge is kept iff for edge x -> y
7 #known issues: if a line contains '->' and is not an edge line
53 #used to check to see if the current line is an edge line
61 #filter out the unnecessary checks on all the edge lines
89 #1) node lines, 2) edge lines 3) support lines (like page size, etc)
91 #is this an edge line?
92 #note that this is no completely robust, if a none edge line
|
| /frameworks/base/core/tests/coretests/src/android/widget/focus/ |
| ScrollingThroughListOfFocusablesTest.java | 53 // Make sure we have some fading edge regardless of ListView style.
98 assertTrue("bottom of view should be just above fading edge",
102 // make sure fading edge is the expected view
104 assertEquals("should be a second view visible due to the fading edge",
147 "the bottom of the list view (no fading edge)",
186 // now we are at top row, should have caused scrolling, and fading edge...
194 assertEquals("top of selected row should be just below top vertical fading edge",
199 // make sure fading edge is the view we expect
|
| /packages/inputmethods/LatinIME/java/res/drawable/ |
| keyboard_key_feedback_ics.xml | 21 <!-- Left edge -->
27 <!-- Right edge -->
|
| /external/llvm/test/Analysis/Profiling/ |
| profiling-tool-chain.ll | 6 ; Test the edge optimal profiling instrumentation.
7 ; RUN: opt %t1 -insert-optimal-edge-profiling -o %t2
103 ; PROF: ;;; Out-edge counts: [2.000000e+00 -> bb10]
111 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb1] [3.000000e+00 -> bb8]
118 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb6]
127 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb3]
134 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb5]
150 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb6]
159 ; PROF: ;;; Out-edge counts: [9.000000e+00 -> bb2] [3.000000e+00 -> bb7]
165 ; PROF: ;;; Out-edge counts: [3.000000e+00 -> bb9
[all...] |
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkClampRange.cpp | 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge
16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) {
20 if (x0 >= edge) {
23 if (x1 <= edge) {
26 int64_t n = (edge - x0 + dx - 1) / dx;
|
| /external/chromium_org/ui/views/window/ |
| custom_frame_view.h | 63 // This does not include any client edge.
67 // borders, including both the window frame and any client edge.
71 // frame, any title area, and any connected client edge.
77 // Returns the thickness of the nonclient portion of the 3D edge along the
89 // Returns true if the client edge should be drawn. This is true if
|
| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 20 struct edge { struct
27 struct edge *A = (struct edge *)a, *B = (struct edge *)b;
66 struct edge *edges;
|
| /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
| Briggs.h | 34 /// corresponding node. Edge cost matrices are likewise assumed to represent
181 /// \brief Prepare a change in the costs on the given edge.
182 /// @param eItr Edge iterator.
199 /// \brief Handle the change in the costs on the given edge.
200 /// @param eItr Edge iterator.
202 // This is effectively the same as adding a new edge now, since
207 /// \brief Handle the addition of a new edge into the PBQP graph.
208 /// @param eItr Edge iterator for the added edge.
210 /// Updates allocability of any nodes connected by this edge which ar
[all...] |
| /external/skia/src/effects/gradients/ |
| SkClampRange.cpp | 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge
16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) {
20 if (x0 >= edge) {
23 if (x1 <= edge) {
26 int64_t n = (edge - x0 + dx - 1) / dx;
|
| /external/chromium_org/cc/output/ |
| shader.cc | 356 "edge",
380 uniform TexCoordPrecision vec3 edge[8]; local
381 varying TexCoordPrecision vec4 edge_dist[2]; // 8 edge distances.
388 edge_dist[0] = vec4(dot(edge[0], screen_pos),
389 dot(edge[1], screen_pos),
390 dot(edge[2], screen_pos),
391 dot(edge[3], screen_pos)) * gl_Position.w;
392 edge_dist[1] = vec4(dot(edge[4], screen_pos),
393 dot(edge[5], screen_pos),
394 dot(edge[6], screen_pos)
441 uniform TexCoordPrecision vec3 edge[8]; local
549 uniform TexCoordPrecision vec3 edge[8]; local
[all...] |
