HomeSort by relevance Sort by last modified time
    Searched refs:Node (Results 26 - 50 of 3612) sorted by null

12 3 4 5 6 7 8 91011>>

  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/
Node.java 1 /* Generated By:JJTree: Do not edit this line. Node.java */
9 public interface Node {
11 /** This method is called after the node has been made the current
12 node. It indicates that child nodes can now be added to it. */
19 /** This pair of methods are used to inform the node of its
21 public void jjtSetParent(Node n);
22 public Node jjtGetParent();
24 /** This method tells the node to add its argument to the node's
26 public void jjtAddChild(Node n, int i)
    [all...]
  /external/clang/test/CXX/expr/expr.post/expr.ref/
p3.cpp 4 template<typename T> struct Node {
8 Node<T> n[1];
14 Node<int> n;
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/
Construct.java 18 import org.yaml.snakeyaml.nodes.Node;
21 * Provide a way to construct a Java instance out of the composed Node. Support
23 * Node Graph)
33 * @param node
34 * composed Node
37 Object construct(Node node);
43 * @param node
44 * composed Node
47 * <code>construct(Node node)</code> for the provided Nod
    [all...]
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/
NodeTuple.java 23 private Node keyNode;
24 private Node valueNode;
26 public NodeTuple(Node keyNode, Node valueNode) {
35 * Key node.
37 public Node getKeyNode() {
42 * Value node.
46 public Node getValueNode() {
AnchorNode.java 18 public class AnchorNode extends Node {
20 private Node realNode;
22 public AnchorNode(Node realNode) {
32 public Node getRealNode() {
  /external/apache-xml/src/main/java/org/apache/xml/utils/
NodeConsumer.java 23 import org.w3c.dom.Node;
35 * Set the node that is originating the SAX event.
37 * @param n Reference to node that originated the current event.
39 public void setOriginatingNode(Node n);
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/
Represent.java 18 import org.yaml.snakeyaml.nodes.Node;
21 * Create a Node Graph out of the provided Native Data Structure (Java
29 * Create a Node
33 * @return Node to dump
35 Node representData(Object data);
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/
AnchorGenerator.java 18 import org.yaml.snakeyaml.nodes.Node;
22 String nextAnchor(Node node);
  /external/v8/src/compiler/
js-inlining.h 35 Reduction Reduce(Node* node) final;
39 Reduction ReduceJSCall(Node* node);
53 bool DetermineCallTarget(Node* node,
55 void DetermineCallContext(Node* node, Node*& context_out,
58 Node* CreateArtificialFrameState(Node* node, Node* outer_frame_state
    [all...]
int64-lowering.h 11 #include "src/compiler/node-marker.h"
37 Node* low;
38 Node* high;
47 void PrepareReplacements(Node* node);
48 void PushNode(Node* node);
49 void LowerNode(Node* node);
50 bool DefaultLowering(Node* node, bool low_word_only = false)
64 Node* node; member in struct:v8::internal::compiler::Int64Lowering::NodeState
    [all...]
js-graph.h 9 #include "src/compiler/common-node-cache.h"
14 #include "src/compiler/node-properties.h"
44 Node* AllocateInNewSpaceStubConstant();
45 Node* AllocateInOldSpaceStubConstant();
46 Node* ToNumberBuiltinConstant();
47 Node* CEntryStubConstant(int result_size,
51 Node* EmptyFixedArrayConstant();
52 Node* EmptyStringConstant();
53 Node* FixedArrayMapConstant();
54 Node* FixedDoubleArrayMapConstant()
    [all...]
js-native-context-specialization.h 53 Reduction Reduce(Node* node) final;
56 Reduction ReduceJSAdd(Node* node);
57 Reduction ReduceJSGetSuperConstructor(Node* node);
58 Reduction ReduceJSInstanceOf(Node* node);
59 Reduction ReduceJSOrdinaryHasInstance(Node* node);
    [all...]
loop-variable-optimizer.h 16 class Node;
20 Node* phi() const { return phi_; }
21 Node* arith() const { return arith_; }
22 Node* increment() const { return increment_; }
23 Node* init_value() const { return init_value_; }
28 Bound(Node* bound, ConstraintKind kind) : bound(bound), kind(kind) {}
30 Node* bound;
42 InductionVariable(Node* phi, Node* arith, Node* increment, Node* init_value
    [all...]
simd-scalar-lowering.h 11 #include "src/compiler/node-marker.h"
37 Node* node[kMaxLanes]; member in struct:v8::internal::compiler::SimdScalarLowering::Replacement
47 void LowerNode(Node* node);
48 bool DefaultLowering(Node* node);
50 void ReplaceNode(Node* old, Node** new_nodes);
51 bool HasReplacement(size_t index, Node* node)
65 Node* node; member in struct:v8::internal::compiler::SimdScalarLowering::NodeState
    [all...]
  /development/samples/IntentPlayground/src/com/example/android/intentplayground/
LauncherActivity.java 33 Node mRoot = new Node(new ComponentName(this, LauncherActivity.class));
36 mRoot.addChild( new Node(new ComponentName(this, SingleTaskActivity.class)))
37 .addChild( new Node(new ComponentName(this, DocumentLaunchAlwaysActivity.class)))
38 .addChild( new Node(new ComponentName(this, DocumentLaunchIntoActivity.class)));
40 Node taskAffinity1 = new Node(new ComponentName(this, TaskAffinity1Activity.class));
42 .addChild(new Node(new ComponentName(this, TaskAffinity1Activity.class)))
43 .addChild(new Node(new ComponentName(this, TaskAffinity1Activity.class)));
44 Node taskAffinity2 = new Node(new ComponentName(this, ClearTaskOnLaunchActivity.class))
    [all...]
  /external/libchrome/sandbox/linux/bpf_dsl/
codegen.h 33 // CodeGen::Node allow, branch, dag;
58 // Node represents a node within the instruction DAG being compiled.
59 using Node = Program::size_type;
61 // kNullNode represents the "null" node; i.e., the reserved node
63 static const Node kNullNode = -1;
68 // MakeInstruction creates a node representing the specified
69 // instruction, or returns and existing equivalent node if one
73 Node MakeInstruction(uint16_t code
    [all...]
  /frameworks/base/tools/aapt2/
DominatorTree.h 33 * A node in the tree represents a resource configuration.
53 class Node {
55 explicit Node(ResourceConfigValue* value = nullptr, Node* parent = nullptr)
60 inline Node* parent() const { return parent_; }
64 inline const std::vector<std::unique_ptr<Node>>& children() const {
68 bool TryAddChild(std::unique_ptr<Node> new_child);
71 bool AddChild(std::unique_ptr<Node> new_child);
72 bool Dominates(const Node* other) const;
75 Node* parent_
    [all...]
  /external/clang/lib/AST/
StmtPrinter.cpp 96 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED {
99 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED {
102 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node);
106 void Visit##CLASS(CLASS *Node);
117 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) {
119 for (auto *I : Node->body())
134 void StmtPrinter::VisitNullStmt(NullStmt *Node) {
138 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) {
140 PrintRawDeclStmt(Node);
144 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) {
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Graph.java 32 /** A generic graph with edges; Each node as a single Object payload.
38 public static class Node {
40 List<Node> edges; // points at which nodes?
42 public Node(Object payload) { this.payload = payload; }
44 public void addEdge(Node n) {
45 if ( edges==null ) edges = new ArrayList<Node>();
52 /** Map from node payload to node containing it */
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>();
    [all...]
  /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
PCommand.java 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PCommand extends Node
PExpression.java 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PExpression extends Node
PPosition.java 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PPosition extends Node
PVariable.java 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PVariable extends Node
  /frameworks/compile/mclinker/unittests/
GCFactoryListTraitsTest.h 30 * \brief Node used in the test
35 class Node : public llvm::ilist_node<Node> {
43 Node() : m_Init(0), m_Value(0) {}
45 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) {}
54 class NodeFactory : public mcld::GCFactory<Node, 0> {
56 NodeFactory() : mcld::GCFactory<Node, 0>(16) {}
58 Node* produce(unsigned pInit) {
59 Node* result = allocate();
60 new (result) Node(pInit)
    [all...]
  /libcore/luni/src/main/java/org/w3c/dom/
NodeList.java 29 * @return The node at the <code>index</code>th position in the
33 public Node item(int index);
36 * The number of nodes in the list. The range of valid child node indices

Completed in 1180 milliseconds

12 3 4 5 6 7 8 91011>>