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

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/go/darwin-x86/test/fixedbugs/
issue22794.go 9 type it struct { type
15 i1 := it{Floats: true}
16 if i1.floats { // ERROR "(type it .* field or method floats, but does have Floats)"
18 i2 := &it{floats: false} // ERROR "(but does have Floats)"
19 _ = &it{InneR: "foo"} // ERROR "(but does have inner)"
  /prebuilts/go/linux-x86/test/fixedbugs/
issue22794.go 9 type it struct { type
15 i1 := it{Floats: true}
16 if i1.floats { // ERROR "(type it .* field or method floats, but does have Floats)"
18 i2 := &it{floats: false} // ERROR "(but does have Floats)"
19 _ = &it{InneR: "foo"} // ERROR "(but does have inner)"
  /bionic/libc/upstream-openbsd/lib/libc/gen/
alarm.c 37 struct itimerval it, oitv; local
38 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/algorithms/alg.modifying.operations/alg.fill/
fill_n.pass.cpp 29 auto it = std::fill_n(std::begin(ib), N, 5); local
30 return it == (std::begin(ib) + N)
31 && std::all_of(std::begin(ib), it, [](int a) {return a == 5; })
32 && *it == 0 // don't overwrite the last value in the output array
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
remove.pass.cpp 29 auto it = std::remove(std::begin(ia), std::end(ia), 5); local
31 return (std::begin(ia) + std::size(ia) - 2) == it // we removed two elements
32 && std::none_of(std::begin(ia), it, [](int a) {return a == 5; })
remove_copy.pass.cpp 28 auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5); local
30 return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements
31 && std::none_of(std::begin(ib), it, [](int a) {return a == 5;})
32 && std::all_of (it, std::end(ib), [](int a) {return a == 0;})
remove_copy_if.pass.cpp 32 auto it = std::remove_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo); local
34 return std::distance(std::begin(ib), it) == (std::size(ia) - 1) // we removed one element
35 && std::none_of(std::begin(ib), it, equalToTwo)
36 && std::all_of (it, std::end(ib), [](int a) {return a == 0;})
  /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;
41 constexpr std::move_iterator<const char *> it; local
42 (void)it;
  /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;
40 constexpr std::reverse_iterator<const char *> it; local
41 (void)it;
  /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());
38 T it; local
39 assert(it == T());
  /external/libese/libapdu/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);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/
default.fail.cpp 27 constexpr std::istream_iterator<S> it; local
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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());
  /prebuilts/jdk/jdk8/darwin-x86/sample/lambda/DefaultMethods/
ArrayIterator.java 56 * @param array source array to iterate over it
111 Iterator<String> it = ArrayIterator.iterator( local
114 while (it.hasNext()) {
115 System.out.println(it.next());
  /prebuilts/jdk/jdk8/linux-x86/sample/lambda/DefaultMethods/
ArrayIterator.java 56 * @param array source array to iterate over it
111 Iterator<String> it = ArrayIterator.iterator( local
114 while (it.hasNext()) {
115 System.out.println(it.next());
  /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/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
set_intersection.pass.cpp 33 auto it = std::set_intersection(std::begin(ia), std::end(ia), local
36 return std::includes(std::begin(ia), std::end(ia), std::begin(results), it)
37 && std::includes(std::begin(ib), std::end(ib), std::begin(results), it)
38 && std::is_sorted(std::begin(results), it)
39 && std::all_of(it, std::end(results), [](int a) {return a == 0; })
  /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/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,
65 struct itimerval it = {.it_value = {.tv_sec = 0, .tv_usec = 10000}}; local
67 setitimer(ITIMER_VIRTUAL, &it, NULL);
  /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;

Completed in 336 milliseconds

1 2 3 4 5 6 7 8 91011>>