HomeSort by relevance Sort by last modified time
    Searched full:front (Results 76 - 100 of 3374) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/libcxx/test/std/containers/sequences/deque/deque.capacity/
access.pass.cpp 18 // reference front();
19 // const_reference front() const;
59 assert(c.front() == 0);
68 assert(c.front() == 0);
78 assert(c.front() == 0);
87 assert(c.front() == 0);
  /external/libcxx/test/std/containers/sequences/vector.bool/
emplace.pass.cpp 29 assert(c.front() == false);
34 assert(c.front() == false);
40 assert(c.front() == false);
51 assert(c.front() == false);
56 assert(c.front() == false);
63 assert(c.front() == false);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/
access.pass.cpp 18 // reference front();
19 // const_reference front() const;
59 assert(c.front() == 0);
68 assert(c.front() == 0);
78 assert(c.front() == 0);
87 assert(c.front() == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/
emplace.pass.cpp 29 assert(c.front() == false);
34 assert(c.front() == false);
40 assert(c.front() == false);
51 assert(c.front() == false);
56 assert(c.front() == false);
63 assert(c.front() == false);
  /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
pop.pass.cpp 25 assert(q.front() == 1);
29 assert(q.front() == 2);
33 assert(q.front() == 3);
push.pass.cpp 22 assert(q.front() == 1);
26 assert(q.front() == 1);
30 assert(q.front() == 1);
push_rv.pass.cpp 25 assert(q.front() == MoveOnly(1));
29 assert(q.front() == MoveOnly(1));
33 assert(q.front() == MoveOnly(1));
  /external/libcxx/test/std/containers/sequences/list/
db_cfront.pass.cpp 12 // Call front() on empty const container.
32 assert(c.front() == 0);
40 assert(c.front() == 0);
  /external/libcxx/test/std/containers/sequences/vector/
db_cfront.pass.cpp 12 // Call front() on empty const container.
32 assert(c.front() == 0);
40 assert(c.front() == 0);
  /external/libcxx/test/std/experimental/string.view/string.view.access/
front.pass.cpp 22 assert ( sv.front() == s[0] );
23 return &sv.front() == s;
45 static_assert ( sv.front() == 'A', "" );
  /external/libcxx/test/std/strings/basic.string/string.access/
db_cfront.pass.cpp 12 // Call front() on empty const container.
31 assert(s.front() == 0);
38 assert(s.front() == 0);
  /external/selinux/libselinux/src/
label_file.h 180 int front, back; local
188 front = 0;
192 memcpy(&spec_copy[front++], &data->spec_arr[i], len);
199 * since 'front' is now the first of the 'exact' we can run that part of the
200 * array switching the front and back element.
203 while (front < back) {
204 /* save the front */
205 memcpy(&spec, &spec_copy[front], len);
206 /* move the back to the front */
207 memcpy(&spec_copy[front], &spec_copy[back], len)
    [all...]
  /frameworks/base/tools/aapt2/
SourceXmlPullParser.cpp 92 return mEventQueue.front().event;
100 return mEventQueue.front().comment;
104 return mEventQueue.front().lineNumber;
108 return mEventQueue.front().depth;
115 return mEventQueue.front().data1;
123 return mEventQueue.front().data1;
131 return mEventQueue.front().data2;
155 return mEventQueue.front().data1;
163 return mEventQueue.front().data2;
167 return mEventQueue.front().attributes.begin()
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/
pop.pass.cpp 25 assert(q.front() == 1);
29 assert(q.front() == 2);
33 assert(q.front() == 3);
push.pass.cpp 22 assert(q.front() == 1);
26 assert(q.front() == 1);
30 assert(q.front() == 1);
push_rv.pass.cpp 25 assert(q.front() == MoveOnly(1));
29 assert(q.front() == MoveOnly(1));
33 assert(q.front() == MoveOnly(1));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/
db_cfront.pass.cpp 12 // Call front() on empty const container.
32 assert(c.front() == 0);
40 assert(c.front() == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/
db_cfront.pass.cpp 12 // Call front() on empty const container.
32 assert(c.front() == 0);
40 assert(c.front() == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.access/
db_cfront.pass.cpp 12 // Call front() on empty const container.
31 assert(s.front() == 0);
38 assert(s.front() == 0);
  /prebuilts/misc/common/swig/include/2.0.11/octave/
std_common.i 36 instantiations required using %template). The STL containers define the 'front' method and the typemap
37 below is used whenever the front method is wrapped returning an enum. This typemap simply picks up the
61 %typemap(out, fragment="SWIG_Traits_enum_"{Type}) const enum SWIGTYPE& front %{$typemap(out, const enum SWIGTYPE&)%}
  /prebuilts/misc/common/swig/include/2.0.11/python/
std_common.i 38 instantiations required using %template). The STL containers define the 'front' method and the typemap
39 below is used whenever the front method is wrapped returning an enum. This typemap simply picks up the
63 %typemap(out, fragment="SWIG_Traits_enum_"{Type}) const enum SWIGTYPE& front %{$typemap(out, const enum SWIGTYPE&)%}
  /prebuilts/misc/common/swig/include/2.0.11/r/
std_common.i 37 instantiations required using %template). The STL containers define the 'front' method and the typemap
38 below is used whenever the front method is wrapped returning an enum. This typemap simply picks up the
62 %typemap(out, fragment="SWIG_Traits_enum_"{Type}) const enum SWIGTYPE& front %{$typemap(out, const enum SWIGTYPE&)%}
  /prebuilts/misc/common/swig/include/2.0.11/ruby/
std_common.i 39 instantiations required using %template). The STL containers define the 'front' method and the typemap
40 below is used whenever the front method is wrapped returning an enum. This typemap simply picks up the
64 %typemap(out, fragment="SWIG_Traits_enum_"{Type}) const enum SWIGTYPE& front %{$typemap(out, const enum SWIGTYPE&)%}
  /development/samples/training/AnimationsDemo/res/animator/
card_flip_left_out.xml 21 The overall effect of this animator is to rotate the front of the card
24 1. The front rotates 90 degrees, from facing the user to being
26 2. The front is then made invisible (this is half-way through the
28 3. The front rotates another 90 degrees, from zero-width, to
  /external/libcxx/test/std/containers/sequences/dynarray/dynarray.overview/
front_back.pass.cpp 12 // reference front();
13 // const_reference front() const;
34 assert ( *data == dyn.front ());
41 assert ( *data == dyn.front ());

Completed in 704 milliseconds

1 2 34 5 6 7 8 91011>>