Searched defs:Node (Results 1 - 25 of 302) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DRecognitionException.cs221 public object Node { property in class:Antlr.Runtime.RecognitionException
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
H A DRecognitionException.cs256 public object Node property in class:Antlr.Runtime.RecognitionException
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java38 public static class Node { class in class:Graph
40 List<Node> edges; // points at which nodes?
42 public Node(Object payload) { this.payload = payload; } method in class:Graph.Node
44 public void addEdge(Node n) {
45 if ( edges==null ) edges = new ArrayList<Node>();
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>();
57 Node a_node = getNode(a);
58 Node b_node = getNode(b);
62 protected Node getNod
[all...]
/external/apache-xml/src/main/java/org/apache/xml/serializer/
H A DToHTMLStream.java2054 final Node m_Root;
2067 m_Root = new Node();
2078 m_Root = new Node();
2100 Node node = m_Root;
2104 Node nextNode =
2115 Node newNode = new Node();
2164 Node node = m_Root;
2233 private class Node class in class:ToHTMLStream.Trie
2237 * Constructor, creates a Node[ALPHA_SIZ
2239 Node() method in class:ToHTMLStream.Trie.Node
[all...]
/external/chromium_org/base/containers/
H A Dlinked_list_unittest.cc12 class Node : public LinkNode<Node> { class in namespace:base::__anon2210
14 explicit Node(int id) : id_(id) {} function in class:base::__anon2210::Node
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
51 void ExpectListContents(const LinkedList<Node>& list,
65 LinkedList<Node> list;
72 LinkedList<Node> list;
75 Node n1(1);
85 Node n
[all...]
/external/chromium_org/build/android/gyp/util/
H A Dbuild_utils.py273 def Node(dep): function in function:GetSortedTransitiveDependencies
287 unsorted_deps = dict(map(Node, all_deps))
/external/chromium_org/cc/resources/
H A Dtask_graph_runner.h43 struct Node { struct in struct:cc::TaskGraph
48 bool operator()(const Node& node) const { return node.task == task_; }
54 typedef std::vector<Node> Vector;
56 Node(Task* task, unsigned priority, size_t dependencies) function in struct:cc::TaskGraph::Node
80 Node::Vector nodes;
/external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/omaha/
H A DXMLParser.java31 static final class Node { class in class:XMLParser
34 public final List<Node> children;
36 public Node(String tagName) { method in class:XMLParser.Node
39 children = new ArrayList<Node>();
43 private final Node mRootNode;
44 private final Stack<Node> mTagStack;
47 mRootNode = new Node(null);
48 mTagStack = new Stack<Node>();
75 public Node getRootNode() {
84 Node currentNod
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/
H A Dexterns.js5 Node.prototype.role;
0 Node.prototype.role; class
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dmath_semantic_tree.js16 goog.provide('cvox.SemanticTree.Node');
36 * @type {Node}
40 /** @type {cvox.SemanticTree.Node} */
46 * @param {number} id Node id.
49 cvox.SemanticTree.Node = function(id) {
56 /** @type {cvox.SemanticTree.Node} */
68 /** @type {!Array.<cvox.SemanticTree.Node>} */
76 * @type {!Array.<cvox.SemanticTree.Node>}
85 * @param {function(cvox.SemanticTree.Node): boolean} pred The predicate.
86 * @return {!Array.<cvox.SemanticTree.Node>} Th
[all...]
/external/chromium_org/chrome/browser/sync_file_system/
H A Dsubtree_set.cc13 SubtreeSet::Node::Node() function in class:sync_file_system::SubtreeSet::Node
18 SubtreeSet::Node::Node(bool contained_as_subtree_root, function in class:sync_file_system::SubtreeSet::Node
56 = Node(true, 1);
H A Dsubtree_set.h39 struct Node { struct in class:sync_file_system::SubtreeSet
43 Node();
44 Node(bool contained_as_subtree_root,
49 typedef base::hash_map<StringType, Node> Subtrees;
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/managed_bookmarks/
H A Dbackground.js65 var Node = function(nodesMap, id, title, url) { class
77 Node.prototype.isRoot = function() {
81 Node.prototype.getIndex = function() {
85 Node.prototype.appendChild = function(node) {
90 Node.prototype.droppedFromParent = function() {
105 Node.prototype.matches = function(bookmark) {
114 Node.prototype.updateChildren = function(wantedChildren, callbackChain) {
133 // The "id" comes with the callback from bookmarks.create() but the Node
135 var newChild = new Node(
165 * Creates new nodes in the bookmark model to represent this Node an
[all...]
/external/chromium_org/courgette/
H A Dadjustment_method.cc134 struct Node { struct in namespace:courgette
135 Node(LabelInfo* in_edge, Node* prev) function in struct:courgette::Node
141 Node* prev_; // Node at shorter length.
144 typedef std::map<LabelInfo*, Node*> Edges;
147 std::list<Node*> edges_in_frequency_order;
157 static std::string ToString(Node* node) {
159 for (Node* n = node; n->prev_; n = n->prev_)
182 bool operator()(Node*
[all...]
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/
H A Dnode.cc28 Node::Node(Filesystem* filesystem) : filesystem_(filesystem) { function in class:nacl_io::Node
42 Node::~Node() {
45 Error Node::Init(int open_flags) {
49 void Node::Destroy() {
55 EventEmitter* Node::GetEventEmitter() {
59 uint32_t Node::GetEventStatus() {
66 bool Node::CanOpen(int open_flags) {
79 Error Node
[all...]
H A Dnode.h29 class Node;
32 typedef sdk_util::ScopedRef<Node> ScopedNode;
36 class Node : public sdk_util::RefObject { class in namespace:nacl_io
38 explicit Node(Filesystem* filesystem);
39 virtual ~Node();
49 // Returns the emitter for this Node if it has one, if not, assume this
58 // It is expected that the derived Node will fill with 0 when growing
/external/chromium_org/net/spdy/
H A Dspdy_priority_forest.h114 struct Node { struct in class:net::SpdyPriorityForest
115 Node() : type(ROOT_NODE), flags(0), child() { function in struct:net::SpdyPriorityForest::Node
127 typedef base::hash_map<NodeId, Node> NodeMap;
129 // Constants for the Node.flags bitset:
144 const Node* FindNode(NodeId node_id) const;
146 NodeMap all_nodes_; // maps from node IDs to Node objects
173 Node* new_node = &all_nodes_[node_id];
186 Node* parent = &all_nodes_[parent_id];
191 Node* new_node = &all_nodes_[node_id];
203 const Node
[all...]
H A Dspdy_priority_tree.h54 struct Node { struct in class:net::SpdyPriorityTree
55 Node();
56 ~Node();
138 const Node* FindNode(NodeId node_id) const;
151 typedef base::hash_map<NodeId, Node> NodeMap;
153 NodeMap all_nodes_; // maps from node IDs to Node objects
160 Node* root_node = &all_nodes_[kRootNodeId];
173 SpdyPriorityTree<NodeId>::Node::Node() : function in class:net::SpdyPriorityTree::Node
185 SpdyPriorityTree<NodeId>::Node
[all...]
/external/chromium_org/remoting/test/
H A Dfake_network_dispatcher.h28 class Node { class in class:remoting::FakeNetworkDispatcher
30 virtual ~Node() {};
49 void AddNode(Node* node);
50 void RemoveNode(Node* node);
58 typedef std::map<rtc::IPAddress, Node*> NodesMap;
/external/chromium_org/remoting/webapp/js_proto/
H A Ddom_proto.js87 Node.prototype.getAttribute = function(name) { };
90 Node.prototype.value;
93 Node.prototype.style;
80 Node.prototype.getAttribute = function(name) { }; class
/external/chromium_org/testing/gtest/test/
H A Dgtest_xml_outfiles_test.py37 from xml.dom import minidom, Node namespace
H A Dgtest_xml_output_unittest.py41 from xml.dom import minidom, Node namespace
H A Dgtest_xml_test_utils.py37 from xml.dom import minidom, Node namespace
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]:
140 if (child.nodeType == Node.CDATA_SECTION_NODE or
186 if child.nodeType == Node
[all...]

Completed in 780 milliseconds

1234567891011>>