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

1 2 3 4 5 6 7 8 91011>>

  /bionic/libc/upstream-openbsd/lib/libc/gen/
alarm.c 40 struct itimerval it, oitv; local
41 struct itimerval *itp = ⁢
  /external/libbrillo/brillo/
variant_dictionary.h 19 // and convert it to the type T. If the value does not exist, or the type
24 VariantDictionary::const_iterator it = dictionary.find(key); local
25 if (it == dictionary.end()) {
28 return it->second.TryGet<T>();
  /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.const/
default.pass.cpp 23 template <class It>
27 std::move_iterator<It> r;
40 constexpr std::move_iterator<const char *> it; local
  /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.cons/
default.pass.cpp 23 template <class It>
27 std::reverse_iterator<It> r;
39 constexpr std::reverse_iterator<const char *> it; local
  /external/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/
default.fail.cpp 27 constexpr std::istream_iterator<S> it; local
  /external/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator.cons/
default.pass.cpp 29 T it; local
30 assert(it == T());
37 T it; local
38 assert(it == T());
  /external/libese/esed/pn81a/tests/
apdu_test.cpp 74 auto it = apdu.dataBegin(); local
75 *it++ = 10;
76 *it++ = 11;
77 *it++ = 12;
78 ASSERT_EQ(apdu.dataEnd(), it);
112 auto it = apdu.dataBegin(); local
113 *it++ = 8;
114 ASSERT_EQ(apdu.dataEnd(), it);
  /external/ltp/testcases/kernel/controllers/cpuacct/
cpuacct_task.c 4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
9 * This program is distributed in the hope that it would be useful,
47 struct itimerval it = {.it_value = {.tv_sec = 0, .tv_usec = 10000}}; local
49 setitimer(ITIMER_VIRTUAL, &it, NULL);
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/
default.fail.cpp 25 constexpr std::istream_iterator<S> it; local
default.pass.cpp 23 T it; local
24 assert(it == T());
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator.cons/
default.pass.cpp 27 T it; local
28 assert(it == T());
35 T it; local
36 assert(it == T());
  /external/libcxx/test/libcxx/experimental/filesystem/class.path/path.itr/
iterator_db.pass.cpp 47 auto it = p.begin(); local
49 --it;
52 ++it;
53 ++it;
55 ++it;
62 auto it = p.end(); local
64 ++it;
67 --it;
68 --it;
70 --it;
    [all...]
  /external/libtextclassifier/util/gtl/
map_util.h 22 // Returns a const reference to the value associated with the given key if it
30 // or store it in a string (not string&).
36 typename Collection::const_iterator it = collection.find(key); local
37 if (it == collection.end()) {
40 return it->second;
  /external/parameter-framework/upstream/parameter/
HardwareBackSynchronizer.cpp 40 std::list<const CConfigurableElement *>::const_iterator it; local
42 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) {
44 const CConfigurableElement *pConfigurableElement = *it;
SimulatedBackSynchronizer.cpp 46 std::list<const CConfigurableElement *>::const_iterator it; local
48 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) {
50 const CConfigurableElement *pConfigurableElement = *it;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/
compare.pass.cpp 29 std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0)); local
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
76 iterator it = upper_bound(r_key); local
78 new_other.copy_from_ordered_range(it, end());
80 new_this.copy_from_ordered_range(begin(), it); local
  /system/update_engine/update_manager/
evaluation_context-inl.h 34 ValueCacheMap::iterator it = value_cache_.find(var); local
35 if (it != value_cache_.end())
36 return reinterpret_cast<const T*>(it->second.value());
  /external/libchrome/base/metrics/
sample_map_unittest.cc 80 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
86 it->Get(&min, &max, &count);
90 EXPECT_FALSE(it->GetBucketIndex(NULL));
92 it->Next();
93 it->Get(&min, &max, &count);
98 it->Next();
99 it->Get(&min, &max, &count);
104 it->Next();
105 EXPECT_TRUE(it->Done());
123 std::unique_ptr<SampleCountIterator> it = samples.Iterator() local
152 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
    [all...]
  /external/libcxx/test/libcxx/containers/sequences/deque/
incomplete.pass.cpp 22 std::deque<A>::iterator it; member in struct:A
30 a.it = a.d.begin();

Completed in 1625 milliseconds

1 2 3 4 5 6 7 8 91011>>