Home
last modified time | relevance | path

Searched refs:edgeMap (Results 1 – 4 of 4) sorted by relevance

/external/eigen/demos/opengl/
Dicosphere.cpp64 std::map<Key,int> edgeMap; in _subdivide() local
82 std::map<Key,int>::iterator it = edgeMap.find(edgeKey); in _subdivide()
83 if (it==edgeMap.end()) in _subdivide()
86 edgeMap[edgeKey] = ids1[k]; in _subdivide()
/external/antlr/tool/src/main/java/org/antlr/analysis/
DLL1DFA.java79 MultiMap<IntervalSet, Integer> edgeMap) in LL1DFA() argument
89 for (Map.Entry<IntervalSet, List<Integer>> entry : edgeMap.entrySet()) { in LL1DFA()
/external/skia/tests/
DTriangulatingPathRendererTests.cpp817 static void add_edge(EdgeMap& edgeMap, SkPoint p0, SkPoint p1) { in add_edge() argument
820 auto reverseIter = edgeMap.find(edge.reverse()); in add_edge()
821 if (reverseIter != edgeMap.end()) { in add_edge()
824 ++edgeMap[edge]; in add_edge()
828 static void add_tri_edges(skiatest::Reporter* r, EdgeMap& edgeMap, const SkPoint pts[3]) { in add_tri_edges() argument
833 add_edge(edgeMap, p0, p1); in add_tri_edges()
/external/antlr/tool/src/main/java/org/antlr/tool/
DGrammar.java1255 MultiMap<IntervalSet, Integer> edgeMap = new MultiMap<IntervalSet, Integer>(); in createLL_1_LookaheadDFA() local
1261 edgeMap.map(ds, alt); in createLL_1_LookaheadDFA()
1270 DFA lookaheadDFA = new LL1DFA(decision, decisionStartState, edgeMap); in createLL_1_LookaheadDFA()