HomeSort by relevance Sort by last modified time
    Searched refs:edges (Results 26 - 50 of 131) sorted by null

12 3 4 5 6

  /external/chromium_org/third_party/freetype/src/autofit/
aflatin.c 1036 /* 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 *
1193 AF_Edge edges = axis->edges; local
1804 AF_Edge edges = axis->edges; local
    [all...]
aflatin2.c 1082 /* We will begin by generating a sorted table of edges for the */
1091 /* Note that the edges table is sorted along the segment/edge */
1203 AF_Edge edges = axis->edges; local
1811 AF_Edge edges = axis->edges; local
    [all...]
afcjk.c 914 /* 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++ )
1673 AF_Edge edges = axis->edges; local
2017 AF_Edge edges = axis->edges; local
    [all...]
  /external/chromium_org/components/browser_context_keyed_service/
dependency_graph.cc 28 // Remove all dependency edges that contain this node.
70 // Step 1: Build a set of nodes with no incoming edges.
85 EdgeMap edges(edges_);
92 edges.equal_range(node);
98 edges.erase(temp);
101 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
113 if (!edges.empty()) {
  /external/freetype/src/autofit/
aflatin2.c 1111 /* We will begin by generating a sorted table of edges for the */
1233 AF_Edge edges = axis->edges; local
1841 AF_Edge edges = axis->edges; local
    [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...]
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 111 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 connected to the given node
    [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...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
Ruby.stg 763 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
765 <edges; separator="\nels">
787 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
789 <edges; separator="\nels">
802 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
804 <edges; separator="\nels"><\n>
833 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
835 <edges; separator="\n">
851 dfaOptionalBlockStateSwitch(k, edges, eotPredictsAlt, description, stateNumber, semPredState) ::= <<
853 <edges; separator="\n"
    [all...]
  /external/opencv/cv/src/
cvstereogc.cpp 134 static int64 icvGCMaxFlow( GCVtx* vtx, int nvtx, GCEdge* edges, GCVtx**& _orphans, int& _maxOrphans )
179 for( ei = v->first; ei != 0; ei = edges[ei].next )
181 if( edges[ei^vt].weight == 0 )
183 u = edges[ei].dst;
224 min_weight = edges[e0].weight;
229 for( v = edges[e0^k].dst;; v = edges[ei].dst )
233 weight = edges[ei^k].weight;
242 // modify weights of the edges along the path and collect orphans
243 edges[e0].weight -= min_weight
    [all...]
  /system/core/libpixelflinger/
trap.cpp 32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3]; local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax )
    [all...]
  /external/antlr/antlr-3.4/runtime/Python/unittests/
testdottreegen.py 33 " $edges$\n" +
  /external/chromium_org/extensions/common/matcher/
substring_set_matcher.h 70 // The Aho Corasick algorithm improves this runtime by using failure edges.
84 typedef std::map<char, uint32> Edges;
96 const Edges& edges() const { return edges_; } function in class:extensions::SubstringSetMatcher::AhoCorasickNode
106 // Outgoing edges of current node.
107 Edges edges_;
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c 2417 pANTLR3_BITSET edges; local
    [all...]
  /external/chromium_org/sandbox/linux/seccomp-bpf/
codegen_unittest.cc 286 // 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/skia/src/core/
SkRegion_path.cpp 416 edge++; // skip over "used" edges
469 SkTDArray<Edge> edges;
472 Edge* edge = edges.append(2);
476 qsort(edges.begin(), edges.count(), sizeof(Edge), SkCastForQSort(EdgeProc));
478 int count = edges.count();
479 Edge* start = edges.begin();
  /external/skia/src/core/
SkRegion_path.cpp 416 edge++; // skip over "used" edges
469 SkTDArray<Edge> edges;
472 Edge* edge = edges.append(2);
476 qsort(edges.begin(), edges.count(), sizeof(Edge), SkCastForQSort(EdgeProc));
478 int count = edges.count();
479 Edge* start = edges.begin();
  /external/opencv/cxcore/src/
cxdrawing.cpp 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges,
66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color );
943 CvContour* edges;
948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st ));
954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT ));
955 CV_CALL( icvFillEdgeCollection( img, edges, color ));
999 int edges = npts;
2423 CvContour* edges = 0; local
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DotTreeGenerator.cs 104 var edges = DefineEdges( tree, adaptor );
111 foreach ( var s in edges )
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/
DOTTreeGenerator.cs 101 var edges = DefineEdges(tree, adaptor);
108 foreach (var s in edges)
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DotTreeGenerator.cs 104 var edges = DefineEdges( tree, adaptor );
111 foreach ( var s in edges )
  /external/chromium_org/chrome/browser/ui/panels/
display_settings_provider_win.cc 144 UINT edges[] = { ABE_BOTTOM }; local
147 views::GetTopmostAutoHideTaskbarForEdge(edges[i], monitor_);
  /external/chromium_org/third_party/WebKit/Source/core/page/scrolling/
ScrollingConstraints.h 62 void setAnchorEdges(AnchorEdges edges) { m_anchorEdges = edges; }
  /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/
RoundedRect.h 60 void includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge);
97 void includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge);
  /external/eigen/Eigen/src/Core/arch/AltiVec/
PacketMath.h 306 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...]

Completed in 551 milliseconds

12 3 4 5 6