HomeSort by relevance Sort by last modified time
    Searched refs:Node (Results 476 - 500 of 2695) sorted by null

<<11121314151617181920>>

  /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/metamodel/
StatementMetaModel.java 4 import com.github.javaparser.ast.Node;
12 protected StatementMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
TypeDeclarationMetaModel.java 4 import com.github.javaparser.ast.Node;
12 protected TypeDeclarationMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
TypeMetaModel.java 4 import com.github.javaparser.ast.Node;
12 protected TypeMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
  /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/
JsonPrinter.java 3 import com.github.javaparser.ast.Node;
25 public String output(Node node) {
26 return output(node, null, 0);
29 public String output(Node node, String name, int level) {
30 assertNotNull(node);
31 NodeMetaModel metaModel = node.getMetaModel();
44 content.add(q(attributeMetaModel.getName()) + ":" + q(attributeMetaModel.getValue(node).toString()));
48 Node value = (Node) subNodeMetaModel.getValue(node)
    [all...]
XmlPrinter.java 3 import com.github.javaparser.ast.Node;
23 public String output(Node node) {
25 output(node, "root", 0, output);
29 public void output(Node node, String name, int level, StringBuilder builder) {
30 assertNotNull(node);
31 NodeMetaModel metaModel = node.getMetaModel();
43 builder.append(attribute(attributeMetaModel.getName(), attributeMetaModel.getValue(node).toString()));
48 Node value = (Node) subNodeMetaModel.getValue(node)
    [all...]
  /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/concretesyntaxmodel/
CsmChar.java 24 import com.github.javaparser.ast.Node;
36 public void prettyPrint(Node node, SourcePrinter printer) {
38 printer.print(property.getValueAsStringAttribute(node));
CsmString.java 24 import com.github.javaparser.ast.Node;
36 public void prettyPrint(Node node, SourcePrinter printer) {
38 printer.print(property.getValueAsStringAttribute(node));
  /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/resolution/
SymbolResolver.java 24 import com.github.javaparser.ast.Node;
34 <T> T resolveDeclaration(Node node, Class<T> resultClass);
  /external/javaparser/javaparser-core/src/main/javacc-support/com/github/javaparser/
RangedList.java 3 import com.github.javaparser.ast.Node;
9 class RangedList<T extends Node> {
  /external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/declarators/
NoSymbolDeclarator.java 19 import com.github.javaparser.ast.Node;
29 public class NoSymbolDeclarator<N extends Node> extends AbstractSymbolDeclarator<N> {
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/
NodeWithType.java 25 import com.github.javaparser.ast.Node;
30 * A node having a type.
60 ((Node) this).tryAddImportToParentCompilationUnit(typeClass);
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGPrinter.cpp 43 static unsigned numEdgeDestLabels(const void *Node) {
44 return ((const SDNode *) Node)->getNumValues();
47 static std::string getEdgeDestLabel(const void *Node, unsigned i) {
48 return ((const SDNode *) Node)->getValueType(i).getEVTString();
52 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) {
53 return itostr(I - SDNodeIterator::begin((const SDNode *) Node));
57 /// should actually target another edge source, not a node. If this method
60 static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {
65 /// called to determine which outgoing edge of Node is the target of this
68 static EdgeIter getEdgeTarget(const void *Node, EdgeIter I)
    [all...]
  /external/snakeyaml/src/test/java/examples/jodatime/
JodaTimeImplicitContructor.java 23 import org.yaml.snakeyaml.nodes.Node;
35 public Object construct(Node node) {
36 Date date = (Date) super.construct(node);
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue171/
CustomRepresenter.java 18 import org.yaml.snakeyaml.nodes.Node;
29 public Node representData(Object data) {
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/
ScalarNodeTest.java 27 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
28 assertEquals(NodeId.scalar, node.getNodeId());
32 Node node = new ScalarNode(new Tag("str"), "text", null, null, '>'); local
33 assertTrue(node.toString().contains("ScalarNode"));
34 assertTrue(node.toString().contains("tag="));
35 assertTrue(node.toString().contains("value="));
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGPrinter.cpp 41 static unsigned numEdgeDestLabels(const void *Node) {
42 return ((const SDNode *) Node)->getNumValues();
45 static std::string getEdgeDestLabel(const void *Node, unsigned i) {
46 return ((const SDNode *) Node)->getValueType(i).getEVTString();
50 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) {
51 return itostr(I - SDNodeIterator::begin((const SDNode *) Node));
55 /// should actually target another edge source, not a node. If this method
58 static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {
63 /// called to determine which outgoing edge of Node is the target of this
66 static EdgeIter getEdgeTarget(const void *Node, EdgeIter I)
    [all...]
  /external/syzkaller/pkg/ast/
clone.go 14 func (n *NewLine) Clone() Node {
20 func (n *Comment) Clone() Node {
27 func (n *Include) Clone() Node {
34 func (n *Incdir) Clone() Node {
41 func (n *Define) Clone() Node {
49 func (n *Resource) Clone() Node {
58 func (n *TypeDef) Clone() Node {
80 func (n *Call) Clone() Node {
95 func (n *Struct) Clone() Node {
106 func (n *IntFlags) Clone() Node {
    [all...]
  /external/tensorflow/tensorflow/compiler/jit/
encapsulate_util.h 31 // stored in node attribute `kXlaInferredShapesAttrName`.
38 // Attribute indicating that some ops in this node's XLA computation has control
39 // dependency on this node. Attribute value will always be "true".
42 // Attribute indicating that this node has control dependency on some ops in
43 // this node's XLA computation. Attribute value will always be "true".
46 // Attribute indicating that this is an Placeholder node added to act as a
47 // temporary input node for an outside compilation node. Attribute value will be
48 // string (original input node name).
51 // Attribute indicating that this is an Placeholder node added to act as
87 Node* node; member in struct:tensorflow::XlaClusterInfo
    [all...]
  /external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
segment.h 34 // Vector of segments, each entry contains a set of node pointers and a device
37 std::vector<std::pair<std::set<const Node*>, string>>;
48 // @param candidate_fn A function that returns OK for a Node* if
49 // that node can be handled by TensorRT.
55 const std::function<Status(const Node*)>& candidate_fn,
  /external/tensorflow/tensorflow/compiler/tf2xla/
tf2xla_util.h 49 // Returns node:port for the given <id>.
55 Status SetNodeShardingFromNeighbors(Node* n, bool out_edges);
64 // Indicates how a FunctionDef is associated with a graph node (e.g. the node is
65 // a function call, or the node has function attrs).
74 // The function is an attr of the node.
81 // The node is a function call.
89 // The node is a SymbolicGradient op.
126 // Gets functions associated with the node. Current cases:
127 // 1. For function call node, its function name
    [all...]
  /external/tensorflow/tensorflow/core/common_runtime/
parallel_concat_optimizer.cc 45 gtl::InlinedVector<Node*, 2> matches;
46 for (Node* n : g->op_nodes()) {
51 for (Node* n : matches) {
73 // Add the start node
74 Node* start;
81 std::vector<Node*> control_nodes;
89 Node* update;
104 for (Node* s : control_nodes) {
107 Node* identity_node;
110 // Remove the node and redirect edges
    [all...]
  /external/tensorflow/tensorflow/core/graph/
algorithm_test.cc 48 const std::vector<Node*>& inputs, string* error) {
54 for (const Node* node : inputs) {
55 if (!seen_before && after_node == node->name()) {
60 if (before_node == node->name()) {
62 } else if (after_node == node->name()) {
80 Node* w1 = SourceOp("TestParams", b.opts().WithName("W1"));
81 Node* w2 = SourceOp("TestParams", b.opts().WithName("W2"));
82 Node* input =
84 Node* t1 = BinaryOp("TestMul", w1, {input, 1}, b.opts().WithName("t1"))
    [all...]
collective_order_test.cc 40 for (const Node* src : graph.nodes()) {
67 for (const Node* node : graph.nodes()) {
68 if (node->IsCollective() ||
69 wait_for_map.find(node->name()) == wait_for_map.end()) {
73 TF_EXPECT_OK(GetNodeAttr(node->attrs(), "wait_for", &wait_for_actual));
74 auto wait_for_expected = wait_for_map.at(node->name());
79 Node* CollectiveReduceNode(GraphDefBuilder* builder, Node* input,
82 Node* collective_node
    [all...]
  /external/v8/src/builtins/
builtins-intl-gen.cc 36 Node* const string = Parameter(Descriptor::kString);
37 Node* const context = Parameter(Descriptor::kContext);
53 Node* const instance_type = to_direct.instance_type();
60 Node* const dst = AllocateSeqOneByteString(context, length);
66 Node* const dst_ptr = PointerToSeqStringData(dst);
70 Node* const start_address = to_direct.PointerToData(&call_c);
74 Node* const to_lower_table_addr =
81 [=, &var_cursor, &var_did_change](Node* current) {
82 Node* c = Load(MachineType::Uint8(), current);
83 Node* lower
    [all...]
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/
EqualsVisitor.java 106 public class EqualsVisitor implements GenericVisitor<Boolean, Node> {
110 public static boolean equals(final Node n1, final Node n2) {
119 * Check for equality that can be applied to each kind of node,
122 private boolean commonNodeEquality(Node n1, Node n2) {
129 private <T extends Node> boolean nodesEquals(final List<T> nodes1, final List<T> nodes2) {
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) {
172 @Override public Boolean visit(final CompilationUnit n1, final Node arg) {
194 @Override public Boolean visit(final PackageDeclaration n1, final Node arg)
    [all...]

Completed in 622 milliseconds

<<11121314151617181920>>