Home
last modified time | relevance | path

Searched refs:i_next (Results 1 – 5 of 5) sorted by relevance

/external/libcxx/test/std/containers/unord/unord.set/
Derase_const_iter.pass.cpp48 C::const_iterator i_next = i; in main() local
49 ++i_next; in main()
51 assert(j == i_next); in main()
73 C::const_iterator i_next = i; in main() local
74 ++i_next; in main()
76 assert(j == i_next); in main()
/external/libcxx/test/std/containers/unord/unord.multiset/
Derase_const_iter.pass.cpp48 C::const_iterator i_next = i; in main() local
49 ++i_next; in main()
51 assert(j == i_next); in main()
75 C::const_iterator i_next = i; in main() local
76 ++i_next; in main()
78 assert(j == i_next); in main()
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
Derase_const_iter.pass.cpp50 C::const_iterator i_next = i; in main() local
51 ++i_next; in main()
53 assert(j == i_next); in main()
99 C::const_iterator i_next = i; in main() local
100 ++i_next; in main()
102 assert(j == i_next); in main()
/external/llvm/test/Transforms/IndVarSimplify/
Dpr25578.ll16 %i = phi i32 [ 0, %L1_header ], [ %i_next, %L2_latch ]
33 %i_next = add nsw i32 %i, 1
/external/webp/src/enc/
Dbackward_references_enc.c1374 const int i_next = i + len - 1; // for loop does ++i, thus -1 here. in BackwardReferencesHashChainDistanceOnly() local
1375 for (; i <= i_next; ++i) UpdateCostPerIndex(cost_manager, i + 1); in BackwardReferencesHashChainDistanceOnly()
1376 i = i_next; in BackwardReferencesHashChainDistanceOnly()