| /libcore/ojluni/src/main/java/java/util/stream/ |
| ReferencePipeline.java | 110 return Nodes.collect(helper, spliterator, flattenTree, generator);
132 return Nodes.builder(exactSizeIfKnown, generator);
439 return (A[]) Nodes.flatten(evaluateToArrayNode(rawGenerator), rawGenerator)
|
| SpinedBuffer.java | 213 if (size >= Nodes.MAX_ARRAY_SIZE)
214 throw new IllegalArgumentException(Nodes.BAD_SIZE);
560 if (size >= Nodes.MAX_ARRAY_SIZE)
561 throw new IllegalArgumentException(Nodes.BAD_SIZE);
[all...] |
| Nodes.java | 52 final class Nodes {
54 private Nodes() {
108 * @return a {@code Node} covering the elements of the input nodes
182 // Int nodes
219 // Long nodes
256 // Double nodes
293 // Parallel evaluation of pipelines to nodes
447 // Parallel flattening of nodes
788 return new Nodes.InternalNodeSpliterator.OfRef<>(this);
826 return Nodes.conc(getShape(), left.truncate(from, leftCount, generator)
[all...] |
| /prebuilts/tools/linux-x86_64/kythe/proto/ |
| xref.proto | 49 // TODO(schroederc): break off Nodes/Edges into a separate service
51 // Nodes returns a subset of the facts for each of the requested nodes.
52 rpc Nodes(NodesRequest) returns (NodesReply) {}
55 // requested nodes.
58 // Decorations returns an index of the nodes and edges associated with a
63 // documentation of a set of requested nodes.
83 // nodes in the graph.
88 // The tickets of the nodes to be looked up.
94 // nodes. For different filters per node, the client must issue separat
[all...] |
| /external/clang/unittests/ASTMatchers/ |
| ASTMatchersTest.cpp | 768 bool run(const BoundNodes *Nodes) override {
769 const BoundNodes::IDToNodeMap &M = Nodes->getMap();
770 if (Nodes->getNodeAs<T>(Id)) {
772 if (const NamedDecl *Named = Nodes->getNodeAs<NamedDecl>(Id)) {
775 Nodes->getNodeAs<NestedNameSpecifier>(Id)) {
782 EXPECT_EQ(Nodes->getNodeAs<T>(Id), I->second.get<T>());
790 bool run(const BoundNodes *Nodes, ASTContext *Context) override {
791 return run(Nodes);
[all...] |
| ASTMatchersTest.h | 36 // running 'FindResultVerifier' with the bound nodes as argument.
45 *Verified |= FindResultReviewer->run(&Result.Nodes, Result.Context);
|
| /external/ImageMagick/MagickCore/ |
| quantize.c | 89 % prohibitive because the tree's total number of nodes is 1 +
92 % A complete tree would require 19,173,961 nodes for k = 8, Cmax = 255.
94 % Initializes data structures for nodes only as they are needed; (2)
108 % lower depth in the tree; initially, n2 = 0 for all nodes except
117 % within a node and the nodes' center. This represents the
120 % Reduction repeatedly prunes the tree until the number of nodes with n2
123 % those nodes whose E count is minimal for pruning and merges their color
128 % while number of nodes with (n2 > 0) > required maximum number of colors
129 % prune all nodes such that E <= Ep
130 % Set Ep to minimum E in remaining nodes
253 *nodes; member in struct:_Nodes
283 nodes, member in struct:_CubeInfo
1343 *nodes; local
2112 *nodes; local
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 374 // This code does not currently handle nodes which have multiple types,
841 // Count children in the count if they are also nodes.
861 /// corresponds to the number of nodes that are covered.
[all...] |
| /external/llvm/include/llvm/ProfileData/ |
| InstrProf.h | 471 ValueProfNode **Nodes);
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExprEngine.h | 112 /// Execute the work list with an initial state. Nodes that reaches the exit
152 /// nodes.
153 void ViewGraph(ArrayRef<const ExplodedNode*> Nodes);
170 /// \param Out The returned set of output nodes.
193 /// nodes by processing the 'effects' of a CFG element.
222 /// nodes by processing the 'effects' of a branch condition.
231 /// Used to generate successor nodes for temporary destructors depending
249 /// nodes by processing the 'effects' of a computed goto jump.
253 /// nodes by processing the 'effects' of a switch statement.
257 /// nodes when the control reaches the end of a function
[all...] |
| /external/clang/unittests/AST/ |
| DeclPrinterTest.cpp | 48 const Decl *D = Result.Nodes.getDeclAs<Decl>("id");
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm_ocaml.c | 696 CAMLlocal1(Nodes);
697 Nodes = alloc(LLVMGetNamedMetadataNumOperands(M, String_val(Name)), 0);
698 LLVMGetNamedMetadataOperands(M, String_val(Name), (LLVMValueRef *) Nodes);
699 CAMLreturn(Nodes);
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 63 /// \brief Internal version of BoundNodes. Holds all the bound nodes.
99 /// \brief A map from IDs to the bound nodes.
111 /// stored nodes have memoization data.
127 /// nodes from the Id matcher.
138 /// 'BoundNodesView' contains the bound nodes for a single match.
208 /// descendants of the node or bind matched nodes to names. If you are
269 /// \brief Matches nodes for which all provided matchers match.
271 /// \brief Matches nodes for which at least one of the provided matchers
274 /// \brief Matches nodes for which at least one of the provided matchers
277 /// \brief Matches nodes that do not match the provided matcher
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 60 const Nodes: ITreeNodeStream): String;
618 const Nodes: ITreeNodeStream): String;
626 for I := 0 to Nodes.Size - 1 do
628 T := Nodes.LT(I + 1);
629 TokenType := Nodes.TreeAdaptor.GetNodeType(T);
655 /// Test a tree with four nodes - ^(101 ^(102 103) 104)
724 /// Use Consume() to advance N nodes into lookahead. Then use LT()
725 /// to load at least INITIAL_LOOKAHEAD_BUFFER_SIZE-N nodes so the
731 WrapBy = 4; // wrap around by 4 nodes
846 // stream has 7 real + 6 nav nodes
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| ExprEngine.cpp | 58 // Keeps track of whether CXXBindTemporaryExpr nodes have been evaluated.
426 // Reclaim any unnecessary nodes in the ExplodedGraph.
451 // Enqueue the new nodes onto the work list.
517 assert(Tmp.size() == 1 && "have not generated any new nodes yet");
518 assert(*Tmp.begin() == Pred && "have not generated any new nodes yet");
529 // Construct PostInitializer nodes whether the state changed or not,
539 // Enqueue the new nodes onto the work list.
566 // Enqueue the new nodes onto the work list.
735 // temporary destructor nodes.
[all...] |
| /external/llvm/lib/IR/ |
| AsmWriter.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAG.cpp | [all...] |
| /prebuilts/tools/common/m2/repository/xom/xom/1.0/ |
| xom-1.0.jar | |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.pas | 652 /// tree nodes that have payload objects. We need to create a Token object
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/redshift/ |
| layer1.py | 514 The version selected runs on all the nodes in the cluster.
532 :param number_of_nodes: The number of compute nodes in the cluster.
535 For information about determining how many nodes you need, go to `
540 of nodes that you want in the cluster.
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBodyHelpers.cpp | 257 /* Nodes */
258 if(0!=(drawflags&fDrawFlags::Nodes))
484 //The btSoftBody object from the BulletSDK includes an array of Nodes and Links. These links appear
486 //and then to the rest of the nodes after the execution of the Floyd-Warshall graph algorithm
490 //The PSolve_Links() function reads and writes nodes as it iterates over each link.
552 LinkDepsPtr_t *linkDepListStarts = new LinkDepsPtr_t[nLinks]; // Start nodes of dependent-on-me lists, one for each link
599 // Update the nodes to mark which ones are calculated by this link
606 // -- All other (non-related) nodes in the ready list will automatically be inserted
675 /* Create nodes */
712 /* Create nodes */
[all...] |
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 277 MDNode *Nodes[] = {N0, N1, N2};
278 for (auto *Node : Nodes)
543 // Create a couple of distinct nodes to observe what's going on.
565 // under us. Just check that the other nodes are sane.
591 // Check code for replacing resolved nodes.
644 // collision with any other nodes above).
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| portcls.h | 385 const PCNODE_DESCRIPTOR* Nodes;
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 10 // This pass combines dag nodes to form fewer, simpler DAG nodes. It can be run
45 STATISTIC(NodesCombined , "Number of dag nodes combined");
46 STATISTIC(PreIndexedNodes , "Number of pre-indexed nodes created");
47 STATISTIC(PostIndexedNodes, "Number of post-indexed nodes created");
95 /// \brief Worklist of all of the nodes that need to be simplified.
97 /// This must behave as a stack -- new nodes to process are pushed onto the
101 /// due to nodes being deleted from the underlying DAG.
106 /// This is used to find and remove nodes from the worklist (by nulling
108 /// stable indices of nodes within the worklist
[all...] |
