Stack

The stack is a container that supports the same set of operations as the deque, but has two key differences:

• Thanks to using a simpler stack structure to represent the chunks, the stack offers faster access to the back of the container and faster indexing operations than deque.
• Unlike deque, the stack cannot guarantee fast updates to the front of the container: each update operation performed on the front position can require at most Chunk_capacity items to be shifted toward to back.

The template interface of the stack constructor is the same as that of the deque constructor, except that the chunk structure is not needed.

namespace pasl {
namespace data {
namespace chunkedseq {
namespace bootstrapped {

template <
  class Item,
  int Chunk_capacity = 512,
  class Cache = cachedmeasure::trivial<Item, size_t>,
  class Item_alloc = std::allocator<Item>
>
using stack;

}}}}

Example

#include <iostream>
#include <string>
#include <assert.h>

#include "chunkedseq.hpp"

int main(int argc, const char * argv[]) {
  
  using mystack_type = pasl::data::chunkedseq::bootstrapped::stack<int>;
  
  mystack_type mystack = { 0, 1, 2, 3, 4 };
  
  std::cout << "mystack contains:";
  while (! mystack.empty())
    std::cout << " " << mystack.pop_back();
  std::cout << std::endl;
  
  return 0;
  
}

Output

mystack contains: 4 3 2 1 0