HomeSort by relevance Sort by last modified time
    Searched refs:iter1 (Results 1 - 25 of 59) sorted by null

1 2 3

  /external/chromium_org/third_party/icu/source/samples/uciter8/
uciter8.c 45 compareIterators(UCharIterator *iter1, const char *n1,
51 length=iter1->getIndex(iter1, UITER_LENGTH);
61 pos1=iter1->move(iter1, middle, UITER_ZERO);
74 c1=iter1->current(iter1);
83 c1=iter1->next(iter1);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT))
307 UCharIterator iter1, iter2; local
    [all...]
  /external/icu/icu4c/source/samples/uciter8/
uciter8.c 45 compareIterators(UCharIterator *iter1, const char *n1,
51 length=iter1->getIndex(iter1, UITER_LENGTH);
61 pos1=iter1->move(iter1, middle, UITER_ZERO);
74 c1=iter1->current(iter1);
83 c1=iter1->next(iter1);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT))
307 UCharIterator iter1, iter2; local
    [all...]
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/
advance_backward.hpp 31 typedef typename prior<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_backward::apply
32 typedef iter1 type;
42 typedef typename prior<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_backward::apply
43 typedef typename prior<iter1>::type iter2;
54 typedef typename prior<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_backward::apply
55 typedef typename prior<iter1>::type iter2;
67 typedef typename prior<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_backward::apply
68 typedef typename prior<iter1>::type iter2;
advance_forward.hpp 31 typedef typename next<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_forward::apply
32 typedef iter1 type;
42 typedef typename next<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_forward::apply
43 typedef typename next<iter1>::type iter2;
54 typedef typename next<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_forward::apply
55 typedef typename next<iter1>::type iter2;
67 typedef typename next<iter0>::type iter1; typedef in struct:boost::mpl::aux::advance_forward::apply
68 typedef typename next<iter1>::type iter2;
iter_fold_impl.hpp 50 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::iter_fold_impl
54 typedef iter1 iterator;
68 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::iter_fold_impl
69 typedef typename apply2< ForwardOp,state1,iter1 >::type state2;
70 typedef typename mpl::next<iter1>::type iter2;
88 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::iter_fold_impl
89 typedef typename apply2< ForwardOp,state1,iter1 >::type state2;
90 typedef typename mpl::next<iter1>::type iter2;
110 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::iter_fold_impl
111 typedef typename apply2< ForwardOp,state1,iter1 >::type state2
    [all...]
reverse_fold_impl.hpp 54 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::reverse_fold_impl
60 typedef iter1 iterator;
75 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::reverse_fold_impl
76 typedef typename apply2< ForwardOp, fwd_state1, typename deref<iter1>::type >::type fwd_state2;
77 typedef typename mpl::next<iter1>::type iter2;
81 typedef typename apply2< BackwardOp, bkwd_state2, typename deref<iter1>::type >::type bkwd_state1;
101 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::reverse_fold_impl
102 typedef typename apply2< ForwardOp, fwd_state1, typename deref<iter1>::type >::type fwd_state2;
103 typedef typename mpl::next<iter1>::type iter2;
110 typedef typename apply2< BackwardOp, bkwd_state2, typename deref<iter1>::type >::type bkwd_state1
130 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::reverse_fold_impl
163 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::reverse_fold_impl
    [all...]
fold_impl.hpp 50 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::fold_impl
54 typedef iter1 iterator;
68 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::fold_impl
69 typedef typename apply2< ForwardOp, state1, typename deref<iter1>::type >::type state2;
70 typedef typename mpl::next<iter1>::type iter2;
88 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::fold_impl
89 typedef typename apply2< ForwardOp, state1, typename deref<iter1>::type >::type state2;
90 typedef typename mpl::next<iter1>::type iter2;
110 typedef typename mpl::next<iter0>::type iter1; typedef in struct:boost::mpl::aux::fold_impl
111 typedef typename apply2< ForwardOp, state1, typename deref<iter1>::type >::type state2
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
itercoll.cpp 229 CollationElementIterator *iter1 = en_us->createCollationElementIterator(test1); local
243 delete iter1;
258 assertEqual(*iter1, *iter2);
260 iter1->reset();
270 assertEqual(*iter1, *iter2);
275 iter1->setText(empty, status);
277 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
281 iter1->setText(*chariter, status);
283 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
288 delete iter1;
416 CollationElementIterator *iter1 = local
496 CollationElementIterator *iter1 = local
    [all...]
  /external/chromium_org/third_party/icu/source/test/cintltst/
