| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src_rss/org/eclipse/releng/generators/rss/ |
| RSSFeedUpdateEntryTask.java | 37 import org.w3c.dom.Node;
78 private Node foundNode = null;
140 Node newNode=findAndReplace(document);
168 // get/set the desired node
169 public Node getFoundNode()
173 private void setFoundNode(Node foundNode)
178 // has the desired node been found?
188 // has the desired node been changed?
211 private Node findAndReplace(Document document) {
212 Node parentEntryNode = null
219 Node node = (Node)nodelist.item(i); local
274 Node node = nodeIn; local
[all...] |
| /external/hamcrest/library/src/org/hamcrest/xml/ |
| HasXPath.java | 7 import org.w3c.dom.Node;
16 * Applies a Matcher to a given XML Node in an existing XML Node tree, specified by an XPath expression.
20 public class HasXPath extends TypeSafeMatcher<Node> {
42 public boolean matchesSafely(Node item) {
65 public static Matcher<Node> hasXPath(String xPath, Matcher<String> valueMatcher) {
70 public static Matcher<Node> hasXPath(String xPath) {
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| bpf_dsl.cc | 28 CodeGen::Node Compile(PolicyCompiler* pc) const override {
57 CodeGen::Node Compile(PolicyCompiler* pc) const override {
82 CodeGen::Node Compile(PolicyCompiler* pc) const override {
85 CodeGen::Node then_node = then_result_->Compile(pc);
86 CodeGen::Node else_node = else_result_->Compile(pc);
108 CodeGen::Node Compile(PolicyCompiler* pc,
109 CodeGen::Node then_node,
110 CodeGen::Node else_node) const override {
130 CodeGen::Node Compile(PolicyCompiler* pc,
131 CodeGen::Node then_node
[all...] |
| /external/v8/src/compiler/ |
| state-values-utils.cc | 24 if (node_key1->node == nullptr) {
25 if (node_key2->node == nullptr) {
30 node_key2->node);
33 if (node_key2->node == nullptr) {
36 node_key1->node);
38 return node_key1->node == node_key2->node;
46 bool StateValuesCache::IsKeysEqualToNode(StateValuesKey* key, Node* node) {
47 if (key->count != static_cast<size_t>(node->InputCount()))
110 Node* node; local
138 Node* node() { function in class:v8::internal::compiler::StateValuesCache::ValueArrayIterator
152 Node* node = it->node(); local
[all...] |
| typer.cc | 13 #include "src/compiler/node.h"
14 #include "src/compiler/node-properties.h"
26 void Decorate(Node* node) final;
86 Reduction Reduce(Node* node) override {
87 if (node->op()->ValueOutputCount() == 0) return NoChange();
88 switch (node->opcode()) {
91 return UpdateType(node, TypeBinaryOp(node, x##Typer))
[all...] |
| /external/v8/src/ |
| splay-tree-inl.h | 25 // If the tree is empty, insert the new node.
26 root_ = new(allocator_) Node(key, Config::NoValue());
28 // Splay on the key to move the last node on the search path
37 // Insert the new node.
38 Node* node = new(allocator_) Node(key, Config::NoValue()); local
39 InsertInternal(cmp, node);
47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
285 Node* node = nodes_to_visit[pos++]; local
[all...] |
| /frameworks/rs/ |
| rsScriptGroup.h | 57 class Node {
59 Node(Script *);
78 Vector<Node *> mNodes;
98 bool calcOrderRecurse(Node *n, int depth);
100 Node * findNode(Script *s) const;
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_attrinsertbefore3.java | 61 Node testNode;
68 Node retval;
69 Node firstChild;
70 Node lastChild;
71 Node refChild = null;
|
| hc_attrinsertbefore4.java | 61 Node testNode;
68 Node retval;
69 Node firstChild;
70 Node lastChild;
71 Node refChild;
|
| hc_nodechildnodesappendchild.java | 32 * is live. Changes on the node's children are immediately
71 Node employeeNode;
73 Node createdNode;
74 Node childNode;
77 Node textNode;
96 childNode = (Node) childList.item(indexN10087);
|
| hc_noderemovechildnode.java | 31 * The "removeChild(oldChild)" method removes the node
67 Node employeeNode;
69 Node oldChild;
70 Node child;
73 Node removedChild;
89 emList = ((Element) /*Node */employeeNode).getElementsByTagName("em");
95 child = (Node) childList.item(indexN10098);
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| setNamedItemNS04.java | 39 * which contains an ENTITY_REFERENCE child node. Get access to the node's
40 * map. Try to add an attribute node specified by arg with
81 Node testAddress;
83 Node child;
85 Node child2;
87 Node arg;
88 Node setNode;
|
| /libcore/luni/src/test/java/tests/org/w3c/dom/ |
| LocalName.java | 3 import org.w3c.dom.Node;
12 * The "getLocalName()" method for a Node returns the local part of the
13 * qualified name of this node, and for nodes of any type other than
17 * Retrieve the first emp:address node and get the attributes of this node."
71 Node createdNode;
81 Node testEmployee;
82 Node textNode;
94 Node testEmployee;
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeBuilderTest.java | 48 @DataProvider(name = "Node.Builder")
55 List<Function<Integer, Node.Builder<Integer>>> ms = Arrays.asList(
63 for (Function<Integer, Node.Builder<Integer>> m : ms) {
71 @Test(dataProvider = "Node.Builder", groups = { "serialization-hostile" })
72 public void testIteration(List<Integer> l, Function<Integer, Node.Builder<Integer>> m) {
73 Node.Builder<Integer> nb = m.apply(l.size());
80 Node<Integer> n = nb.build();
91 // Node.Builder.OfInt
93 @DataProvider(name = "Node.Builder<Integer>")
100 List<Function<Integer, Node.Builder<Integer>>> ms = Arrays.asList
[all...] |
| DoubleNodeTest.java | 48 List<Node<Double>> nodes = new ArrayList<>();
50 nodes.add(Nodes.node(array));
52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l))));
56 for (Node<Double> node : nodes) {
57 params.add(new Object[]{array, node});
90 private Node.OfDouble fill(double[] array, Node.Builder.OfDouble nb) {
98 private Node.OfDouble degenerateTree(PrimitiveIterator.OfDouble it) {
100 return Nodes.node(new double[0])
[all...] |
| IntNodeTest.java | 48 List<Node<Integer>> nodes = new ArrayList<>();
50 nodes.add(Nodes.node(array));
52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l))));
56 for (Node<Integer> node : nodes) {
57 params.add(new Object[]{array, node});
90 private Node.OfInt fill(int[] array, Node.Builder.OfInt nb) {
98 private Node.OfInt degenerateTree(PrimitiveIterator.OfInt it) {
100 return Nodes.node(new int[0])
[all...] |
| LongNodeTest.java | 48 List<Node<Long>> nodes = new ArrayList<>();
50 nodes.add(Nodes.node(array));
52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l))));
56 for (Node<Long> node : nodes) {
57 params.add(new Object[]{array, node});
90 private Node.OfLong fill(long[] array, Node.Builder.OfLong nb) {
98 private Node.OfLong degenerateTree(PrimitiveIterator.OfLong it) {
100 return Nodes.node(new long[0])
[all...] |
| /external/deqp/modules/gles31/functional/ |
| es31fProgramInterfaceQueryTests.cpp | 214 class Node
235 typedef de::SharedPtr<const Node> SharedPtr;
237 Node (NodeType type, const SharedPtr& enclosingNode) : m_type(type), m_enclosingNode(enclosingNode) { DE_ASSERT(type < TYPE_LAST); }
238 virtual ~Node (void) { }
240 inline const Node* getEnclosingNode (void) const { return m_enclosingNode.get(); }
248 class Program : public Node
252 : Node (TYPE_PROGRAM, SharedPtr())
260 class Shader : public Node
264 : Node (TYPE_SHADER, enclosingNode)
276 class DefaultBlock : public Node
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeProxy.java | 40 import org.w3c.dom.Node;
50 * <code>DTMNodeProxy</code> presents a DOM Node API front-end to the DTM model.
52 * It does _not_ attempt to address the "node identity" question; no effort
54 * DTM node. Users can create a mechanism for managing this, or relinquish the
58 * DTMNodeProxy may be subclassed further to present specific DOM node types.
64 implements Node, Document, Text, Element, Attr,
68 /** The DTM for this node. */
71 /** The DTM node handle. */
72 int node; field in class:DTMNodeProxy
81 * Create a DTMNodeProxy Node representing a specific Node in a DT
1096 Node node = map.getNamedItem(name); local
[all...] |
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| AbstractInjectorGrapherTest.java | 48 final Set<Node> nodes = Sets.newHashSet();
56 @Override protected void newInterfaceNode(InterfaceNode node) {
57 assertFalse(nodes.contains(node));
58 nodes.add(node);
61 @Override protected void newImplementationNode(ImplementationNode node) {
62 assertFalse(nodes.contains(node));
63 nodes.add(node);
66 @Override protected void newInstanceNode(InstanceNode node) {
67 assertFalse(nodes.contains(node));
68 nodes.add(node);
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedTransferQueue.java | 69 * requests. When a thread tries to enqueue a data node, but
70 * encounters a request node, it instead "matches" and removes it;
84 * (matched) node that in turn points to the first actual
85 * (unmatched) queue node (or null if empty); and "tail" that
86 * points to the last node on the queue (or again null if
105 * In a dual queue, each node must atomically maintain its match
107 * this here as: for a data-mode node, matching entails CASing an
120 * Once a node is matched, its match status can never again
128 * from a pointer to the initial node; CASing the item of the
129 * first unmatched node on match and CASing the next field of th
[all...] |
| LinkedBlockingDeque.java | 57 * keep all Nodes GC-reachable from a predecessor dequeued Node.
61 * a Node was tenured while live, which generational GCs have a
66 * linking a Node that has just been dequeued to itself. Such a
80 /** Doubly-linked list node class */
81 static final class Node<E> {
83 * The item, or null if this node has been removed.
89 * - the real predecessor Node
90 * - this Node, meaning the predecessor is tail
93 Node<E> prev;
97 * - the real successor Node
314 Node<E> node = new Node<E>(e); local
329 Node<E> node = new Node<E>(e); local
345 Node<E> node = new Node<E>(e); local
362 Node<E> node = new Node<E>(e); local
380 Node<E> node = new Node<E>(e); local
403 Node<E> node = new Node<E>(e); local
[all...] |
| /external/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 128 // the IR, and everything in our module is an entry node, so just directly
129 // build variables for each node.
131 LazyCallGraph::Node &A1 = *I++;
133 LazyCallGraph::Node &A2 = *I++;
135 LazyCallGraph::Node &A3 = *I++;
137 LazyCallGraph::Node &B1 = *I++;
139 LazyCallGraph::Node &B2 = *I++;
141 LazyCallGraph::Node &B3 = *I++;
143 LazyCallGraph::Node &C1 = *I++;
145 LazyCallGraph::Node &C2 = *I++
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| MsgMgr.java | 29 import org.w3c.dom.Node;
115 * @param styleNode Stylesheet node
116 * @param sourceNode Source tree node
124 public void warn(SourceLocator srcLctr, Node styleNode, Node sourceNode, String msg)
133 * @param styleNode Stylesheet node
134 * @param sourceNode Source tree node
143 public void warn(SourceLocator srcLctr, Node styleNode, Node sourceNode, String msg, Object args[])
269 * @param styleNode Stylesheet node
[all...] |
| /ndk/sources/host-tools/nawk-20071023/ |
| awk.h | 130 /* Node: parse tree is made of nodes, with Cell's at bottom */
132 typedef struct Node {
134 struct Node *nnext;
137 struct Node *narg[1]; /* variable: actual size set by calling malloc */
138 } Node;
140 #define NIL ((Node *) 0)
142 extern Node *winner;
143 extern Node *nullstat;
144 extern Node *nullnode;
173 /* node types *
[all...] |
