Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:edges (Results 1 - 25 of 56) sorted by null

1 2 3

/external/chromium_org/components/url_matcher/
substring_set_matcher.h	71 // The Aho Corasick algorithm improves this runtime by using failure edges. 85 typedef std::map<char, uint32> Edges; 97 const Edges& edges() const { return edges_; } function in class:url_matcher::SubstringSetMatcher::AhoCorasickNode 107 // Outgoing edges of current node. 108 Edges edges_;
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Graph.java	32 /** 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/cc/resources/
task_graph_runner.h	38 // 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/
chrome_views_delegate.cc	108 int edges = 0; local 110 edges |= views::ViewsDelegate::EDGE_LEFT; 112 edges |= views::ViewsDelegate::EDGE_TOP; 114 edges |= views::ViewsDelegate::EDGE_RIGHT; 116 edges |= views::ViewsDelegate::EDGE_BOTTOM; 117 return edges; 392 // initial value of 0 (no auto-hide edges) then we'll go fullscreen and 394 // in us thinking there is no auto-hide edges. By returning at least one edge 396 // edges. 418 int edges) {     [all...]
/external/chromium_org/sandbox/linux/seccomp-bpf/
codegen_unittest.cc	380 // We also verify that at least some of the edges changed because of 383 std::string edges[2]; local 409 edges[i].append(reinterpret_cast<char*>(&bb), sizeof(bb)); 444 SANDBOX_ASSERT(edges[0] != edges[1]); 446 SANDBOX_ASSERT(edges[0] == edges[1]);
/external/chromium_org/third_party/skia/src/gpu/effects/
GrConvexPolyEffect.cpp	132 // 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[3 * n + 1] * p.fY) 362 SkScalar edges[kMaxEdges * 3]; local     [all...]
/external/opencv/cvaux/src/
cvdpstereo.cpp	108 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[y*imgW+j] |= 2     [all...]
/external/skia/src/gpu/effects/
GrConvexPolyEffect.cpp	132 // 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[3 * n + 1] * p.fY) 362 SkScalar edges[kMaxEdges * 3]; local     [all...]
/external/antlr/antlr-3.4/runtime/C/include/
antlr3collections.h	409 * 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/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c	2417 pANTLR3_BITSET edges; local     [all...]
/external/bison/src/
ielr.c	125 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_counts, always_followsp)     [all...]
/external/chromium_org/ash/wm/workspace/
workspace_window_resizer.cc	137 // the edges |edges|. |edges| is a bitmask of the MagnetismEdges. 707 const uint32 edges = WindowComponentToMagneticEdge( local 709 if (UpdateMagnetismWindow(*bounds, edges)) { 720 uint32 edges) { 724 MagnetismMatcher matcher(bounds_in_screen, edges); 727 // around when close to multiple edges. 855 const uint32 edges = WindowComponentToMagneticEdge( local 861 if (edges & MAGNETISM_EDGE_TOP &     [all...]
/external/chromium_org/third_party/freetype/src/autofit/
afhints.c	88 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...]
afhints.h	36 /* i.e., vertical segments & edges */ 38 /* i.e., horizontal segments & edges */ 80 * 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 */ 324 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_     [all...]
afcjk.c	918 /* We begin by generating a sorted table of edges for the current */ 927 /* Note that the edges table is sorted along the segment/edge */ 949 AF_Edge edge = axis->edges + ee; 1049 AF_Edge edges = axis->edges; local 1050 AF_Edge edge_limit = edges + axis->num_edges; 1054 for ( edge = edges; edge < edge_limit; edge++ ) 1678 AF_Edge edges = axis->edges; local 2022 AF_Edge edges = axis->edges; local     [all...]
aflatin.c	1103 /* Link segments to edges, using feature analysis for selection. */ 1260 AF_Edge edges = axis->edges; local 1869 AF_Edge edges = axis->edges; local     [all...]
/external/eigen/Eigen/src/Core/arch/AltiVec/
PacketMath.h	309 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/
afhints.c	88 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...]
afcjk.c	935 /* We begin by generating a sorted table of edges for the current */ 944 /* Note that the edges table is sorted along the segment/edge */ 966 AF_Edge edge = axis->edges + ee; 1067 AF_Edge edges = axis->edges; local 1068 AF_Edge edge_limit = edges + axis->num_edges; 1072 for ( edge = edges; edge < edge_limit; edge++ ) 1085 for ( edge = edges; edge < edge_limit; edge++ ) 1715 AF_Edge edges = axis->edges; local 2094 AF_Edge edges = axis->edges; local     [all...]
afhints.h	36 /* i.e., vertical segments & edges */ 38 /* i.e., horizontal segments & edges */ 84 * Edges 87 * edges. 90 * edges. An edge corresponds to a single position on the main 95 * edges, then to align segments on the edges unless it detects that 182 * to be interpolated linearly between their two closest edges, even if 208 * alignment of edges and strong points, thus weak points are processed 310 FT_Fixed scale; /* used to speed up interpolation between edges */ 335 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_     [all...]
/external/pixman/pixman/
pixman-vmx.c	179 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...]
/frameworks/base/packages/WallpaperCropper/src/com/android/wallpapercropper/
CropView.java	121 final RectF edges = mTempEdges; local 122 getEdgesHelper(edges); 125 float cropLeft = -edges.left / scale; 126 float cropTop = -edges.top / scale; 203 final RectF edges = mTempEdges; local 204 getEdgesHelper(edges); 206 mCenterX += Math.ceil(edges.left / scale); 286 final RectF edges = mTempEdges; local 287 getEdgesHelper(edges); 297 if (edges.left > 0)     [all...]
/packages/apps/Launcher3/WallpaperPicker/src/com/android/launcher3/
CropView.java	121 final RectF edges = mTempEdges; local 122 getEdgesHelper(edges); 125 float cropLeft = -edges.left / scale; 126 float cropTop = -edges.top / scale; 203 final RectF edges = mTempEdges; local 204 getEdgesHelper(edges); 206 mCenterX += Math.ceil(edges.left / scale); 286 final RectF edges = mTempEdges; local 287 getEdgesHelper(edges); 297 if (edges.left > 0)     [all...]
/external/chromium_org/v8/src/
heap-snapshot-generator.h	162 List<HeapGraphEdge>& edges() { return edges_; } function in class:v8::internal::HeapSnapshot
/external/libpcap/
optimize.c	125 struct edge **edges; variable in typeref:struct:edge 1353 target = fold_edge(ep->succ, edges[k]);     [all...]

Completed in 1706 milliseconds

1 2 3