vcl_deque.h

来自「DTMK软件开发包,此为开源软件,是一款很好的医学图像开发资源.」· C头文件 代码 · 共 922 行 · 第 1/2 页

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 * Exception Handling:
 * Copyright (c) 1997
 * Mark of the Unicorn, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Mark of the Unicorn makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 * Adaptation:
 * Copyright (c) 1997
 * Moscow Center for SPARC Technology
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Moscow Center for SPARC Technology makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 */

#ifndef vcl_emulation_deque_h
#define vcl_emulation_deque_h

#include <vcl_cstddef.h>
#include "vcl_algobase.h"
#include "vcl_alloc.h"

# if defined ( __STL_USE_ABBREVS )
#  define __deque_iterator         dQIt
#  define __deque_const_iterator   dQcIt
# endif

inline vcl_size_t __deque_buf_size(vcl_size_t sz)
{
  return sz < 4096 ? vcl_size_t(4096 / sz) : vcl_size_t(1);
}

template <class T> struct __deque_iterator;
template <class T> struct __deque_const_iterator;
template <class T> struct __deque_data;

template <class T>
struct __deque_iterator_base
{
 private:
  typedef __deque_iterator_base<T> self;
 public:
  typedef T value_type;
  typedef value_type* pointer;
  typedef value_type& reference;
  typedef const value_type& const_reference;
  typedef vcl_size_t size_type;
  typedef vcl_ptrdiff_t difference_type;
  typedef pointer* map_pointer;

  pointer current;
  pointer first;
  pointer last;
  map_pointer node;

  static size_type buffer_size() { return __deque_buf_size(sizeof(value_type)); }
  void construct(pointer x, map_pointer y)
  {
    current=x; first=*y; last=(*y + buffer_size()); node=y;
  }
  void construct() { current=0; first=0; last=0; node=0; }
  void construct(const self& x)
  {
    current=x.current; first=x.first; last=x.last; node=x.node;
  }
  __deque_iterator_base(pointer x, map_pointer y) { construct(x,y);}
  __deque_iterator_base() : current(0), first(0), last(0), node(0) {}
  difference_type operator-(const self& x) const
  {
    return node == x.node
      ? current - x.current
      : difference_type(buffer_size() * (node - x.node - 1) +
                        (current - first) + (x.last - x.current));
  }
  void operator++()
  {
    __stl_debug_check(__check_advance(*this,1));
    if (++current == last)
    {
      first = *(++node);
      current = first;
      last = first + buffer_size();
    }
  }
  void operator--()
  {
    __stl_debug_check(__check_advance(*this,-1));
    if (current == first)
    {
      first = *(--node);
      last = first + buffer_size();
      current = last;
    }
    --current;
  }
  void operator+=(difference_type n)
  {
    __stl_debug_check(__check_advance(*this,n));
    difference_type offset = n + (current - first);
    difference_type num_node_to_jump = offset >= 0
      ? offset / buffer_size()
      : -((-offset + (difference_type)buffer_size() - 1) / (difference_type)buffer_size());
    if (num_node_to_jump == 0)
      current += n;
    else
    {
      node = node + num_node_to_jump;
      first = *node;
      last = first + buffer_size();
      current = first + (offset - num_node_to_jump * buffer_size());
    }
  }

  bool operator==(const self& x) const
  {
     __stl_debug_check(__check_same_owner(*this,x));
     return current == x.current ||
            ((current == first || x.current == x.first) && *this - x == 0);
  }
  bool operator!=(const self& x) const {return !(*this == x); }
  bool operator<(const self& x) const
  {
    __stl_debug_check(__check_same_owner(*this,x));
    return (node == x.node) ? (current < x.current) : (node < x.node);
  }
};

template <class T>
struct __deque_iterator : public __deque_iterator_base<T>
{
 private:
  typedef __deque_iterator_base<T> super;
 public:
  typedef __deque_iterator<T> iterator;
  typedef __deque_const_iterator<T> const_iterator;
  __deque_iterator() {}
  __deque_iterator(typename pointer x, typename map_pointer y) : super(x,y) {}
  // <awf>
  __IMPORT_CONTAINER_TYPEDEFS(super)
  // </awf>

  value_type& operator*() const { __stl_debug_check(__check_dereferenceable(*this)); return *current; }
  difference_type operator-(const iterator& x) const { return super::operator-(x); }
  iterator& operator++() { super::operator++(); return *this; }
  iterator operator++(int) { iterator tmp = *this; ++*this; return tmp; }
  iterator& operator--() { super::operator--(); return *this; }
  iterator operator--(int) { iterator tmp = *this; --*this; return tmp; }
  iterator& operator+=(difference_type n) { super::operator+=(n); return *this; }
  iterator& operator-=(difference_type n) { return *this += -n; }
  iterator operator+(difference_type n) const { iterator tmp = *this; return tmp += n; }
  iterator operator-(difference_type n) const { iterator tmp = *this; return tmp -= n; }
  reference operator[](difference_type n) const { return *(*this + n); }
  bool operator==(const iterator& x) const { return super::operator==(x); }
  bool operator!=(const iterator& x) const { return !(*this == x); }
  bool operator<(const iterator& x) const { return super::operator<(x); }
};


