HomeSort by relevance Sort by last modified time
    Searched defs:an (Results 1 - 25 of 42) sorted by null

1 2

  /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/priority.queue/priqueue.cons/
ctor_iter_iter.pass.cpp 21 int* an = a + sizeof(a)/sizeof(a[0]); local
22 std::priority_queue<int> q(a, an);
23 assert(q.size() == an - a);
ctor_iter_iter_comp.pass.cpp 21 int* an = a + sizeof(a)/sizeof(a[0]); local
23 q(a, an, std::greater<int>());
24 assert(q.size() == an - a);
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.cons/
copy_alloc.pass.cpp 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
33 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
39 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
move_alloc.pass.cpp 25 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
28 for (int* p = ab; p < an; ++p)
31 for (int* p = ab; p < an; ++p)
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
43 for (int* p = ab; p < an; ++p)
46 for (int* p = ab; p < an; ++p)
55 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
58 for (int* p = ab; p < an; ++p)
61 for (int* p = ab; p < an; ++p)
move_assign.pass.cpp 25 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
28 for (int* p = ab; p < an; ++p)
31 for (int* p = ab; p < an; ++p)
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
44 for (int* p = ab; p < an; ++p)
47 for (int* p = ab; p < an; ++p)
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
60 for (int* p = ab; p < an; ++p)
63 for (int* p = ab; p < an; ++p)
copy.pass.cpp 30 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
31 test(std::deque<int>(ab, an));
move.pass.cpp 25 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
28 for (int* p = ab; p < an; ++p)
31 for (int* p = ab; p < an; ++p)
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
43 for (int* p = ab; p < an; ++p)
46 for (int* p = ab; p < an; ++p)
op_equal.pass.cpp 31 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
32 test(std::deque<int>(ab, an));
iter_iter_alloc.pass.cpp 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
40 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
41 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
42 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
43 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
iter_iter.pass.cpp 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
53 test(input_iterator<const int*>(ab), input_iterator<const int*>(an));
54 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an));
55 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an));
56 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an));
57 test<stack_allocator<int, 4096> >(ab, an);
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.cons/
construct_iter_iter.pass.cpp 34 int* an = a + sizeof(a)/sizeof(a[0]); local
35 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an));
36 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
37 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
38 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
39 test<std::vector<int> >(a, an);
41 test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an));
42 test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
43 test<std::vector<int, stack_allocator<int, 18> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
44 test<std::vector<int, stack_allocator<int, 18> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
    [all...]
construct_iter_iter_alloc.pass.cpp 35 int* an = a + sizeof(a)/sizeof(a[0]); local
37 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc);
38 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc);
39 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc);
40 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc);
41 test<std::vector<int> >(a, an, alloc);
copy_alloc.pass.cpp 33 int* an = a + sizeof(a)/sizeof(a[0]); local
34 test(std::vector<int>(a, an), std::allocator<int>());
copy.pass.cpp 33 int* an = a + sizeof(a)/sizeof(a[0]); local
34 test(std::vector<int>(a, an));
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/
construct_iter_iter.pass.cpp 34 bool* an = a + sizeof(a)/sizeof(a[0]); local
35 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an));
36 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an));
37 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an));
38 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an));
39 test<std::vector<bool> >(a, an);
construct_iter_iter_alloc.pass.cpp 35 bool* an = a + sizeof(a)/sizeof(a[0]); local
37 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc);
38 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc);
39 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc);
40 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc);
41 test<std::vector<bool> >(a, an, alloc);
copy_alloc.pass.cpp 33 int* an = a + sizeof(a)/sizeof(a[0]); local
34 test(std::vector<bool>(a, an), std::allocator<bool>());
copy.pass.cpp 34 bool* an = a + sizeof(a)/sizeof(a[0]); local
35 test(std::vector<bool>(a, an));
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
AnimateDrawables.java 11 * distributed under the License is distributed on an "AS IS" BASIS,
49 Animation an = new TranslateAnimation(0, 100, 0, 200); local
50 an.setDuration(2000);
51 an.setRepeatCount(-1);
52 an.initialize(10, 10, 10, 10);
54 mDrawable = new AnimateDrawable(dr, an);
55 an.startNow();
  /development/tools/mkstubs/tests/com/android/mkstubs/sourcer/
TestHelper.java 11 * distributed under the License is distributed on an "AS IS" BASIS,
31 String an = actual.replaceAll( "[\\s]+", " ").trim(); local
35 en, an);
  /external/jmonkeyengine/engine/src/niftygui/com/jme3/niftygui/
SoundDeviceJme.java 57 AudioNode an = new AudioNode(assetManager, filename, false); local
58 an.setPositional(false);
59 return new SoundHandleJme(ar, an);
  /external/libvorbis/doc/
a1-encapsulation-ogg.tex 4 \section{Embedding Vorbis into an Ogg stream} \label{vorbis:over:ogg}
12 The \xref{vorbis:spec:intro} provides an overview of the construction
120 decode, not an internal sample awaiting lapping with a
  /hardware/ti/omap3/omx/system/src/openmax_il/perf/inc/
perf_rt.h 62 an, ax, axx: average temporal statistics - yields stdev */
63 long n, tn, tn0, an; member in struct:PERF_RTdata_rate
  /external/libvorbis/lib/
floor1.c 42 int an; member in struct:lsfit_acc
213 this is an initial mapping */
459 a->an=na;
479 double weight = (a[i].bn+a[i].an)*info->twofitweight/(a[i].an+1)+1.;
486 bn+=a[i].bn + a[i].an * weight;
829 an essentially gaussian probability distribution. */
  /external/quake/quake/src/QW/client/
gl_rmain.c 507 float an; local
568 an = e->angles[1]/180*M_PI;
569 shadevector[0] = cos(-an);
570 shadevector[1] = sin(-an);

Completed in 713 milliseconds

1 2