HomeSort by relevance Sort by last modified time
    Searched full:second (Results 151 - 175 of 14913) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/chromium_org/net/quic/
quic_bandwidth.h 5 // QuicBandwidth represents a bandwidth, stored in bits per second resolution.
23 // Create a new QuicBandwidth holding the bits per second.
26 // Create a new QuicBandwidth holding the kilo bits per second.
29 // Create a new QuicBandwidth holding the bytes per second.
32 // Create a new QuicBandwidth holding the kilo bytes per second.
  /external/guava/guava-tests/test/com/google/common/eventbus/
ReentrantEventsTest.java 32 static final Double SECOND = 2.0d;
43 Lists.<Object>newArrayList(FIRST, SECOND), hater.eventsReceived);
55 bus.post(SECOND);
78 Lists.<Object>newArrayList(FIRST, SECOND), recorder.eventsReceived);
83 bus.post(SECOND);
  /frameworks/base/libs/hwui/utils/
Pair.h 26 S second; member in struct:android::uirenderer::Pair
29 Pair(const Pair& o) : first(o.first), second(o.second) { }
30 Pair(const F& f, const S& s) : first(f), second(s) { }
37 return second;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
init.pass.cpp 50 assert(std::distance(eq.first, eq.second) == 2);
53 assert(i->second == "one");
56 assert(i->second == "four");
58 assert(std::distance(eq.first, eq.second) == 2);
61 assert(i->second == "two");
64 assert(i->second == "four");
67 assert(std::distance(eq.first, eq.second) == 1);
70 assert(i->second == "three");
72 assert(std::distance(eq.first, eq.second) == 1);
75 assert(i->second == "four")
    [all...]
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.pass.cpp 54 assert(std::distance(eq.first, eq.second) == 2);
57 assert(i->second == "one");
60 assert(i->second == "four");
62 assert(std::distance(eq.first, eq.second) == 2);
65 assert(i->second == "two");
68 assert(i->second == "four");
71 assert(std::distance(eq.first, eq.second) == 1);
74 assert(i->second == "three");
76 assert(std::distance(eq.first, eq.second) == 1);
79 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...]
  /external/chromium_org/chrome/common/
instant_restricted_id_cache_unittest.cc 53 EXPECT_EQ(input1[i], output[i].second);
74 EXPECT_EQ(input2[i], output[i].second);
98 EXPECT_EQ(input3[i], output[i].second);
130 EXPECT_EQ(input1[i].second, output[i].second);
136 EXPECT_EQ(input1[2].second, t);
152 EXPECT_EQ(input2[i].second, output[i].second);
157 EXPECT_EQ(input1[1].second, t);
159 EXPECT_EQ(input2[0].second, t)
    [all...]
  /external/chromium_org/base/mac/
libdispatch_task_runner_unittest.cc 137 TaskOrderMarker marker(this, "Second Block");
139 task_runner_->PostTask(FROM_HERE, BoundRecordTaskOrder(this, "Second Task"));
147 "BEGIN Second Block",
148 "END Second Block",
149 "BEGIN Second Task",
150 "END Second Task",
159 TaskOrderMarker marker(this, "Second NonNestable");
170 "BEGIN Second NonNestable",
171 "END Second NonNestable"
189 task_runner_->PostTask(FROM_HERE, BoundRecordTaskOrder(this, "Second"));
    [all...]
  /frameworks/ex/chips/tests/src/com/android/ex/chips/
