Minisat::Queue< T > Class Template Reference

#include <Queue.h>

Collaboration diagram for Minisat::Queue< T >:

Public Types
typedef T	Key

Public Member Functions
	Queue ()
void	clear (bool dealloc=false)
int	size () const
const T &	operator[] (int index) const
T &	operator[] (int index)
T	peek () const
void	pop ()
void	insert (T elem)

Private Attributes
vec< T >	buf
int	first
int	end

Detailed Description

template<class T>
class Minisat::Queue< T >

Definition at line 31 of file Queue.h.

Member Typedef Documentation

template<class T>

typedef T Minisat::Queue< T >::Key

Definition at line 37 of file Queue.h.

Constructor & Destructor Documentation

template<class T>

Minisat::Queue< T >::Queue ( )

inline

Definition at line 39 of file Queue.h.

: buf(1), first(0), end(0) {}

Member Function Documentation

template<class T>

void Minisat::Queue< T >::clear ( bool  dealloc = false )

inline

Definition at line 41 of file Queue.h.

{ buf.clear(dealloc); buf.growTo(1); first = end = 0; }

Here is the caller graph for this function:

template<class T>

void Minisat::Queue< T >::insert ( T  elem )

inline

Definition at line 49 of file Queue.h.

                        {   // INVARIANT: buf[end] is always unused
        buf[end++] = elem;
        if (end == buf.size()) end = 0;
        if (first == end){  // Resize:
            vec<T>  tmp((buf.size()*3 + 1) >> 1);
            //**/printf("queue alloc: %d elems (%.1f MB)\n", tmp.size(), tmp.size() * sizeof(T) / 1000000.0);
            int     i = 0;
            for (int j = first; j < buf.size(); j++) tmp[i++] = buf[j];
            for (int j = 0    ; j < end       ; j++) tmp[i++] = buf[j];
            first = 0;
            end   = buf.size();
            tmp.moveTo(buf);
        }
    }

Here is the caller graph for this function:

template<class T>

const T& Minisat::Queue< T >::operator[] ( int  index ) const

inline

Definition at line 44 of file Queue.h.

{ assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }

template<class T>

T& Minisat::Queue< T >::operator[] ( int  index )

inline

Definition at line 45 of file Queue.h.

{ assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }

template<class T>

T Minisat::Queue< T >::peek ( ) const

inline

Definition at line 47 of file Queue.h.

{ assert(first != end); return buf[first]; }

Here is the caller graph for this function:

template<class T>

void Minisat::Queue< T >::pop ( )

inline

Definition at line 48 of file Queue.h.

{ assert(first != end); first++; if (first == buf.size()) first = 0; }

Here is the caller graph for this function:

template<class T>

int Minisat::Queue< T >::size ( void  ) const

inline

Definition at line 42 of file Queue.h.

{ return (end >= first) ? end - first : end - first + buf.size(); }

Here is the caller graph for this function:

Field Documentation

template<class T>

vec<T> Minisat::Queue< T >::buf

private

Definition at line 32 of file Queue.h.

template<class T>

int Minisat::Queue< T >::end

private

Definition at line 34 of file Queue.h.

template<class T>

int Minisat::Queue< T >::first

private

Definition at line 33 of file Queue.h.

---

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

• Queue.h