| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/translator/ |
| NodeSearch.h | 6 // NodeSearch.h: Utilities for searching translator node graphs
27 static bool search(TIntermNode *node)
30 node->traverse(&searchTraverser);
41 virtual bool visitBranch(Visit visit, TIntermBranch *node)
43 switch (node->getFlowOp())
59 virtual bool visitBinary(Visit visit, TIntermBinary *node)
61 switch (node->getOp())
65 if (node->getRight()->hasSideEffects())
|
| ValidateLimitations.h | 31 bool validateLoopType(TIntermLoop *node);
33 bool validateForLoopHeader(TIntermLoop *node);
35 int validateForLoopInit(TIntermLoop *node);
36 bool validateForLoopCond(TIntermLoop *node, int indexSymbolId);
37 bool validateForLoopExpr(TIntermLoop *node, int indexSymbolId);
41 bool validateFunctionCall(TIntermAggregate *node);
42 bool validateOperation(TIntermOperator *node, TIntermNode *operand);
46 bool isConstExpr(TIntermNode *node);
47 bool isConstIndexExpr(TIntermNode *node);
48 bool validateIndexing(TIntermBinary *node);
[all...] |
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMSource.java | 23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node; field in class:DOMSource
60 * no DOM source is set using {@link #setNode(Node node)} , then the
70 * Create a new input source with a DOM node. The operation
71 * will be applied to the subtree rooted at this node. In XSLT,
74 * from the root node also.
76 * @param n The DOM node that will contain the Source tree
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| DocumentOrderedList.cpp | 31 #include "core/dom/Node.h"
35 void DocumentOrderedList::add(Node* node)
38 m_nodes.add(node);
46 Node* followingNode = 0;
49 Node* n = *it;
50 unsigned short position = n->compareDocumentPositionInternal(node, Node::TreatShadowTreesAsComposed);
51 if (position & Node::DOCUMENT_POSITION_FOLLOWING) {
52 m_nodes.insertBefore(followingNode, node);
[all...] |
| NodeRenderingTraversal.cpp | 41 if (!renderer->node()->isElementNode())
43 if (toElement(renderer->node())->isInTopLayer())
55 ContainerNode* parent(const Node* node, ParentDetails* details)
57 // FIXME: We should probably ASSERT(!node->document().childNeedsDistributionRecalc()) here, but
60 ASSERT(node);
61 if (isActiveInsertionPoint(*node))
63 ComposedTreeWalker walker(node, ComposedTreeWalker::CanStartFromShadowBoundary);
67 bool contains(const ContainerNode* container, const Node* node)
[all...] |
| NodeChildRemovalTracker.h | 30 #include "core/dom/Node.h"
36 explicit NodeChildRemovalTracker(Node&);
39 static bool isBeingRemoved(Node*);
42 Node& node() const { return m_node; } function in class:WebCore::NodeChildRemovalTracker
45 Node& m_node;
50 inline NodeChildRemovalTracker::NodeChildRemovalTracker(Node& node)
51 : m_node(node)
62 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node
[all...] |
| RenderTreeBuilder.h | 30 #include "core/dom/Node.h"
43 RenderTreeBuilder(Node* node, RenderStyle* style)
44 : m_node(node)
48 ASSERT(!node->renderer());
49 ASSERT(node->needsAttach());
50 ASSERT(node->document().inStyleRecalc());
52 // FIXME: We should be able to ASSERT(node->inActiveDocument()) but childrenChanged is called
58 m_renderingParent = NodeRenderingTraversal::parent(node, &m_parentDetails);
70 RawPtrWillBeMember<Node> m_node
[all...] |
| /external/chromium_org/net/disk_cache/memory/ |
| mem_rankings.h | 23 void Insert(MemEntryImpl* node);
26 void Remove(MemEntryImpl* node);
29 void UpdateRank(MemEntryImpl* node);
32 MemEntryImpl* GetNext(MemEntryImpl* node);
33 MemEntryImpl* GetPrev(MemEntryImpl* node);
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 105 for (T* node = m_head; node; node = node->next())
126 template<typename T> inline void DoublyLinkedList<T>::push(T* node)
130 m_head = node;
131 m_tail = node;
132 node->setPrev(0);
133 node->setNext(0);
138 m_head->setPrev(node);
183 T* node = head(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathUtil.cpp | 37 bool isRootDomNode(Node* node)
39 return node && !node->parentNode();
42 String stringValue(Node* node)
44 switch (node->nodeType()) {
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| InlineRewriter.java | 22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
23 import com.google.clearsilver.jsilver.syntax.node.AInlineCommand;
24 import com.google.clearsilver.jsilver.syntax.node.ANoopCommand;
25 import com.google.clearsilver.jsilver.syntax.node.PCommand;
26 import com.google.clearsilver.jsilver.syntax.node.TData;
64 public void caseADataCommand(ADataCommand node) {
65 TData data = node.getData();
67 node.replaceBy(new ANoopCommand());
77 public void caseAInlineCommand(AInlineCommand node) {
79 PCommand command = node.getCommand()
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AXNodeObject.cpp | 51 AXNodeObject::AXNodeObject(Node* node)
58 , m_node(node)
62 PassRefPtr<AXNodeObject> AXNodeObject::create(Node* node)
64 return adoptRef(new AXNodeObject(node));
74 static String accessibleNameForNode(Node* node)
76 if (!node)
79 if (node->isTextNode()
263 Node* node = this->node(); local
399 Node* node = this->node(); local
470 Node* node = this->node(); local
497 Node* node = this->node(); local
516 Node* node = this->node(); local
551 Node* node = this->node(); local
561 Node* node = this->node(); local
579 Node* node = this->node(); local
610 Node* node = this->node(); local
632 Node* node = this->node(); local
680 Node* node = this->node(); local
708 Node* node = this->node(); local
738 Node* node = this->node(); local
775 Node* node = this->node(); local
815 Node* node = this->node(); local
845 Node* node = this->node(); local
999 Node* node = this->node(); local
1097 Node* node = this->node(); local
1151 Node* node = this->node(); local
1206 Node* node = this->node(); local
1385 Node* node = this->node(); local
1429 Node* node = this->node(); local
1497 Node* node = this->node(); local
[all...] |
| /external/apache-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...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| TokenIndex.java | 5 import com.google.clearsilver.jsilver.syntax.node.*;
13 public void caseTData(@SuppressWarnings("unused") TData node)
19 public void caseTComment(@SuppressWarnings("unused") TComment node)
25 public void caseTVar(@SuppressWarnings("unused") TVar node)
31 public void caseTLvar(@SuppressWarnings("unused") TLvar node)
37 public void caseTEvar(@SuppressWarnings("unused") TEvar node)
43 public void caseTUvar(@SuppressWarnings("unused") TUvar node)
49 public void caseTSet(@SuppressWarnings("unused") TSet node)
55 public void caseTIf(@SuppressWarnings("unused") TIf node)
61 public void caseTElseIf(@SuppressWarnings("unused") TElseIf node)
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_api_helpers.cc | 28 const BookmarkNode* node,
32 if (node->IsVisible()) {
34 node,
44 const BookmarkNode* node,
49 bookmark_tree_node->id = base::Int64ToString(node->id());
51 const BookmarkNode* parent = node->parent();
55 bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node)));
58 if (!node->is_folder()) {
59 bookmark_tree_node->url.reset(new std::string(node->url().spec()));
62 base::Time t = node->date_folder_modified()
114 const BookmarkNode* node = GetBookmarkNodeByID(model, id); local
[all...] |
| /external/chromium_org/ppapi/generators/ |
| idl_lint.py | 33 def VisitFilter(self, node, data):
34 __pychecker__ = 'unusednames=node,data'
35 return not node.IsA('Comment', 'Copyright')
37 def Arrive(self, node, errors):
38 __pychecker__ = 'unusednames=node,errors'
40 if node.IsA('Interface', 'Member', 'Struct', 'Enum', 'EnumItem', 'Typedef'):
41 comments = node.GetListOf('Comment')
42 if not comments and not node.GetProperty('wcomment'):
43 node.Warning('Expecting a comment.')
46 if node.IsA('File')
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ALoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
62 public void setPosition(PPosition node)
69 if(node != null)
71 if(node.parent() != null)
73 node.parent().removeChild(node);
76 node.parent(this);
79 this._position_ = node;
87 public void setVariable(PVariable node)
94 if(node != null
[all...] |
| /external/smack/src/org/jivesoftware/smackx/entitycaps/packet/ |
| CapsExtension.java | 25 private String node, ver, hash; field in class:CapsExtension
30 public CapsExtension(String node, String version, String hash) {
31 this.node = node;
45 return node;
48 public void setNode(String node) {
49 this.node = node;
71 * node='http://code.google.com/p/exodus'
78 "node=\"" + node + "\" "
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| RenderSVGTransformableContainer.cpp | 33 RenderSVGTransformableContainer::RenderSVGTransformableContainer(SVGGraphicsElement* node)
34 : RenderSVGContainer(node)
40 static bool hasValidPredecessor(const Node* node)
42 ASSERT(node);
43 while ((node = node->previousSibling())) {
44 if (node->isSVGElement() && toSVGElement(node)->isValid())
54 Node* node = child->node() local
[all...] |
| /external/icu/icu4c/source/common/ |
| ucharstrie.cpp | 35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| ExpressionTranslator.java | 28 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
30 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
31 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
32 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
33 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
34 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
35 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
36 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
37 import com.google.clearsilver.jsilver.syntax.node.AGteExpression
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| walker.py | 61 """ get a leaf node """
95 node = self._tree.root
97 while node is not None:
98 if key == node.key:
100 elif less_than(key, node.key):
101 if (succ is None) or less_than(node.key, succ.key):
102 succ = node
103 node = left(node)
105 node = right(node
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| hash_table.c | 35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...] |
