/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 32 """Unit tests for nodes (Base, Leaf, Node).""" 37 l = pytree.Leaf(100, "foo") 57 l1 = pytree.Leaf(100, "foo") 62 l1 = pytree.Leaf(100, "foo") 63 self.assertEqual(repr(l1), "Leaf(100, 'foo')") 66 l1 = pytree.Leaf(100, "foo") 68 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1))) 72 # Make sure that the Leaf's value is stringified. Failing to 74 l1 = pytree.Leaf(2, 5) 79 l1 = pytree.Leaf(100, "foo" [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 32 """Unit tests for nodes (Base, Leaf, Node).""" 37 l = pytree.Leaf(100, "foo") 57 l1 = pytree.Leaf(100, "foo") 62 l1 = pytree.Leaf(100, "foo") 63 self.assertEqual(repr(l1), "Leaf(100, 'foo')") 66 l1 = pytree.Leaf(100, "foo") 68 l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1))) 72 # Make sure that the Leaf's value is stringified. Failing to 74 l1 = pytree.Leaf(2, 5) 79 l1 = pytree.Leaf(100, "foo" [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
pagemap.h | 121 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 128 // Leaf node 129 struct Leaf { 133 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes 170 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 171 if (leaf == NULL) return false; 172 memset(leaf, 0, sizeof(*leaf)) 190 Leaf* leaf = root_[i1]; local 284 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 307 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_ws_comma.py | 20 COMMA = pytree.Leaf(token.COMMA, u",") 21 COLON = pytree.Leaf(token.COLON, u":")
|
fix_ne.py | 22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf 29 1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta') 30 2) clsdef => simple_stmt => expr_stmt => Leaf('__meta') 39 if isinstance(left_side, Leaf) and \ 108 # look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ] 115 if isinstance(left_node, Leaf) and \ 134 # find the first Leaf 137 if isinstance(node, Leaf) and node.type != token.DEDENT: 164 text_type = node.children[0].type # always Leaf(nnn, 'class') 186 node.insert_child(2, Leaf(token.RPAR, u')') [all...] |
fix_apply.py | 50 l_newargs = [pytree.Leaf(token.STAR, u"*"), args] 53 pytree.Leaf(token.DOUBLESTAR, u"**"),
|
fix_set_literal.py | 38 literal = [pytree.Leaf(token.LBRACE, u"{")] 40 literal.append(pytree.Leaf(token.RBRACE, u"}"))
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_ws_comma.py | 20 COMMA = pytree.Leaf(token.COMMA, u",") 21 COLON = pytree.Leaf(token.COLON, u":")
|
fix_ne.py | 22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf 29 1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta') 30 2) clsdef => simple_stmt => expr_stmt => Leaf('__meta') 39 if isinstance(left_side, Leaf) and \ 108 # look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ] 115 if isinstance(left_node, Leaf) and \ 134 # find the first Leaf 137 if isinstance(node, Leaf) and node.type != token.DEDENT: 164 text_type = node.children[0].type # always Leaf(nnn, 'class') 186 node.insert_child(2, Leaf(token.RPAR, u')') [all...] |
fix_apply.py | 50 l_newargs = [pytree.Leaf(token.STAR, u"*"), args] 53 pytree.Leaf(token.DOUBLESTAR, u"**"),
|
fix_set_literal.py | 38 literal = [pytree.Leaf(token.LBRACE, u"{")] 40 literal.append(pytree.Leaf(token.RBRACE, u"}"))
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
fixer_util.py | 8 from .pytree import Leaf, Node 19 [keyword, Leaf(token.EQUAL, u"="), value]) 22 return Leaf(token.LPAR, u"(") 25 return Leaf(token.RPAR, u")") 36 target + [Leaf(token.EQUAL, u"=", prefix=u" ")] + source) 39 """Return a NAME leaf""" 40 return Leaf(token.NAME, name, prefix=prefix) 47 """A comma leaf""" 48 return Leaf(token.COMMA, u",") 51 """A period (.) leaf""" [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
fixer_util.py | 8 from .pytree import Leaf, Node 19 [keyword, Leaf(token.EQUAL, u"="), value]) 22 return Leaf(token.LPAR, u"(") 25 return Leaf(token.RPAR, u")") 36 target + [Leaf(token.EQUAL, u"=", prefix=u" ")] + source) 39 """Return a NAME leaf""" 40 return Leaf(token.NAME, name, prefix=prefix) 47 """A comma leaf""" 48 return Leaf(token.COMMA, u",") 51 """A period (.) leaf""" [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
pagemap.h | 324 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 331 // Leaf node 332 struct Leaf { 336 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes 373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 374 if (leaf == NULL) return false; 375 memset(leaf, 0, sizeof(*leaf)) 393 Leaf* leaf = root_[i1]; local 487 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 510 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
node_iterators.hpp | 54 Leaf, \ 65 Leaf, \ 75 class Leaf, 92 Leaf>::other::const_pointer 97 Leaf>::other::pointer 194 // the current leaf. 252 class Leaf, 305 // Access; returns the iterator* associated with the current leaf.
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
point_iterators.hpp | 55 Leaf, \ 65 Leaf, \ 75 Leaf, \ 85 Leaf, \ 95 class Leaf, 111 Leaf>::other::const_pointer 116 Leaf>::other::pointer 353 class Leaf, 370 Leaf>::other::const_pointer 375 Leaf>::other::pointe [all...] |
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 72 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock, 222 // newLeafBlock - Create a new leaf block for the binary lookup tree. It 228 BasicBlock* LowerSwitch::newLeafBlock(CaseRange& Leaf, Value* Val, 239 if (Leaf.Low == Leaf.High) { 242 Leaf.Low, "SwitchLeaf"); 245 if (cast<ConstantInt>(Leaf.Low)->isMinValue(true /*isSigned*/)) { 247 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, 249 } else if (cast<ConstantInt>(Leaf.Low)->isZero()) { 251 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High [all...] |