ChipsTest.java 185 String second = (String) mTokenizer.terminateToken("SECOND"); local
188 mEditable.append(first + extra + second);
191 int secondStart = mEditable.toString().indexOf(second);
192 int secondEnd = secondStart + second.trim().length();
199 assertEquals(editableString.indexOf(second), secondStart - extra.length());
200 assertEquals(editableString, (first + second));
222 String second = (String) mTokenizer.terminateToken("SECOND"); local
225 mEditable.append(first + second);
249 String second = (String) mTokenizer.terminateToken("SECOND"); local
265 String second = (String) mTokenizer.terminateToken("SECOND"); local
300 String second = (String) mTokenizer.terminateToken("SECOND"); local
361 String second = (String) mTokenizer.terminateToken("SECOND"); local
440 String second = (String) mTokenizer.terminateToken("SE,COND"); local
481 String second = (String) mTokenizer.terminateToken("SECOND"); local
527 String second = (String) mTokenizer.terminateToken("SECOND"); local
600 assertEquals(mEditable.toString(), first + second); local
616 String second = (String) mTokenizer.terminateToken("SECOND"); local
769 String second = (String) mTokenizer.terminateToken("SECOND"); local
901 String second = (String) mTokenizer.terminateToken("SECOND"); local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_pair.h 70 typedef _T2 second_type; ///< @c second_type is the second bound type
73 _T2 second; ///< @c second is a copy of the second object member in struct:pair
77 /** The default constructor creates @c first and @c second using their
80 : first(), second() { }
84 : first(__a), second(__b) { }
90 second(std::forward<_U2>(__y)) { }
94 second(std::move(__p.second)) { }
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_pair.h 70 typedef _T2 second_type; ///< @c second_type is the second bound type
73 _T2 second; ///< @c second is a copy of the second object member in struct:pair
77 /** The default constructor creates @c first and @c second using their
80 : first(), second() { }
84 : first(__a), second(__b) { }
90 second(std::forward<_U2>(__y)) { }
94 second(std::move(__p.second)) { }
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_pair.h 70 typedef _T2 second_type; ///< @c second_type is the second bound type
73 _T2 second; ///< @c second is a copy of the second object member in struct:pair
77 /** The default constructor creates @c first and @c second using their
80 : first(), second() { }
84 : first(__a), second(__b) { }
90 second(std::forward<_U2>(__y)) { }
94 second(std::move(__p.second)) { }
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_pair.h 70 typedef _T2 second_type; ///< @c second_type is the second bound type
73 _T2 second; ///< @c second is a copy of the second object member in struct:pair
77 /** The default constructor creates @c first and @c second using their
80 : first(), second() { }
84 : first(__a), second(__b) { }
90 second(std::forward<_U2>(__y)) { }
94 second(std::move(__p.second)) { }
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/
awk.pass.cpp 35 assert(m.prefix().second == m[0].first);
37 assert(m.suffix().first == m[0].second);
38 assert(m.suffix().second == s+1);
50 assert(m.prefix().second == m[0].first);
52 assert(m.suffix().first == m[0].second);
53 assert(m.suffix().second == s+2);
91 assert(m.prefix().second == m[0].first);
93 assert(m.suffix().first == m[0].second);
94 assert(m.suffix().second == s+4);
106 assert(m.prefix().second == m[0].first)
    [all...]
  /external/chromium_org/net/tools/quic/
spdy_utils.cc 40 if ((hi->second.length() == 0) && !allow_empty_values) {
52 it->second.reserve(it->second.size() + 1 + hi->second.size());
53 it->second.append("\0", 1);
54 it->second.append(hi->second.data(), hi->second.size());
56 block->insert(make_pair(name, hi->second.as_string()));
169 if (header->first.empty() || header->second.empty())
    [all...]
  /frameworks/compile/mclinker/lib/Support/
MemoryArea.cpp 100 for (it = range.first; it != range.second; ++it) {
101 if (space == it->second)
122 Space::Sync(space->second, *m_pFileHandle);
123 Space::Release(space->second, *m_pFileHandle);
124 assert(NULL != space->second);
125 Space::Destroy(space->second);
130 Space::Release(space->second, *m_pFileHandle);
131 assert(NULL != space->second);
132 Space::Destroy(space->second);
147 for (it = range.first; it != range.second; ++it)
    [all...]
  /external/chromium/chrome/browser/search_engines/
search_host_to_urls_map.cc 88 const TemplateURLSet& urls = host_map_iterator->second;
112 if (iter == host_to_urls_map_.end() || iter->second.empty())
114 return *(iter->second.begin()); // Return the 1st element.
122 if (urls_for_host == host_to_urls_map_.end() || urls_for_host->second.empty())
124 return &urls_for_host->second;
131 TemplateURLSet::iterator url_set_iterator = i->second.find(template_url);
132 if (url_set_iterator != i->second.end()) {
133 i->second.erase(url_set_iterator);
134 if (i->second.empty())
  /external/llvm/test/CodeGen/X86/
returned-trunc-tail-calls.ll 41 %second = extractvalue {i32, i32} %in, 1
42 %second.trunc = trunc i32 %second to i8
45 %callval = insertvalue {i32, i8} %tmp, i8 %second.trunc, 1
49 %res = insertvalue {i8, i8} %restmp, i8 %second.trunc, 1
60 %second = extractvalue {i32, {i32, i32}} %val, 1, 0
64 %reseventmper = insertvalue {{i32, i32}, i32} %restmp, i32 %second, 0, 1
83 %second = extractvalue {i32, {i32, i32}} %agg, 1, 0
86 %res = insertvalue {{}, {{}, i32, {}}, [1 x i32]} %restmp, i32 %second, 2, 0

Completed in 1675 milliseconds

1 2 3 4 5 67 8 91011>>