| /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/base/tools/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...] |
| /system/core/libmemunreachable/ |
| PtracerThread.h | 27 class Stack;
44 std::unique_ptr<Stack> stack_;
|
| PtracerThread.cpp | 38 class Stack {
40 Stack(size_t size) : size_(size) {
51 prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, base_, size_, "libmemunreachable stack");
55 ~Stack() {
62 DISALLOW_COPY_AND_ASSIGN(Stack);
71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN);
73 LOG_ALWAYS_FATAL("failed to mmap child stack: %s", strerror(errno));
|
| /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...] |
| /external/clang/lib/Format/ |
| ContinuationIndenter.cpp | 78 State.Stack.push_back(ParenState(FirstIndent, Line->Level, FirstIndent,
97 !(State.Stack.back().BreakBeforeClosingBrace &&
116 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder)
121 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 &&
122 State.Stack[State.Stack.size() - 2].NestedBlockInlined &&
123 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks)
133 return !State.Stack.back().NoLineBreak;
141 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...] |
| /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...] |
| /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();
|
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * java.util.Stack#empty()
39 // Test for method boolean java.util.Stack.empty()
40 assertTrue("New stack answers non-empty", s.empty());
42 assertTrue("Stack should not be empty but answers empty", !s.empty())
133 Stack<Object> stack = new Stack<Object>(); local
[all...] |
| /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...] |
| /external/clang/lib/Sema/ |
| SemaAttr.cpp | 30 // We just use a sentinel to represent when the stack is set to mac68k
38 /// PragmaPackStack - Simple class to wrap the stack used by #pragma
46 /// Stack - Entries in the #pragma pack stack, consisting of saved
48 stack_ty Stack;
56 /// push - Push the current alignment onto the stack, optionally
60 Stack.push_back(PSE);
63 /// pop - Pop a record from the stack and restore the current
74 // An empty stack is a special case...
75 if (Stack.empty())
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 104 /// Post-order traversal stack entry.
179 SmallVector<POStackEntry, 16> Stack;
183 Stack.push_back(POStackEntry(EntryBlock, MF, MLI));
186 POStackEntry &Entry = Stack.back();
191 Stack.push_back(POStackEntry(Succ, MF, MLI));
208 Stack.pop_back();
209 if (Stack.empty())
250 "Control flow stack pushes and pops should be balanced.");
274 // predecessors so that we minimize the time that the BLOCK is on the stack,
275 // which reduces overall stack height
[all...] |
| /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...] |
| /packages/services/Telephony/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/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/ |
| NDC.java | 21 import java.util.Stack;
42 public static Stack cloneStack() {
47 public static void inherit(Stack stack) {
|
| /external/testng/src/main/java/org/testng/mustache/ |
| Model.java | 5 import java.util.Stack;
9 private Stack<SubModel> m_subModels = new Stack<>();
|
| /external/valgrind/coregrind/ |
| m_stacks.c | 3 /*--- Stack management. m_stacks.c ---*/
45 The stack
47 The stack's segment seems to be dynamically extended downwards by
48 the kernel as the stack pointer moves down. Initially, a 1-page
49 (4k) stack is allocated. When SP moves below that for the first
52 upwards to the current valid stack. It then extends the stack
57 That means that Valgrind can't spot when the stack segment is being
59 update stack permissions around SP, so we need to spot all writes
62 The deal is: when SP is assigned a lower value, the stack is bein
272 Stack* stack = find_stack_by_addr(SP); local
[all...] |
| m_addrinfo.c | 49 /* Returns the tid whose stack includes the address a.
60 // No stack found
65 /* Stack limits found. Search the tid to which this stack belongs. */
69 /* The stack end (highest accessible byte) is for sure inside the 'active'
70 part of the stack of the searched tid.
82 /* We can arrive here if a stack was registered with wrong bounds
84 and/or if the thread for the registered stack is dead, but
85 the stack was not unregistered. */
136 /* -- Perhaps it's on a thread's stack? -- *
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_diag.h | 23 SymbolizedStack *Stack;
26 if (Stack)
27 Stack->ClearAll();
31 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
32 : Stack(Stack) {}
35 if (Stack != S)
37 Stack = S;
39 const SymbolizedStack *get() const { return Stack; }
73 Location(const SymbolizedStackHolder &Stack)
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic6x/ |
| unwind-1.d | 10 Stack increment 8
25 Stack increment 8
31 Stack increment 0
42 Stack increment 0
48 Stack increment 0
54 Stack increment 0
60 Stack increment 0
66 Restore stack from frame pointer
72 Restore stack from frame pointer
|
| unwind-2.d | 10 Stack increment 8
25 Stack increment 8
31 Stack increment 0
42 Stack increment 0
48 Stack increment 0
54 Stack increment 0
60 Stack increment 0
66 Restore stack from frame pointer
72 Restore stack from frame pointer
|
