Lines Matching refs:beg
173 // Write values between |beg| and |end| to |fp|, and fold the data into the
176 bool WriteRange(const CTI& beg, const CTI& end,
178 for (CTI iter = beg; iter != end; ++iter) {
294 bool sorted(CTI beg, CTI end, LESS less) {
295 while ((end - beg) > 2) {
296 CTI n = beg++;
297 DCHECK(!less(*beg, *n));
298 if (less(*beg, *n))
304 // Merge |beg|..|end| into |container|. Both should be sorted by the given
309 void container_merge(CT* container, CTI beg, CTI end, const COMP& less) {
311 DCHECK(sorted(beg, end, less));
315 container->resize(c_size + (end - beg));
323 while (c_end != container->begin() && end != beg) {
332 if (end != beg) {
337 DCHECK_EQ(c_out - c_end, end - beg);
339 std::copy(beg, end, container->begin());
393 // Merge data from |beg|..|end| into receiver's state, then process the state.
398 void MergeDataAndProcess(const StateInternalPos& beg,
403 beg.add_prefixes_iter_,
408 beg.sub_prefixes_iter_,
413 beg.add_hashes_iter_,
418 beg.sub_hashes_iter_,
452 StateInternalPos ShardEnd(const StateInternalPos& beg, SBPrefix shard_max) {
454 std::upper_bound(beg.add_prefixes_iter_, add_prefixes_.end(),
456 std::upper_bound(beg.sub_prefixes_iter_, sub_prefixes_.end(),
458 std::upper_bound(beg.add_hashes_iter_, add_full_hashes_.end(),
460 std::upper_bound(beg.sub_hashes_iter_, sub_full_hashes_.end(),
464 // Write a shard header and data for the shard starting at |beg| and ending at
466 bool WriteShard(const StateInternalPos& beg, const StateInternalPos& end,
470 end.add_prefixes_iter_ - beg.add_prefixes_iter_;
472 end.sub_prefixes_iter_ - beg.sub_prefixes_iter_;
474 end.add_hashes_iter_ - beg.add_hashes_iter_;
476 end.sub_hashes_iter_ - beg.sub_hashes_iter_;
480 WriteRange(beg.add_prefixes_iter_, end.add_prefixes_iter_,
482 WriteRange(beg.sub_prefixes_iter_, end.sub_prefixes_iter_,
484 WriteRange(beg.add_hashes_iter_, end.add_hashes_iter_,
486 WriteRange(beg.sub_hashes_iter_, end.sub_hashes_iter_,