/frameworks/base/media/libdrm/mobile2/include/util/domcore/ |
NodeType.h | 20 * The node is an <code>Element</code>.
24 * The node is an <code>Attr</code>.
28 * The node is a <code>Text</code> node.
32 * The node type is CDATASection.
36 * The node type is an EntityReference.
40 * The node type is an <code>Entity</code>.
44 * The node type is a ProcessingInstruction.
48 * The node is a Comment
52 * The node is a Document. [all...] |
NodeIterator.h | 31 NodeImpl* curNode; /** The position of current node.*/
34 * Find the specify node's next order node.
35 * @param node The specify node.
36 * @return The next order node when success.
39 NodeImpl* findNextOrderNode(NodeImpl* node);
42 * Find the specify node's previous order node.
43 * @param node The specify node. [all...] |
/packages/apps/Email/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/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...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
DTMDefaultBaseIterators.java | 39 * Construct a DTMDefaultBaseTraversers object from a DOM node. 61 * Construct a DTMDefaultBaseTraversers object from a DOM node. 72 * @param usePrevsib true if we want to build the previous sibling node array. 92 * with a start node (using iterator.setStartNode()). 174 * with a start node (using iterator.setStartNode()). 257 * returned (starting point for the next() search); for single-node 258 * iterators it may instead be initialized to point to that single node. 263 * Remembers the current node for the next call to gotoMark(). 273 * Restores the current node remembered by setMark(). 285 * Iterator that returns all immediate children of a given node 328 int node = _currentNode; local 473 int node = _currentNode; local 628 int node = _currentNode; local 666 int node; local 771 int node = _startNode; local 852 int node = _currentNode; local 936 int node = _currentNode; local 1005 final int node = _currentNode; local 1068 final int node = _currentNode; local 1159 final int node = _currentNode; local 1196 int node = _currentNode; local 1427 int node = _currentNode; local 1532 int node = _currentNode; local 1568 int node; local 1881 int node = _currentNode; local 1946 int node; local 2002 int node; local [all...] |
/sdk/layoutopt/libs/uix/src/resources/rules/ |
NestedScrollingWidgets.rule | 6 // - The node is a scrolling widget 7 // - The node has a descendant who is also a scrolling widget 10 if (node.name() in widgets && node.all().any{ it.name() in widgets }) { 11 analysis << "The vertically scrolling ${node.name()} should not contain another " + 16 if (node.name() in widgets && node.all().any{ it.name() in widgets }) { 17 analysis << "The horizontally scrolling ${node.name()} should not contain another " +
|
TooManyLevels.rule | 8 if (node.isRoot() && (depth = node.depth()) > 10) { 9 analysis << [node: null, description: "This layout has too many nested layouts: " +
|
TooManyViews.rule | 8 if (node.isRoot && (size = node.'**'.size()) > 80) { 9 analysis << [node: null,
|
TooManyChildren.rule | 9 if (node.name() in ["ScrollView", "HorizontalScrollView"] && node.'*'.size() > 1) { 13 if (node.name() in ["ListView", "GridView"] && node.'*'.size() > 0) { 14 analysis << "A list/grid should have no children declared in node"
|
/external/webkit/WebCore/bindings/js/ |
JSTreeWalkerCustom.cpp | 24 #include "Node.h" 42 Node* node = impl()->parentNode(exec); local 45 return toJS(exec, node); 50 Node* node = impl()->firstChild(exec); local 53 return toJS(exec, node); 58 Node* node = impl()->lastChild(exec); local 61 return toJS(exec, node); 66 Node* node = impl()->nextSibling(exec); local 74 Node* node = impl()->previousSibling(exec); local 82 Node* node = impl()->previousNode(exec); local 90 Node* node = impl()->nextNode(exec); local [all...] |
JSNodeCustom.cpp | 52 #include "Node.h" 139 Node* node = m_impl.get(); local 140 node->markJSEventListeners(markStack); 145 if (node->inDocument()) { 146 if (Document* doc = node->ownerDocument()) 151 // This is a node outside the document. 153 Node* root = node; 154 Node* outermostNodeWithWrapper = node [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
MockNamedNodeMap.java | 21 import org.w3c.dom.Node; 29 private final HashMap<String, HashMap<String, Node>> mNodeMap = 30 new HashMap<String, HashMap<String, Node>>(); 33 private final ArrayList<Node> mNodeList = new ArrayList<Node>(); 36 MockXmlNode node = new MockXmlNode(namespace, localName, value); local 43 HashMap<String, Node> map = mNodeMap.get(namespace); 45 map = new HashMap<String, Node>(); 50 map.put(localName, node); 51 mNodeList.add(node); [all...] |
/external/clearsilver/man/man3/ |
hdf_get_obj.3 | 14 hdf_get_obj - return the HDF data set node at a named location 25 hdf -> the dataset node to start from 30 hdf_get_obj walks the dataset given by hdf to the node 31 named name, and then returns the pointer to that node
|
hdf_obj_name.3 | 14 hdf_obj_name - Return the name of a node 25 hdf -> the hdf dataset node 28 hdf_obj_name is an accessor function for a datset node 29 which returns the name of the node. This is just the
|
/external/clearsilver/util/ |
neo_hash.c | 52 NE_HASHNODE *node, *next; local 62 node = my_hash->nodes[x]; 63 while (node) 65 next = node->next; 66 free(node); 67 node = next; 79 NE_HASHNODE **node; local 81 node = _hash_lookup_node(hash, key, &hashv); 83 if (*node) 85 (*node)->value = value 105 NE_HASHNODE *node; local 114 NE_HASHNODE **node, *remove; local 131 NE_HASHNODE *node; local 141 NE_HASHNODE **node = 0; local 189 NE_HASHNODE **node; local [all...] |
/packages/apps/Mms/src/com/android/mms/dom/ |
NodeListImpl.java | 22 import org.w3c.dom.Node; 26 private ArrayList<Node> mSearchNodes; 27 private ArrayList<Node> mStaticNodes; 28 private Node mRootNode; 38 * children of a root node with a given tag name. 39 * @param rootNode The root <code>Node</code> of the search. 45 public NodeListImpl(Node rootNode, String tagName, boolean deepSearch) { 52 * Constructs a NodeList for a given static node list. 53 * @param nodes The static node list. 55 public NodeListImpl(ArrayList<Node> nodes) 73 Node node = null; local [all...] |
/external/webkit/WebCore/dom/ |
TreeWalker.h | 39 static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences) 44 Node* currentNode() const { return m_current.get(); } 45 void setCurrentNode(PassRefPtr<Node>, ExceptionCode&); 47 Node* parentNode(ScriptState*); 48 Node* firstChild(ScriptState*); 49 Node* lastChild(ScriptState*); 50 Node* previousSibling(ScriptState*); 51 Node* nextSibling(ScriptState*); 52 Node* previousNode(ScriptState*); 53 Node* nextNode(ScriptState*) [all...] |
NamedNodeMap.idl | 29 Node getNamedItem(in DOMString name); 31 Node setNamedItem(in Node node) 34 Node removeNamedItem(in DOMString name) 37 Node item(in unsigned long index); 44 [OldStyleObjC] Node getNamedItemNS(in [ConvertNullToNullString] DOMString namespaceURI, 49 Node setNamedItemNS(in Node node) [all...] |
ContainerNode.h | 27 #include "Node.h" 32 typedef void (*NodeCallback)(Node*); 39 class ContainerNode : public Node { 43 Node* firstChild() const { return m_firstChild; } 44 Node* lastChild() const { return m_lastChild; } 46 virtual bool insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&, bool shouldLazyAttach = false); 47 virtual bool replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&, bool shouldLazyAttach = false); 48 virtual bool removeChild(Node* child, ExceptionCode&) [all...] |
/external/webkit/WebCore/inspector/ |
InspectorDOMAgent.cpp | 51 #include "Node.h" 130 Node* node = event->target()->toNode(); local 137 long frameOwnerId = m_documentNodeToIdMap.get(node); 143 m_frontend->childNodeCountUpdated(frameOwnerId, innerChildNodeCount(node)); 146 long parentId = m_documentNodeToIdMap.get(innerParentNode(node)); 148 ScriptObject value = buildObjectForNode(node, 0, &m_documentNodeToIdMap); 149 Node* previousSibling = innerPreviousSibling(node); 158 long InspectorDOMAgent::bind(Node* node, NodeToIdMap* nodesMap 206 Node* node = nodeForId(nodeId); local 240 Node* node = mainFrameDocument(); local 316 Node* node = nodeForId(elementId); local 329 Node* node = nodeForId(elementId); local 342 Node* node = nodeForId(nodeId); local 355 Node* node = nodeForId(nodeId); local [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/harmony/xml/dom/ |
InnerNodeImpl.java | 20 import org.w3c.dom.Node; 36 * <p>This class represents a Node that has a parent Node as well as 50 public Node appendChild(Node newChild) throws DOMException { 57 for (NodeImpl node : children) { 58 list.add(node); 64 public Node getFirstChild() { 68 public Node getLastChild() { 72 public Node getNextSibling() [all...] |
/external/webkit/JavaScriptCore/API/tests/ |
minidom.js | 43 print("Node is " + Node); 44 for (var p in Node) 45 print(p + ": " + Node[p]); 47 node = new Node(); 48 print("node is " + node); 49 for (var p in node) 50 print(p + ": " + node[p]) [all...] |
/frameworks/base/media/libstagefright/include/ |
OMX.h | 39 const char *name, const sp<IOMXObserver> &observer, node_id *node); 41 virtual status_t freeNode(node_id node); 44 node_id node, OMX_COMMANDTYPE cmd, OMX_S32 param); 47 node_id node, OMX_INDEXTYPE index, 51 node_id node, OMX_INDEXTYPE index, 55 node_id node, OMX_INDEXTYPE index, 59 node_id node, OMX_INDEXTYPE index, 63 node_id node, OMX_U32 port_index, const sp<IMemory> ¶ms, 67 node_id node, OMX_U32 port_index, size_t size, 71 node_id node, OMX_U32 port_index, const sp<IMemory> ¶ms [all...] |
/system/core/libcutils/ |
config_utils.c | 28 cnode *node; local 30 node = calloc(sizeof(cnode), 1); 31 if(node) { 32 node->name = name ? name : ""; 33 node->value = value ? value : ""; 36 return node; 41 cnode *node, *match = NULL; local 44 for(node = root->first_child; node; node = node->next 53 cnode *node; local 69 cnode *node; local 87 cnode *node; local 97 cnode *node; local 264 cnode *node; local [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
ClonerToResultTree.java | 31 * Class used to clone a node, possibly including its children to 40 // * TODO: Fix or figure out node clone failure! 43 // * @param node The node to clone 49 // public void cloneToResultTree(int node, boolean shouldCloneAttributes) 56 // DTM dtm = xctxt.getDTM(node); 58 // int type = dtm.getNodeType(node); 62 // dtm.dispatchCharactersEvents(node, m_rth, false); 76 // m_rth.addAttributes(node); 77 // m_rth.processNSDecls(node, type, dtm) [all...] |