Home
last modified time | relevance | path

Searched refs:nodeData (Results 1 – 6 of 6) sorted by relevance

/external/google-fruit/include/fruit/impl/data_structures/
Dsemistatic_graph.templates.h121 NodeData& nodeData = *nodeAtId(node_index_map.at(i->getId())); in SemistaticGraph() local
122 nodeData.node = i->getValue(); in SemistaticGraph()
124 nodeData.edges_begin = 0; in SemistaticGraph()
126nodeData.edges_begin = reinterpret_cast<std::uintptr_t>(edges_storage.data() + edges_storage.size(… in SemistaticGraph()
198 NodeData& nodeData = *nodeAtId(node_index_map.at(i->getId())); in SemistaticGraph() local
199 nodeData.node = i->getValue(); in SemistaticGraph()
201 nodeData.edges_begin = 0; in SemistaticGraph()
203nodeData.edges_begin = reinterpret_cast<std::uintptr_t>(edges_storage.data() + edges_storage.size(… in SemistaticGraph()
/external/eigen/doc/
Deigen_navtree_hacks.js58 var nodeData = po.childrenData[i];
59 if((!nodeData[1]) || (nodeData[1].indexOf('#')==-1)) // <- we added this line
60 po.children[i] = newNode(o, po, nodeData[0], nodeData[1], nodeData[2], i==l);
/external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
DTestDTDAttributes.java517 NodeData nodeData = null;
522 if (nodeData == null) {
525 nodeData = fullNodeData.get(type);
526 if (nodeData == null) {
527 fullNodeData.put(type, nodeData = new NodeData( in fullNodeData.put() argument
537 nodeData.elementToAttributes.putAll(element, in nodeData.elementToAttributes.putAll()
539 Set<String> oldAlways = nodeData.elementToAttributesAlwaysFound
542 nodeData.elementToAttributesAlwaysFound.putAll( in nodeData.elementToAttributesAlwaysFound.putAll()
548 nodeData.elementToAttributesAlwaysFound
554 putIfNew(nodeData.branchNodes, element, locale, in putIfNew()
[all …]
/external/swiftshader/third_party/PowerVR_SDK/Tools/
DPVRTSkipGraph.h284 bool AddNodeDependency(const T& nodeData, const T& dependantData) in AddNodeDependency() argument
289 pNode = FindNode(nodeData); in AddNodeDependency()
/external/epid-sdk/doc/html/
Dnavtree.js408 var nodeData = po.childrenData[i];
409 po.children[i] = newNode(o, po, nodeData[0], nodeData[1], nodeData[2],
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h559 NodeData &nodeData = getSolverNodeData(nItr); in computeSolution() local
564 for (SolverEdgeItr solvedEdgeItr = nodeData.solverEdgesBegin(), in computeSolution()
565 solvedEdgeEnd = nodeData.solverEdgesEnd(); in computeSolution()