| /external/chromium_org/chrome/browser/ui/panels/ |
| stacked_panel_drag_handler.cc | 20 StackedPanelCollection* stack = panel->stack(); local
21 DCHECK(stack);
23 // If the panel is in its original stack, only top panel is allowed to drag.
24 if (in_orginal_collection && panel != stack->top_panel())
27 // Find out if all panels in the stack are being dragged.
30 stack->panels().begin();
31 iter != stack->panels().end(); ++iter) {
40 // If not all panels in the stack are being dragged, it means that these
41 // panels being dragged have just been added to this stack. Dragging thes
54 StackedPanelCollection* stack = panel->stack(); local
[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
928 SkClipStack stack; local
1016 SkClipStack stack; local
[all...] |
| /external/freetype/src/cff/ |
| cf2stack.h | 5 /* Adobe's code for emulating a CFF stack (specification). */
46 /* CFF operand stack; specified maximum of 48 or 192 values */
75 cf2_stack_free( CF2_Stack stack ); variable
78 cf2_stack_count( CF2_Stack stack ); variable
81 cf2_stack_pushInt( CF2_Stack stack,
84 cf2_stack_pushFixed( CF2_Stack stack,
88 cf2_stack_popInt( CF2_Stack stack ); variable
90 cf2_stack_popFixed( CF2_Stack stack ); variable
93 cf2_stack_getReal( CF2_Stack stack,
97 cf2_stack_clear( CF2_Stack stack ); variable
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| empty.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| top.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.special/ |
| swap_noexcept.pass.cpp | 10 // <stack>
12 // void swap(stack& c)
17 #include <stack>
26 typedef std::stack<MoveOnly> C;
|
| /external/compiler-rt/lib/asan/ |
| asan_stack.cc | 12 // Code for ASan stack trace.
27 void PrintStack(StackTrace *stack) {
28 stack->PrintStack(stack->trace, stack->size, common_flags()->symbolize,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_copy.pass.cpp | 10 // <stack>
12 // stack(const stack&) = default;
14 #include <stack>
29 std::stack<int> q(make<std::deque<int> >(5));
30 std::stack<int> q2 = q;
|
| /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/chromium_org/third_party/opus/src/celt/ |
| stack_alloc.h | 5 @brief Temporary memory allocation on stack
52 * @def ALIGN(stack, size)
54 * Aligns the stack to a 'size' boundary
56 * @param stack Stack
61 * @def PUSH(stack, size, type)
63 * Allocates 'size' elements of type 'type' on the stack
65 * @param stack Stack
73 * Declare variable on stack
[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...] |
| /prebuilts/ndk/9/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/9/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...] |
