| /libcore/luni/src/main/java/java/text/ |
| StringCharacterIterator.java | 141 StringCharacterIterator it = (StringCharacterIterator) object; local
142 return string.equals(it.string) && start == it.start && end == it.end
143 && offset == it.offset;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| CopyOnWriteArraySet.java | 17 * for all of its operations. Thus, it shares the same basic properties:
19 * <li>It is best suited for applications in which set sizes generally
23 * <li>It is thread-safe.
123 * <p>The returned array will be "safe" in that no references to it
140 * If the set fits in the specified array, it is returned therein.
170 * stored, if it is big enough; otherwise, a new array of the same
191 * Removes the specified element from this set if it is present.
207 * Adds the specified element to this set if it is not already present.
225 * method returns {@code true} if it is a <i>subset</i> of this set.
312 * as this object, or if it is also a {@link Set} and the element
331 Iterator<?> it = set.iterator(); local
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/asn1/ |
| ASN1Choice.java | 80 * // pass it to custom time class
99 * // ASN.1 Time choice passed Data object - use it
117 * If it is a matter what time format should be used to decode/encode
142 * // return it
148 * // return it
182 * private Time notBefore; // now it is a Time!!!
183 * private Time notAfter; // now it is a Time!!!
242 // even it is a single component (not good for nested choices)
268 Iterator<Map.Entry<BigInteger, BigInteger>> it = map.entrySet().iterator(); local
271 Map.Entry<BigInteger, BigInteger> entry = it.next()
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/x501/ |
| Name.java | 181 Iterator<AttributeTypeAndValue> it = atavList.iterator(); local
182 while (it.hasNext()) {
183 AttributeTypeAndValue attributeTypeAndValue = it.next();
185 if (it.hasNext()) {
|
| /libcore/support/src/test/java/org/apache/harmony/security/tests/support/cert/ |
| MyCertificateFactorySpi.java | 104 Iterator<String> it = engineGetCertPathEncodings(); local
105 if (!it.hasNext()) {
108 return engineGenerateCertPath(inStream, it.next());
|
| /libcore/support/src/test/java/tests/support/ |
| Support_Format.java | 90 Iterator<Attribute> it = iterator.getAttributes().keySet().iterator(); local
91 while (it.hasNext()) {
92 AttributedCharacterIterator.Attribute attribute = it.next();
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| fixed_mapping.hpp | 39 // You can redefine it before inclusion of this file.
94 iterator it = boost::detail::lower_bound( m_map.begin(), m_map.end(), key, p1() ); local
96 return (it == m_map.end() || Compare()( key, it->first ) ) ? m_invalid_value : it->second;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| equal_test.cpp | 106 vector<Test>::iterator it; local
113 it = upper_bound(tv.begin(), tv.end(), 5);
114 CPPUNIT_ASSERT( it != tv.end() );
115 CPPUNIT_ASSERT( *it == 6 );
117 it = lower_bound(tv.begin(), tv.end(), 5);
118 CPPUNIT_ASSERT( it != tv.end() );
119 CPPUNIT_ASSERT( *it == 5 );
|
| iter_test.cpp | 69 Vec::reverse_iterator it; local
71 for (it = v.rbegin(); it != v.rend(); ++it, ++counter) {
74 CPPUNIT_ASSERT(!strcmp(*it, "zippy"));
77 CPPUNIT_ASSERT(!strcmp(*it, "motorboy"));
|
| mvctor_test.cpp | 114 * STL implementation it is only a compile check.
247 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {}
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
467 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
487 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
507 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
527 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
[all...] |
| uninitialized_test.cpp | 95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
96 for (; it != end; ++it) {
97 CPPUNIT_ASSERT( (*it).member == 1 );
107 TrivialCopyStruct* it = src + 0; local
109 for (; it != end; ++it) {
110 (*it).member = 0;
114 for (it = dst+0, end = dst+count; it != end; ++it)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| equal_test.cpp | 106 vector<Test>::iterator it; local
113 it = upper_bound(tv.begin(), tv.end(), 5);
114 CPPUNIT_ASSERT( it != tv.end() );
115 CPPUNIT_ASSERT( *it == 6 );
117 it = lower_bound(tv.begin(), tv.end(), 5);
118 CPPUNIT_ASSERT( it != tv.end() );
119 CPPUNIT_ASSERT( *it == 5 );
|
| iter_test.cpp | 69 Vec::reverse_iterator it; local
71 for (it = v.rbegin(); it != v.rend(); ++it, ++counter) {
74 CPPUNIT_ASSERT(!strcmp(*it, "zippy"));
77 CPPUNIT_ASSERT(!strcmp(*it, "motorboy"));
|
| mvctor_test.cpp | 114 * STL implementation it is only a compile check.
247 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {}
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {}
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; local
467 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
487 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
507 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
527 vector<vector<int> >::iterator it = vect_vector.end() - 5; local
[all...] |
| uninitialized_test.cpp | 95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
96 for (; it != end; ++it) {
97 CPPUNIT_ASSERT( (*it).member == 1 );
107 TrivialCopyStruct* it = src + 0; local
109 for (; it != end; ++it) {
110 (*it).member = 0;
114 for (it = dst+0, end = dst+count; it != end; ++it)
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/gatt/ |
| SearchQueue.java | 77 for (Iterator<Entry> it = mEntries.iterator(); it.hasNext();) {
78 Entry entry = it.next();
80 it.remove();
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/ |
| proximity_info_state.cpp | 167 // This function basically converts from a length to an edit distance. Accordingly, it's obviously
192 // the same position. We want to see if c is in it: if so, then the word contains at that position
206 // The first char in the array is what user typed. If it matches right away, that means the
215 // non-accented version of the accented character the user typed. Treat it as a close char.
300 std::unordered_map<int, float>::const_iterator it = mCharProbabilities[index].find(keyIndex); local
301 if (it != mCharProbabilities[index].end()) {
302 return it->second;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pat_trie_/ |
| split_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
111 iterator it = lower_bound(r_key); local
113 if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))
114 --it;
116 node_pointer p_nd = it.m_p_nd;
|
| /system/core/libsysutils/src/ |
| SocketListener.cpp | 64 SocketClientCollection::iterator it; local
65 for (it = mClients->begin(); it != mClients->end();) {
66 (*it)->decRef();
67 it = mClients->erase(it);
136 SocketClientCollection::iterator it; local
137 for (it = mClients->begin(); it != mClients->end();) {
138 delete (*it);
157 SocketClientCollection::iterator it; local
259 SocketClientCollection::iterator it; local
[all...] |
