| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 20 /* Determines whether the current node was actually closed and
22 node scope. */
27 /* Call this to reinitialize the node stack. It is called
36 /* Returns the root node of the AST. It only makes sense to call
38 Node rootNode() {
39 return (Node)nodes.elementAt(0);
42 /* Pushes a node on to the stack. */
43 void pushNode(Node n) {
48 /* Returns the node on the top of the stack, and remove it from the
50 Node popNode()
[all...] |
| /sdk/layoutopt/libs/uix/src/resources/rules/ |
| InefficientWeight.rule | 6 // - The node has a LinearLayout parent
7 // - The node is the only sibling with a weight
8 // - The node has a height/width != 0
10 def parent = node.'..'
11 if (parent.is("LinearLayout") && node.'@android:layout_weight' &&
15 if (node."@${dimension}"[0] != '0') {
16 analysis << "Use an ${dimension} of 0dip instead of ${node."@${dimension}"} " +
|
| /external/bluetooth/glib/glib/ |
| gnode.h | 60 typedef gboolean (*GNodeTraverseFunc) (GNode *node,
62 typedef void (*GNodeForeachFunc) (GNode *node,
70 * A function of this signature is used to copy the node data
93 * @node: a #GNode
100 #define G_NODE_IS_ROOT(node) (((GNode*) (node))->parent == NULL && \
101 ((GNode*) (node))->prev == NULL && \
102 ((GNode*) (node))->next == NULL)
106 * @node: a #GNode
108 * Returns %TRUE if a #GNode is a leaf node
[all...] |
| /external/kernel-headers/original/linux/ |
| nodemask.h | 6 * set of Node's in a system, one bit position per Node number.
20 * void node_set(node, mask) turn on bit 'node' in mask
21 * void node_clear(node, mask) turn off bit 'node' in mask
24 * int node_isset(node, mask) true iff bit 'node' set in mask
25 * int node_test_and_set(node, mask) test and set bit 'node' in mas
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/harmony/xml/dom/ |
| DocumentImpl.java | 29 import org.w3c.dom.Node;
71 * <p>Attaching user data directly to the corresponding node would cost a
72 * field per node. Under the assumption that user data is rarely needed, we
122 * Returns a shallow copy of the given node. If the node is an element node,
125 * @param node a node belonging to any document or DOM implementation.
128 * responsibility to notify user data handlers of the returned node.
129 * @return a new node whose document is this document and whose DO
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/cp/ |
| cp-tree.h | 164 The BV_DELTA of each node gives the amount by which to adjust the
170 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
193 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
194 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
196 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
197 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
199 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
200 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
202 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
203 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM
[all...] |
| /external/webkit/WebCore/inspector/ |
| InspectorDOMAgent.h | 53 class Node;
57 EventListenerInfo(Node* node, const AtomicString& eventType, const EventListenerVector& eventListenerVector)
58 : node(node)
64 Node* node; member in struct:WebCore::EventListenerInfo
101 void didInsertDOMNode(Node*);
102 void didRemoveDOMNode(Node*);
105 Node* nodeForId(long nodeId)
[all...] |
| /external/skia/src/views/ |
| SkParsePaint.cpp | 7 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node)
9 if ((node = dom.getFirstChild(node, "shader")) == NULL)
14 if (dom.hasAttr(node, "type", "linear-gradient"))
20 if ((str = dom.findAttr(node, "c0")) != NULL &&
22 (str = dom.findAttr(node, "c1")) != NULL &&
24 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
25 dom.findScalars(node, "p1", &pts[1].fX, 2))
30 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0
[all...] |
| SkBGViewArtist.cpp | 20 void SkBGViewArtist::onInflate(const SkDOM& dom, const SkDOM::Node* node)
22 SkPaint_Inflate(&fPaint, dom, node);
|
| SkViewPriv.cpp | 11 void SkView::Artist::inflate(const SkDOM& dom, const SkDOM::Node* node)
13 SkASSERT(&dom && node);
14 this->onInflate(dom, node);
17 void SkView::Artist::onInflate(const SkDOM& dom, const SkDOM::Node* node)
57 void SkView::Layout::inflate(const SkDOM& dom, const SkDOM::Node* node)
59 SkASSERT(&dom && node);
60 this->onInflate(dom, node);
[all...] |
| /packages/apps/IM/src/com/android/im/app/ |
| IntTrie.java | 21 private Node mHead;
23 class Node {
24 private Node mFirstChild;
25 private Node mNextSibling;
31 Node n = this;
41 private Node getOrCreateNode(char key) {
42 for (Node n = mFirstChild; n != null; n = n.mNextSibling) {
48 Node n = new Node();
57 Node getNode(char key)
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 43 /** Node where to start the tree walk */
65 * @param pos Start node for traversal
78 * End processing of given node
81 * @param node Node we just finished processing
85 protected void endNode(int node) throws org.xml.sax.SAXException
87 super.endNode(node);
88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node))
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversa
[all...] |
| /external/webkit/WebCore/html/ |
| HTMLParser.h | 44 class Node;
62 PassRefPtr<Node> parseToken(Token*);
81 void setCurrent(Node*);
85 PassRefPtr<Node> getNode(Token*);
86 bool bodyCreateErrorCheck(Token*, RefPtr<Node>&);
87 bool canvasCreateErrorCheck(Token*, RefPtr<Node>&);
88 bool commentCreateErrorCheck(Token*, RefPtr<Node>&);
89 bool ddCreateErrorCheck(Token*, RefPtr<Node>&);
90 bool dtCreateErrorCheck(Token*, RefPtr<Node>&);
91 bool formCreateErrorCheck(Token*, RefPtr<Node>&)
[all...] |
| /external/webkit/WebCore/editing/ |
| SplitElementCommand.cpp | 34 SplitElementCommand::SplitElementCommand(PassRefPtr<Element> element, PassRefPtr<Node> atChild)
49 Vector<RefPtr<Node> > children;
50 for (Node* node = m_element2->firstChild(); node != m_atChild; node = node->nextSibling())
51 children.append(node);
55 Node* parent = m_element2->parentNode();
79 Vector<RefPtr<Node> > children
[all...] |
| ApplyStyleCommand.cpp | 104 Document* document = position.node() ? position.node()->document() : 0;
116 if (isTabSpanTextNode(position.node()) || isTabSpanNode((position.node())))
266 bool isStyleSpan(const Node *node)
268 if (!node || !node->isHTMLElement())
271 const HTMLElement* elem = static_cast<const HTMLElement*>(node);
275 static bool isUnstyledStyleSpan(const Node* node
1048 Node* node = start.node(); local
1461 Node* node = start.node(); local
1712 Node* node = startNode; local
[all...] |
| /external/webkit/WebCore/dom/ |
| Range.h | 44 static PassRefPtr<Range> create(PassRefPtr<Document>, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr<Node> endContainer, int endOffset);
49 Node* startContainer() const { return m_start.container(); }
51 Node* endContainer() const { return m_end.container(); }
54 Node* startContainer(ExceptionCode&) const;
56 Node* endContainer(ExceptionCode&) const;
60 Node* commonAncestorContainer(ExceptionCode&) const;
61 static Node* commonAncestorContainer(Node* containerA, Node* containerB)
[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...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 36 * in terms of DTM Node Handles... but they may use the internal node
44 * Construct a DTMDefaultBaseTraversers object from a DOM node.
66 * Construct a DTMDefaultBaseTraversers object from a DOM node.
77 * @param usePrevsib true if we want to build the previous sibling node array.
204 * Traverse to the next node after the current node.
206 * @param context The context node if this iteration.
207 * @param current The current node of the iteration.
209 * @return the next node in the iteration, or DTM.NULL
[all...] |
| /external/bluetooth/glib/gobject/ |
| gtype.c | 179 static inline GTypeFundamentalInfo* type_node_fundamental_info_I (TypeNode *node);
180 static void type_add_flags_W (TypeNode *node,
182 static void type_data_make_W (TypeNode *node,
185 static inline void type_data_ref_Wm (TypeNode *node);
186 static inline void type_data_unref_WmREC (TypeNode *node,
190 static inline gpointer type_get_qdata_L (TypeNode *node,
192 static inline void type_set_qdata_W (TypeNode *node,
198 TypeNode *node);
200 TypeNode *node);
201 static gboolean type_node_is_a_L (TypeNode *node,
386 TypeNode *node; local
490 TypeNode *node; local
590 TypeNode *node = lookup_type_node_I (type); local
870 TypeNode *node = NULL; local
886 TypeNode *node = lookup_type_node_I (instance_type); local
1426 TypeNode *node = lookup_type_node_I (prerequisite); local
1579 InstanceRealClass key, *node; local
1597 InstanceRealClass key, *node; local
1631 TypeNode *node; local
1692 TypeNode *node; local
2084 TypeNode *node = lookup_type_node_I (type); local
2345 TypeNode *node; local
2455 TypeNode *pnode, *node; local
2510 TypeNode *pnode, *node; local
2561 TypeNode *node = lookup_type_node_I (instance_type); local
2585 TypeNode *node; local
2621 TypeNode *node; local
2680 TypeNode *node; local
2708 TypeNode *node; local
2739 TypeNode *node; local
2767 TypeNode *node; local
2803 TypeNode *node; local
2839 TypeNode *node; local
2882 TypeNode *node; local
2936 TypeNode *node; local
2985 TypeNode *node; local
3016 TypeNode *node; local
3048 TypeNode *node; local
3068 TypeNode *node; local
3117 TypeNode *node; local
3136 TypeNode *node; local
3163 TypeNode *node; local
3244 TypeNode *node, *iface_node; local
3268 TypeNode *node; local
3311 TypeNode *node; local
3399 TypeNode *node; local
3465 TypeNode *node; local
3513 TypeNode *node; local
3541 TypeNode *node; local
3587 TypeNode *node; local
3611 TypeNode *node; local
3678 TypeNode *node = lookup_type_node_I (type_id); local
3687 TypeNode *node, *iface; local
3704 TypeNode *node, *iface; local
3725 TypeNode *node, *iface; local
3758 TypeNode *node, *iface; local
3802 TypeNode *node = lookup_type_node_I (type_instance->g_class->g_type); local
3823 TypeNode *node; local
3895 TypeNode *node = lookup_type_node_I (type); local
3981 TypeNode *node; local
4143 TypeNode *node = lookup_type_node_I (instance_type); local
[all...] |
| /external/bluetooth/bluez/doc/ |
| node-api.txt | 1 BlueZ D-Bus Node API description
7 Node hierarchy
11 Interface org.bluez.Node
16 Returns all properties for the device node. See the
24 The name of the node. For example "rfcomm0".
28 The object path of the device this node belongs to.
|
| /external/e2fsprogs/tests/f_h_badnode/ |
| expect.1 | 3 Problem in HTREE directory inode 12929: node (531) has bad max hash
4 Problem in HTREE directory inode 12929: node (993) referenced twice
5 Problem in HTREE directory inode 12929: node (1061) has bad min hash
6 Problem in HTREE directory inode 12929: node (1062) has invalid depth
7 Problem in HTREE directory inode 12929: node (1062) has bad max hash
8 Problem in HTREE directory inode 12929: node (1062) not referenced
|
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| TreeWalker.java | 29 import org.w3c.dom.Node;
148 * @param pos Node in the tree where to start traversal
152 public void traverse(Node pos) throws org.xml.sax.SAXException
167 * @param pos Node in the tree where to start traversal
171 public void traverseFragment(Node pos) throws org.xml.sax.SAXException
173 Node top = pos;
179 Node nextNode = pos.getFirstChild();
218 * @param pos Node in the tree where to start traversal
219 * @param top Node in the tree where to end traversal
223 public void traverse(Node pos, Node top) throws org.xml.sax.SAXExceptio
[all...] |
| /external/webkit/JavaScriptCore/wtf/ |
| ListHashSet.h | 56 typedef ListHashSetNode<ValueArg> Node;
59 typedef HashTraits<Node*> NodeTraits;
62 typedef HashTable<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeTraits> ImplType;
63 typedef HashTableIterator<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeTraits> ImplTypeIterator;
64 typedef HashTableConstIterator<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeTraits> ImplTypeConstIterator
269 Node* node() { return m_iterator.node(); } function in class:WTF::ListHashSetIterator
337 Node* node() { return m_position; } function in class:WTF::ListHashSetConstIterator
[all...] |
| /sdk/layoutopt/libs/uix/src/com/android/layoutopt/uix/groovy/ |
| LayoutAnalysisCategory.java | 29 import org.w3c.dom.Node;
35 * to {@link com.android.layoutopt.uix.LayoutAnalysis} and {@link org.w3c.dom.Node}.
63 * @return True if the specified node corresponds to a container widget.
74 * @return All descendants, this node excluded.
76 public static List<Node> all(Element element) {
79 List<Node> nodes = new ArrayList<Node>(count - 1);
87 * Returns the start line of this node.
91 public static int getStartLine(Node node) {
[all...] |
| /external/clearsilver/man/man3/ |
| hdf_get_child.3 | 14 hdf_get_child - return the first child of the named node
25 hdf -> the dataset node to start from
31 name, and return the first child of that node
|
