_stack (reference) in projects: external

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:_stack (Results 1 – 25 of 42) sorted by relevance

/external/tensorflow/tensorflow/python/framework/
D	traceable_stack.py	`87 self._stack = existing_stack[:] if existing_stack else [] 103 self._stack.append(traceable_obj) 110 return self._stack.pop().obj 114 return [t_obj.obj for t_obj in reversed(self._stack)] 118 return list(reversed(self._stack)) 122 return len(self._stack) 132 return TraceableStack(self._stack)`
/external/python/cpython2/Lib/hotshot/
D	stats.py	`19 self._stack = [] 20 self.pop_frame = self._stack.pop 51 assert not self._stack 65 if self._stack: 66 back = self._stack[-1] 70 self._stack.append(frame)`
D	log.py	`43 self._stack = [] 44 self._append = self._stack.append 45 self._pop = self._stack.pop 115 filename, firstlineno, funcname = self._stack[-1]`
/external/antlr/runtime/Python3/tests/
D	t044trace.g	`7 self._stack = None 14 if self._stack is None: 15 self._stack = self.getRuleInvocationStack()`
/external/antlr/runtime/Python/tests/
D	t044trace.g	`7 self._stack = None 14 if self._stack is None: 15 self._stack = self.getRuleInvocationStack()`
/external/tensorflow/tensorflow/python/autograph/pyct/
D	transformer.py	`111 self._stack.append(self.type()) 114 return self._stack.pop() 118 return len(self._stack) 122 return self._stack[-1] 125 return iter(self._stack) 128 return getattr(self._stack[-1], key) 131 setattr(self._stack[-1], key, value)`
/external/antlr/runtime/Cpp/tests/
D	t044trace.g	`20 self._stack = None 27 if self._stack is None: 28 self._stack = self.getRuleInvocationStack()`
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
D	DTMDefaultBaseIterators.java	1247 protected int[] _stack = new int[_maxAncestors]; field in DTMDefaultBaseIterators.PrecedingIterator 1278 final int[] stackCopy = new int[_stack.length]; in cloneIterator() 1279 System.arraycopy(_stack, 0, stackCopy, 0, _stack.length); in cloneIterator() 1281 clone._stack = stackCopy; in cloneIterator() 1316 _stack[index = 0] = node; in setStartNode() 1323 if (++index == _stack.length) in setStartNode() 1326 System.arraycopy(_stack, 0, stack, 0, index); in setStartNode() 1327 _stack = stack; in setStartNode() 1329 _stack[index] = parent; in setStartNode() 1334 _currentNode=_stack[index]; // Last parent before root node in setStartNode() [all …]
/external/tensorflow/tensorflow/python/kernel_tests/
D	stack_ops_test.py	180 h = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 195 h = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 208 h1 = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 212 h2 = gen_data_flow_ops._stack(dtypes.float32, stack_name="bar") 222 h = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 263 h1 = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 265 h2 = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 277 h = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo") 288 h = gen_data_flow_ops._stack(dtypes.float32, stack_name="foo")
/external/tensorflow/tensorflow/tools/compatibility/
D	ast_edits.py	`136 self._stack = [] # Allow easy access to parents. 140 self._stack.append(node) 142 self._stack.pop() 395 assert self._stack[-1] is node 427 parent = self._stack[-2] 436 self._stack[-1] = node 442 assert self._stack[-1] is node 446 parent = self._stack[-2] 461 while isinstance(self._stack[-i], ast.Attribute): 463 whole_name = pasta.dump(self._stack[-(i-1)])`
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
D	SAX2DTM2.java	806 protected int[] _stack = new int[_maxAncestors]; field in SAX2DTM2.PrecedingIterator 837 final int[] stackCopy = new int[_stack.length]; in cloneIterator() 838 System.arraycopy(_stack, 0, stackCopy, 0, _stack.length); in cloneIterator() 840 clone._stack = stackCopy; in cloneIterator() 875 _stack[index = 0] = node; in setStartNode() 880 if (++index == _stack.length) in setStartNode() 883 System.arraycopy(_stack, 0, stack, 0, index); in setStartNode() 884 _stack = stack; in setStartNode() 886 _stack[index] = parent; in setStartNode() 892 _currentNode=_stack[index]; // Last parent before root node in setStartNode() [all …]
/external/python/cpython3/Lib/xmlrpc/
D	client.py	`641 self._stack = [] 647 self.append = self._stack.append 656 raise Fault(**self._stack[0]) 657 return tuple(self._stack) 674 self._marks.append(len(self._stack)) 764 self._stack[mark:] = [self._stack[mark:]] 772 items = self._stack[mark:] 775 self._stack[mark:] = [dict]`
/external/python/cpython2/Lib/
D	xmlrpclib.py	`784 self._stack = [] 790 self.append = self._stack.append 800 raise Fault(**self._stack[0]) 801 return tuple(self._stack) 816 self._marks.append(len(self._stack)) 889 self._stack[mark:] = [self._stack[mark:]] 897 items = self._stack[mark:] 900 self._stack[mark:] = [dict]`
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python3/
D	Python3.stg	501 <ruleDescriptor.useScopes:{it \| self.<it>_stack.append(<it>_scope())}; separator="\n"> 502 <ruleDescriptor.ruleScope:{it \| self.<it.name>_stack.append(<it.name>_scope())}; separator="\n"> 506 <ruleDescriptor.useScopes:{it \| self.<it>_stack.pop()}; separator="\n"> 507 <ruleDescriptor.ruleScope:{it \| self.<it.name>_stack.pop()}; separator="\n"> 1270 self.<scope.name>_stack = []<\n> 1289 self.<scope.name>_stack = []<\n> 1333 self.<scope>_stack[-<negIndex>].<attr.name> 1336 self.<scope>_stack[<index>].<attr.name> 1338 self.<scope>_stack[-1].<attr.name> 1346 ((len(self.<scope>_stack) - <negIndex> - 1) >= 0 and [self.<scope>_stack[-<negIndex>].<attr.name>] … [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python/
D	Python.stg	494 <ruleDescriptor.useScopes:{it \| self.<it>_stack.append(<it>_scope())}; separator="\n"> 495 <ruleDescriptor.ruleScope:{it \| self.<it.name>_stack.append(<it.name>_scope())}; separator="\n"> 499 <ruleDescriptor.useScopes:{it \| self.<it>_stack.pop()}; separator="\n"> 500 <ruleDescriptor.ruleScope:{it \| self.<it.name>_stack.pop()}; separator="\n"> 1252 self.<scope.name>_stack = []<\n> 1271 self.<scope.name>_stack = []<\n> 1315 self.<scope>_stack[-<negIndex>].<attr.name> 1318 self.<scope>_stack[<index>].<attr.name> 1320 self.<scope>_stack[-1].<attr.name> 1328 ((len(self.<scope>_stack) - <negIndex> - 1) >= 0 and [self.<scope>_stack[-<negIndex>].<attr.name>] … [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
D	ActionScript.stg	387 <ruleDescriptor.useScopes:{it \|<it>_stack.push(new Object());}; separator="\n"> 388 <ruleDescriptor.ruleScope:{it \|<it.name>_stack.push(new Object());}; separator="\n"> 392 <ruleDescriptor.useScopes:{it \|<it>_stack.pop();}; separator="\n"> 393 <ruleDescriptor.ruleScope:{it \|<it.name>_stack.pop();}; separator="\n"> 1083 protected var <scope.name>_stack:Array = new Array();<\n> 1089 protected var <scope.name>_stack:Array = new Array();<\n> 1160 <scope>_stack[<scope>_stack.length-<negIndex>-1].<attr.name> 1163 <scope>_stack[<index>].<attr.name> 1165 <scope>_stack[<scope>_stack.length-1].<attr.name> 1172 <scope>_stack[<scope>_stack.length-<negIndex>-1].<attr.name> =<expr>; [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
D	JavaScript.stg	389 <ruleDescriptor.useScopes:{this.<it>_stack.push({});}; separator="\n"> 390 <ruleDescriptor.ruleScope:{this.<it.name>_stack.push({});}; separator="\n"> 394 <ruleDescriptor.useScopes:{this.<it>_stack.pop();}; separator="\n"> 395 <ruleDescriptor.ruleScope:{this.<it.name>_stack.pop();}; separator="\n"> 1099 <scope.name>_stack: [],<\n> 1105 <scope.name>_stack: [],<\n> 1182 (this.<scope>_stack[this.<scope>_stack.length-<negIndex>-1]).<attr.name> 1185 (this.<scope>_stack[<index>]).<attr.name> 1187 org.antlr.lang.array.peek(this.<scope>_stack).<attr.name> 1194 (this.<scope>_stack[this.<scope>_stack.length-<negIndex>-1]).<attr.name> =<expr>; [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Perl5/
D	Perl5.stg	407 <ruleDescriptor.useScopes:{<it>_stack.push(new <it>_scope());}; separator="\n"> 408 <ruleDescriptor.ruleScope:{<it.name>_stack.push(new <it.name>_scope());}; separator="\n"> 412 <ruleDescriptor.useScopes:{<it>_stack.pop();}; separator="\n"> 413 <ruleDescriptor.ruleScope:{<it.name>_stack.pop();}; separator="\n"> 1138 protected Stack <scope.name>_stack = new Stack();<\n> 1147 protected Stack <scope.name>_stack = new Stack();<\n> 1221 ((<scope>_scope)<scope>_stack.elementAt(<scope>_stack.size()-<negIndex>-1)).<attr.name> 1224 ((<scope>_scope)<scope>_stack.elementAt(<index>)).<attr.name> 1226 ((<scope>_scope)<scope>_stack.peek()).<attr.name> 1233 ((<scope>_scope)<scope>_stack.elementAt(<scope>_stack.size()-<negIndex>-1)).<attr.name> =<expr>; [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ObjC/
D	ObjC.stg	930 <ruleDescriptor.useScopes:{it \| [<it>_stack push:[<it>_Scope new<it>_Scope]];}> 931 <ruleDescriptor.ruleScope:{it \| [<it.name>_stack push:[<it.name>_Scope new<it.name>_Scope]];}> 936 <ruleDescriptor.useScopes:{it \| [<it>_stack pop];}; separator="\n"> 937 <ruleDescriptor.ruleScope:{it \| [<it.name>_stack pop];}; separator="\n"> 1737 SymbolStack <scope.name>_stack;<\n> 1770 <scope.name>_stack = [SymbolStack newSymbolStackWithLen:30];<\n> 1773 globalAttributeScopeDealloc(scope) ::= <% [<scope.name>_stack release];<\n> %> 1777 static <scope.name>_stack;<\n> 1831 <scope.name>_stack = [SymbolStack newSymbolStackWithLen:30];<\n> 1839 static SymbolStack <scope.name>_stack;<\n> [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Scala/
D	Scala.stg	411 <ruleDescriptor.useScopes:{it \| <it>_stack.push(new <it>_scope())}; separator="\n"> 412 <ruleDescriptor.ruleScope:{it \| <it.name>_stack.push(new <it.name>_scope())}; separator="\n"> 416 <ruleDescriptor.useScopes:{it \| <it>_stack.pop()}; separator="\n"> 417 <ruleDescriptor.ruleScope:{it \| <it.name>_stack.pop()}; separator="\n"> 1147 val <scope.name>_stack = new collection.mutable.Stack[<scope.name>_scope]<\n> 1156 val <scope.name>_stack = new collection.mutable.Stack[<scope.name>_scope]<\n> 1228 <scope>_stack(<scope>_stack.size-<negIndex>-1).<attr.name> 1231 <scope>_stack(<index>).<attr.name> 1233 <scope>_stack.top.<attr.name> 1240 <scope>_stack(<scope>_stack.size-<negIndex>-1).<attr.name> = <expr> [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Java/
D	Java.stg	448 <ruleDescriptor.useScopes:{it \|<it>_stack.push(new <it>_scope());}; separator="\n"> 449 <ruleDescriptor.ruleScope:{it \|<it.name>_stack.push(new <it.name>_scope());}; separator="\n"> 453 <ruleDescriptor.useScopes:{it \|<it>_stack.pop();}; separator="\n"> 454 <ruleDescriptor.ruleScope:{it \|<it.name>_stack.pop();}; separator="\n"> 1214 protected Stack\<<scope.name>_scope> <scope.name>_stack = new Stack\<<scope.name>_scope>(); 1224 protected Stack\<<scope.name>_scope> <scope.name>_stack = new Stack\<<scope.name>_scope>(); 1297 <scope>_stack.elementAt(<scope>_stack.size()-<negIndex>-1).<attr.name> 1300 <scope>_stack.elementAt(<index>).<attr.name> 1302 <scope>_stack.peek().<attr.name> 1309 <scope>_stack.elementAt(<scope>_stack.size()-<negIndex>-1).<attr.name> =<expr>; [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/
D	CSharp3.stg	623 <ruleDescriptor.useScopes:{it\|<it>_stack.Push(new <it>_scope(this));<it>_scopeInit(<it>_stack.Peek(… 624 <ruleDescriptor.ruleScope:{it\|<it.name>_stack.Push(new <it.name>_scope(this));<it.name>_scopeInit(<… 628 <ruleDescriptor.useScopes:{it\|<it>_scopeAfter(<it>_stack.Peek());<it>_stack.Pop();}; separator="\n"> 629 <ruleDescriptor.ruleScope:{it\|<it.name>_scopeAfter(<it.name>_stack.Peek());<it.name>_stack.Pop();};… 1488 protected readonly ListStack\<<scope.name>_scope> <scope.name>_stack = new ListStack\<<scope.name>_… 1581 <scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> 1584 <scope>_stack[<index>].<attr.name; format="id"> 1586 <scope>_stack.Peek().<attr.name; format="id"> 1593 <scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> = <expr>; 1596 <scope>_stack[<index>].<attr.name; format="id"> = <expr>; [all …]
/external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/
D	CSharp2.stg	645 <ruleDescriptor.useScopes:{it\|<it>_stack.Push(new <it>_scope());<it>_scopeInit(<it>_stack.Peek());}… 646 <ruleDescriptor.ruleScope:{it\|<it.name>_stack.Push(new <it.name>_scope());<it.name>_scopeInit(<it.n… 650 <ruleDescriptor.useScopes:{it\|<it>_scopeAfter(<it>_stack.Peek());<it>_stack.Pop();}; separator="\n"> 651 <ruleDescriptor.ruleScope:{it\|<it.name>_scopeAfter(<it.name>_stack.Peek());<it.name>_stack.Pop();};… 1508 protected readonly ListStack\<<scope.name>_scope> <scope.name>_stack = new ListStack\<<scope.name>_… 1599 <scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> 1602 <scope>_stack[<index>].<attr.name; format="id"> 1604 <scope>_stack.Peek().<attr.name; format="id"> 1611 <scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> = <expr>; 1614 <scope>_stack[<index>].<attr.name; format="id"> = <expr>; [all …]
/external/tensorflow/tensorflow/python/ops/parallel_for/
D	pfor.py	55 def _stack(t, length): function 423 inp = _stack(inp, loop_len_vector).t 483 done_inp = _stack(inp, [array_ops.size(done_indices)]).t 688 self._inputs[i] = _stack(inp.t, length) 1148 return _stack(output, self._loop_len_vector).t 2048 data = _stack(data, pfor_input.pfor.loop_len_vector).t 2499 value = _stack(value, pfor_input.pfor.loop_len_vector).t 2510 return _stack(flow_out, pfor_input.pfor.loop_len_vector) 2518 value = _stack(value, pfor_input.pfor.loop_len_vector).t 2520 return _stack(flow_out, pfor_input.pfor.loop_len_vector) [all …]
/external/tinyxml2/contrib/
D	html5-printer.cpp	`67 if (_elementJustOpened && !isVoidElement (_stack.PeekTop())) { in CloseElement()`

art
bionic
bootable
build
cts
dalvik
developers
development
device
external
frameworks
hardware
kernel
libcore
libnativehelper
packages
pdk
platform_testing
sdk
system
test
toolchain
tools