Gluco2::bqueue< T > Class Template Reference

#include <BoundedQueue.h>

Public Member Functions
	bqueue (void)
void	initSize (int size)
void	push (T x)
T	peek ()
void	pop ()
uint64_t	getsum () const
unsigned int	getavg () const
int	maxSize () const
double	getavgDouble () const
int	isvalid () const
void	growTo (int size)
double	getAvgExp ()
void	fastclear ()
int	size (void)
void	clear (bool dealloc=false)

Detailed Description

template<class T>
class Gluco2::bqueue< T >

Definition at line 35 of file BoundedQueue.h.

Constructor & Destructor Documentation

bqueue()

template<class T>

Gluco2::bqueue< T >::bqueue ( void )

inline

Definition at line 45 of file BoundedQueue.h.

: first(0), last(0), sumofqueue(0), maxsize(0), queuesize(0),expComputed(false) { } 

Member Function Documentation

clear()

template<class T>

void Gluco2::bqueue< T >::clear ( bool dealloc = false )

inline

Definition at line 105 of file BoundedQueue.h.

{ elems.clear(dealloc); first = 0; maxsize=0; queuesize=0;sumofqueue=0;}

fastclear()

template<class T>

void Gluco2::bqueue< T >::fastclear ( )

inline

Definition at line 101 of file BoundedQueue.h.

{first = 0; last = 0; queuesize=0; sumofqueue=0;} // to be called after restarts... Discard the queue

getavg()

template<class T>

unsigned int Gluco2::bqueue< T >::getavg ( ) const

inline

Definition at line 66 of file BoundedQueue.h.

{return (unsigned int)(sumofqueue/((uint64_t)queuesize));}

getavgDouble()

template<class T>

double Gluco2::bqueue< T >::getavgDouble ( ) const

inline

Definition at line 68 of file BoundedQueue.h.

                                {
      double tmp = 0;
      for(int i=0;i<elems.size();i++) {
        tmp+=elems[i];
      }
      return tmp/elems.size();
    }

getAvgExp()

template<class T>

double Gluco2::bqueue< T >::getAvgExp ( )

inline

Definition at line 83 of file BoundedQueue.h.

                       {
      if(expComputed) return value;
      double a=exp;
      value = elems[first];
      for(int i  = first;i<maxsize;i++) {
        value+=a*((double)elems[i]);
        a=a*exp;
      }
      for(int i  = 0;i<last;i++) {
        value+=a*((double)elems[i]);
        a=a*exp;
      }
      value = value*(1-exp)/(1-a);
      expComputed = true;
      return value;
      
 
    }

getsum()

template<class T>

uint64_t Gluco2::bqueue< T >::getsum ( ) const

inline

Definition at line 65 of file BoundedQueue.h.

{return sumofqueue;}

growTo()

template<class T>

void Gluco2::bqueue< T >::growTo ( int size )

inline

Definition at line 77 of file BoundedQueue.h.

                          {
        elems.growTo(size); 
        first=0; maxsize=size; queuesize = 0;last = 0;
        for(int i=0;i<size;i++) elems[i]=0; 
    }

Here is the call graph for this function:

Here is the caller graph for this function:

initSize()

template<class T>

void Gluco2::bqueue< T >::initSize ( int size )

inline

Definition at line 47 of file BoundedQueue.h.

{growTo(size);exp = 2.0/(size+1);} // Init size of bounded size queue

Here is the call graph for this function:

isvalid()

template<class T>

int Gluco2::bqueue< T >::isvalid ( ) const

inline

Definition at line 75 of file BoundedQueue.h.

{return (queuesize==maxsize);}

maxSize()

template<class T>

int Gluco2::bqueue< T >::maxSize ( ) const

inline

Definition at line 67 of file BoundedQueue.h.

{return maxsize;}

peek()

template<class T>

T Gluco2::bqueue< T >::peek ( )

inline

Definition at line 62 of file BoundedQueue.h.

{ assert(queuesize>0); return elems[last]; }

pop()

template<class T>

void Gluco2::bqueue< T >::pop ( )

inline

Definition at line 63 of file BoundedQueue.h.

{sumofqueue-=elems[last]; queuesize--; if ((++last) == maxsize) last = 0;}

push()

template<class T>

void Gluco2::bqueue< T >::push ( T x )

inline

Definition at line 49 of file BoundedQueue.h.

                   {
      expComputed = false;
        if (queuesize==maxsize) {
            assert(last==first); // The queue is full, next value to enter will replace oldest one
            sumofqueue -= elems[last];
            if ((++last) == maxsize) last = 0;
        } else 
            queuesize++;
        sumofqueue += x;
        elems[first] = x;
        if ((++first) == maxsize) {first = 0;last = 0;}
    }

size()

template<class T>

int Gluco2::bqueue< T >::size ( void )

inline

Definition at line 103 of file BoundedQueue.h.

{ return queuesize; }

Here is the caller graph for this function:

---

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

• src/sat/glucose2/BoundedQueue.h