Searched defs:edges (Results 1 - 25 of 53) sorted by relevance

123

/external/chromium_org/third_party/WebKit/Source/core/paint/
H A DBoxDecorationData.cpp59 BorderEdge edges[4]; local
60 style.getBorderEdgeInfo(edges);
63 const BorderEdge& currEdge = edges[i];
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
/external/chromium_org/components/url_matcher/
H A Dsubstring_set_matcher.h71 // The Aho Corasick algorithm improves this runtime by using failure edges.
97 const Edges& edges() const { return edges_; } function in class:url_matcher::SubstringSetMatcher::AhoCorasickNode
107 // Outgoing edges of current node.
/external/chromium_org/third_party/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h30 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
31 * The edges should form a convex polygon. The positive half-plane is considered to be the
35 * Currently the edges are specified in device space. In the future we may prefer to specify
41 const SkScalar edges[]) {
45 return SkNEW_ARGS(GrConvexPolyEffect, (edgeType, n, edges));
50 * inverse filled, or has too many edges, this will return NULL. If offset is non-NULL, then
57 * Creates an effect that fills inside the rect with AA edges..
78 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]);
40 Create(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
H A DGrConvexPolyEffect.cpp135 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
222 "edges",
286 SkScalar edges[3 * kMaxEdges]; local
305 edges[3 * n] = v.fY;
306 edges[3 * n + 1] = -v.fX;
308 edges[3 * n] = -v.fY;
309 edges[3 * n + 1] = v.fX;
312 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[
339 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
369 SkScalar edges[kMaxEdges * 3]; local
[all...]
/external/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h30 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
31 * The edges should form a convex polygon. The positive half-plane is considered to be the
35 * Currently the edges are specified in device space. In the future we may prefer to specify
40 static GrEffectRef* Create(GrEffectEdgeType edgeType, int n, const SkScalar edges[]) { argument
45 (edgeType, n, edges))));
50 * inverse filled, or has too many edges, this will return NULL. If offset is non-NULL, then
56 * Creates an effect that fills inside the rect with AA edges..
77 GrConvexPolyEffect(GrEffectEdgeType edgeType, int n, const SkScalar edges[]);
H A DGrConvexPolyEffect.cpp132 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
218 "edges",
279 SkScalar edges[3 * kMaxEdges]; local
298 edges[3 * n] = v.fY;
299 edges[3 * n + 1] = -v.fX;
301 edges[3 * n] = -v.fY;
302 edges[3 * n + 1] = v.fX;
305 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[
332 GrConvexPolyEffect(GrEffectEdgeType edgeType, int n, const SkScalar edges[]) argument
362 SkScalar edges[kMaxEdges * 3]; local
[all...]
/external/chromium_org/ash/wm/workspace/
H A Dmagnetism_matcher.cc13 // Returns true if |a| is close enough to |b| that the two edges snap.
19 // primary edge of |primary|. |edges| is a bitmask of the allowed
23 uint32 edges) {
24 // Convert |secondary| to a MagnetismEdge so we can compare it to |edges|.
46 return (edges & secondary_as_magnetism_edge) != 0;
123 MagnetismMatcher::MagnetismMatcher(const gfx::Rect& bounds, uint32 edges) argument
124 : edges_(edges) {
125 if (edges & MAGNETISM_EDGE_TOP)
127 if (edges & MAGNETISM_EDGE_LEFT)
129 if (edges
21 CanMatchSecondaryEdge(MagnetismEdge primary, SecondaryMagnetismEdge secondary, uint32 edges) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/page/scrolling/
H A DScrollingConstraints.h62 void setAnchorEdges(AnchorEdges edges) { m_anchorEdges = edges; } argument
/external/chromium_org/cc/resources/
H A Dtask_graph_runner.h38 // Dependencies are represented as edges in a task graph. Each graph node is
81 Edge::Vector edges; member in struct:cc::TaskGraph
/external/chromium_org/chrome/browser/ui/views/
H A Dchrome_views_delegate.cc109 int edges = 0; local
111 edges |= views::ViewsDelegate::EDGE_LEFT;
113 edges |= views::ViewsDelegate::EDGE_TOP;
115 edges |= views::ViewsDelegate::EDGE_RIGHT;
117 edges |= views::ViewsDelegate::EDGE_BOTTOM;
118 return edges;
396 // initial value of 0 (no auto-hide edges) then we'll go fullscreen and
398 // in us thinking there is no auto-hide edges. By returning at least one edge
400 // edges.
422 int edges) {
418 OnGotAppbarAutohideEdges( const base::Closure& callback, HMONITOR monitor, int returned_edges, int edges) argument
[all...]
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen_unittest.cc381 // We also verify that at least some of the edges changed because of
384 std::string edges[2]; local
410 edges[i].append(reinterpret_cast<char*>(&bb), sizeof(bb));
445 SANDBOX_ASSERT(edges[0] != edges[1]);
447 SANDBOX_ASSERT(edges[0] == edges[1]);
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DRoundedRect.cpp97 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
101 m_bottomLeft = edges.bottomLeft();
103 m_topRight = edges.topRight();
104 m_topLeft = edges.topLeft();
109 m_topRight = edges.topRight();
111 m_bottomLeft = edges.bottomLeft();
112 m_bottomRight = edges.bottomRight();
162 void RoundedRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
164 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
/external/opencv/cvaux/src/
H A Dcvdpstereo.cpp108 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
158 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
159 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
162 edges[y*imgW+j] = 0;
167 edges[y*imgW+j] |= 1;
172 edges[
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkDistanceFieldGen.cpp66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image, argument
72 edges += (pad*dataWidth + pad);
95 *edges = 255; // using 255 makes for convenient debug rendering
99 ++edges;
102 edges += 2*pad;
148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) { argument
156 if (*edges) {
187 ++edges;
361 // create initial distance data, particularly at edges
/external/skia/src/core/
H A DSkDistanceFieldGen.cpp66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image, argument
72 edges += (pad*dataWidth + pad);
95 *edges = 255; // using 255 makes for convenient debug rendering
99 ++edges;
102 edges += 2*pad;
148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) { argument
156 if (*edges) {
187 ++edges;
361 // create initial distance data, particularly at edges
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
/external/bison/src/
H A Dielr.c125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_count
[all...]
/external/chromium_org/third_party/freetype/src/autofit/
H A Dafhints.c88 AF_Edge edges; local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
114 edges = axis->edges;
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
259 AF_Edge edges = axis->edges; local
288 AF_INDEX_NUM( seg->edge, edges ),
363 /* Dump the array of linked edges
377 AF_Edge edges = axis->edges; local
917 AF_Edge edges = axis->edges; local
[all...]
H A Dafhints.h36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
83 * edges. An edge corresponds to a single position on the main
87 * The auto-hinter first tries to grid fit edges, then to align
88 * segments on the edges unless it detects that they form a serif.
91 * edges; they are specific to a script.
173 * to be interpolated linearly between their two closest edges, even if
198 * alignment of edges and strong points, thus weak points are processed
299 FT_Fixed scale; /* used to speed up interpolation between edges */
304 FT_Short num_linked; /* number of linked edges */
324 AF_Edge edges; /* edges array */ member in struct:AF_AxisHintsRec_
[all...]
/external/chromium_org/ui/chromeos/
H A Dtouch_exploration_controller.cc461 int edges = FindEdgesWithinBounds(event.location(), kSlopDistanceFromEdge); local
462 bool in_a_bottom_corner = (edges == BOTTOM_LEFT_CORNER) ||
463 (edges == BOTTOM_RIGHT_CORNER);
894 // bit/edges intersect. Otherwise, if no bits are turned on, the point must be
/external/eigen/Eigen/src/Core/arch/AltiVec/
H A DPacketMath.h309 Packet16uc MSQ, LSQ, edges; local
314 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
327 Packet16uc MSQ, LSQ, edges; local
332 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...]
/external/freetype/src/autofit/
H A Dafhints.c88 AF_Edge edges; local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
114 edges = axis->edges;
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
272 AF_Edge edges = axis->edges; local
301 AF_INDEX_NUM( seg->edge, edges ),
387 /* Dump the array of linked edges
402 AF_Edge edges = axis->edges; local
1054 AF_Edge edges = axis->edges; local
[all...]
/external/pixman/pixman/
H A Dpixman-vmx.c179 edges = vec_perm (tmp4, tmp3, dest ## _mask); \
180 tmp3 = vec_perm ((vector unsigned char)v ## dest, edges, store_mask); \
181 tmp1 = vec_perm (edges, (vector unsigned char)v ## dest, store_mask); \
192 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
231 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
287 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
325 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
380 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
416 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
469 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
506 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
560 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
597 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
650 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
688 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
742 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
782 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
841 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
881 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
940 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
980 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1039 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1075 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1131 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1171 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1215 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1258 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1300 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1343 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1387 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1431 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1482 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1530 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
1578 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, local
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c2264 * used to define edges that identify numerical node indexes that depend on other
2297 topo->limit = 1; // No edges added yet
2298 topo->edges = NULL; // No edges added yet
2334 // First see if we have enough room in the edges array to add the edge?
2336 if (topo->edges == NULL)
2338 // We don't have any edges yet, so create an array to hold them
2340 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1);
2341 if (topo->edges == NULL)
2352 // WE have some edges bu
2417 pANTLR3_BITSET edges; local
[all...]

Completed in 1121 milliseconds

123