template <class T>
struct __deque_const_iterator : public __deque_iterator_base<T>
{
 private:
  typedef __deque_iterator_base<T> super;
 public:
  typedef __deque_iterator<T> iterator;
  typedef __deque_const_iterator<T> const_iterator;
  __deque_const_iterator() {}
  __deque_const_iterator(typename pointer x, typename map_pointer y) : super(x,y) {}
  __deque_const_iterator(const iterator& x) : super(x) {}
  typename const_reference operator*() const { return *current; }
  typename difference_type operator-(const const_iterator& x) const { return super::operator-(x); }
  const_iterator& operator++() { super::operator++(); return *this; }
  const_iterator operator++(int)  { const_iterator tmp = *this; ++*this; return tmp; }
  const_iterator& operator--() { super::operator--(); return *this; }
  const_iterator operator--(int) { const_iterator tmp = *this; --*this; return tmp; }
  const_iterator& operator+=(typename difference_type n) { super::operator+=(n); return *this; }
  const_iterator& operator-=(typename difference_type n) { return *this += -n; }
  const_iterator operator+(typename difference_type n) const { const_iterator tmp = *this; return tmp += n; }
  const_iterator operator-(typename difference_type n) const { const_iterator tmp = *this; return tmp -= n; }
  typename const_reference operator[](typename difference_type n) const { return *(*this + n); }
  bool operator==(const const_iterator& x) const { return super::operator==(x); }
  bool operator!=(const const_iterator& x) const {return !(*this == x); }
  bool operator<(const const_iterator& x) const { return super::operator<(x); }
};

template <class T>
inline vcl_random_access_iterator_tag
iterator_category(const __deque_iterator<T>&)
{
  return vcl_random_access_iterator_tag();
}

template <class T>
inline T*
value_type(const __deque_iterator<T>&)
{
  return (T*) 0;
}

template <class T>
inline vcl_ptrdiff_t*
distance_type(const __deque_iterator<T>&)
{
  return (vcl_ptrdiff_t*) 0;
}

template <class T>
inline vcl_random_access_iterator_tag
iterator_category(const __deque_const_iterator<T>&)
{
  return vcl_random_access_iterator_tag();
}

template <class T>
inline T*
value_type(const __deque_const_iterator<T>&)
{
  return (T*) 0;
}

template <class T>
inline vcl_ptrdiff_t*
distance_type(const __deque_const_iterator<T>&)
{
  return (vcl_ptrdiff_t*) 0;
}

template <class T>
struct __deque_data
{
  typedef T value_type;
  typedef vcl_size_t size_type;
  typedef vcl_ptrdiff_t difference_type;
  typedef T** map_pointer;
 protected:
  __deque_iterator<T> start;
  __deque_iterator<T> finish;
  size_type length;
  map_pointer map;
  size_type map_size;
 public:
  __deque_data() : start(), finish(), length(0), map(0), map_size(0) {
          __stl_debug_do(safe_init(this));
          __stl_debug_do(start.safe_init(this));
          __stl_debug_do(finish.safe_init(this));
  }
  ~__deque_data() {
      __stl_debug_do(invalidate()); __stl_debug_do(start.invalidate());
      __stl_debug_do(finish.invalidate());
  }
};

template <class T, class Alloc>
class __deque_base : public __deque_data <T> {
  typedef __deque_base<T,Alloc> self;
 public:
  typedef T value_type;
  typedef value_type* pointer;
  typedef vcl_size_t size_type;
  typedef Alloc allocator_type;
 protected:
  static size_type buffer_size() {
    return __deque_buf_size(sizeof(value_type)); }
  static size_type init_map_size() {
    return __deque_buf_size(sizeof(pointer)); }
  inline void deallocate_at_begin();
 public:
  typedef vcl_simple_alloc<value_type*, allocator_type> map_allocator;
  typedef vcl_simple_alloc<value_type, allocator_type> data_allocator;
  __deque_base() {}
 ~__deque_base() { clear(); }
  void pop_front() {
    vcl_destroy(start.current);
    ++start.current;
    --length;
    if ((length == 0) || start.current == start.last)
      deallocate_at_begin();
  }
  void clear() { while (length!=0) pop_front(); }
};

