| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| range_size.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2);
59 assert(i->second == "one");
62 assert(i->second == "four");
64 assert(std::distance(eq.first, eq.second) == 2);
67 assert(i->second == "two");
70 assert(i->second == "four");
73 assert(std::distance(eq.first, eq.second) == 1);
76 assert(i->second == "three");
78 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->second == "four")
[all...] |
| range_size_hash.pass.cpp | 58 assert(std::distance(eq.first, eq.second) == 2);
61 assert(i->second == "one");
64 assert(i->second == "four");
66 assert(std::distance(eq.first, eq.second) == 2);
69 assert(i->second == "two");
72 assert(i->second == "four");
75 assert(std::distance(eq.first, eq.second) == 1);
78 assert(i->second == "three");
80 assert(std::distance(eq.first, eq.second) == 1);
83 assert(i->second == "four")
[all...] |
| range_size_hash_equal.pass.cpp | 59 assert(std::distance(eq.first, eq.second) == 2);
62 assert(i->second == "one");
65 assert(i->second == "four");
67 assert(std::distance(eq.first, eq.second) == 2);
70 assert(i->second == "two");
73 assert(i->second == "four");
76 assert(std::distance(eq.first, eq.second) == 1);
79 assert(i->second == "three");
81 assert(std::distance(eq.first, eq.second) == 1);
84 assert(i->second == "four")
[all...] |
| range_size_hash_equal_allocator.pass.cpp | 61 assert(std::distance(eq.first, eq.second) == 2);
64 assert(i->second == "one");
67 assert(i->second == "four");
69 assert(std::distance(eq.first, eq.second) == 2);
72 assert(i->second == "two");
75 assert(i->second == "four");
78 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->second == "three");
83 assert(std::distance(eq.first, eq.second) == 1);
86 assert(i->second == "four")
[all...] |
| /external/libweave/src/states/ |
| state_change_queue.cc | 36 element_old->second->MergeDictionary(element_new->second.get());
37 std::swap(element_old->second, element_new->second);
47 changes.push_back(StateChange{pair.first, std::move(pair.second)});
|
| /external/llvm/test/MC/AsmParser/ |
| macro-qualifier-diagnostics.s | 37 .macro missing_second_required_argument first=0 second:req
42 # CHECK: error: missing value for required parameter 'second' in macro 'missing_second_required_argument'
46 .macro second_third_required first=0 second:req third:req
51 # CHECK: error: missing value for required parameter 'second' in macro 'second_third_required'
61 # CHECK: error: missing value for required parameter 'second' in macro 'second_third_required'
|
| /frameworks/base/libs/hwui/utils/ |
| Pair.h | 28 S second; member in struct:android::uirenderer::Pair
31 Pair(const Pair& o) : first(o.first), second(o.second) { }
32 Pair(const F& f, const S& s) : first(f), second(s) { }
39 return second;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| init_size.pass.cpp | 52 assert(std::distance(eq.first, eq.second) == 2);
55 assert(i->second == "one");
58 assert(i->second == "four");
60 assert(std::distance(eq.first, eq.second) == 2);
63 assert(i->second == "two");
66 assert(i->second == "four");
69 assert(std::distance(eq.first, eq.second) == 1);
72 assert(i->second == "three");
74 assert(std::distance(eq.first, eq.second) == 1);
77 assert(i->second == "four")
[all...] |
| init_size_hash.pass.cpp | 53 assert(std::distance(eq.first, eq.second) == 2);
56 assert(i->second == "one");
59 assert(i->second == "four");
61 assert(std::distance(eq.first, eq.second) == 2);
64 assert(i->second == "two");
67 assert(i->second == "four");
70 assert(std::distance(eq.first, eq.second) == 1);
73 assert(i->second == "three");
75 assert(std::distance(eq.first, eq.second) == 1);
78 assert(i->second == "four")
[all...] |
| init_size_hash_equal.pass.cpp | 55 assert(std::distance(eq.first, eq.second) == 2);
58 assert(i->second == "one");
61 assert(i->second == "four");
63 assert(std::distance(eq.first, eq.second) == 2);
66 assert(i->second == "two");
69 assert(i->second == "four");
72 assert(std::distance(eq.first, eq.second) == 1);
75 assert(i->second == "three");
77 assert(std::distance(eq.first, eq.second) == 1);
80 assert(i->second == "four")
[all...] |
| init_size_hash_equal_allocator.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2);
59 assert(i->second == "one");
62 assert(i->second == "four");
64 assert(std::distance(eq.first, eq.second) == 2);
67 assert(i->second == "two");
70 assert(i->second == "four");
73 assert(std::distance(eq.first, eq.second) == 1);
76 assert(i->second == "three");
78 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->second == "four")
[all...] |
| range_size.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2);
59 assert(i->second == "one");
62 assert(i->second == "four");
64 assert(std::distance(eq.first, eq.second) == 2);
67 assert(i->second == "two");
70 assert(i->second == "four");
73 assert(std::distance(eq.first, eq.second) == 1);
76 assert(i->second == "three");
78 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->second == "four")
[all...] |
| range_size_hash.pass.cpp | 58 assert(std::distance(eq.first, eq.second) == 2);
61 assert(i->second == "one");
64 assert(i->second == "four");
66 assert(std::distance(eq.first, eq.second) == 2);
69 assert(i->second == "two");
72 assert(i->second == "four");
75 assert(std::distance(eq.first, eq.second) == 1);
78 assert(i->second == "three");
80 assert(std::distance(eq.first, eq.second) == 1);
83 assert(i->second == "four")
[all...] |
| range_size_hash_equal.pass.cpp | 59 assert(std::distance(eq.first, eq.second) == 2);
62 assert(i->second == "one");
65 assert(i->second == "four");
67 assert(std::distance(eq.first, eq.second) == 2);
70 assert(i->second == "two");
73 assert(i->second == "four");
76 assert(std::distance(eq.first, eq.second) == 1);
79 assert(i->second == "three");
81 assert(std::distance(eq.first, eq.second) == 1);
84 assert(i->second == "four")
[all...] |
| range_size_hash_equal_allocator.pass.cpp | 61 assert(std::distance(eq.first, eq.second) == 2);
64 assert(i->second == "one");
67 assert(i->second == "four");
69 assert(std::distance(eq.first, eq.second) == 2);
72 assert(i->second == "two");
75 assert(i->second == "four");
78 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->second == "three");
83 assert(std::distance(eq.first, eq.second) == 1);
86 assert(i->second == "four")
[all...] |
| /prebuilts/go/darwin-x86/src/go/doc/testdata/ |
| d.0.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| d.1.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| d.2.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| /prebuilts/go/linux-x86/src/go/doc/testdata/ |
| d.0.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| d.1.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| d.2.golden | 29 // C1 should be second.
61 // V1 should be second.
79 // F1 should be second.
90 // T1 should be second.
99 // TG1 should be second.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
| OnePointCrossover.java | 26 * second parts are copied crosswise.
53 * second parts are copied crosswise.
66 * @param second second parent (p2)
70 public ChromosomePair crossover(Chromosome first, Chromosome second) {
71 if (! (first instanceof AbstractListChromosome<?> && second instanceof AbstractListChromosome<?>)) {
74 return crossover((AbstractListChromosome<T>) first, (AbstractListChromosome<T>) second);
82 * @param second the second chromosome.
85 private ChromosomePair crossover(AbstractListChromosome<T> first, AbstractListChromosome<T> second) {
[all...] |
| /external/libbrillo/brillo/message_loops/ |
| fake_message_loop.cc | 66 // The fd_watched->second task might have been canceled and we never removed
68 const auto& scheduled_task_ref = tasks_.find(fd_watched->second);
73 VLOG_LOC(scheduled_task_ref->second.location, 1)
74 << "Running task_id " << fd_watched->second
76 << (fd_mode.second == MessageLoop::kWatchRead ? "reading" : "writing")
77 << (scheduled_task_ref->second.persistent ?
80 if (scheduled_task_ref->second.persistent) {
81 scheduled_task_ref->second.callback.Run();
83 base::Closure callback = std::move(scheduled_task_ref->second.callback);
99 const auto scheduled_task_ref = tasks_.find(task_ref.second);
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/guile/ |
| std_pair.i | 29 SCM first, second;
31 second = SCM_CDR($input);
33 y = (U*) SWIG_MustGetPtr(second,$descriptor(U *),$argnum, 0);
45 SCM first, second;
47 second = SCM_CDR($input);
49 y = (U*) SWIG_MustGetPtr(second,$descriptor(U *),$argnum, 0);
60 U* y = new U($1.second);
62 SCM second = SWIG_NewPointerObj(y,$descriptor(U *), 1);
63 $result = scm_cons(first,second);
71 SCM second = SCM_CDR($input)
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/mzscheme/ |
| std_pair.i | 30 Scheme_Object *first, *second;
32 second = scheme_cdr($input);
34 y = (U*) SWIG_MustGetPtr(second,$descriptor(U *),$argnum, 0);
48 Scheme_Object *first, *second;
50 second = scheme_cdr($input);
52 y = (U*) SWIG_MustGetPtr(second,$descriptor(U *),$argnum, 0);
62 U* y = new U($1.second);
64 Scheme_Object* second = SWIG_NewPointerObj(y,$descriptor(U *), 1);
65 $result = scheme_make_pair(first,second);
73 Scheme_Object* second = scheme_cdr($input)
[all...] |
