| /external/webkit/WebCore/page/ |
| DOMSelection.cpp | 35 #include "Node.h"
44 static Node* selectionShadowAncestor(Frame* frame)
46 Node* node = frame->selection()->selection().base().anchorNode(); local
47 if (!node)
49 Node* shadowAncestor = node->shadowAncestorNode();
50 if (shadowAncestor == node)
98 Node* DOMSelection::anchorNode() const
102 if (Node* shadowAncestor = selectionShadowAncestor(m_frame)
[all...] |
| /external/webkit/WebCore/page/animation/ |
| AnimationController.cpp | 101 Node* node = it->first->node(); local
102 ASSERT(!node || (node->document() && !node->document()->inPageCache()));
103 node->setNeedsStyleRecalc(SyntheticStyleChange);
149 Vector<RefPtr<Node> >::const_iterator nodeChangesToDispatchEnd = m_nodeChangesToDispatch.end();
150 for (Vector<RefPtr<Node> >::const_iterator it = m_nodeChangesToDispatch.begin(); it != nodeChangesToDispatchEnd; ++it)
177 void AnimationControllerPrivate::addNodeChangeToDispatch(PassRefPtr<Node> node
454 Node* node = renderer->node(); local
[all...] |
| /external/webkit/WebCore/platform/ |
| DeprecatedPtrListImpl.cpp | 49 DeprecatedListNode *node = l; local
53 while (node != 0) {
54 DeprecatedListNode *copy = new DeprecatedListNode(node->data);
64 node = node->next;
99 ASSERT(!it->node);
109 for (DeprecatedListNode *node = head; node; node = next) {
110 next = node->next
127 DeprecatedListNode *node; local
147 DeprecatedListNode *node = new DeprecatedListNode(const_cast<void*>(item)); local
191 DeprecatedListNode *node = cur; local
252 DeprecatedListNode *node; local
365 DeprecatedListNode *node = head; local
[all...] |
| /external/webkit/WebCore/rendering/ |
| MediaControlElements.cpp | 52 Node* node = o->node(); local
53 Node* mediaNode = node ? node->shadowAncestorNode() : 0;
170 Node* sibling = nextSibling();
402 Node* sibling = nextSibling();
|
| RenderCounter.cpp | 95 if (Node* e = object->node()) {
123 // - A subtree rooted at any reset node in the tree is equivalent to all counter
125 // reset node.
139 // A sibling without a parent means that the counter node tree was not constructed correctly so we stop
141 // render tree at counter node creation. See bug 43812.
155 // we are a root node if that reset is a root.
160 // We are not a reset node or the previous reset must be on an ancestor of our renderer
168 // If the node we are placing is not reset or we have found a counter that is attached
169 // to an ancestor of the placed counter's renderer we know we are a sibling of that node
425 CounterNode* node = counterMap->get(it->first.get()); local
[all...] |
| RenderListItem.cpp | 40 RenderListItem::RenderListItem(Node* node)
41 : RenderBlock(node)
78 static bool isList(Node* node)
80 return (node->hasTagName(ulTag) || node->hasTagName(olTag));
83 static Node* enclosingList(Node* node)
97 Node* node = renderer->node(); local
[all...] |
| SVGRenderTreeAsText.cpp | 457 if (object.node())
458 ts << " {" << object.node()->nodeName() << "}";
512 void writeRenderResources(TextStream& ts, Node* parent)
515 Node* node = parent; local
517 if (!node->isSVGElement())
519 SVGElement* svgElement = static_cast<SVGElement*>(node);
524 RefPtr<SVGResource> resource(styled->canvasResource(node->renderer()));
535 } while ((node = node->traverseNextNode(parent)))
[all...] |
| /external/webkit/WebKit/win/ |
| DOMCoreClasses.h | 35 class Node;
83 DOMNode(WebCore::Node* n);
87 static IDOMNode* createInstance(WebCore::Node* n);
241 WebCore::Node* node() const { return m_node; } function
244 WebCore::Node* m_node;
[all...] |
| /frameworks/base/core/java/android/text/ |
| AutoText.java | 225 // There is a node for this letter, and this is the
233 // There is a node for this letter, and we need
243 // No node for this letter yet. Make one.
245 char node = newTrieNode(); local
246 mTrie[herep] = node;
|
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 848 DependencyGraph.Node node = mGraph.mKeyNodes.get(id); local
1230 final Node node = Node.acquire(view); local
1254 final Node node = roots.removeFirst(); local
1294 final Node node = nodes.get(i); local
1301 final Node node = nodes.get(i); local
1331 final Node node = nodes.get(i); local
1447 final Node node = sPool.acquire(); local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| UUID.java | 52 private transient long node; field in class:UUID
110 // setup node field
111 node = (leastSigBits & 0x0000FFFFFFFFFFFFL);
335 * The node value of the version 1, variant 2 UUID as per <a
342 public long node() { method in class:UUID
346 return node;
432 * clock-seq-low "-" node
438 * node = 6hexOctet
|
| /libcore/luni/src/main/java/java/util/prefs/ |
| Preferences.java | 26 * An instance of the class {@code Preferences} represents one node in a
33 * Every node has one name and one unique absolute path following the same
34 * notational conventions as directories in a file system. The root node's
35 * name is "", and other node name strings cannot contain the slash character
36 * and cannot be empty. The root node's absolute path is "/", and all other
38 * absolute path> + "/" + <node's name>. Since the set of nodes forms a
39 * tree with the root node at its base, all absolute paths start with the slash
40 * character. Every node has one relative path to each of its ancestors. The
41 * relative path doesn't start with slash: it equals the node's absolute path
129 * Gets the absolute path string of this preference node
502 public abstract Preferences node(String path); method in class:Preferences
[all...] |
| /libcore/luni/src/main/java/org/apache/xalan/processor/ |
| ProcessorInclude.java | 38 import org.w3c.dom.Node;
216 Node node = ((DOMSource)source).getNode(); local
235 walker.traverse(node);
|
| TransformerFactoryImpl.java | 61 import org.w3c.dom.Node;
108 public javax.xml.transform.Templates processFromNode(Node node)
119 walker.traverse(node);
194 * processFromNode(Node node, String systemID).
200 * processFromNode(Node node, String systemID).
214 * @param node A DOM tree which must contain
223 javax.xml.transform.Templates processFromNode(Node node, String systemID
262 Node node = null; local
854 Node node = dsource.getNode(); local
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 112 * Append a Node onto the vector.
114 * @param value Node to add to the vector
144 * Append a Node onto the vector.
146 * @param value Node to add to the vector
180 * Pop a node from the tail of the vector and return the result.
182 * @return the node at the tail of the vector
197 * Pop a node from the tail of the vector and return the
213 * Pop a node from the tail of the vector.
224 * Return the node at the top of the stack without popping the stack.
228 * @return Node at the top of the stack or null if stack is empty
473 int node = m_map[i]; local
567 int node = m_map[i]; local
595 int node = m_map[i]; local
622 int node = m_map[i]; local
[all...] |
| /libcore/luni/src/main/java/org/apache/xpath/axes/ |
| UnionPathIterator.java | 37 * As each node is iterated via nextNode(), the node is also stored
275 * @return A clone of this iterator that holds the same node position.
376 * Returns the next node in the set and advances the position of the
378 * to nextNode() returns the first node in the set.
379 * @return The next <code>Node</code> in the set being iterated over, or
388 // node, and get the earliest occuring in document order
398 int node = m_iterators[i].getCurrentNode(); local
400 if (DTM.NULL == node)
405 earliestNode = node;
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
| UUIDTest.java | 38 assertEquals(0xA0C91E6BF6L, uuid.node());
166 * @see UUID#node()
170 assertEquals(0x0, uuid.node());
173 assertEquals(0xFFFFFFFFFFFFL, uuid.node());
177 uuid.node();
183 uuid.node();
316 assertEquals(690568981494L, actual.node());
326 assertEquals(0L, actual.node());
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/bin_search_tree_/ |
| bin_search_tree_.hpp | 41 * This implementation uses an idea from the SGI STL (using a "header" node
142 typename Node_And_It_Traits::node>::other
145 typedef typename node_allocator::value_type node; typedef in class:__gnu_pbds::detail::PB_DS_CLASS_NAME
156 typedef cond_dealtor< node, Allocator> cond_dealtor_t;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| OutlinePage2.java | 207 * its own input as the single root node.
213 * The solution is to wrap the tree viewer input in a dummy root node that acts
299 UiElementNode node = (UiElementNode) element; local
300 ElementDescriptor desc = node.getDescriptor();
304 if (node.hasError()) {
325 UiElementNode node = (UiElementNode) element; local
326 return node.getShortDescription();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockXmlNode.java | 22 import org.w3c.dom.Node;
30 * A mock XML node with only a minimal set of information.
32 public class MockXmlNode implements Node {
44 // namespace stuff only set in the root node
49 * Constructs a node from a given children list.
51 * @param namespace The namespace of the node or null if none
52 * @param localName The XML local node name.
53 * @param node_type One of Node.xxx_NODE constants, e.g. Node.ELEMENT_NODE
66 * Constructs an attribute node
99 MockXmlNode node = mAttributes.addAttribute(namespaceURI, localName, value); local
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| LayoutRenderer.java | 94 ViewNode node = (ViewNode) selection.iterator().next(); local
97 ViewNode p = node.parent;
102 if (showExtras && node.image != null) {
103 s.drawImage(node.image, node.left, node.top, null);
105 s.drawRect(node.left, node.top, node.width - 1, node.height - 1)
[all...] |
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/xml/ |
| AndroidManifest.java | 24 import org.w3c.dom.Node;
145 XPathConstants.NODE);
148 Node node = (Node)result; local
149 if (node.getNodeValue().length() > 0) {
|
| /system/core/adb/ |
| fdevent.c | 67 static void fdevent_plist_enqueue(fdevent *node);
68 static void fdevent_plist_remove(fdevent *node);
364 static void fdevent_plist_enqueue(fdevent *node)
368 node->next = list;
369 node->prev = list->prev;
370 node->prev->next = node;
371 list->prev = node;
374 static void fdevent_plist_remove(fdevent *node)
376 node->prev->next = node->next
385 fdevent *node = list->next; local
[all...] |
| /system/core/init/ |
| init_parser.c | 247 struct listnode *node; local
249 list_for_each(node, &service_list) {
250 svc = node_to_item(node, struct service, slist);
260 struct listnode *node; local
262 list_for_each(node, &service_list) {
263 svc = node_to_item(node, struct service, slist);
273 struct listnode *node; local
275 list_for_each(node, &service_list) {
276 svc = node_to_item(node, struct service, slist);
286 struct listnode *node; local
297 struct listnode *node; local
310 struct listnode *node; local
323 struct listnode *node; local
335 struct listnode *node; local
354 struct listnode *node; local
412 struct listnode *node = list_head(&action_queue); local
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 50 import org.w3c.dom.Node;
57 * tree. You can wrap a DOM2DTM around a specific node and its subtree
75 /** The current position in the DOM tree. Last node examined for
77 transient private Node m_pos;
87 transient private Node m_root;
90 synthesis of the implied xml: namespace declaration node. */
98 /** The node objects. The instance part of the handle indexes
99 * directly into this vector. Each DTM node may actually be
102 * single DTM Text node); this table points only to the first in
107 * Construct a DOM2DTM object from a DOM node
781 Node node = lookupNode(identity); local
816 Node node = getNode(nodeHandle); local
871 Node node = getNode(nodeHandle); local
958 Node node = getNode(nodeHandle); local
982 Node node = getNode(nodeHandle); local
1001 Node node = getNode(nodeHandle); local
1060 Node node = getNode(nodeHandle); local
1103 Node node = getNode(nodeHandle); local
1115 Node node = getNode(nodeHandle); local
1164 Node node = getNode(nodeHandle); local
1363 Node node = getNode(identity); local
1621 Node node = getNode(nodeHandle); local
1726 Node node = getNode(nodeHandle); local
[all...] |
