| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher_unittest.cc | 12 // Trivial test case verifying assertions on left edge.
18 MatchedEdge edge; local
21 initial_bounds.y() - distance - 10, 2, 3), &edge));
25 &edge));
26 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge);
27 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_LEADING, edge.secondary_edge);
32 &edge));
33 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge);
34 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_NONE, edge.secondary_edge);
37 // Trivial test case verifying assertions on bottom edge
43 MatchedEdge edge; local
72 MatchedEdge edge; local
101 MatchedEdge edge; local
124 MatchedEdge edge; local
149 MatchedEdge edge; local
[all...] |
| magnetism_matcher.h | 31 // MagnetismEdgeMatcher is used for matching a particular edge of a window. You
35 // edge. As ShouldAttach() is invoked the visible range is updated.
38 MagnetismEdgeMatcher(const gfx::Rect& bounds, MagnetismEdge edge);
41 MagnetismEdge edge() const { return edge_; } function in class:ash::internal::MagnetismEdgeMatcher
44 // Returns true if the edge is completely obscured. If true ShouldAttach()
58 static int GetPrimaryCoordinate(const gfx::Rect& bounds, MagnetismEdge edge) {
59 switch (edge) {
73 static MagnetismEdge FlipEdge(MagnetismEdge edge) {
74 switch (edge) {
121 // The edge this matcher checks
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| MoveHandler.java | 49 * different segment types -- the left edge, the right edge, the baseline, the center
210 Segment edge = new Segment(b.y, b.x, b.x2(), null, null, TOP, NO_MARGIN); local
211 List<Match> horizontalMatches = findClosest(edge, mHorizontalEdges);
212 edge = new Segment(b.y2(), b.x, b.x2(), null, null, BOTTOM, NO_MARGIN);
213 addClosest(edge, mHorizontalEdges, horizontalMatches);
215 edge = new Segment(b.x, b.y, b.y2(), null, null, LEFT, NO_MARGIN);
216 List<Match> verticalMatches = findClosest(edge, mVerticalEdges);
217 edge = new Segment(b.x2(), b.y, b.y2(), null, null, RIGHT, NO_MARGIN);
218 addClosest(edge, mVerticalEdges, verticalMatches)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
|
| /external/chromium_org/ui/views/win/ |
| appbar.cc | 20 void GetEdgesOnWorkerThread(HMONITOR monitor, int* edge) {
22 *edge = 0;
24 *edge = Appbar::EDGE_LEFT;
26 *edge = Appbar::EDGE_TOP;
28 *edge = Appbar::EDGE_RIGHT;
30 *edge = Appbar::EDGE_BOTTOM;
47 // in us thinking there is no auto-hide edges. By returning at least one edge
53 int* edge = new int; local
58 base::Unretained(edge)),
64 base::Owned(edge)),
[all...] |
| /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/mesa3d/src/gallium/auxiliary/util/ |
| u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
|
| /external/chromium_org/chrome/browser/ui/views/app_list/linux/ |
| app_list_linux.cc | 32 AppListPositioner::ScreenEdge edge) {
36 // Snap to the shelf edge. If the cursor is greater than the window
39 if (edge == AppListPositioner::SCREEN_EDGE_UNKNOWN) {
45 int snap_distance = edge == AppListPositioner::SCREEN_EDGE_BOTTOM ||
46 edge == AppListPositioner::SCREEN_EDGE_TOP
49 if (positioner.GetCursorDistanceFromShelf(edge, cursor) > snap_distance)
50 return positioner.GetAnchorPointForShelfCorner(edge);
52 return positioner.GetAnchorPointForShelfCursor(edge, cursor);
75 // Find which edge of the screen the shelf is attached to. For now, just
76 // assume Ubuntu Unity (fixed to left edge)
79 AppListPositioner::ScreenEdge edge = AppListPositioner::SCREEN_EDGE_LEFT; local
[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...] |
| LL1DFA.java | 39 * predicates to resolve edge set collisions.
43 * an LL(1) DFA. One edge per set.
87 IntervalSet edge = (IntervalSet)it.next(); local
88 List<Integer> alts = edgeMap.get(edge);
90 //System.out.println(edge+" -> "+alts);
93 Label e = getLabelForSet(edge);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 99 Transition edge = (Transition) s.transition(i); local
100 //System.out.println("edge "+s.stateNumber+"-"+edge.label.toString()+"->"+edge.target.stateNumber);
101 if ( edge.label.getAtom()==Label.EOT ) {
102 // don't generate a real edge for EOT; track alt EOT predicts
104 EOTTarget = (DFAState)edge.target;
108 edge.target.stateNumber+" predicates alt "+
116 List labels = edge.label.getSet().toList();
127 parentGenerator.genLabelExpr(templates,edge,k))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| DOTGenerator.java | 131 // make a DOT edge for each transition
133 Transition edge = (Transition) s.transition(i); local
136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions());
139 if ( edge.target instanceof DFAState &&
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES )
145 st = stlib.getInstanceOf("edge");
146 st.add("label", getEdgeLabel(edge));
148 st.add("target", getStateLabel(edge.target));
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin'
205 // make a DOT edge for each transitio
208 Transition edge = (Transition) s.transition(i); local
[all...] |
| /external/chromium_org/chrome/browser/ui/views/app_list/win/ |
| app_list_win.cc | 22 // edge of screen.
29 // one pixel of overlap where the edge of the taskbar is shown.
64 // Find which edge of the screen the taskbar is attached to.
65 AppListPositioner::ScreenEdge edge = positioner.GetShelfEdge(taskbar_rect); local
67 // Snap to the taskbar edge. If the cursor is greater than kSnapDistance away,
70 if (edge == AppListPositioner::SCREEN_EDGE_UNKNOWN) {
76 if (positioner.GetCursorDistanceFromShelf(edge, cursor) > kSnapDistance)
77 return positioner.GetAnchorPointForShelfCorner(edge);
79 return positioner.GetAnchorPointForShelfCursor(edge, cursor);
|
| /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/llvm/lib/Transforms/Instrumentation/ |
| OptimalEdgeProfiling.cpp | 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
11 // Edge profiling can give a reasonable approximation of the hot paths through a
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
49 return "Optimal Edge Profiler";
55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
56 "Insert optimal instrumentation for edge profiling",
60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
61 "Insert optimal instrumentation for edge profiling",
68 inline static void printEdgeCounter(ProfileInfo::Edge e
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local
[all...] |
| /external/opencv/cvaux/src/ |
| cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ) local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
| SDL_sysevents.cc | 195 BPoint edge; local
196 GetXYOffset(edge.x, edge.y);
197 edge.x += x;
198 edge.y += y;
199 ConvertToScreen(&edge);
200 set_mouse_position((int)edge.x, (int)edge.y);
|
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 266 // empty edge set. We then iterate over the edges of G in decreasing
309 // edge>. Sorting it using the reverse iterators gives us the edges
316 const pair<Vertex, Vertex>& edge = weighted_edges[i].second; local
317 const Vertex vertex1 = edge.first;
318 const Vertex vertex2 = edge.second;
321 // which case adding this edge will violate the degree 2
331 // vertex, and adding this edge will create a cycle.
339 // This edge can be added, add an edge in either direction with
|
| /external/chromium_org/content/browser/android/ |
| overscroll_glow.cc | 188 static_cast<EdgeEffect::Edge>(i));
234 const SkBitmap& edge = g_overscroll_resources.Get().edge_bitmap(); local
236 if (edge.isNull() || glow.isNull()) {
244 scoped_refptr<cc::Layer> edge_layer = CreateImageLayer(edge);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /external/bison/src/ |
| lalr.c | 162 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
182 edge[nedges++] = map_goto (stateno, sym);
190 memcpy (reads[i], edge, nedges * sizeof edge[0]);
202 free (edge);
221 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
263 edge[nedges++] = map_goto (states1[--length],
278 includes[i][j] = edge[j]
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
