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

12

/external/chromium_org/ui/views/win/
H A Dappbar.cc45 // initial value of 0 (no auto-hide edges) then we'll go fullscreen and
47 // in us thinking there is no auto-hide edges. By returning at least one edge
49 // edges.
79 int* edges) {
80 edge_map_[monitor] = *edges;
81 if (returned_edges == *edges)
76 OnGotEdges(const base::Closure& callback, HMONITOR monitor, int returned_edges, int* edges) argument
/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/extensions/common/matcher/
H A Dsubstring_set_matcher.h70 // The Aho Corasick algorithm improves this runtime by using failure edges.
96 const Edges& edges() const { return edges_; } function in class:extensions::SubstringSetMatcher::AhoCorasickNode
106 // Outgoing edges of current node.
/external/chromium_org/ash/wm/workspace/
H A Dmagnetism_matcher.cc15 // Returns true if |a| is close enough to |b| that the two edges snap.
21 // primary edge of |primary|. |edges| is a bitmask of the allowed
25 uint32 edges) {
26 // Convert |secondary| to a MagnetismEdge so we can compare it to |edges|.
48 return (edges & secondary_as_magnetism_edge) != 0;
125 MagnetismMatcher::MagnetismMatcher(const gfx::Rect& bounds, uint32 edges) argument
126 : edges_(edges) {
127 if (edges & MAGNETISM_EDGE_TOP)
129 if (edges & MAGNETISM_EDGE_LEFT)
131 if (edges
23 CanMatchSecondaryEdge(MagnetismEdge primary, SecondaryMagnetismEdge secondary, uint32 edges) argument
[all...]
H A Dworkspace_window_resizer.cc140 // the edges |edges|. |edges| is a bitmask of the MagnetismEdges.
666 const uint32 edges = WindowComponentToMagneticEdge(details_.window_component); local
667 if (UpdateMagnetismWindow(*bounds, edges)) {
678 uint32 edges) {
682 MagnetismMatcher matcher(bounds_in_screen, edges);
685 // around when close to multiple edges.
804 const uint32 edges = WindowComponentToMagneticEdge(details_.window_component); local
809 if (edges
677 UpdateMagnetismWindow(const gfx::Rect& bounds, uint32 edges) argument
[all...]
/external/chromium_org/chrome/browser/ui/panels/
H A Ddisplay_settings_provider_win.cc144 UINT edges[] = { ABE_BOTTOM }; local
147 views::GetTopmostAutoHideTaskbarForEdge(edges[i], monitor_);
/external/dropbear/libtomcrypt/src/pk/asn1/der/set/
H A Dder_encode_setof.c66 struct edge *edges; local
88 /* allocate edges */
89 edges = XCALLOC(inlen, sizeof(*edges));
90 if (edges == NULL) {
108 /* scan for edges */
112 edges[x].start = ptr;
120 edges[x].size = y;
123 edges[x].size = 0;
125 edges[
[all...]
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen_unittest.cc286 // We also verify that at least some of the edges changed because of
289 std::string edges[2]; local
315 edges[i].append(reinterpret_cast<char *>(&bb), sizeof(bb));
350 SANDBOX_ASSERT(edges[0] != edges[1]);
352 SANDBOX_ASSERT(edges[0] == edges[1]);
/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/third_party/WebKit/Source/core/platform/graphics/
H A DRoundedRect.cpp99 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
103 m_bottomLeft = edges.bottomLeft();
105 m_topRight = edges.topRight();
106 m_topLeft = edges.topLeft();
111 m_topRight = edges.topRight();
113 m_bottomLeft = edges.bottomLeft();
114 m_bottomRight = edges.bottomRight();
164 void RoundedRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
166 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/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/WebKit/Source/core/rendering/shapes/
H A DPolygonShape.cpp247 Vector<const FloatPolygonEdge*> edges; local
248 if (!polygon.overlappingEdges(y, y, edges))
253 for (unsigned i = 0; i < edges.size(); ++i) {
254 if (computeXIntersection(edges[i], y, intersection) && intersection.type != VertexYBoth)
317 Vector<const FloatPolygonEdge*> edges;
318 if (!polygon.overlappingEdges(y1, y2, edges))
322 for (unsigned i = 0; i < edges.size(); ++i) {
323 const FloatPolygonEdge *edge = edges[i];
409 Vector<const FloatPolygonEdge*> edges; local
410 if (!polygon.overlappingEdges(rect.y(), rect.maxY(), edges))
[all...]
/external/chromium_org/third_party/freetype/src/autofit/
H A Dafhints.c77 AF_Edge edges; local
97 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
103 edges = axis->edges;
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
343 /* Dump the array of linked edges. */
357 AF_Edge edges = axis->edges; local
358 AF_Edge limit = edges
895 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...]
H A Dafcjk.c914 /* We begin by generating a sorted table of edges for the current */
923 /* Note that the edges table is sorted along the segment/edge */
945 AF_Edge edge = axis->edges + ee;
1044 AF_Edge edges = axis->edges; local
1045 AF_Edge edge_limit = edges + axis->num_edges;
1049 for ( edge = edges; edge < edge_limit; edge++ )
1062 for ( edge = edges; edge < edge_limit; edge++ )
1175 AF_Edge edge = axis->edges;
1212 /* if it is a top zone, check for right edges
1673 AF_Edge edges = axis->edges; local
2017 AF_Edge edges = axis->edges; local
[all...]
H A Daflatin.c1036 /* Link segments to edges, using feature analysis for selection. */
1081 /* We begin by generating a sorted table of edges for the current */
1090 /* Note that the table of edges is sorted along the segment/edge */
1113 /* A special case for serif edges: If they are smaller than */
1122 AF_Edge edge = axis->edges + ee;
1193 AF_Edge edges = axis->edges; local
1194 AF_Edge edge_limit = edges + axis->num_edges;
1198 for ( edge = edges; edge < edge_limit; edge++ )
1211 for ( edge = edges; edg
1804 AF_Edge edges = axis->edges; local
[all...]
/external/eigen/Eigen/src/Core/arch/AltiVec/
H A DPacketMath.h306 Packet16uc MSQ, LSQ, edges; local
311 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
312 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
314 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
315 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
324 Packet16uc MSQ, LSQ, edges; local
329 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
330 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 )
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/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h111 EdgeList edges; member in class:PBQP::Graph
128 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
131 EdgeItr edgeItr = edges.insert(edges.end(), e);
162 /// This will clear the current graph, erasing any nodes and edges added,
193 /// \brief Get the number of edges in the graph.
194 /// @return Number of edges in the graph.
265 EdgeItr edgesBegin() { return edges.begin(); }
268 EdgeItr edgesEnd() { return edges.end(); }
272 /// @return Begin iterator for the set of edges connecte
[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...]
/external/chromium_org/v8/src/
H A Dheap-snapshot-generator.h178 List<HeapGraphEdge>& edges() { return edges_; } function in class:v8::internal::HeapSnapshot
381 // An interface used to populate a snapshot with nodes and edges.

Completed in 635 milliseconds

12