CoreNEURON
Public Types | Public Member Functions | Public Attributes | Private Member Functions | Private Attributes | List of all members
coreneuron::TQueue< C > Class Template Reference

Detailed Description

template<container C = spltree>
class coreneuron::TQueue< C >

Definition at line 123 of file tqueue.hpp.

#include <tqueue.hpp>

Public Types

enum  qtype { enq = 0, spike, ite, deq }
 Types of queuing statistics. More...
 

Public Member Functions

 TQueue ()
 
 ~TQueue ()
 
TQItem * least ()
 
TQItem * insert (double t, DiscreteEvent *data)
 
TQItem * enqueue_bin (double t, DiscreteEvent *data)
 
TQItem * dequeue_bin ()
 
void shift_bin (double _t_)
 
TQItem * top ()
 
TQItem * atomic_dq (double til)
 
void remove (TQItem *)
 
void move (TQItem *, double tnew)
 
void move (TQItem *i, double tnew)
 Splay tree priority queue implementation. More...
 
void move (TQItem *i, double tnew)
 STL priority queue implementation. More...
 
TQItem * insert (double tt, DiscreteEvent *d)
 Splay tree priority queue implementation. More...
 
TQItem * insert (double tt, DiscreteEvent *d)
 STL priority queue implementation. More...
 
void remove (TQItem *q)
 Splay tree priority queue implementation. More...
 
void remove (TQItem *q)
 STL priority queue implementation. More...
 
TQItem * atomic_dq (double tt)
 Splay tree priority queue implementation. More...
 
TQItem * atomic_dq (double tt)
 STL priority queue implementation. More...
 

Public Attributes

int nshift_
 
std::priority_queue< TQPair, std::vector< TQPair >, less_time > pq_que_
 Priority queue of vectors for queuing the events. More...
 
BinQ * binq_
 

Private Member Functions

double least_t_nolock ()
 
void move_least_nolock (double tnew)
 
TQPair make_TQPair (TQItem *p)
 
void move_least_nolock (double tnew)
 Splay tree priority queue implementation. More...
 
void move_least_nolock (double tnew)
 STL priority queue implementation. More...
 

Private Attributes

SPTREE * sptree_
 
TQItem * least_
 

Member Enumeration Documentation

◆ qtype

template<container C = spltree>
enum coreneuron::TQueue::qtype

Types of queuing statistics.

Enumerator
enq 
spike 
ite 
deq 

Definition at line 153 of file tqueue.hpp.

Constructor & Destructor Documentation

◆ TQueue()

template<container C>
coreneuron::TQueue< C >::TQueue

Definition at line 33 of file tqueue.ipp.

◆ ~TQueue()

template<container C>
coreneuron::TQueue< C >::~TQueue

Clear the binq

Clear the splay tree

Clear the priority queue

Definition at line 42 of file tqueue.ipp.

Member Function Documentation

◆ atomic_dq() [1/3]

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::atomic_dq ( double  til)
inline

◆ atomic_dq() [2/3]

TQItem * coreneuron::TQueue< spltree >::atomic_dq ( double  tt)
inline

Splay tree priority queue implementation.

Definition at line 232 of file tqueue.ipp.

◆ atomic_dq() [3/3]

TQItem * coreneuron::TQueue< pq_que >::atomic_dq ( double  tt)
inline

STL priority queue implementation.

This while loop is to delete events whose times have been moved with the ::move function, but in fact events were left in the queue since the only function available is pop

Definition at line 247 of file tqueue.ipp.

◆ dequeue_bin()

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::dequeue_bin ( )
inline

Definition at line 133 of file tqueue.hpp.

◆ enqueue_bin()

template<container C>
TQItem * coreneuron::TQueue< C >::enqueue_bin ( double  t,
DiscreteEvent *  data 
)
inline

Definition at line 71 of file tqueue.ipp.

◆ insert() [1/3]

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::insert ( double  t,
DiscreteEvent *  data 
)
inline

◆ insert() [2/3]

TQItem * coreneuron::TQueue< spltree >::insert ( double  tt,
DiscreteEvent *  d 
)
inline

