/usr/include/stxxl/bits/containers/sequence.h is in libstxxl-dev 1.4.1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 | /***************************************************************************
* include/stxxl/bits/containers/sequence.h
*
* based on include/stxxl/bits/containers/queue.h
*
* Part of the STXXL. See http://stxxl.sourceforge.net
*
* Copyright (C) 2012-2013 Timo Bingmann <tb@panthema.net>
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
**************************************************************************/
#ifndef STXXL_CONTAINERS_SEQUENCE_HEADER
#define STXXL_CONTAINERS_SEQUENCE_HEADER
#include <deque>
#include <stxxl/bits/deprecated.h>
#include <stxxl/bits/mng/block_manager.h>
#include <stxxl/bits/mng/typed_block.h>
#include <stxxl/bits/common/tmeta.h>
#include <stxxl/bits/mng/read_write_pool.h>
#include <stxxl/bits/mng/write_pool.h>
#include <stxxl/bits/mng/prefetch_pool.h>
STXXL_BEGIN_NAMESPACE
#ifndef STXXL_VERBOSE_SEQUENCE
#define STXXL_VERBOSE_SEQUENCE STXXL_VERBOSE2
#endif
//! \addtogroup stlcont
//! \{
//! External sequence or deque container without random access. \n
//! <b> Introduction </b> to sequence container: see \ref tutorial_sequence tutorial. \n
//! <b> Design and Internals </b> of sequence container: see \ref design_queue
/**
* Sequence is a primitive container consisting of only a sequence of blocks in
* external memory. The sequence provides appending methods similar to a deque:
* push_back and push_front; and also the corresponding pop functions. However,
* different from stxxl::deque (which is a vector in disguise), the sequence
* does not allow random access. Instead, the sequence can only be iterated
* using streams: either from front to back or in reverse.
*
* As with queue and stack, sequences of pushes and pops are made efficient
* using overlapping or read-ahead via block pools. The stream access likewise
* uses overlapped I/O, just like stream::vector_iterator2stream.
*
* \tparam ValueType type of the contained objects (POD with no references to internal memory)
* \tparam BlockSize size of the external memory block in bytes, default is \c STXXL_DEFAULT_BLOCK_SIZE(ValTp)
* \tparam AllocStr parallel disk allocation strategy, default is \c STXXL_DEFAULT_ALLOC_STRATEGY
* \tparam SizeType size data type, default is \c stxxl::uint64
*/
template <class ValueType,
unsigned BlockSize = STXXL_DEFAULT_BLOCK_SIZE(ValueType),
class AllocStr = STXXL_DEFAULT_ALLOC_STRATEGY,
class SizeType = stxxl::uint64>
class sequence : private noncopyable
{
public:
typedef ValueType value_type;
typedef AllocStr alloc_strategy_type;
typedef SizeType size_type;
enum {
block_size = BlockSize
};
typedef typed_block<block_size, value_type> block_type;
typedef BID<block_size> bid_type;
typedef std::deque<bid_type> bid_deque_type;
private:
typedef read_write_pool<block_type> pool_type;
/// current number of items in the sequence
size_type m_size;
/// whether the m_pool object is own and should be deleted.
bool m_owns_pool;
/// read_write_pool of blocks
pool_type* m_pool;
/// current front block of sequence
block_type* m_front_block;
/// current back block of sequence
block_type* m_back_block;
/// pointer to current front element in m_front_block
value_type* m_front_element;
/// pointer to current back element in m_back_block
value_type* m_back_element;
/// block allocation strategy
alloc_strategy_type m_alloc_strategy;
/// block allocation counter
unsigned_type m_alloc_count;
/// allocated block identifiers
bid_deque_type m_bids;
/// block manager used
block_manager* m_bm;
/// number of blocks to prefetch
unsigned_type m_blocks2prefetch;
public:
//! \name Constructors/Destructors
//! \{
//! Constructs empty sequence with own write and prefetch block pool
//!
//! \param D number of parallel disks, defaulting to the configured number of scratch disks,
//! memory consumption will be 2 * D + 2 blocks
//! (first and last block, D blocks as write cache, D block for prefetching)
explicit sequence(int_type D = -1)
: m_size(0),
m_owns_pool(true),
m_alloc_count(0),
m_bm(block_manager::get_instance())
{
if (D < 1) D = config::get_instance()->disks_number();
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]::sequence(D)");
m_pool = new pool_type(D, D + 2);
init();
}
//! Constructs empty sequence with own write and prefetch block pool
//!
//! \param w_pool_size number of blocks in the write pool, must be at least 2, recommended at least 3
//! \param p_pool_size number of blocks in the prefetch pool, recommended at least 1
//! \param blocks2prefetch defines the number of blocks to prefetch (\c front side),
//! default is number of block in the prefetch pool
explicit sequence(unsigned_type w_pool_size, unsigned_type p_pool_size, int blocks2prefetch = -1)
: m_size(0),
m_owns_pool(true),
m_alloc_count(0),
m_bm(block_manager::get_instance())
{
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]::sequence(sizes)");
m_pool = new pool_type(p_pool_size, w_pool_size);
init(blocks2prefetch);
}
//! Constructs empty sequence
//!
//! \param pool block write/prefetch pool
//! \param blocks2prefetch defines the number of blocks to prefetch (\c front side), default is number of blocks in the prefetch pool
//! \warning Number of blocks in the write pool must be at least 2, recommended at least 3
//! \warning Number of blocks in the prefetch pool recommended at least 1
sequence(pool_type& pool, int blocks2prefetch = -1)
: m_size(0),
m_owns_pool(false),
m_pool(&pool),
m_alloc_count(0),
m_bm(block_manager::get_instance())
{
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]::sequence(pool)");
init(blocks2prefetch);
}
//! \}
//! \name Modifiers
//! \{
void swap(sequence& obj)
{
std::swap(m_size, obj.m_size);
std::swap(m_owns_pool, obj.m_owns_pool);
std::swap(m_pool, obj.m_pool);
std::swap(m_front_block, obj.m_front_block);
std::swap(m_back_block, obj.m_back_block);
std::swap(m_front_element, obj.m_front_element);
std::swap(m_back_element, obj.m_back_element);
std::swap(m_alloc_strategy, obj.m_alloc_strategy);
std::swap(m_alloc_count, obj.m_alloc_count);
std::swap(m_bids, obj.m_bids);
std::swap(m_bm, obj.m_bm);
std::swap(m_blocks2prefetch, obj.m_blocks2prefetch);
}
//! \}
private:
void init(int blocks2prefetch = -1)
{
if (m_pool->size_write() < 2) {
STXXL_ERRMSG("sequence: invalid configuration, not enough blocks (" << m_pool->size_write() <<
") in write pool, at least 2 are needed, resizing to 3");
m_pool->resize_write(3);
}
if (m_pool->size_write() < 3) {
STXXL_MSG("sequence: inefficient configuration, no blocks for buffered writing available");
}
if (m_pool->size_prefetch() < 1) {
STXXL_MSG("sequence: inefficient configuration, no blocks for prefetching available");
}
/// initialize empty sequence
m_front_block = m_back_block = m_pool->steal();
m_back_element = m_back_block->begin() - 1;
m_front_element = m_back_block->begin();
set_prefetch_aggr(blocks2prefetch);
}
public:
//! \name Miscellaneous
//! \{
//! Defines the number of blocks to prefetch (\c front side).
//! This method should be called whenever the prefetch pool is resized
//! \param blocks2prefetch defines the number of blocks to prefetch (\c front side),
//! a negative value means to use the number of blocks in the prefetch pool
void set_prefetch_aggr(int_type blocks2prefetch)
{
if (blocks2prefetch < 0)
m_blocks2prefetch = m_pool->size_prefetch();
else
m_blocks2prefetch = blocks2prefetch;
}
//! Returns the number of blocks prefetched from the \c front side
unsigned_type get_prefetch_aggr() const
{
return m_blocks2prefetch;
}
//! \}
//! \name Modifiers
//! \{
//! Adds an element to the front of the sequence
void push_front(const value_type& val)
{
if (UNLIKELY(m_front_element == m_front_block->begin()))
{
if (m_size == 0)
{
STXXL_VERBOSE1("sequence::push_front Case 0");
assert(m_front_block == m_back_block);
m_front_element = m_back_element = m_front_block->end() - 1;
*m_front_element = val;
++m_size;
return;
}
// front block is completely filled
else if (m_front_block == m_back_block)
{
// can not write the front block because it
// is the same as the back block, must keep it memory
STXXL_VERBOSE1("sequence::push_front Case 1");
}
else if (size() < 2 * block_type::size)
{
STXXL_VERBOSE1("sequence::push_front Case 1.5");
// only two blocks with a gap at the end, move elements within memory
assert(m_bids.empty());
size_t gap = m_back_block->end() - (m_back_element + 1);
assert(gap > 0);
std::copy_backward(m_back_block->begin(), m_back_element + 1, m_back_block->end());
std::copy_backward(m_front_block->end() - gap, m_front_block->end(), m_back_block->begin() + gap);
std::copy_backward(m_front_block->begin(), m_front_block->end() - gap, m_front_block->end());
m_front_element += gap;
m_back_element += gap;
--m_front_element;
*m_front_element = val;
++m_size;
return;
}
else
{
STXXL_VERBOSE1("sequence::push_front Case 2");
// write the front block
// need to allocate new block
bid_type newbid;
m_bm->new_block(m_alloc_strategy, newbid, m_alloc_count++);
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]: push_front block " << m_front_block << " @ " << FMT_BID(newbid));
m_bids.push_front(newbid);
m_pool->write(m_front_block, newbid);
if (m_bids.size() <= m_blocks2prefetch) {
STXXL_VERBOSE1("sequence::push Case Hints");
m_pool->hint(newbid);
}
}
m_front_block = m_pool->steal();
m_front_element = m_front_block->end() - 1;
*m_front_element = val;
++m_size;
}
else // not at beginning of a block
{
--m_front_element;
*m_front_element = val;
++m_size;
}
}
//! Adds an element to the end of the sequence
void push_back(const value_type& val)
{
if (UNLIKELY(m_back_element == m_back_block->begin() + (block_type::size - 1)))
{
// back block is completely filled
if (m_front_block == m_back_block)
{
// can not write the back block because it
// is the same as the front block, must keep it memory
STXXL_VERBOSE1("sequence::push_back Case 1");
}
else if (size() < 2 * block_type::size)
{
STXXL_VERBOSE1("sequence::push_back Case 1.5");
// only two blocks with a gap in the beginning, move elements within memory
assert(m_bids.empty());
size_t gap = m_front_element - m_front_block->begin();
assert(gap > 0);
std::copy(m_front_element, m_front_block->end(), m_front_block->begin());
std::copy(m_back_block->begin(), m_back_block->begin() + gap, m_front_block->begin() + (block_type::size - gap));
std::copy(m_back_block->begin() + gap, m_back_block->end(), m_back_block->begin());
m_front_element -= gap;
m_back_element -= gap;
++m_back_element;
*m_back_element = val;
++m_size;
return;
}
else
{
STXXL_VERBOSE1("sequence::push_back Case 2");
// write the back block
// need to allocate new block
bid_type newbid;
m_bm->new_block(m_alloc_strategy, newbid, m_alloc_count++);
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]: push_back block " << m_back_block << " @ " << FMT_BID(newbid));
m_bids.push_back(newbid);
m_pool->write(m_back_block, newbid);
if (m_bids.size() <= m_blocks2prefetch) {
STXXL_VERBOSE1("sequence::push_back Case Hints");
m_pool->hint(newbid);
}
}
m_back_block = m_pool->steal();
m_back_element = m_back_block->begin();
*m_back_element = val;
++m_size;
}
else // not at end of a block
{
++m_back_element;
*m_back_element = val;
++m_size;
}
}
//! Removes element from the front of the sequence
void pop_front()
{
assert(!empty());
if (UNLIKELY(m_front_element == m_front_block->begin() + (block_type::size - 1)))
{
// if there is only one block, it implies ...
if (m_back_block == m_front_block)
{
STXXL_VERBOSE1("sequence::pop_front Case 1");
assert(size() == 1);
assert(m_back_element == m_front_element);
assert(m_bids.empty());
// reset everything
m_back_element = m_back_block->begin() - 1;
m_front_element = m_back_block->begin();
m_size = 0;
return;
}
--m_size;
if (m_size <= block_type::size)
{
STXXL_VERBOSE1("sequence::pop_front Case 2");
assert(m_bids.empty());
// the m_back_block is the next block
m_pool->add(m_front_block);
m_front_block = m_back_block;
m_front_element = m_back_block->begin();
return;
}
STXXL_VERBOSE1("sequence::pop_front Case 3");
assert(!m_bids.empty());
request_ptr req = m_pool->read(m_front_block, m_bids.front());
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]: pop_front block " << m_front_block << " @ " << FMT_BID(m_bids.front()));
// give prefetching hints
for (unsigned_type i = 0; i < m_blocks2prefetch && i < m_bids.size() - 1; ++i)
{
STXXL_VERBOSE1("sequence::pop_front Case Hints");
m_pool->hint(m_bids[i + 1]);
}
m_front_element = m_front_block->begin();
req->wait();
m_bm->delete_block(m_bids.front());
m_bids.pop_front();
}
else
{
++m_front_element;
--m_size;
}
}
//! Removes element from the back of the sequence
void pop_back()
{
assert(!empty());
if (UNLIKELY(m_back_element == m_back_block->begin()))
{
// if there is only one block, it implies ...
if (m_back_block == m_front_block)
{
STXXL_VERBOSE1("sequence::pop_back Case 1");
assert(size() == 1);
assert(m_back_element == m_front_element);
assert(m_bids.empty());
// reset everything
m_back_element = m_back_block->begin() - 1;
m_front_element = m_back_block->begin();
m_size = 0;
return;
}
--m_size;
if (m_size <= block_type::size)
{
STXXL_VERBOSE1("sequence::pop_back Case 2");
assert(m_bids.empty());
// the m_front_block is the next block
m_pool->add(m_back_block);
m_back_block = m_front_block;
m_back_element = m_back_block->end() - 1;
return;
}
STXXL_VERBOSE1("sequence::pop_back Case 3");
assert(!m_bids.empty());
request_ptr req = m_pool->read(m_back_block, m_bids.back());
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]: pop_back block " << m_back_block << " @ " << FMT_BID(m_bids.back()));
// give prefetching hints
for (unsigned_type i = 1; i < m_blocks2prefetch && i < m_bids.size() - 1; ++i)
{
STXXL_VERBOSE1("sequence::pop_front Case Hints");
m_pool->hint(m_bids[m_bids.size() - 1 - i]);
}
m_back_element = m_back_block->end() - 1;
req->wait();
m_bm->delete_block(m_bids.back());
m_bids.pop_back();
}
else
{
--m_back_element;
--m_size;
}
}
//! \}
//! \name Capacity
//! \{
//! Returns the size of the sequence
size_type size() const
{
return m_size;
}
//! Returns \c true if sequence is empty
bool empty() const
{
return (m_size == 0);
}
//! \}
//! \name Operators
//! \{
//! Returns a mutable reference at the back of the sequence
value_type & back()
{
assert(!empty());
return *m_back_element;
}
//! Returns a const reference at the back of the sequence
const value_type & back() const
{
assert(!empty());
return *m_back_element;
}
//! Returns a mutable reference at the front of the sequence
value_type & front()
{
assert(!empty());
return *m_front_element;
}
//! Returns a const reference at the front of the sequence
const value_type & front() const
{
assert(!empty());
return *m_front_element;
}
//! \}
//! \name Constructors/Destructors
//! \{
~sequence()
{
if (m_front_block != m_back_block)
m_pool->add(m_back_block);
m_pool->add(m_front_block);
if (m_owns_pool)
delete m_pool;
if (!m_bids.empty())
m_bm->delete_blocks(m_bids.begin(), m_bids.end());
}
//! \}
/**************************************************************************/
class stream
{
public:
typedef typename sequence::value_type value_type;
typedef typename bid_deque_type::const_iterator bid_iter_type;
protected:
const sequence& m_sequence;
size_type m_size;
value_type* m_current_element;
block_type* m_current_block;
bid_iter_type m_next_bid;
public:
stream(const sequence& sequence)
: m_sequence(sequence),
m_size(sequence.size())
{
m_current_block = sequence.m_front_block;
m_current_element = sequence.m_front_element;
m_next_bid = sequence.m_bids.begin();
}
~stream()
{
if (m_current_block != m_sequence.m_front_block &&
m_current_block != m_sequence.m_back_block) // give m_current_block back to pool
m_sequence.m_pool->add(m_current_block);
}
//! return number of element left till end-of-stream.
size_type size() const
{
return m_size;
}
//! standard stream method
bool empty() const
{
return (m_size == 0);
}
//! standard stream method
const value_type& operator * () const
{
assert(!empty());
return *m_current_element;
}
//! standard stream method
stream& operator ++ ()
{
assert(!empty());
if (UNLIKELY(m_current_element == m_current_block->begin() + (block_type::size - 1)))
{
// next item position is beyond end of current block, find next block
--m_size;
if (m_size == 0)
{
STXXL_VERBOSE1("sequence::stream::operator++ last block finished clean at block end");
assert(m_next_bid == m_sequence.m_bids.end());
assert(m_current_block == m_sequence.m_back_block);
// nothing to give back to sequence pool
m_current_element = NULL;
return *this;
}
else if (m_size <= block_type::size) // still items left in last partial block
{
STXXL_VERBOSE1("sequence::stream::operator++ reached last block");
assert(m_next_bid == m_sequence.m_bids.end());
// the m_back_block is the next block
if (m_current_block != m_sequence.m_front_block) // give current_block back to pool
m_sequence.m_pool->add(m_current_block);
m_current_block = m_sequence.m_back_block;
m_current_element = m_current_block->begin();
return *this;
}
else if (m_current_block == m_sequence.m_front_block)
{
STXXL_VERBOSE1("sequence::stream::operator++ first own-block case: steal block from sequence's pool");
m_current_block = m_sequence.m_pool->steal();
}
STXXL_VERBOSE1("sequence::stream::operator++ default case: fetch next block");
assert(m_next_bid != m_sequence.m_bids.end());
request_ptr req = m_sequence.m_pool->read(m_current_block, *m_next_bid);
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]::stream::operator++ read block " << m_current_block << " @ " << FMT_BID(*m_next_bid));
// give prefetching hints
bid_iter_type bid = m_next_bid + 1;
for (unsigned_type i = 0; i < m_sequence.m_blocks2prefetch && bid != m_sequence.m_bids.end(); ++i, ++bid)
{
STXXL_VERBOSE1("sequence::stream::operator++ giving prefetch hints");
m_sequence.m_pool->hint(*bid);
}
m_current_element = m_current_block->begin();
req->wait();
++m_next_bid;
}
else
{
--m_size;
++m_current_element;
}
return *this;
}
};
//! \name Miscellaneous
//! \{
//! construct a forward stream from this sequence
stream get_stream()
{
return stream(*this);
}
//! \}
/**************************************************************************/
class reverse_stream
{
public:
typedef typename sequence::value_type value_type;
typedef typename bid_deque_type::const_reverse_iterator bid_iter_type;
protected:
const sequence& m_sequence;
size_type m_size;
value_type* m_current_element;
block_type* m_current_block;
bid_iter_type m_next_bid;
public:
reverse_stream(const sequence& sequence)
: m_sequence(sequence),
m_size(sequence.size())
{
m_current_block = sequence.m_back_block;
m_current_element = sequence.m_back_element;
m_next_bid = sequence.m_bids.rbegin();
}
~reverse_stream()
{
if (m_current_block != m_sequence.m_front_block &&
m_current_block != m_sequence.m_back_block) // give m_current_block back to pool
m_sequence.m_pool->add(m_current_block);
}
//! return number of element left till end-of-stream.
size_type size() const
{
return m_size;
}
//! standard stream method
bool empty() const
{
return (m_size == 0);
}
//! standard stream method
const value_type& operator * () const
{
assert(!empty());
return *m_current_element;
}
//! standard stream method
reverse_stream& operator ++ ()
{
assert(!empty());
if (UNLIKELY(m_current_element == m_current_block->begin()))
{
// next item position is beyond begin of current block, find next block
--m_size;
if (m_size == 0)
{
STXXL_VERBOSE1("sequence::reverse_stream::operator++ last block finished clean at block begin");
assert(m_next_bid == m_sequence.m_bids.rend());
assert(m_current_block == m_sequence.m_front_block);
// nothing to give back to sequence pool
m_current_element = NULL;
return *this;
}
else if (m_size <= block_type::size)
{
STXXL_VERBOSE1("sequence::reverse_stream::operator++ reached first block");
assert(m_next_bid == m_sequence.m_bids.rend());
// the m_back_block is the next block
if (m_current_block != m_sequence.m_back_block) // give current_block back to pool
m_sequence.m_pool->add(m_current_block);
m_current_block = m_sequence.m_front_block;
m_current_element = m_current_block->begin() + (block_type::size - 1);
return *this;
}
else if (m_current_block == m_sequence.m_back_block)
{
STXXL_VERBOSE1("sequence::reverse_stream::operator++ first own-block case: steal block from sequence's pool");
m_current_block = m_sequence.m_pool->steal();
}
STXXL_VERBOSE1("sequence::reverse_stream::operator++ default case: fetch previous block");
assert(m_next_bid != m_sequence.m_bids.rend());
request_ptr req = m_sequence.m_pool->read(m_current_block, *m_next_bid);
STXXL_VERBOSE_SEQUENCE("sequence[" << this << "]::reverse_stream::operator++ read block " << m_current_block << " @ " << FMT_BID(*m_next_bid));
// give prefetching hints
bid_iter_type bid = m_next_bid + 1;
for (unsigned_type i = 0; i < m_sequence.m_blocks2prefetch && bid != m_sequence.m_bids.rend(); ++i, ++bid)
{
STXXL_VERBOSE1("sequence::reverse_stream::operator++ giving prefetch hints");
m_sequence.m_pool->hint(*bid);
}
m_current_element = m_current_block->begin() + (block_type::size - 1);
req->wait();
++m_next_bid;
}
else
{
--m_size;
--m_current_element;
}
return *this;
}
};
//! \name Miscellaneous
//! \{
//! construct a reverse stream from this sequence
reverse_stream get_reverse_stream()
{
return reverse_stream(*this);
}
//! \}
};
//! \}
STXXL_END_NAMESPACE
#endif // !STXXL_CONTAINERS_SEQUENCE_HEADER
// vim: et:ts=4:sw=4
|