| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.defn/ |
| assign_copy.pass.cpp | 10 // <stack>
12 // stack& operator=(const stack& q);
14 #include <stack>
29 std::stack<int> q(make<std::deque<int> >(5));
30 std::stack<int> q2;
|
| top_const.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
24 const std::stack<int>& cqr = q;
|
| types.pass.cpp | 10 // <stack>
13 // class stack
27 #include <stack>
32 : private std::stack<int>
50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), "");
51 static_assert((std::is_same<std::stack<double, std::vector<int> >::container_type, std::vector<int> >::value), "");
52 static_assert((std::is_same<std::stack<double, std::vector<int> >::value_type, int>::value), "");
53 static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), "");
54 static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::value), "");
55 static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), "")
[all...] |
| /external/srec/srec/crec/ |
| astar.c | 52 int astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack);
238 void list_free_parps(AstarStack* stack, char* msg);
240 #define list_free_parps(stack,msg)
248 partial_path* make_new_partial_path(AstarStack* stack);
249 /*void free_partial_path(AstarStack* stack, partial_path* parp); put the proto in astar.h */
289 partial_path* extend_path(AstarStack* stack,
383 extended_parp = make_new_partial_path(stack);
421 void check_stack_root_sanity(AstarStack* stack)
423 partial_path* parp1 = stack->root_path;
424 /* append_arc_arriving(stack->root_path, parp); *
524 AstarStack *stack; local
556 AstarStack *stack = rec->astar_stack; local
657 AstarStack *stack = rec->astar_stack; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /external/skia/tests/ |
| ClipStackTest.cpp | 25 // Build up a clip stack with a path, an empty clip, and a rect.
124 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack,
126 SkClipStack::B2TIter iter(stack);
137 SkClipStack stack; local
148 stack.clipDevRect(gRects[i], SkRegion::kUnion_Op, false);
151 assert_count(reporter, stack, 4);
157 SkClipStack::B2TIter iter(stack);
172 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
187 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart);
247 SkClipStack stack; local
827 SkClipStack stack; local
915 SkClipStack stack; local
[all...] |
| /external/bison/examples/calc++/ |
| stack.hh | 3 /* Stack handling for Bison parsers in C++
34 ** \file ../../../../examples/calc++/stack.hh
35 ** Define the yy::stack class.
45 /* Line 34 of stack.hh */
46 #line 47 "../../../../examples/calc++/stack.hh"
48 class stack class in namespace:yy
55 stack () : seq_ () function in class:yy::stack
59 stack (unsigned int n) : seq_ (n) function in class:yy::stack
106 /// Present a slice of the top of a stack.
107 template <class T, class S = stack<T>
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| CodeAnalyzer.java | 33 /* d = stack[i]
40 int[] stack = new int[length]; local
42 initStack(stack, codeAttr);
47 if (stack[i] < 0) {
49 visitBytecode(ci, stack, i);
55 if (stack[i] > maxStack)
56 maxStack = stack[i];
61 private void initStack(int[] stack, CodeAttribute ca) {
62 stack[0] = -1;
67 stack[et.handlerPc(i)] = -2; // an exception is on stac
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_move.pass.cpp | 10 // <stack>
12 // stack(stack&& q);
14 #include <stack>
36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
37 std::stack<MoveOnly> q2 = std::move(q);
|
| ctor_default.pass.cpp | 10 // <stack>
12 // stack();
14 #include <stack>
22 std::stack<int, std::vector<int, stack_allocator<int, 10> > > q;
|
| ctor_rcontainer.pass.cpp | 10 // <stack>
12 // explicit stack(container_type&& c);
14 #include <stack>
36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| SIPDialogEventListener.java | 16 package gov.nist.javax.sip.stack;
|
| SIPTransactionEventListener.java | 26 package gov.nist.javax.sip.stack;
|
| /external/compiler-rt/lib/asan/ |
| asan_report.h | 22 // on the memory type (shadow/heap/stack/global).
36 void NORETURN ReportDoubleFree(uptr addr, StackTrace *stack);
37 void NORETURN ReportFreeNotMalloced(uptr addr, StackTrace *stack);
38 void NORETURN ReportAllocTypeMismatch(uptr addr, StackTrace *stack,
42 StackTrace *stack);
44 StackTrace *stack);
47 const char *offset2, uptr length2, StackTrace *stack);
51 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
53 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
55 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Frame.java | 19 * Represents the stack frame and local variable table at a particular point in time.
25 private Type[] stack; field in class:Frame
31 * Create a new frame with the specified local variable table size, and max stack size
34 * @param stack the maximum stack size
36 public Frame(int locals, int stack) {
38 this.stack = new Type[stack];
63 * Returns the type on the stack at the specified index.
65 * @param index the position on the stack
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/message/ |
| Message.java | 25 import java.util.Stack;
100 private Stack<Object> stack = new Stack<Object>();
field in class:Message.MessageBuilder
106 if (!c.isInstance(stack.peek())) {
107 throw new IllegalStateException("Internal stack error: "
109 + stack.peek().getClass().getName() + "'");
117 if (stack.isEmpty()) {
118 stack.push(Message.this);
122 ((Entity) stack.peek()).setBody(m);
[all...] |
| /bionic/libc/arch-arm/bionic/ |
| crtend.S | 39 .section .note.GNU-stack,"",%progbits
|