Splay tree priority queue implementation.

Probably storing both time and event which has the time is redundant, but the event is then returned to the upper level call stack function. If we were to eliminate i->t_ and i->cnt_ fields, we need to make sure we are not braking anything.

Definition at line 152 of file tqueue.ipp.

◆ insert() [3/3]

TQItem * coreneuron::TQueue< pq_que >::insert ( double  tt,
DiscreteEvent *  d 
)
inline

STL priority queue implementation.

Probably storing both time and event which has the time is redundant, but the event is then returned to the upper level call stack function. If we were to eliminate i->t_ and i->cnt_ fields, we need to make sure we are not braking anything.

Definition at line 175 of file tqueue.ipp.

◆ least()

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::least ( )
inline

Definition at line 128 of file tqueue.hpp.

◆ least_t_nolock()

template<container C = spltree>
double coreneuron::TQueue< C >::least_t_nolock ( )
inlineprivate

Definition at line 156 of file tqueue.hpp.

◆ make_TQPair()

template<container C = spltree>
TQPair coreneuron::TQueue< C >::make_TQPair ( TQItem *  p)
inlineprivate

Definition at line 171 of file tqueue.hpp.

◆ move() [1/3]

template<container C = spltree>
void coreneuron::TQueue< C >::move ( TQItem *  ,
double  tnew 
)
inline

◆ move() [2/3]

void coreneuron::TQueue< spltree >::move ( TQItem *  i,
double  tnew 
)
inline

Splay tree priority queue implementation.

Definition at line 112 of file tqueue.ipp.

◆ move() [3/3]

void coreneuron::TQueue< pq_que >::move ( TQItem *  i,
double  tnew 
)
inline

STL priority queue implementation.

Definition at line 129 of file tqueue.ipp.

◆ move_least_nolock() [1/3]

void coreneuron::TQueue< spltree >::move_least_nolock ( double  tnew)
inlineprivate

Splay tree priority queue implementation.

Definition at line 81 of file tqueue.ipp.

◆ move_least_nolock() [2/3]

void coreneuron::TQueue< pq_que >::move_least_nolock ( double  tnew)
inlineprivate

STL priority queue implementation.

Definition at line 96 of file tqueue.ipp.

◆ move_least_nolock() [3/3]

template<container C = spltree>
void coreneuron::TQueue< C >::move_least_nolock ( double  tnew)
private

◆ remove() [1/3]

template<container C = spltree>
void coreneuron::TQueue< C >::remove ( TQItem *  )
inline

◆ remove() [2/3]

void coreneuron::TQueue< spltree >::remove ( TQItem *  q)
inline

Splay tree priority queue implementation.

Definition at line 198 of file tqueue.ipp.

◆ remove() [3/3]

void coreneuron::TQueue< pq_que >::remove ( TQItem *  q)
inline

STL priority queue implementation.

Definition at line 215 of file tqueue.ipp.

◆ shift_bin()

template<container C = spltree>
void coreneuron::TQueue< C >::shift_bin ( double  _t_)
inline

Definition at line 136 of file tqueue.hpp.

◆ top()

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::top ( )
inline

Definition at line 140 of file tqueue.hpp.

Member Data Documentation

◆ binq_

template<container C = spltree>
BinQ* coreneuron::TQueue< C >::binq_

Definition at line 167 of file tqueue.hpp.

◆ least_

template<container C = spltree>
TQItem* coreneuron::TQueue< C >::least_
private

Definition at line 170 of file tqueue.hpp.

◆ nshift_

template<container C = spltree>
int coreneuron::TQueue< C >::nshift_

Definition at line 147 of file tqueue.hpp.

◆ pq_que_

template<container C = spltree>
std::priority_queue<TQPair, std::vector<TQPair>, less_time> coreneuron::TQueue< C >::pq_que_

Priority queue of vectors for queuing the events.

enqueuing for move() and move_least_nolock() is not implemented

Definition at line 151 of file tqueue.hpp.

◆ sptree_

template<container C = spltree>
SPTREE* coreneuron::TQueue< C >::sptree_
private

Definition at line 164 of file tqueue.hpp.

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