custrtst.c 431 UCharIterator iter1, iter2; local
466 uiter_setString(&iter1, strings[i], len1);
468 if(u_strCompareIter(&iter1, &iter2, TRUE)>=0) {
471 r1=u_strCompareIter(&iter1, &iter2, FALSE);
1446 UCharIterator iter, iter1, iter2; local
1705 UCharIterator iter1, iter2, *iter; local
    [all...]
  /external/icu/icu4c/source/test/intltest/
itercoll.cpp 284 CollationElementIterator *iter1 = en_us->createCollationElementIterator(test1); local
298 delete iter1;
313 assertEqual(*iter1, *iter2);
315 iter1->reset();
325 assertEqual(*iter1, *iter2);
330 iter1->setText(empty, status);
332 || iter1->next(status) != (int32_t)CollationElementIterator::NULLORDER) {
336 iter1->setText(*chariter, status);
338 || iter1->next(status) != (int32_t)CollationElementIterator::NULLORDER) {
343 delete iter1;
471 CollationElementIterator *iter1 = local
551 CollationElementIterator *iter1 = local
    [all...]
  /external/icu/icu4c/source/test/cintltst/
custrtst.c 427 UCharIterator iter1, iter2; local
462 uiter_setString(&iter1, strings[i], len1);
464 if(u_strCompareIter(&iter1, &iter2, TRUE)>=0) {
467 r1=u_strCompareIter(&iter1, &iter2, FALSE);
1442 UCharIterator iter, iter1, iter2; local
    [all...]
  /external/chromium_org/chrome/browser/ui/ash/launcher/
app_window_launcher_controller.cc 198 WindowToAppShelfIdMap::iterator iter1 = local
200 DCHECK(iter1 != window_to_app_shelf_id_map_.end());
201 std::string app_shelf_id = iter1->second;
202 window_to_app_shelf_id_map_.erase(iter1);
227 WindowToAppShelfIdMap::iterator iter1 = local
229 if (iter1 == window_to_app_shelf_id_map_.end())
231 std::string app_shelf_id = iter1->second;
  /external/llvm/lib/Transforms/Utils/
FlattenCFG.cpp 328 BasicBlock::iterator iter1 = Block1->begin(); local
334 if (iter1 == end1) {
340 if (!iter1->isIdenticalTo(iter2))
345 if (iter1->mayHaveSideEffects()) {
346 Instruction *CurI = &*iter1;
354 if (iter1->mayReadFromMemory())
357 if (iter1->mayWriteToMemory()) {
361 if (!AA || AA->alias(iter1, BI))
366 ++iter1;
  /external/chromium_org/third_party/icu/source/common/
ustring.cpp 826 u_strCompareIter(UCharIterator *iter1, UCharIterator *iter2, UBool codePointOrder) {
830 if(iter1==NULL || iter2==NULL) {
833 if(iter1==iter2) {
838 iter1->move(iter1, 0, UITER_START);
843 c1=iter1->next(iter1);
857 (c1<=0xdbff && U16_IS_TRAIL(iter1->current(iter1))) ||
858 (U16_IS_TRAIL(c1) && (iter1->previous(iter1), U16_IS_LEAD(iter1->previous(iter1)))
    [all...]
  /external/icu/icu4c/source/common/
ustring.cpp 826 u_strCompareIter(UCharIterator *iter1, UCharIterator *iter2, UBool codePointOrder) {
830 if(iter1==NULL || iter2==NULL) {
833 if(iter1==iter2) {
838 iter1->move(iter1, 0, UITER_START);
843 c1=iter1->next(iter1);
857 (c1<=0xdbff && U16_IS_TRAIL(iter1->current(iter1))) ||
858 (U16_IS_TRAIL(c1) && (iter1->previous(iter1), U16_IS_LEAD(iter1->previous(iter1)))
    [all...]
  /external/openfst/src/include/fst/
string-weight.h 301 StringWeightIterator<L, S> iter1(w1);
304 for (; !iter1.Done() ; iter1.Next(), iter2.Next())
305 if (iter1.Value() != iter2.Value())
403 StringWeightIterator<L, STRING_LEFT> iter1(w1);
405 for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value();
406 iter1.Next(), iter2.Next())
407 sum.PushBack(iter1.Value());
424 StringWeightReverseIterator<L, STRING_RIGHT> iter1(w1)
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
string-weight.h 293 StringWeightIterator<L, S> iter1(w1);
296 for (; !iter1.Done() ; iter1.Next(), iter2.Next())
297 if (iter1.Value() != iter2.Value())
387 StringWeightIterator<L, STRING_LEFT> iter1(w1);
389 for (; !iter1.Done() && !iter2.Done() && iter1.Value() == iter2.Value();
390 iter1.Next(), iter2.Next())
391 sum.PushBack(iter1.Value());
406 StringWeightReverseIterator<L, STRING_RIGHT> iter1(w1)
    [all...]
determinize.h 63 StringWeightIterator<L, S> iter1(w1);
74 return Weight(iter1.Value());
75 else if (iter1.Value() == iter2.Value())
76 return Weight(iter1.Value());
393 for (typename Subset::iterator iter1 = subset1->begin();
394 iter1 != subset1->end();
395 ++iter1) {
396 Element &element1 = *iter1;
408 for (typename Subset::iterator iter1 = subset1->begin();
409 iter1 != subset1->end()
    [all...]
  /external/chromium_org/third_party/skia/tests/
LListTest.cpp 131 Iter iter1; local
141 REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kHead_IterStart));
142 REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kTail_IterStart));
155 iter1.init(list1, Iter::kHead_IterStart);
157 REPORTER_ASSERT(reporter, iter1.get()->fID == iter2.get()->fID);
160 REPORTER_ASSERT(reporter, iter3.get()->fID == iter1.get()->fID);
161 REPORTER_ASSERT(reporter, iter4.get()->fID == iter1.get()->fID);
183 REPORTER_ASSERT(reporter, iter3.get()->fID == iter1.get()->fID);
184 REPORTER_ASSERT(reporter, iter4.get()->fID == iter1.get()->fID);
  /external/skia/tests/
LListTest.cpp 131 Iter iter1; local
141 REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kHead_IterStart));
142 REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kTail_IterStart));
155 iter1.init(list1, Iter::kHead_IterStart);
157 REPORTER_ASSERT(reporter, iter1.get()->fID == iter2.get()->fID);
160 REPORTER_ASSERT(reporter, iter3.get()->fID == iter1.get()->fID);
161 REPORTER_ASSERT(reporter, iter4.get()->fID == iter1.get()->fID);
183 REPORTER_ASSERT(reporter, iter3.get()->fID == iter1.get()->fID);
184 REPORTER_ASSERT(reporter, iter4.get()->fID == iter1.get()->fID);
  /external/chromium_org/chrome/browser/
memory_details.cc 186 for (ProcessMemoryInformationList::reverse_iterator iter1 =
188 iter1 != processes.rend();
189 ++iter1) {
191 iter1->process_type, iter1->renderer_type);
192 if (!iter1->titles.empty()) {
195 iter1->titles.begin();
196 iter2 != iter1->titles.end(); ++iter2) {
197 if (iter2 != iter1->titles.begin())
204 static_cast<int>(iter1->working_set.priv) / 1024
    [all...]
  /external/stlport/test/unit/
iter_test.cpp 19 CPPUNIT_TEST(iter1);
29 void iter1();
43 void IterTest::iter1() function in class:IterTest
  /ndk/tests/device/test-gnustl-full/unit/
iter_test.cpp 19 CPPUNIT_TEST(iter1);
29 void iter1();
43 void IterTest::iter1() function in class:IterTest
  /ndk/tests/device/test-stlport/unit/
iter_test.cpp 19 CPPUNIT_TEST(iter1);
29 void iter1();
43 void IterTest::iter1() function in class:IterTest
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_xrange.py 195 iter1 = xrange(start, end, step)
202 self.assert_iterators_equal(iter1, iter2, test_id, limit=100)
205 iter1 = reversed(xrange(start, end, step))
211 self.assert_iterators_equal(iter1, iter2, test_id, limit=100)

Completed in 1071 milliseconds

1 2 3