| /libcore/ojluni/src/main/java/java/util/stream/ |
| SliceOps.java | 150 // This will limit the size of the buffers created at the leaf nodes
171 return Nodes.collect(helper, s, true, generator);
180 return Nodes.collect(this, s, true, generator);
280 return Nodes.collectInt(helper, s, true);
289 return Nodes.collectInt(this, s, true);
389 return Nodes.collectLong(helper, s, true);
398 return Nodes.collectLong(this, s, true);
498 return Nodes.collectDouble(helper, s, true);
507 return Nodes.collectDouble(this, s, true);
595 return Nodes.emptyNode(op.getOutputShape())
[all...] |
| DistinctOps.java | 64 return Nodes.node(reduceOp.evaluateParallel(helper, spliterator));
98 return Nodes.node(keys);
|
| DoublePipeline.java | 140 return Nodes.collectDouble(helper, spliterator, flattenTree);
165 return Nodes.doubleBuilder(exactSizeIfKnown);
507 return Nodes.flattenDouble((Node.OfDouble) evaluateToArrayNode(Double[]::new))
|
| LongPipeline.java | 141 return Nodes.collectLong(helper, spliterator, flattenTree);
166 return Nodes.longBuilder(exactSizeIfKnown);
485 return Nodes.flattenLong((Node.OfLong) evaluateToArrayNode(Long[]::new))
|
| IntPipeline.java | 143 return Nodes.collectInt(helper, spliterator, flattenTree);
169 return Nodes.intBuilder(exactSizeIfKnown);
503 return Nodes.flattenInt((Node.OfInt) evaluateToArrayNode(Integer[]::new))
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| netprov.h | 82 virtual HRESULT WINAPI Query(LPCWSTR pszwDomain,LPCWSTR pszwLanguage,LPCWSTR pszwXPathQuery,IXMLDOMNodeList **Nodes) = 0;
91 HRESULT (WINAPI *Query)(IProvisioningDomain *This,LPCWSTR pszwDomain,LPCWSTR pszwLanguage,LPCWSTR pszwXPathQuery,IXMLDOMNodeList **Nodes);
102 #define IProvisioningDomain_Query(This,pszwDomain,pszwLanguage,pszwXPathQuery,Nodes) (This)->lpVtbl->Query(This,pszwDomain,pszwLanguage,pszwXPathQuery,Nodes)
107 HRESULT WINAPI IProvisioningDomain_Query_Proxy(IProvisioningDomain *This,LPCWSTR pszwDomain,LPCWSTR pszwLanguage,LPCWSTR pszwXPathQuery,IXMLDOMNodeList **Nodes);
|
| mmcobj.h | 135 typedef struct Nodes Nodes;
191 typedef Nodes *PNODES;
192 typedef Nodes **PPNODES;
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 60 // Numbering map for gep nodes. Used to keep track of ordering for
61 // gep nodes.
133 NodeVect Nodes;
355 Nodes.push_back(N);
370 Nodes.push_back(Nx);
394 // The creation of gep nodes requires DT-traversal. When processing a GEP
409 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes);
414 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM,
417 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I)
[all...] |
| /external/jsoncpp/include/json/ |
| reader.h | 230 typedef std::stack<Value*> Nodes;
231 Nodes nodes_;
|
| /external/llvm/lib/Analysis/ |
| ScopedNoAliasAA.cpp | 133 SmallPtrSetImpl<const MDNode *> &Nodes) const {
137 Nodes.insert(MD);
161 // To not alias, all of the nodes in ScopeNodes must be in NANodes.
|
| BlockFrequencyInfoImpl.cpp | 188 // Early exit for termination nodes.
373 for (const BlockNode &M : Loop.Nodes) {
479 for (const BlockNode &N : Loop.Nodes) {
566 Nodes.reserve(OuterLoop.Nodes.size());
567 for (auto N : OuterLoop.Nodes)
579 for (auto &I : Nodes)
619 // Map from nodes in the SCC to whether it's an entry block.
622 // InSCC also acts the set of nodes in the graph. Seed it.
696 for (const auto &N : Loop->Nodes)
[all...] |
| LazyCallGraph.cpp | 111 // Now add entry nodes for functions reachable via initializers to globals.
161 Nodes.push_back(&N);
224 // formation by leaving behind (conservative) DFS numberings in the nodes,
256 // We fully explore the depth-first space, adding nodes to the connected
290 unsigned NewNodeBeginIdx = Nodes.size();
306 Nodes.push_back(N);
308 C->Nodes.clear();
310 for (auto I = Nodes.begin() + NewNodeBeginIdx, E = Nodes.end(); I != E; ++I)
471 Worklist.swap(Nodes);
[all...] |
| CallGraphSCCPass.cpp | 182 << " nodes:\n";
529 assert(i != Nodes.size() && "Node not in SCC");
530 if (Nodes[i] != Old) continue;
531 Nodes[i] = New;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 68 // First, we only consider nodes for reclamation of the following
77 // After these prerequisites, we discard all "filler" nodes that
83 // We then discard all other nodes where *all* of the following conditions
96 // FIXME: It may be safe to reclaim PreCall and PostCall nodes as well.
110 // Now reclaim any nodes that are (by definition) not essential to
138 // Do not collect nodes for "interesting" lvalue expressions since they are
144 // Do not collect nodes for non-consumed Stmt or Expr to ensure precise
175 Nodes.RemoveNode(node);
184 // Only periodically reclaim nodes so that we can build up a set of
185 // nodes that meet the reclamation criteria. Freshly created node
[all...] |
| /external/clang/lib/Tooling/ |
| JSONCompilationDatabase.cpp | 214 nodeToCommandLine(const std::vector<llvm::yaml::ScalarNode *> &Nodes) {
216 if (Nodes.size() == 1) {
217 return unescapeCommandLine(Nodes[0]->getValue(Storage));
220 for (auto *Node : Nodes) {
|
| /external/compiler-rt/lib/profile/ |
| InstrProfData.inc | 335 * shared C implementation. In this structure, NumValueSites and Nodes
345 ValueProfNode **Nodes;
359 ValueProfNode **Nodes);
521 * for a given function in \c NumValueSites and \c Nodes structures.
530 ValueProfNode **Nodes) {
533 RuntimeRecord->Nodes = Nodes;
544 RuntimeRecord->NodesKind[I] = Nodes ? &Nodes[S] : NULL;
548 ValueProfNode *Site = Nodes ? RuntimeRecord->NodesKind[I][J] : NULL
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| fDrawFlags.java | 68 public final static int Nodes = 0x0001;
|
| /external/llvm/include/llvm/ProfileData/ |
| InstrProfData.inc | 335 * shared C implementation. In this structure, NumValueSites and Nodes
345 ValueProfNode **Nodes;
359 ValueProfNode **Nodes);
521 * for a given function in \c NumValueSites and \c Nodes structures.
530 ValueProfNode **Nodes) {
533 RuntimeRecord->Nodes = Nodes;
544 RuntimeRecord->NodesKind[I] = Nodes ? &Nodes[S] : NULL;
548 ValueProfNode *Site = Nodes ? RuntimeRecord->NodesKind[I][J] : NULL
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 110 /// \brief A lazy iterator used for both the entry nodes and child nodes.
159 /// a callee, and facilitate iteration of child nodes in the graph.
208 /// a collection of call graph nodes. While the order of nodes in the SCC is
216 SmallVector<Node *, 1> Nodes;
231 iterator begin() const { return Nodes.begin(); }
232 iterator end() const { return Nodes.end(); }
339 /// where V is the number of nodes in this SCC and E is the number of edges
340 /// leaving the nodes in this SCC. Note that E includes both edges withi
[all...] |
| /external/clang/unittests/AST/ |
| NamedDeclPrinterTest.cpp | 41 const NamedDecl *ND = Result.Nodes.getNodeAs<NamedDecl>("id");
|
| MatchVerifier.h | 40 /// \brief Base class for verifying some property of nodes found by a matcher.
132 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>("");
145 BoundNodes::IDToNodeMap M = Result.Nodes.getMap();
|
| StmtPrinterTest.cpp | 48 const Stmt *S = Result.Nodes.getStmtAs<Stmt>("id");
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBodyHelpers.h | 27 Nodes = 0x0001,
|
| /external/ImageMagick/MagickCore/ |
| histogram.c | 94 nodes[NodesInAList];
98 } Nodes;
118 Nodes
397 register Nodes
398 *nodes;
406 nodes=cube_info->node_queue->next;
407 cube_info->node_queue=(Nodes *)
409 cube_info->node_queue=nodes;
410 } while (cube_info->node_queue != (Nodes *) NULL);
598 Nodes
91 nodes[NodesInAList]; member in struct:_Nodes
391 *nodes; local
588 *nodes; local
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 324 /// an SDNode and any nodes flagged to it.
370 /// \brief Boundary nodes are placeholders for the boundary of the
375 /// valid ID. Consequently, always check for boundary nodes before accessing
439 /// recursively marks successor nodes dirty.
444 /// recursively marks predecessor nodes dirty.
496 /// the interface of a standard priority queue, where nodes are inserted in
529 void push_all(const std::vector<SUnit *> &Nodes) {
530 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
531 E = Nodes.end(); I != E; ++I)
543 /// unscheduled nodes, for example
[all...] |
