| /external/valgrind/main/memcheck/tests/ |
| deep_templates.cpp | 11 class Stack
14 Stack(int = 10) { size=5; top=6; stackPtr=(T*)6; };
15 ~Stack() { }
27 typedef Stack<int,char> Foo;
28 typedef Stack<Foo,Foo> Foo2;
29 typedef Stack<Foo2,Foo2> Foo3;
30 typedef Stack<Foo3,Foo3> Foo4;
31 typedef Stack<Foo4,Foo4> Foo5;
32 typedef Stack<Foo5,Foo5> Foo6;
33 typedef Stack<Foo6,Foo6> Foo7
[all...] |
| /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...] |
| /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/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| EmptyStackExceptionTest.java | 21 import java.util.Stack;
26 Stack s;
52 s = new Stack();
|
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * @tests java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * @tests 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())
[all...] |
| /libcore/luni/src/test/java/tests/api/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...] |
| /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...] |
| /external/clang/lib/Sema/ |
| SemaAttr.cpp | 29 // We just use a sentinel to represent when the stack is set to mac68k
37 /// PragmaPackStack - Simple class to wrap the stack used by #pragma
45 /// Stack - Entries in the #pragma pack stack, consisting of saved
47 stack_ty Stack;
55 /// push - Push the current alignment onto the stack, optionally
59 Stack.push_back(PSE);
62 /// pop - Pop a record from the stack and restore the current
73 // An empty stack is a special case...
74 if (Stack.empty())
[all...] |
| /sdk/emulator/qtools/ |
| read_method.cpp | 26 class Stack {
32 Stack() {
41 void Stack::push(frame *pframe) {
43 fprintf(stderr, "Error: stack overflow\n");
50 frame *Stack::pop() {
57 void Stack::dump() {
70 Stack *stacks[kMaxThreads];
115 // Get the stack for the current thread
116 Stack *pStack = stacks[proc->pid];
118 // If the stack does not exist, then allocate a new one
[all...] |
| check_stack.cpp | 45 class Stack {
51 Stack() {
60 void Stack::push(frame *pframe) {
62 fprintf(stderr, "Error: stack overflow\n");
69 frame *Stack::pop() {
76 Stack *mStacks[kMaxThreads];
121 // Get the stack for the current thread
122 Stack *mStack = mStacks[proc->pid];
124 // If the stack does not exist, then allocate a new one.
126 mStack = new Stack();
[all...] |
| /external/valgrind/main/coregrind/ |
| m_stacks.c | 3 /*--- Stack management. m_stacks.c ---*/
41 The stack
43 The stack's segment seems to be dynamically extended downwards by
44 the kernel as the stack pointer moves down. Initially, a 1-page
45 (4k) stack is allocated. When SP moves below that for the first
48 upwards to the current valid stack. It then extends the stack
53 That means that Valgrind can't spot when the stack segment is being
55 update stack permissions around SP, so we need to spot all writes
58 The deal is: when SP is assigned a lower value, the stack is bein
263 Stack* stack = find_stack_by_addr(SP); local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Stack.java | 21 * {@code Stack} is a Last-In/First-Out(LIFO) data structure which represents a
22 * stack of objects. It enables users to pop to and push from the stack,
23 * including null objects. There is no limit to the size of the stack.
25 public class Stack<E> extends Vector<E> {
30 * Constructs a stack with the default size of {@code Vector}.
32 public Stack() {
36 * Returns whether the stack is empty or not.
38 * @return {@code true} if the stack is empty, {@code false} otherwise.
45 * Returns the element at the top of the stack without removing it
[all...] |
| /packages/apps/Email/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...] |
| /tools/motodev/src/plugins/translation/src/com/motorola/studio/android/json/ |
| JSONArray.java | 21 import java.util.Stack;
40 Stack<Character> stack = new Stack<Character>();
local
49 stack.push('[');
54 if (stack.pop() != '[')
|
| JSONObject.java | 22 import java.util.Stack;
41 Stack<Character> stack = new Stack<Character>();
local
51 stack.push('{');
56 if (stack.pop() != '{')
|
| /external/llvm/include/llvm/Support/ |
| FileSystem.h | 39 #include <stack>
791 std::stack<directory_iterator, std::vector<directory_iterator> > Stack;
806 State->Stack.push(directory_iterator(path, ec));
807 if (State->Stack.top() == directory_iterator())
818 if ((ec = State->Stack.top()->status(st))) return *this;
820 State->Stack.push(directory_iterator(*State->Stack.top(), ec));
822 if (State->Stack.top() != end_itr) {
826 State->Stack.pop()
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
| ParseTreeBuilder.java | 34 import java.util.Stack;
44 Stack callStack = new Stack();
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_item.java | 3 import java.util.Stack;
47 _propagate_items = new Stack();
85 protected Stack _propagate_items;
88 public Stack propagate_items() {return _propagate_items;}
|
| /external/proguard/src/proguard/evaluation/ |
| InvocationUnit.java | 30 * and it updates the stack for the invocation of a class member.
53 * Updates the given stack corresponding to the execution of the given
61 Stack stack);
|
| Stack.java | 26 * This class represents an operand stack that contains <code>Value</code>
31 public class Stack
42 * Creates a new Stack with a given maximum size, accounting for the double
45 public Stack(int maxSize)
52 * Creates a Stack that is a copy of the given Stack.
54 public Stack(Stack stack)
57 this(stack.values.length)
[all...] |
| /external/proguard/src/proguard/classfile/util/ |
| DescriptorClassEnumeration.java | 25 import java.util.Stack;
41 private Stack accumulatedClassNames;
102 // Make sure we have a stack.
105 accumulatedClassNames = new Stack();
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/testtype/ |
| TestPackageXmlParser.java | 26 import java.util.Stack;
63 private Stack<String> mClassNameStack = new Stack<String>();
92 mClassNameStack = new Stack<String>();
|
