OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:next_it
(Results
1 - 6
of
6
) sorted by null
/external/pdfium/fpdfsdk/
fpdfedittext.cpp
163
auto
next_it
= std::next(iter);
local
170
if (
next_it
== to_unicode.end() || curCharcode + 1 !=
next_it
->first)
175
next_it
= std::next(iter);
183
if (
next_it
== to_unicode.end() || curCharcode + 1 !=
next_it
->first ||
184
curUnicode + 1 !=
next_it
->second) {
190
next_it
= std::next(iter);
362
auto
next_it
= std::next(it);
local
363
if (
next_it
== widths.end() || next_it->first != it->first + 1 |
381
auto
next_it
= std::next(it);
local
[
all
...]
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/
weighted_quantiles_summary.h
211
auto
next_it
= read_it + 1;
local
212
while (
next_it
!= entries_.end() && add_accumulator < add_step &&
213
next_it
->PrevMaxRank() - read_it->NextMinRank() <= eps_delta) {
215
++
next_it
;
217
if (read_it ==
next_it
- 1) {
220
read_it =
next_it
- 1;
/external/drm_hwcomposer/
separate_rects.cpp
167
typename std::set<SweepEvent<TId, TNum>>::iterator
next_it
= it;
local
168
++
next_it
;
169
if (
next_it
!= sweep_h_events.end()) {
170
if (
next_it
->x == h_evt.x) {
245
typename std::vector<std::pair<TNum, IdSet<TId>>>::iterator
next_it
= it;
local
246
++
next_it
;
247
assert(
next_it
!= active_regions.end());
250
TNum region_bottom =
next_it
->first;
/art/compiler/debug/
elf_debug_loc_writer.h
128
auto
next_it
= it;
local
129
next_it
++;
130
const uint32_t high_pc =
next_it
!= stack_maps.end()
131
?
next_it
->first
/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_/
pat_trie_base.hpp
664
inode_iterator
next_it
= it;
local
665
++
next_it
;
666
return (
next_it
== p_parent->end())? 0 : *
next_it
;
[
all
...]
/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_/
pat_trie_base.hpp
664
inode_iterator
next_it
= it;
local
665
++
next_it
;
666
return (
next_it
== p_parent->end())? 0 : *
next_it
;
[
all
...]
Completed in 503 milliseconds