HomeSort by relevance Sort by last modified time
    Searched defs:edge (Results 1 - 25 of 85) sorted by null

1 2 3 4

  /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...]
  /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/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/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/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/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/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/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 31 gfx::Transform ComputeTransform(OverscrollGlow::Edge edge,
34 // Transforms assume the edge layers are anchored to their *top center point*.
35 switch (edge) {
56 NOTREACHED() << "Invalid edge: " << edge;
61 gfx::SizeF ComputeSize(OverscrollGlow::Edge edge,
63 switch (edge) {
71 NOTREACHED() << "Invalid edge: " << edge
157 Edge edge = static_cast<Edge>(i); local
    [all...]
  /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...]
  /bionic/libc/kernel/uapi/linux/
pps.h 77 int edge; member in struct:pps_bind_args
  /development/ndk/platforms/android-L/include/linux/
pps.h 77 int edge; member in struct:pps_bind_args
  /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/athena/activity/
activity_frame_view.cc 148 int edge = (top_height - kIconSize) / 2; local
149 icon_->SetBounds(edge, edge, kIconSize, kIconSize);
  /external/chromium_org/third_party/icu/source/common/
stringtriebuilder.cpp 496 Node *edge=equal[--i]; local
497 if(edge!=NULL) {
498 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step);
500 // For all but the rightmost edge, decrement the edge number.
  /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/chromium_org/third_party/skia/experimental/Intersection/
EdgeWalkerRectangles_Test.cpp 225 static void assertOneContour(const SkPath& out, bool edge, bool extend) {
248 SkASSERT(count == (extend ? 4 : edge ? 6 : 8));
266 bool edge = start[startIndex] == rect2.fLeft || stop[stopIndex] == rect2.fRight; local
272 assertOneContour(out, edge, extend);
279 assertOneContour(out, edge, extend);
286 assertOneContour(out, edge, extend);
293 assertOneContour(out, edge, extend);
  /external/chromium_org/tools/clang/blink_gc_plugin/
RecordInfo.h 15 #include "Edge.h"
52 FieldPoint(clang::FieldDecl* field, Edge* edge)
53 : field_(field), edge_(edge) {}
55 return edge_->NeedsTracing(Edge::kRecursive);
58 Edge* edge() { return edge_; } function in class:FieldPoint
62 Edge* edge_;
99 TracingStatus NeedsTracing(Edge::NeedsTracingOption);
111 Edge* CreateEdge(const clang::Type* type)
    [all...]
  /external/icu/icu4c/source/common/
stringtriebuilder.cpp 496 Node *edge=equal[--i]; local
497 if(edge!=NULL) {
498 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step);
500 // For all but the rightmost edge, decrement the edge number.
  /external/kernel-headers/original/uapi/linux/
pps.h 119 int edge; /* selected event type */ member in struct:pps_bind_args

Completed in 5708 milliseconds

1 2 3 4