/external/chromium_org/ash/wm/workspace/ |
magnetism_matcher_unittest.cc | 11 // Trivial test case verifying assertions on left edge. 17 MatchedEdge edge; local 20 initial_bounds.y() - distance - 10, 2, 3), &edge)); 24 &edge)); 25 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge); 26 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_LEADING, edge.secondary_edge); 31 &edge)); 32 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge); 33 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_NONE, edge.secondary_edge); 36 // Trivial test case verifying assertions on bottom edge 42 MatchedEdge edge; local 71 MatchedEdge edge; local 100 MatchedEdge edge; local 123 MatchedEdge edge; local 148 MatchedEdge edge; local [all...] |
magnetism_matcher.h | 30 // MagnetismEdgeMatcher is used for matching a particular edge of a window. You 34 // edge. As ShouldAttach() is invoked the visible range is updated. 37 MagnetismEdgeMatcher(const gfx::Rect& bounds, MagnetismEdge edge); 40 MagnetismEdge edge() const { return edge_; } function in class:ash::MagnetismEdgeMatcher 43 // Returns true if the edge is completely obscured. If true ShouldAttach() 57 static int GetPrimaryCoordinate(const gfx::Rect& bounds, MagnetismEdge edge) { 58 switch (edge) { 72 static MagnetismEdge FlipEdge(MagnetismEdge edge) { 73 switch (edge) { 120 // The edge this matcher checks [all...] |
magnetism_matcher.cc | 19 // primary edge of |primary|. |edges| is a bitmask of the allowed 54 MagnetismEdge edge) 56 edge_(edge) { 72 // Close enough, but only attach if some portion of the edge is visible. 141 MatchedEdge* edge) { 144 edge->primary_edge = matchers_[i]->edge(); 145 AttachToSecondaryEdge(bounds, edge->primary_edge, 146 &(edge->secondary_edge)); 163 MagnetismEdge edge, [all...] |
/dalvik/dx/tests/086-ssa-edge-split/ |
run | 18 dx --dump --width=1000 --ssa-blocks --ssa-step=edge-split Blort.class
|
/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...] |
/external/chromium_org/tools/telemetry/telemetry/core/heap/ |
live_heap_object.py | 37 def AddEdgeTo(self, edge): 38 """Associates an Edge with the LiveHeapObject (the end point). 41 edge: Edge, an edge whose end point this LiveHeapObject is. 43 self.edges_to.append(edge) 45 def AddEdgeFrom(self, edge): 46 """Associates an Edge with the LiveHeapObject (the start point). 49 edge: Edge, an edge whose start point this LiveHeapObject is [all...] |
/external/chromium_org/chrome/browser/ui/views/app_list/linux/ |
app_list_linux.cc | 17 // desktop environments). The shelf can usually be found on the edge where the 18 // display edge and work area do not match up, but there can be more than one 19 // such edge. The shelf is assumed to be on the side of the screen with the 20 // largest delta between the display edge and the work area edge. Ties are 56 AppListPositioner::ScreenEdge edge, 65 // Snap to the shelf edge. If the cursor is greater than the window 68 if (edge == AppListPositioner::SCREEN_EDGE_UNKNOWN) { 74 int snap_distance = edge == AppListPositioner::SCREEN_EDGE_BOTTOM || 75 edge == AppListPositioner::SCREEN_EDGE_TO 93 AppListPositioner::ScreenEdge edge; local [all...] |
/external/chromium_org/third_party/freetype/src/autofit/ |
aflatin.c | 858 /* we are already on an edge, try to locate its start */ 892 /* we are just leaving an edge; record a new segment! */ 1189 AF_Edge edge = axis->edges + ee; local 1206 AF_Edge edge; local 1262 AF_Edge edge; local 1425 AF_Edge edge = axis->edges; local 1872 AF_Edge edge; local [all...] |
aflatin2.c | 765 /* already on an edge ?, backtrack to find its start */ 1113 /* to find an edge in our table that corresponds to its position. */ 1115 /* If no edge is found, we create and insert a new edge in the * 1164 AF_Edge edge = axis->edges + ee; local 1181 AF_Edge edge; local 1235 AF_Edge edge; local 1393 AF_Edge edge = axis->edges; local 1843 AF_Edge edge; local [all...] |
afcjk.c | 920 /* an edge in our table that corresponds to its position. */ 922 /* If no edge is found, we create and insert a new edge in the */ 923 /* sorted table. Otherwise, we simply add the segment to the edge's */ 925 /* edge's properties. */ 927 /* Note that the edges table is sorted along the segment/edge */ 946 /* look for an edge corresponding to the segment */ 949 AF_Edge edge = axis->edges + ee; local 953 if ( edge->dir != seg->dir ) 956 dist = seg->pos - edge->fpos 998 AF_Edge edge; local 1051 AF_Edge edge; local 1180 AF_Edge edge = axis->edges; local 1681 AF_Edge edge; local 2024 AF_Edge edge; local [all...] |
/external/chromium_org/third_party/skia/src/core/ |
SkScan_Path.cpp | 28 static void validate_sort(const SkEdge* edge) { 31 while (edge->fFirstY != SK_MaxS32) { 32 edge->validate(); 33 SkASSERT(y <= edge->fFirstY); 35 y = edge->fFirstY; 36 edge = edge->fNext; 40 #define validate_sort(edge) 43 static inline void remove_edge(SkEdge* edge) { 44 edge->fPrev->fNext = edge->fNext 470 SkEdge* edge = sort_edges(list, count, &last); local 678 SkEdge* edge = sort_edges(list, count, &last); local [all...] |
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/freetype/src/autofit/ |
aflatin2.c | 766 /* already on an edge ?, backtrack to find its start */ 1114 /* to find an edge in our table that corresponds to its position. */ 1116 /* If no edge is found, we create and insert a new edge in the * 1165 AF_Edge edge = axis->edges + ee; local 1182 AF_Edge edge; local 1236 AF_Edge edge; local 1394 AF_Edge edge = axis->edges; local 1844 AF_Edge edge; local [all...] |
aflatin.c | 1598 AF_Edge edge = axis->edges + ee; local 1615 AF_Edge edge; local 1671 AF_Edge edge; local 1836 AF_Edge edge = axis->edges; local 2295 AF_Edge edge; local [all...] |
afcjk.c | 937 /* an edge in our table that corresponds to its position. */ 939 /* If no edge is found, we create and insert a new edge in the */ 940 /* sorted table. Otherwise, we simply add the segment to the edge's */ 942 /* edge's properties. */ 944 /* Note that the edges table is sorted along the segment/edge */ 963 /* look for an edge corresponding to the segment */ 966 AF_Edge edge = axis->edges + ee; local 970 if ( edge->dir != seg->dir ) 973 dist = seg->pos - edge->fpos 1015 AF_Edge edge; local 1069 AF_Edge edge; local 1202 AF_Edge edge = axis->edges; local 1718 AF_Edge edge; local 2096 AF_Edge edge; 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/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. 62 // Find which edge of the screen the taskbar is attached to. 63 AppListPositioner::ScreenEdge edge = positioner.GetShelfEdge(taskbar_rect); 65 // Snap to the taskbar edge. If the cursor is greater than kSnapDistance away, 68 if (edge == AppListPositioner::SCREEN_EDGE_UNKNOWN) { 74 if (positioner.GetCursorDistanceFromShelf(edge, cursor) > kSnapDistance) 75 return positioner.GetAnchorPointForShelfCorner(edge); 77 return positioner.GetAnchorPointForShelfCursor(edge, cursor);
|
/external/chromium_org/v8/src/compiler/ |
node-properties.h | 28 static inline bool IsValueEdge(Node::Edge edge); 29 static inline bool IsContextEdge(Node::Edge edge); 30 static inline bool IsEffectEdge(Node::Edge edge); 31 static inline bool IsControlEdge(Node::Edge edge); 57 static inline bool IsInputRange(Node::Edge edge, int first, int count) [all...] |
node-properties-inl.h | 109 // Edge kinds. 111 inline bool NodeProperties::IsInputRange(Node::Edge edge, int first, int num) { 112 // TODO(titzer): edge.index() is linear time; 115 int index = edge.index(); 119 inline bool NodeProperties::IsValueEdge(Node::Edge edge) { 120 Node* node = edge.from(); 121 return IsInputRange(edge, FirstValueIndex(node), 125 inline bool NodeProperties::IsContextEdge(Node::Edge edge) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderFrameSet.h | 45 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; } 46 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; } 48 void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize; } 49 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; }
|
/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...] |
/external/mesa3d/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...] |
/external/opencv/cv/src/ |
cvsubdivision2d.cpp | 72 * Quad Edge algebra * 78 CvQuadEdge2D *edge = 0; local 88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges ); 91 memset( edge->pt, 0, sizeof( edge->pt )); 92 edgehandle = (CvSubdiv2DEdge) edge; 94 edge->next[0] = edgehandle; 95 edge->next[1] = edgehandle + 3; 96 edge->next[2] = edgehandle + 2; 97 edge->next[3] = edgehandle + 1 254 CvSubdiv2DEdge edge = 0; local 734 CvSubdiv2DEdge edge; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
PolygonShape.cpp | 38 static inline FloatSize inwardEdgeNormal(const FloatPolygonEdge& edge) 40 FloatSize edgeDelta = edge.vertex2() - edge.vertex1(); 49 static inline FloatSize outwardEdgeNormal(const FloatPolygonEdge& edge) 51 return -inwardEdgeNormal(edge); 78 // Clip the edge line segment to the vertical range y1,y2 and then return 137 const FloatPolygonEdge& edge = *(overlappingEdges[i]); local 138 if (edge.maxY() == edge.minY()) 141 excludedInterval.unite(OffsetPolygonEdge(edge, FloatSize()).clippedEdgeXRange(y1, y2)) [all...] |
/external/freetype/src/cff/ |
cf2hints.c | 60 size_t j; /* index of upper hint map edge */ 142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints 184 /* Now that ghost hints have been detected, adjust this edge for */ 323 csCoord >= hintmap->edge[i + 1].csCoord ) 327 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) 332 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) 334 /* special case for points below first edge: use uniform scale */ 335 return FT_MulFix( csCoord - hintmap->edge[0].csCoord, 337 hintmap->edge[0].dsCoord; 343 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor 901 CF2_HintRec edge, invalid; local [all...] |