| /external/chromium_org/base/i18n/ |
| break_iterator_unittest.cc | 17 BreakIterator iter(empty, BreakIterator::BREAK_WORD);
18 ASSERT_TRUE(iter.Init());
19 EXPECT_FALSE(iter.Advance());
20 EXPECT_FALSE(iter.IsWord());
21 EXPECT_FALSE(iter.Advance()); // Test unexpected advance after end.
22 EXPECT_FALSE(iter.IsWord());
28 BreakIterator iter(str, BreakIterator::BREAK_WORD);
29 ASSERT_TRUE(iter.Init());
30 EXPECT_TRUE(iter.Advance());
31 EXPECT_FALSE(iter.IsWord())
[all...] |
| char_iterator_unittest.cc | 22 UTF8CharIterator iter(&str);
23 ASSERT_FALSE(iter.end());
24 ASSERT_EQ(0, iter.array_pos());
25 ASSERT_EQ(0, iter.char_pos());
26 ASSERT_EQ('s', iter.get());
27 ASSERT_TRUE(iter.Advance());
29 ASSERT_FALSE(iter.end());
30 ASSERT_EQ(1, iter.array_pos());
31 ASSERT_EQ(1, iter.char_pos());
32 ASSERT_EQ(251, iter.get())
[all...] |
| /external/chromium/base/i18n/ |
| break_iterator_unittest.cc | 14 base::BreakIterator iter(&empty, base::BreakIterator::BREAK_WORD);
15 ASSERT_TRUE(iter.Init());
16 EXPECT_FALSE(iter.Advance());
17 EXPECT_FALSE(iter.IsWord());
18 EXPECT_FALSE(iter.Advance()); // Test unexpected advance after end.
19 EXPECT_FALSE(iter.IsWord());
25 base::BreakIterator iter(&str, base::BreakIterator::BREAK_WORD);
26 ASSERT_TRUE(iter.Init());
27 EXPECT_TRUE(iter.Advance());
28 EXPECT_FALSE(iter.IsWord())
[all...] |
| char_iterator_unittest.cc | 22 UTF8CharIterator iter(&str);
23 ASSERT_FALSE(iter.end());
24 ASSERT_EQ(0, iter.array_pos());
25 ASSERT_EQ(0, iter.char_pos());
26 ASSERT_EQ('s', iter.get());
27 ASSERT_TRUE(iter.Advance());
29 ASSERT_FALSE(iter.end());
30 ASSERT_EQ(1, iter.array_pos());
31 ASSERT_EQ(1, iter.char_pos());
32 ASSERT_EQ(251, iter.get())
[all...] |
| /external/chromium_org/third_party/skia/src/utils/ |
| SkNWayCanvas.cpp | 46 class SkNWayCanvas::Iter {
48 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) {
67 Iter iter(fList);
68 while (iter.next()) {
69 iter->save(flags);
76 Iter iter(fList);
77 while (iter.next()) {
78 iter->saveLayer(bounds, paint, flags)
[all...] |
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 46 class SkNWayCanvas::Iter {
48 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) {
67 Iter iter(fList);
68 while (iter.next()) {
69 iter->save(flags);
76 Iter iter(fList);
77 while (iter.next()) {
78 iter->saveLayer(bounds, paint, flags)
[all...] |
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| term_break_iterator_unittest.cc | 15 TermBreakIterator iter(empty);
16 EXPECT_FALSE(iter.Advance());
21 TermBreakIterator iter(word);
22 EXPECT_TRUE(iter.Advance());
23 EXPECT_EQ(UTF8ToUTF16("simple"), iter.GetCurrentTerm());
24 EXPECT_FALSE(iter.Advance()); // Test unexpected advance after end.
29 TermBreakIterator iter(word);
30 EXPECT_TRUE(iter.Advance());
31 EXPECT_EQ(UTF8ToUTF16("Camel"), iter.GetCurrentTerm());
32 EXPECT_TRUE(iter.Advance())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 22 template <class Iter>
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa))
[all...] |
| /external/chromium_org/chrome/browser/notifications/ |
| balloon_collection_base.cc | 29 Balloons::iterator iter; local
30 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
31 if ((*iter) == balloon) {
32 balloons_.erase(iter);
40 Balloons::const_iterator iter; local
41 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
53 Balloons::iterator iter; local
69 Balloons::iterator iter; local
84 Balloons::iterator iter; local
106 Balloons::iterator iter; local
[all...] |
| /external/chromium/chrome/browser/notifications/ |
| balloon_collection_base.cc | 26 Balloons::iterator iter; local
27 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
28 if ((*iter) == balloon) {
29 balloons_.erase(iter);
39 Balloons::iterator iter; local
40 for (iter = balloons_.begin(); iter != balloons_.end(); ++iter) {
55 Balloons::iterator iter; local
77 Balloons::iterator iter; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| is_sorted_until.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // is_sorted_until(Iter first, Iter last);
22 template <class Iter>
29 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a));
30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa))
[all...] |
| is_sorted_until_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
14 // Iter
15 // is_sorted_until(Iter first, Iter last, Compare comp);
23 template <class Iter>
30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a));
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa))
[all...] |
| is_sorted.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
15 // is_sorted(Iter first, Iter last);
22 template <class Iter>
29 assert(std::is_sorted(Iter(a), Iter(a)));
30 assert(std::is_sorted(Iter(a), Iter(a+sa)));
36 assert(std::is_sorted(Iter(a), Iter(a+sa)))
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uiter.cpp | 34 noopGetIndex(UCharIterator * /*iter*/, UCharIteratorOrigin /*origin*/) {
39 noopMove(UCharIterator * /*iter*/, int32_t /*delta*/, UCharIteratorOrigin /*origin*/) {
44 noopHasNext(UCharIterator * /*iter*/) {
49 noopCurrent(UCharIterator * /*iter*/) {
54 noopGetState(const UCharIterator * /*iter*/) {
59 noopSetState(UCharIterator * /*iter*/, uint32_t /*state*/, UErrorCode *pErrorCode) {
87 stringIteratorGetIndex(UCharIterator *iter, UCharIteratorOrigin origin) {
92 return iter->start;
94 return iter->index;
96 return iter->limit
[all...] |
| /external/icu4c/common/ |
| uiter.cpp | 37 noopGetIndex(UCharIterator * /*iter*/, UCharIteratorOrigin /*origin*/) {
42 noopMove(UCharIterator * /*iter*/, int32_t /*delta*/, UCharIteratorOrigin /*origin*/) {
47 noopHasNext(UCharIterator * /*iter*/) {
52 noopCurrent(UCharIterator * /*iter*/) {
57 noopGetState(const UCharIterator * /*iter*/) {
62 noopSetState(UCharIterator * /*iter*/, uint32_t /*state*/, UErrorCode *pErrorCode) {
90 stringIteratorGetIndex(UCharIterator *iter, UCharIteratorOrigin origin) {
95 return iter->start;
97 return iter->index;
99 return iter->limit
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // inplace_merge(Iter first, Iter middle, Iter last);
23 template <class Iter>
34 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.cpp | 38 for (Witer_const iter = w_.begin();
39 iter != w_.end();
40 ++iter) {
41 if (isnanf(iter->second) || __isinff(iter->second))
52 for (Witer_const iter = w1.w_.begin();
53 iter != w1.w_.end();
54 ++iter) {
55 w_[iter->first] += ((multiplier * iter->second) / w1.normalizer
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| generators-iteration.js | 40 var iter = g();
41 var result = iter.next();
54 var iter = thunk();
58 iter.next());
60 assertThrows(function() { iter.next(); }, Error);
63 var iter = thunk();
67 iter.next(send_val));
69 assertThrows(function() { iter.next(send_val); }, Error);
73 var iter = thunk();
77 iter.next())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // max_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::max_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| min_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // min_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::min_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| minmax_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // pair<Iter, Iter>
15 // minmax_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 std::pair<Iter, Iter> p = std::minmax_element(first, last)
[all...] |
| /external/bison/lib/ |
| mbuiter.h | 24 char *iter;
25 for (iter = buf; *iter != '\0'; iter++)
27 do_something (*iter);
32 mbui_iterator_t iter;
33 for (mbui_init (iter, buf); mbui_avail (iter); mbui_advance (iter))
35 do_something (mbui_cur_ptr (iter), mb_len (mbui_cur (iter)))
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/dbus/ |
| dbus_new_handlers_p2p.h | 91 dbus_bool_t wpas_dbus_setter_p2p_device_config(DBusMessageIter *iter,
95 dbus_bool_t wpas_dbus_getter_p2p_device_config(DBusMessageIter *iter,
99 dbus_bool_t wpas_dbus_getter_p2p_peers(DBusMessageIter *iter, DBusError *error,
102 dbus_bool_t wpas_dbus_getter_p2p_role(DBusMessageIter *iter, DBusError *error,
105 dbus_bool_t wpas_dbus_getter_p2p_group(DBusMessageIter *iter, DBusError *error,
108 dbus_bool_t wpas_dbus_getter_p2p_peergo(DBusMessageIter *iter,
116 dbus_bool_t wpas_dbus_getter_p2p_peer_device_name(DBusMessageIter *iter,
121 DBusMessageIter *iter, DBusError *error, void *user_data);
123 dbus_bool_t wpas_dbus_getter_p2p_peer_config_method(DBusMessageIter *iter,
127 dbus_bool_t wpas_dbus_getter_p2p_peer_level(DBusMessageIter *iter,
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/accumulate/ |
| accumulate.pass.cpp | 12 // template <InputIterator Iter, MoveConstructible T>
13 // requires HasPlus<T, Iter::reference>
14 // && HasAssign<T, HasPlus<T, Iter::reference>::result_type>
16 // accumulate(Iter first, Iter last, T init);
23 template <class Iter, class T>
25 test(Iter first, Iter last, T init, T x)
30 template <class Iter>
36 test(Iter(ia), Iter(ia), 0, 0)
[all...] |
| /external/chromium_org/device/nfc/ |
| nfc_adapter.cc | 23 for (PeersMap::const_iterator iter = peers_.begin();
24 iter != peers_.end(); ++iter) {
25 peer_list->push_back(iter->second);
31 for (TagsMap::const_iterator iter = tags_.begin();
32 iter != tags_.end(); ++iter) {
33 tag_list->push_back(iter->second);
38 PeersMap::const_iterator iter = peers_.find(identifier); local
39 if (iter != peers_.end()
45 TagsMap::const_iterator iter = tags_.find(identifier); local
[all...] |
