VecIncAccess< _Data > Class Template Reference

#include <vecincaccess.h>

Inheritance diagram for VecIncAccess< _Data >:

[legend]

Collaboration diagram for VecIncAccess< _Data >:

[legend]

List of all members.

Classes
class	cyclic_iterator
class	iterator
class	Node
Public Types
typedef std::vector< Node > ::const_iterator	data_iterator
Public Member Functions
	VecIncAccess ()
void	push_back (Index index, const _Data &data)
iterator	begin ()
cyclic_iterator	begin_cyclic ()
data_iterator	begin_data ()
data_iterator	end_data ()
void	reserve (unsigned size)
Index	size ()
Protected Attributes
std::vector< Node >	m_list
Friends
std::ostream &	operator<< (std::ostream &out, const VecIncAccess< _Data > &v)

---

Detailed Description

template<class _Data>
class VecIncAccess< _Data >

IncAccessVector define a sparse vector optimized for finding non null elements as long as the sequence of searchs for indices is always increasing.

Definition at line 22 of file vecincaccess.h.

---

Member Typedef Documentation

template<class _Data>

typedef std::vector<Node>::const_iterator VecIncAccess< _Data >::data_iterator

Reimplemented in VecIncBC.

Definition at line 38 of file vecincaccess.h.

---

Constructor & Destructor Documentation

template<class _Data>

VecIncAccess< _Data >::VecIncAccess

(

)

[inline]

Definition at line 170 of file vecincaccess.h.

                {
    Node node;
    node.index=INDEX_MAX;
    m_list.push_back(node);
  }

---

Member Function Documentation

template<class _Data>

iterator VecIncAccess< _Data >::begin

(

)

[inline]

Definition at line 184 of file vecincaccess.h.

{return iterator(this,m_list.begin());}

template<class _Data>

cyclic_iterator VecIncAccess< _Data >::begin_cyclic

(

)

[inline]

Definition at line 186 of file vecincaccess.h.

{return cyclic_iterator(this,m_list.begin());}

template<class _Data>

data_iterator VecIncAccess< _Data >::begin_data

(

)

[inline]

Definition at line 188 of file vecincaccess.h.

{return m_list.begin();}

template<class _Data>

data_iterator VecIncAccess< _Data >::end_data

(

)

[inline]

Definition at line 189 of file vecincaccess.h.

                          {assert(m_list.size() != 0);
                           return m_list.begin() + (m_list.size() -1);}

template<class _Data>

void VecIncAccess< _Data >::push_back	(	Index	index,
		const _Data &	data
	)			[inline]

Definition at line 176 of file vecincaccess.h.

  {
    Node node;
    node.index=index;
    node.data = data;
    m_list.push_back(node);
    std::swap(m_list.back(),m_list[m_list.size()-2]);
  }

template<class _Data>

void VecIncAccess< _Data >::reserve

(

unsigned

size

)

[inline]

Definition at line 192 of file vecincaccess.h.

  {
    m_list.reserve(size+2);
  }

template<class _Data>

Index VecIncAccess< _Data >::size

(

)

[inline]

Definition at line 197 of file vecincaccess.h.

{return m_list.size()-1;}

---

Friends And Related Function Documentation

template<class _Data>

std::ostream& operator<<	(	std::ostream &	out,
		const VecIncAccess< _Data > &	v
	)			[friend]

Definition at line 203 of file vecincaccess.h.

{
  typename std::vector< typename VecIncAccess<_Data>::Node >::const_iterator it=v.m_list.begin();
  while(it!=v.m_list.end())
  {
    out << it->index << " " << it->data << "\n";
  }


  return out;
}

---

Member Data Documentation

template<class _Data>

std::vector<Node> VecIncAccess< _Data >::m_list [protected]

Definition at line 33 of file vecincaccess.h.

---

The documentation for this class was generated from the following file:

• vecincaccess.h