template <class T , class Alloc>
void __deque_base<T, Alloc>::deallocate_at_begin() {
  data_allocator::deallocate(*start.node++, buffer_size());
  if (length==0) {
    if (finish.current == finish.first)
      data_allocator::deallocate(*start.node, buffer_size());
    start.construct();
    finish.construct();
    map_allocator::deallocate(__deque_data<T>::map, map_size);
  }
  else
    start.construct(*start.node, start.node);
}

__BEGIN_STL_FULL_NAMESPACE
#  define vcl_deque __WORKAROUND_RENAME(vcl_deque)

template <class T, VCL_DFL_TYPE_PARAM_STLDECL(Alloc,vcl_alloc) >
class vcl_deque : public __deque_base<T,Alloc>
{
  typedef __deque_base<T, Alloc> super;
  typedef vcl_deque<T, Alloc> self;
 public:
  typedef T value_type;
  typedef vcl_size_t size_type;
  typedef value_type* pointer;
  typedef const value_type* const_pointer;
  typedef value_type& reference;
  typedef const value_type& const_reference;
  typedef vcl_ptrdiff_t difference_type;
  typedef __deque_iterator<T> iterator;
  typedef __deque_const_iterator<T> const_iterator;
  typedef vcl_reverse_iterator<const_iterator, value_type, const_reference,
                               difference_type>  const_reverse_iterator;
  typedef vcl_reverse_iterator<iterator, value_type, reference, difference_type>
          reverse_iterator;
 protected:
  typedef pointer* map_pointer;
  inline void allocate_at_begin();
  inline void allocate_at_end();
  inline void deallocate_at_end();
 public:
  vcl_deque() { }
  iterator begin() { return start; }
  const_iterator begin() const { return start; }
  iterator end() { return finish; }
  const_iterator end() const { return finish; }
  reverse_iterator rbegin() { return reverse_iterator(end()); }
  const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
  reverse_iterator rend() { return reverse_iterator(begin()); }
  const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
  bool empty() const { return length == 0; }
  size_type size() const { return length; }
  size_type max_size() const { return size_type(-1); }
  reference operator[](size_type n) { return *(begin() + n); }
  const_reference operator[](size_type n) const { return *(begin() + n); }
  reference front() { return *begin(); }
  const_reference front() const { return *begin(); }
  reference back() { return *(end() - 1); }
  const_reference back() const { return *(end() - 1); }
 private:

#  if defined (__STL_USE_EXCEPTIONS)
  inline void push_back_cleanup(int steps_remaining);
  inline void push_front_cleanup(int steps_remaining, bool allocated_at_begin);
  class push_back_protector;
  friend class push_back_protector;
  class push_back_protector
  {
    typedef vcl_deque<T,Alloc> deque_type;
    deque_type *container;
    int steps_remaining;
   public:
    push_back_protector(deque_type* d) : container(d), steps_remaining(2) {}
   ~push_back_protector() { if (steps_remaining) container->push_back_cleanup(steps_remaining); }
    void constructed() { steps_remaining = 1; }
    void done() { steps_remaining = 0; }
  };

  class push_front_protector;
  friend class push_front_protector;
  class push_front_protector
  {
    typedef vcl_deque<T,Alloc> deque_type;
    deque_type *container;
    int steps_remaining;
    bool allocated_at_begin;
   public:
    push_front_protector(deque_type* d, bool alloc_at_begin)
      : container(d), steps_remaining(2), allocated_at_begin(alloc_at_begin) {}
   ~push_front_protector() { if (steps_remaining ) container->push_front_cleanup(steps_remaining, allocated_at_begin); }
    void constructed() { steps_remaining = 1; }
    void done() { steps_remaining = 0; }
  };
#  else
  class push_front_protector
  {
   public:
    push_front_protector(void*, bool=bool()){}
   ~push_front_protector() {}
    void constructed() {}
    void done() {}
  };
  typedef push_front_protector push_back_protector;
#  endif

 public:
  void push_back(const T& x)
  {
    if (empty()) allocate_at_end();
    push_back_protector protector(this);
    vcl_construct(finish.current, x);
    protector.constructed();
    ++finish.current;
    ++length;
    if (finish.current == finish.last) allocate_at_end();
    protector.done();
    __stl_debug_do(invalidate_all());
  }
  void push_front(const T& x)
  {
    bool alloc_at_begin = empty() || start.current == start.first;
    if (alloc_at_begin) allocate_at_begin();
    push_front_protector protector(this, alloc_at_begin);
    --start.current;
    vcl_construct(start.current, x);
    protector.constructed();
    ++length;
    if (finish.current == finish.last) allocate_at_end();
    protector.done();
    __stl_debug_do(invalidate_all());
  }
  void pop_front()
  {
    __stl_debug_do(invalidate_iterator(start));
    super::pop_front();
  }
  void pop_back()
  {
    __stl_debug_do(invalidate_iterator(finish));
    if (finish.current == finish.first) deallocate_at_end();
    --finish.current;
    vcl_destroy(finish.current);
    --length;