Searched refs:Node (Results 501 - 525 of 1945) sorted by relevance

<<21222324252627282930>>

/external/tensorflow/tensorflow/core/graph/
H A Dgraph_def_builder.h32 // Node* Identity(NodeOut input, const GraphDefBuilder::Options& opts) {
44 // Node* Identity(NodeOut input, const GraphDefBuilder::Options& opts) {
53 // Node* na = Const(7, b.opts());
55 // Node* nb = Const(5, b.opts().WithName("control-input"));
56 // Node* nc = Identity(na, b.opts().WithControlInput(nb));
68 // Options for adding a Node to a Graph.
81 Options WithControlInput(Node* control_input) const;
82 Options WithControlInputs(gtl::ArraySlice<Node*> control_inputs) const;
96 // Methods for using options from a function that creates a Node.
114 Node* FinalizeBuilde
[all...]
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/
H A DCommentsInserter.java25 import com.github.javaparser.ast.Node;
36 import static com.github.javaparser.ast.Node.NODE_BY_BEGIN_POSITION;
67 List<Node> children = cu.getChildNodes();
82 void insertComments(Node node, TreeSet<Comment> commentsToAttribute) {
98 List<Node> children = node.getChildNodes();
100 for (Node child : children) {
117 List<Node> childrenAndComments = new LinkedList<>();
126 for (Node thing : childrenAndComments) {
154 private void attributeLineCommentsOnSameLine(TreeSet<Comment> commentsToAttribute, List<Node> children) {
175 private boolean attributeLineCommentToNodeOrChild(Node nod
[all...]
/external/v8/src/compiler/x64/
H A Dinstruction-selector-x64.cc22 bool CanBeImmediate(Node* node) {
40 int32_t GetImmediateIntegerValue(Node* node) {
49 bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input,
80 AddressingMode GenerateMemoryOperandInputs(Node* index, int scale_exponent,
81 Node* base, Node* displacement,
151 AddressingMode GetEffectiveAddressMemoryOperand(Node* operand,
191 bool CanBeBetterLeftOperand(Node* node) const {
271 void InstructionSelector::VisitLoad(Node* nod
[all...]
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DXalanTransformState.java30 import org.w3c.dom.Node;
40 Node m_node = null;
45 Node m_currentNode = null;
52 * @see org.apache.xml.serializer.TransformStateSetter#setCurrentNode(Node)
54 public void setCurrentNode(Node n) {
88 public Node getCurrentNode() {
120 public Node getMatchedNode() {
/external/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp82 pred_iterator_ty pred_begin(change_ty Node) { argument
83 assert(Predecessors.count(Node) && "Invalid node!");
84 return Predecessors[Node].begin();
86 pred_iterator_ty pred_end(change_ty Node) { argument
87 assert(Predecessors.count(Node) && "Invalid node!");
88 return Predecessors[Node].end();
91 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { argument
92 assert(PredClosure.count(Node) && "Invalid node!");
93 return PredClosure[Node].begin();
95 pred_closure_iterator_ty pred_closure_end(change_ty Node) { argument
100 succ_begin(change_ty Node) argument
104 succ_end(change_ty Node) argument
109 succ_closure_begin(change_ty Node) argument
113 succ_closure_end(change_ty Node) argument
[all...]
/external/skia/src/core/
H A DSkTLList.h33 struct Node { struct in class:SkTLList
35 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node);
38 typedef SkTInternalLList<Node> NodeList;
51 Node* node = iter.init(fList, Iter::kHead_IterStart);
58 block->fNodes[i].~Node();
70 Node* node = this->createNode();
79 Node* node = this->createNode();
89 Node* node = this->createNode();
99 Node* node = this->createNode();
116 Node* nod
[all...]
/external/skqp/src/core/
H A DSkTLList.h33 struct Node { struct in class:SkTLList
35 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node);
38 typedef SkTInternalLList<Node> NodeList;
51 Node* node = iter.init(fList, Iter::kHead_IterStart);
58 block->fNodes[i].~Node();
70 Node* node = this->createNode();
79 Node* node = this->createNode();
89 Node* node = this->createNode();
99 Node* node = this->createNode();
116 Node* nod
[all...]
/external/swiftshader/third_party/LLVM/lib/Support/
H A DDAGDeltaAlgorithm.cpp83 pred_iterator_ty pred_begin(change_ty Node) { argument
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
87 pred_iterator_ty pred_end(change_ty Node) { argument
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
92 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { argument
93 assert(PredClosure.count(Node) && "Invalid node!");
94 return PredClosure[Node].begin();
96 pred_closure_iterator_ty pred_closure_end(change_ty Node) { argument
101 succ_begin(change_ty Node) argument
105 succ_end(change_ty Node) argument
110 succ_closure_begin(change_ty Node) argument
114 succ_closure_end(change_ty Node) argument
[all...]
/external/one-true-awk/
H A Dawkgram.y30 void checkdup(Node *list, Cell *item);
33 Node *beginloc = 0;
34 Node *endloc = 0;
38 Node *arglist = 0; /* list of args for current function */
42 Node *p;
99 winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }
206 | ppattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); }
209 $$ = op3($2, NIL, $1, (Node*)makedfa(strnode($3), 0));
211 $$ = op3($2, (Node *)1, $1, $3); }
233 | pattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedf
[all...]
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
H A DParseRDF.java18 import org.w3c.dom.Node;
87 static XMPMetaImpl parse(Node xmlRoot) throws XMPException
104 static void rdf_RDF(XMPMetaImpl xmp, Node rdfRdfNode) throws XMPException
127 private static void rdf_NodeElementList(XMPMetaImpl xmp, XMPNode xmpParent, Node rdfRdfNode)
132 Node child = rdfRdfNode.getChildNodes().item(i);
161 private static void rdf_NodeElement(XMPMetaImpl xmp, XMPNode xmpParent, Node xmlNode,
167 throw new XMPException("Node element must be rdf:Description or typed node",
204 private static void rdf_NodeElementAttrs(XMPMetaImpl xmp, XMPNode xmpParent, Node xmlNode,
212 Node attribute = xmlNode.getAttributes().item(i);
280 private static void rdf_PropertyElementList(XMPMetaImpl xmp, XMPNode xmpParent, Node xmlParen
[all...]
/external/robolectric-shadows/resources/src/main/java/org/robolectric/manifest/
H A DAndroidManifest.java23 import org.w3c.dom.Node;
150 Node applicationNode = findApplicationNode(manifestDocument);
155 Node attr = attributes.item(i);
221 Node node = elementsByTagName.item(i).getAttributes().getNamedItem("android:name");
230 Node permissionNode = elementsByTagName.item(i);
249 Node permissionGroupNode = elementsByTagName.item(i);
262 private void parseContentProviders(Node applicationNode) {
263 for (Node contentProviderNode : getChildrenTags(applicationNode, "provider")) {
269 for (Node node : getChildrenTags(contentProviderNode, "path-permission")) {
291 private @Nullable String getAttributeValue(Node parentNod
[all...]
/external/doclava/src/com/google/doclava/
H A DPageMetadata.java37 import org.w3c.dom.Node;
53 * Includes a Node class that represents the metadata and lets it attach
55 * Node also includes methods for rendering the node tree to a json file
74 public PageMetadata(File source, String dest, List<Node> taglist) {
97 public static void WriteList(List<Node> rootTypeNodesList) {
99 Node pageMeta = new Node.Builder().setLabel("TOP").setChildren(rootTypeNodesList).build();
119 public static void WriteListByLang(List<Node> rootNodesList) {
121 for (Node n : rootNodesList) {
126 Node pageMet
695 public static class Node { class in class:PageMetadata
710 private Node(Builder builder) { method in class:PageMetadata.Node
[all...]
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/
H A DEqualsVisitor.java28 import com.github.javaparser.ast.Node;
78 public class EqualsVisitor implements GenericVisitor<Boolean, Node> {
82 public static boolean equals(final Node n1, final Node n2) {
94 private boolean commonNodeEquality(Node n1, Node n2) {
104 private <T extends Node> boolean nodesEquals(final List<T> nodes1, final List<T> nodes2) {
124 private <T extends Node> boolean nodeEquals(final T n1, final T n2) {
160 @Override public Boolean visit(final CompilationUnit n1, final Node arg) {
182 @Override public Boolean visit(final PackageDeclaration n1, final Node ar
[all...]
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/observer/
H A DObservableProperty.java23 import com.github.javaparser.ast.Node;
198 public Node getValueAsSingleReference(Node node) {
201 if (rawValue instanceof Node) {
202 return (Node) rawValue;
204 Optional<Node> opt = (Optional<Node>) rawValue;
218 private boolean hasMethod(Node node, String name) {
227 public NodeList<? extends Node> getValueAsMultipleReference(Node nod
[all...]
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/
H A DSerializer.java43 import org.yaml.snakeyaml.nodes.Node;
58 private Set<Node> serializedNodes;
59 private Map<Node, String> anchors;
73 this.serializedNodes = new HashSet<Node>();
74 this.anchors = new HashMap<Node, String>();
100 public void serialize(Node node) throws IOException {
118 private void anchorNode(Node node) {
133 List<Node> list = seqNode.getValue();
134 for (Node item : list) {
142 Node ke
[all...]
/external/llvm/include/llvm/ADT/
H A DEquivalenceClasses.h226 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node;
244 const ECValue *Node; member in class:llvm::EquivalenceClasses::member_iterator
252 explicit member_iterator(const ECValue *N) : Node(N) {}
255 assert(Node != nullptr && "Dereferencing end()!");
256 return Node->getData();
261 assert(Node != nullptr && "++'d off the end of the list!");
262 Node = Node->getNext();
273 return Node
[all...]
/external/protobuf/java/util/src/main/java/com/google/protobuf/util/
H A DFieldMaskTree.java67 private static class Node { class in class:FieldMaskTree
68 public TreeMap<String, Node> children = new TreeMap<String, Node>();
71 private final Node root = new Node();
101 Node node = root;
114 Node tmp = new Node();
145 private void getFieldPaths(Node node, String path, List<String> paths) {
150 for (Entry<String, Node> entr
[all...]
/external/tensorflow/tensorflow/contrib/tensorrt/segment/
H A Dsegment.cc38 const tensorflow::Node* src = edge->src();
39 const tensorflow::Node* dst = edge->dst();
51 std::vector<tensorflow::Node*> dfs_start_nodes;
52 for (tensorflow::Node* node : dst->in_nodes()) {
61 [&is_cycle, src](tensorflow::Node* node) {
75 tensorflow::Node* src = edge->src();
76 tensorflow::Node* dst = edge->dst();
135 std::vector<UnionFind<tensorflow::Node*>> node_segments;
137 tensorflow::Node* node = graph.FindNodeId(i);
153 std::vector<tensorflow::Node*> orde
[all...]
/external/libcxx/test/libcxx/containers/associative/
H A Dtree_balance_after_insert.pass.cpp20 struct Node struct
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
27 Node* __parent_unsafe() const { return __parent_; }
28 void __set_parent(Node* x) { __parent_ = x;}
30 Node() : __left_(), __right_(), __parent_(), __is_black_() {} function in struct:Node
37 Node root;
38 Node a;
39 Node
[all...]
/external/icu/icu4c/source/common/
H A Dstringtriebuilder.cpp74 Node *root=makeNode(0, elementsLength, 0, errorCode);
207 StringTrieBuilder::Node *
222 Node *node;
229 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode);
244 Node *subNode=makeBranchSubNode(start, limit, unitIndex, length, errorCode);
259 StringTrieBuilder::Node *
266 Node *lessThan[kMaxSplitBranchLevels];
308 Node *node=registerNode(listNode, errorCode);
318 StringTrieBuilder::Node *
319 StringTrieBuilder::registerNode(Node *newNod
[all...]
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/
H A DCloneVisitor.java110 public class CloneVisitor implements GenericVisitor<Node, Object> {
113 public Node visit(CompilationUnit _n, Object _arg) {
125 public Node visit(PackageDeclaration _n, Object _arg) {
139 public Node visit(ImportDeclaration _n, Object _arg) {
152 public Node visit(TypeParameter _n, Object _arg) {
165 public Node visit(LineComment _n, Object _arg) {
170 public Node visit(BlockComment _n, Object _arg) {
175 public Node visit(ClassOrInterfaceDeclaration _n, Object _arg) {
192 public Node visit(EnumDeclaration _n, Object _arg) {
208 public Node visi
[all...]
H A DModifierVisitorAdapter.java117 public class ModifierVisitorAdapter<A> implements GenericVisitor<Node, A> {
127 @Override public Node visit(final AnnotationDeclaration n, final A arg) {
150 @Override public Node visit(final AnnotationMemberDeclaration n, final A arg) {
166 @Override public Node visit(final ArrayAccessExpr n, final A arg) {
173 @Override public Node visit(final ArrayCreationExpr n, final A arg) {
189 @Override public Node visit(final ArrayInitializerExpr n, final A arg) {
203 @Override public Node visit(final AssertStmt n, final A arg) {
212 @Override public Node visit(final AssignExpr n, final A arg) {
229 @Override public Node visit(final BinaryExpr n, final A arg) {
244 @Override public Node visi
[all...]
/external/python/cpython2/Lib/lib2to3/tests/
H A Dtest_pytree.py32 """Unit tests for nodes (Base, Leaf, Node)."""
98 n1 = pytree.Node(1000, [l1, l2])
105 n1 = pytree.Node(1000, [l1, l2])
107 "Node(1000, [%s, %s])" % (repr(l1), repr(l2)))
112 n1 = pytree.Node(1000, [l1, l2])
118 n1 = pytree.Node(1000, [l1])
127 n1 = pytree.Node(1000, [l1, l2])
134 n2 = pytree.Node(1000, [n1, l3])
141 n1 = pytree.Node(1000, ())
142 n2 = pytree.Node(100
[all...]
/external/python/cpython3/Lib/lib2to3/tests/
H A Dtest_pytree.py27 """Unit tests for nodes (Base, Leaf, Node)."""
76 n1 = pytree.Node(1000, [l1, l2])
83 n1 = pytree.Node(1000, [l1, l2])
85 "Node(1000, [%s, %s])" % (repr(l1), repr(l2)))
90 n1 = pytree.Node(1000, [l1, l2])
96 n1 = pytree.Node(1000, [l1])
105 n1 = pytree.Node(1000, [l1, l2])
112 n2 = pytree.Node(1000, [n1, l3])
119 n1 = pytree.Node(1000, ())
120 n2 = pytree.Node(100
[all...]
/external/v8/src/compiler/
H A Dscheduler.cc64 Scheduler::SchedulerData* Scheduler::GetData(Node* node) {
69 Scheduler::Placement Scheduler::GetPlacement(Node* node) {
103 void Scheduler::UpdatePlacement(Node* node, Placement placement) {
116 Node* control = NodeProperties::GetControlInput(node);
150 bool Scheduler::IsCoupledControlEdge(Node* node, int index) {
156 void Scheduler::IncrementUnscheduledUseCount(Node* node, int index,
157 Node* from) {
166 Node* control = NodeProperties::GetControlInput(node);
179 void Scheduler::DecrementUnscheduledUseCount(Node* node, int index,
180 Node* fro
[all...]

Completed in 3671 milliseconds

<<21222324252627282930>>