| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| StackExtensions.cs | 45 public static T elementAt<T>( this Stack<T> stack, int index )
47 return stack.ElementAt( index );
51 public static T peek<T>( this Stack<T> stack )
53 return stack.Peek();
57 public static T pop<T>( this Stack<T> stack )
59 return stack.Pop();
63 public static void push<T>( this Stack<T> stack, T obj
[all...] |
| /frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| Stack.java | 22 * Custom Stack implementation on top of an {@link ArrayList} instead of
23 * using {@link java.util.Stack} which is on top of a vector.
27 public class Stack<T> extends ArrayList<T> {
31 public Stack() {
35 public Stack(int size) {
40 * Pushes the given object to the stack
48 * Remove the object at the top of the stack and returns it.
49 * @return the removed object or null if the stack was empty.
60 * Returns the object at the top of the stack.
61 * @return the object at the top or null if the stack is empty
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| virtual_parse_stack.java | 4 import java.util.Stack;
6 /** This class implements a temporary or "virtual" parse stack that
7 * replaces the top portion of the actual parse stack (the part that
13 * reverts to the original parse stack (which has not actually been
15 * state is maintained on the virtual stack, not full symbol objects.
27 /** Constructor to build a virtual stack out of a real stack. */
28 public virtual_parse_stack(Stack shadowing_stack) throws java.lang.Exception
33 "Internal parser error: attempt to create null virtual stack");
37 vstack = new Stack();
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/debug/ |
| stack.go | 14 // PrintStack prints to standard error the stack trace returned by runtime.Stack.
16 os.Stderr.Write(Stack())
19 // Stack returns a formatted stack trace of the goroutine that calls it.
20 // It calls runtime.Stack with a large enough buffer to capture the entire trace.
21 func Stack() []byte {
24 n := runtime.Stack(buf, false)
|
| /prebuilts/go/linux-x86/src/runtime/debug/ |
| stack.go | 14 // PrintStack prints to standard error the stack trace returned by runtime.Stack.
16 os.Stderr.Write(Stack())
19 // Stack returns a formatted stack trace of the goroutine that calls it.
20 // It calls runtime.Stack with a large enough buffer to capture the entire trace.
21 func Stack() []byte {
24 n := runtime.Stack(buf, false)
|
| /external/clang/lib/Format/ |
| ContinuationIndenter.cpp | 84 State.Stack.push_back(ParenState(FirstIndent, Line->Level, FirstIndent,
103 !(State.Stack.back().BreakBeforeClosingBrace &&
122 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder)
127 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 &&
128 State.Stack[State.Stack.size() - 2].NestedBlockInlined &&
129 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks)
139 return !State.Stack.back().NoLineBreak;
147 if (State.Stack.back().BreakBeforeClosingBrace &
[all...] |
| /external/easymock/src/org/easymock/internal/ |
| LastControl.java | 21 import java.util.Stack;
31 private static final ThreadLocal<Stack<Invocation>> threadToCurrentInvocation = new ThreadLocal<Stack<Invocation>>();
33 private static final ThreadLocal<Stack<IArgumentMatcher>> threadToArgumentMatcherStack = new ThreadLocal<Stack<IArgumentMatcher>>();
48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
local
49 if (stack == null) {
50 stack = new Stack<IArgumentMatcher>();
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
72 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
78 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
98 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
104 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
112 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
121 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
[all...] |
| /frameworks/base/core/proto/android/os/ |
| backtrace.proto | 27 message Stack {
35 repeated Stack traces = 1;
|
| /system/core/libmemunreachable/ |
| PtracerThread.h | 29 class Stack;
47 std::unique_ptr<Stack> stack_;
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must hav
119 Stack stack; local
141 final Stack stack = getPrefixStack(prefix); local
152 final Stack stack = (Stack) m_namespaces.get(prefix); local
210 Stack stack; local
233 Stack stack; local
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/asm/internal/lex/ |
| stack.go | 13 // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
15 type Stack struct {
19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
24 func (s *Stack) Next() ScanToken {
29 // Pop the topmost item from the stack and resume with the next one down.
36 func (s *Stack) Text() string {
40 func (s *Stack) File() string {
44 func (s *Stack) Base() *src.PosBase
[all...] |
| /prebuilts/go/linux-x86/src/cmd/asm/internal/lex/ |
| stack.go | 13 // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
15 type Stack struct {
19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
24 func (s *Stack) Next() ScanToken {
29 // Pop the topmost item from the stack and resume with the next one down.
36 func (s *Stack) Text() string {
40 func (s *Stack) File() string {
44 func (s *Stack) Base() *src.PosBase
[all...] |
| /external/boringssl/src/include/openssl/ |
| stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
116 // These are the raw stack functions, you shouldn't be using them. Rather you
117 // should be using the type stack macros implemented above.
119 // sk_new creates a new, empty stack with the given comparison function, which
120 // may be zero. It returns the new stack or NULL on allocation failure.
123 // sk_new_null creates a new, empty stack. It returns the new stack or NULL o
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| EmptyStackExceptionTest.java | 21 import java.util.Stack;
26 Stack s;
51 s = new Stack();
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
| stack.h | 25 // Stack
27 //! A type-unsafe stack for storing different types of data.
28 /*! \tparam Allocator Allocator for allocating stack memory.
31 class Stack {
35 Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
40 Stack(Stack&& rhs)
57 ~Stack() {
62 Stack& operator=(Stack&& rhs) {
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Stack.java | 29 * The <code>Stack</code> class represents a last-in-first-out
30 * (LIFO) stack of objects. It extends class <tt>Vector</tt> with five
31 * operations that allow a vector to be treated as a stack. The usual
33 * method to <tt>peek</tt> at the top item on the stack, a method to test
34 * for whether the stack is <tt>empty</tt>, and a method to <tt>search</tt>
35 * the stack for an item and discover how far it is from the top.
37 * When a stack is first created, it contains no items.
39 * <p>A more complete and consistent set of LIFO stack operations is
43 * Deque<Integer> stack = new ArrayDeque<Integer>();}</pre>
49 class Stack<E> extends Vector<E>
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Compatibility/FrameworkHiiOnUefiHiiThunk/ |
| UefiIfrParserExpression.c | 34 // Global stack used to evaluate boolean expresions
48 Grow size of the stack
50 @param Stack On input: old stack; On output: new stack
51 @param StackPtr On input: old stack pointer; On output: new stack
53 @param StackEnd On input: old stack end; On output: new stack end
55 @retval EFI_SUCCESS Grow stack success.
[all...] |
| /cts/hostsidetests/incident/src/com/android/server/cts/ |
| StackTraceIncidentTest.java | 26 for (BackTraceProto.Stack s : dump.getTracesList()) {
|
| /device/linaro/bootloader/edk2/IntelFspPkg/Library/BaseFspSwitchStackLib/ |
| BaseFspSwitchStackLib.inf | 27 Ia32/Stack.asm | MSFT
28 Ia32/Stack.s | GCC
|
| /device/linaro/bootloader/edk2/IntelFsp2Pkg/Library/BaseFspSwitchStackLib/ |
| BaseFspSwitchStackLib.inf | 27 Ia32/Stack.nasm
|
| /external/compiler-rt/lib/esan/ |
| esan_sideline.h | 51 char *Stack;
|
| /external/valgrind/none/tests/linux/ |
| stack-overflow.stderr.exp | 2 Stack overflow in thread #1: can't grow stack to 0x........
6 Stack overflow in thread #1: can't grow stack to 0x........
7 at 0x........: main (stack-overflow.c:5)
8 If you believe this happened as a result of a stack
11 main thread stack using the --main-stacksize= flag.
12 The main thread stack size used in this run was ....
|
| /external/valgrind/none/tests/solaris/ |
| stack-overflow.stderr.exp | 2 Stack overflow in thread #1: can't grow stack to 0x........
6 Stack overflow in thread #1: can't grow stack to 0x........
7 at 0x........: main (stack-overflow.c:5)
8 If you believe this happened as a result of a stack
11 main thread stack using the --main-stacksize= flag.
12 The main thread stack size used in this run was ....
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes;
7 private java.util.Stack<Integer> marks;
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
15 marks = new java.util.Stack<Integer>();
27 /* Call this to reinitialize the node stack. It is called
42 /* Pushes a node on to the stack. */
48 /* Returns the node on the top of the stack, and remove it from the
49 stack. */
57 /* Returns the node currently on the top of the stack. *
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| emplace.pass.cpp | 12 // <stack>
18 #include <stack>
26 template <typename Stack>
28 typedef typename Stack::container_type Container;
30 typedef decltype(std::declval<Stack>().emplace(std::declval<value_type &>())) stack_return_type;
42 test_return_type<std::stack<int> > ();
43 test_return_type<std::stack<int, std::vector<int> > > ();
46 std::stack<Emplaceable> q;
|
