HomeSort by relevance Sort by last modified time
    Searched refs:begin (Results 226 - 250 of 10094) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/list_update_map_/
debug_fn_imps.hpp 49 for (const_iterator it = begin(); it != end(); ++it)
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/list_update_map_/
debug_fn_imps.hpp 49 for (const_iterator it = begin(); it != end(); ++it)
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/list_update_map_/
debug_fn_imps.hpp 49 for (const_iterator it = begin(); it != end(); ++it)
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/list_update_map_/
debug_fn_imps.hpp 49 for (const_iterator it = begin(); it != end(); ++it)
  /external/stlport/test/eh/
test_algo.cpp 41 SortClass* begin() { return items; } function in struct:SortBuffer
42 const SortClass* begin() const { return items; } function in struct:SortBuffer
50 EH_STD::sort( begin(), begin() + ( end() - begin() )/2 );
51 EH_STD::sort( begin() + ( end() - begin() )/2, end() );
52 for ( SortClass* p = begin(); p != end(); p++ )
63 SortClass* q = begin();
64 for ( const SortClass* p = rhs.begin() ; p != rhs.end(); p++,q++
    [all...]
  /external/arduino/libraries/Wire/
keywords.txt 13 begin KEYWORD2
  /external/chromium_org/chrome/browser/automation/
automation_provider_list.h 26 const_iterator begin() { function in class:AutomationProviderList
27 return automation_providers_.begin();
  /external/chromium_org/chrome/browser/ui/
browser_iterator.cc 11 current_iterator_(current_browser_list_->begin()),
30 current_iterator_ = current_browser_list_->begin();
  /external/chromium_org/chrome/browser/ui/cocoa/
accelerators_cocoa.h 31 const_iterator const begin() { return accelerators_.begin(); } function in class:AcceleratorsCocoa
  /external/chromium_org/chrome/renderer/safe_browsing/
test_utils.cc 17 std::map<std::string, double> sorted_first(first.features().begin(),
19 std::map<std::string, double> sorted_second(second.features().begin(),
  /external/chromium_org/third_party/WebKit/Source/core/dom/
DocumentOrderedList.h 51 iterator begin() { return m_nodes.begin(); } function in class:WebCore::DocumentOrderedList
  /external/chromium_org/third_party/WebKit/Source/modules/gamepad/
Gamepad.cpp 42 std::copy(data, data + count, m_axes.begin());
49 std::copy(data, data + count, m_buttons.begin());
  /external/chromium_org/v8/src/
disassembler.h 38 // Print the bytes in the interval [begin, end) into f.
39 static void Dump(FILE* f, byte* begin, byte* end);
41 // Decode instructions in the the interval [begin, end) and print the
44 static int Decode(Isolate* isolate, FILE* f, byte* begin, byte* end);
  /external/clang/lib/StaticAnalyzer/Core/
FunctionSummary.cpp 20 for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
28 for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
  /external/stlport/test/unit/
search_test.cpp 57 __iota(v1.begin(), v1.end(), 0);
59 __iota(v2.begin(), v2.end(), 50);
62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
66 __iota(v2.begin(), v2.end(), 4);
68 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
71 CPPUNIT_ASSERT(location - v1.begin() == 4);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/
iter_iter_comp_alloc.pass.cpp 47 assert(distance(m.begin(), m.end()) == 3);
48 assert(*m.begin() == V(1, 1));
49 assert(*next(m.begin()) == V(2, 1));
50 assert(*next(m.begin(), 2) == V(3, 1));
73 assert(distance(m.begin(), m.end()) == 3);
74 assert(*m.begin() == V(1, 1));
75 assert(*next(m.begin()) == V(2, 1));
76 assert(*next(m.begin(), 2) == V(3, 1));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
pop_front.pass.cpp 30 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 0);
43 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 0);
58 assert(distance(c.begin(), c.end()) == 1);
61 assert(distance(c.begin(), c.end()) == 0);
71 assert(distance(c.begin(), c.end()) == 1);
74 assert(distance(c.begin(), c.end()) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/
resize_size.pass.cpp 25 assert(std::distance(l.begin(), l.end()) == 2);
32 assert(std::distance(l.begin(), l.end()) == 10);
41 assert(std::distance(l.begin(), l.end()) == 5);
47 assert(std::distance(l.begin(), l.end()) == 20);
55 assert(std::distance(l.begin(), l.end()) == 2);
62 assert(std::distance(l.begin(), l.end()) == 10);
71 assert(std::distance(l.begin(), l.end()) == 5);
77 assert(std::distance(l.begin(), l.end()) == 20);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/
distance.hpp 18 #include <boost/range/begin.hpp>
29 return std::distance( boost::begin( r ), boost::end( r ) );
  /ndk/tests/device/test-gnustl-full/unit/
search_test.cpp 57 __iota(v1.begin(), v1.end(), 0);
59 __iota(v2.begin(), v2.end(), 50);
62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
66 __iota(v2.begin(), v2.end(), 4);
68 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
71 CPPUNIT_ASSERT(location - v1.begin() == 4);
  /ndk/tests/device/test-stlport/unit/
search_test.cpp 57 __iota(v1.begin(), v1.end(), 0);
59 __iota(v2.begin(), v2.end(), 50);
62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
66 __iota(v2.begin(), v2.end(), 4);
68 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
71 CPPUNIT_ASSERT(location - v1.begin() == 4);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binary_heap_/
iterators_fn_imps.hpp 44 begin() function in class:PB_DS_CLASS_C_DEC
52 begin() const function in class:PB_DS_CLASS_C_DEC
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 57 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin())))
85 new_this.copy_from_ordered_range(begin(), it);
114 PB_DS_V2F(*other.begin()));
117 PB_DS_V2F(*begin()));
125 new_this.copy_from_ordered_range(begin(), end(),
126 other.begin(), other.end());
128 new_this.copy_from_ordered_range(other.begin(), other.end(),
129 begin(), end());
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/binary_heap_/
iterators_fn_imps.hpp 44 begin() function in class:PB_DS_CLASS_C_DEC
52 begin() const function in class:PB_DS_CLASS_C_DEC
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 57 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin())))
85 new_this.copy_from_ordered_range(begin(), it);
114 PB_DS_V2F(*other.begin()));
117 PB_DS_V2F(*begin()));
125 new_this.copy_from_ordered_range(begin(), end(),
126 other.begin(), other.end());
128 new_this.copy_from_ordered_range(other.begin(), other.end(),
129 begin(), end());

Completed in 320 milliseconds

1 2 3 4 5 6 7 8 91011>>