#include <bbtqueue.h>
|
| | TQueue () |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | insert (double t, void *data_) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | insert1 (double t, TQItem *) |
| |
| void | remove1 (TQItem *) |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
| | TQueue () |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | insert (double t, void *data_) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
| | TQueue () |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | insert (double t, void *data_) |
| |
| TQItem * | insert_fifo (double t, void *data_) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | spike_stat (double *) |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
| double | q2least_t () |
| |
| | TQueue (TQItemPool *, int mkmut=0) |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | atomic_dq (double til) |
| |
| TQItem * | insert (double t, void *data) |
| |
| TQItem * | enqueue_bin (double t, void *data) |
| |
| TQItem * | dequeue_bin () |
| |
| void | shift_bin (double t) |
| |
| double | tbin () |
| |
| TQItem * | top () |
| |
| void | release (TQItem *) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | spike_stat (double *) |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
| void | deleteitem (TQItem *) |
| |
| BinQ * | binq () |
| |
| | TQueue () |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | insert (double t, void *data_) |
| |
| TQItem * | insert_fifo (double t, void *data_) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | spike_stat (double *) |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
| | TQueue () |
| |
| virtual | ~TQueue () |
| |
| TQItem * | least () |
| |
| double | least_t () |
| |
| TQItem * | insert (double t, void *data_) |
| |
| TQItem * | find (double t) |
| |
| void | remove (TQItem *) |
| |
| void | move (TQItem *, double tnew) |
| |
| void | move_least (double tnew) |
| |
| void | print () |
| |
| void | check (const char *errmess) |
| |
| void | statistics () |
| |
| void | spike_stat (double *) |
| |
| void | forall_callback (void(*)(const TQItem *, int)) |
| |
Definition at line 30 of file bbtqueue.h.
◆ TQueue() [1/6]
◆ ~TQueue() [1/6]
◆ TQueue() [2/6]
◆ ~TQueue() [2/6]
| virtual TQueue::~TQueue |
( |
| ) |
|
|
virtual |
◆ TQueue() [3/6]
◆ ~TQueue() [3/6]
| virtual TQueue::~TQueue |
( |
| ) |
|
|
virtual |
◆ TQueue() [4/6]
| TQueue::TQueue |
( |
TQItemPool * |
tp, |
|
|
int |
mkmut = 0 |
|
) |
| |
◆ ~TQueue() [4/6]
| virtual TQueue::~TQueue |
( |
| ) |
|
|
virtual |
◆ TQueue() [5/6]
◆ ~TQueue() [5/6]
| virtual TQueue::~TQueue |
( |
| ) |
|
|
virtual |
◆ TQueue() [6/6]
◆ ~TQueue() [6/6]
| virtual TQueue::~TQueue |
( |
| ) |
|
|
virtual |
◆ atomic_dq()
| TQItem * TQueue::atomic_dq |
( |
double |
til | ) |
|
◆ binq()
◆ check() [1/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ check() [2/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ check() [3/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ check() [4/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ check() [5/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ check() [6/6]
| void TQueue::check |
( |
const char * |
errmess | ) |
|
◆ deleteFixup()
◆ deleteitem()
◆ deleteNode()
◆ dequeue_bin()
| TQItem* TQueue::dequeue_bin |
( |
| ) |
|
|
inline |
◆ enqueue_bin()
| TQItem * TQueue::enqueue_bin |
( |
double |
t, |
|
|
void * |
data |
|
) |
| |
◆ find() [1/6]
| TQItem * TQueue::find |
( |
double |
t | ) |
|
◆ find() [2/6]
| TQItem* TQueue::find |
( |
double |
t | ) |
|
◆ find() [3/6]
| TQItem* TQueue::find |
( |
double |
t | ) |
|
◆ find() [4/6]
| TQItem* TQueue::find |
( |
double |
t | ) |
|
◆ find() [5/6]
| TQItem* TQueue::find |
( |
double |
t | ) |
|
◆ find() [6/6]
| TQItem* TQueue::find |
( |
double |
t | ) |
|
◆ forall_callback() [1/6]
◆ forall_callback() [2/6]
◆ forall_callback() [3/6]
◆ forall_callback() [4/6]
◆ forall_callback() [5/6]
◆ forall_callback() [6/6]
◆ insert() [1/6]
◆ insert() [2/6]
| TQItem * TQueue::insert |
( |
double |
t, |
|
|
void * |
data_ |
|
) |
| |
◆ insert() [3/6]
◆ insert() [4/6]
◆ insert() [5/6]
◆ insert() [6/6]
◆ insert1()
◆ insert_fifo() [1/2]
| TQItem * TQueue::insert_fifo |
( |
double |
t, |
|
|
void * |
data_ |
|
) |
| |
◆ insert_fifo() [2/2]
| TQItem* TQueue::insert_fifo |
( |
double |
t, |
|
|
void * |
data_ |
|
) |
| |
◆ insertFixup()
◆ insertNode()
◆ least() [1/6]
◆ least() [2/6]
◆ least() [3/6]
◆ least() [4/6]
◆ least() [5/6]
◆ least() [6/6]
◆ least_t() [1/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t() [2/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t() [3/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t() [4/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t() [5/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t() [6/6]
| double TQueue::least_t |
( |
| ) |
|
◆ least_t_nolock()
| double TQueue::least_t_nolock |
( |
| ) |
|
|
inlineprivate |
◆ move() [1/6]
◆ move() [2/6]
◆ move() [3/6]
◆ move() [4/6]
◆ move() [5/6]
◆ move() [6/6]
◆ move_least() [1/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least() [2/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least() [3/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least() [4/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least() [5/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least() [6/6]
| void TQueue::move_least |
( |
double |
tnew | ) |
|
◆ move_least_nolock()
| void TQueue::move_least_nolock |
( |
double |
tnew | ) |
|
|
private |
◆ new_least() [1/2]
| void TQueue::new_least |
( |
| ) |
|
|
private |
◆ new_least() [2/2]
| void TQueue::new_least |
( |
| ) |
|
|
private |
◆ print() [1/6]
◆ print() [2/6]
◆ print() [3/6]
◆ print() [4/6]
◆ print() [5/6]
◆ print() [6/6]
◆ q2least_t()
| double TQueue::q2least_t |
( |
| ) |
|
◆ release()
◆ remove() [1/6]
◆ remove() [2/6]
◆ remove() [3/6]
◆ remove() [4/6]
◆ remove() [5/6]
◆ remove() [6/6]
◆ remove1()
◆ reverse()
◆ rotateLeft()
◆ rotateRight()
◆ shift_bin()
| void TQueue::shift_bin |
( |
double |
t | ) |
|
|
inline |
◆ spike_stat() [1/4]
| void TQueue::spike_stat |
( |
double * |
d | ) |
|
◆ spike_stat() [2/4]
| void TQueue::spike_stat |
( |
double * |
| ) |
|
◆ spike_stat() [3/4]
| void TQueue::spike_stat |
( |
double * |
| ) |
|
◆ spike_stat() [4/4]
| void TQueue::spike_stat |
( |
double * |
| ) |
|
◆ statistics() [1/6]
| void TQueue::statistics |
( |
| ) |
|
◆ statistics() [2/6]
| void TQueue::statistics |
( |
| ) |
|
◆ statistics() [3/6]
| void TQueue::statistics |
( |
| ) |
|
◆ statistics() [4/6]
| void TQueue::statistics |
( |
| ) |
|
◆ statistics() [5/6]
| void TQueue::statistics |
( |
| ) |
|
◆ statistics() [6/6]
| void TQueue::statistics |
( |
| ) |
|
◆ tbin()
◆ top()
◆ binq_
◆ fifo_
◆ least_
◆ nbal [1/2]
| unsigned long TQueue::nbal |
|
private |
◆ nbal [2/2]
| MUTDEC unsigned long TQueue::nbal |
|
private |
◆ ncmplxrem [1/2]
| unsigned long TQueue::ncmplxrem |
|
private |
◆ ncmplxrem [2/2]
| MUTDEC unsigned long TQueue::ncmplxrem |
|
private |
◆ ncompare
| unsigned long TQueue::ncompare |
|
private |
◆ nenq1
| unsigned long TQueue::nenq1 |
|
private |
◆ nenq2
| unsigned long TQueue::nenq2 |
|
private |
◆ nfastmove
| unsigned long TQueue::nfastmove |
|
private |
◆ nfind
| unsigned long TQueue::nfind |
|
private |
◆ nfindsrch
| unsigned long TQueue::nfindsrch |
|
private |
◆ ninsert [1/2]
| unsigned long TQueue::ninsert |
|
private |
◆ ninsert [2/2]
| MUTDEC unsigned long TQueue::ninsert |
|
private |
◆ nleast [1/2]
| unsigned long TQueue::nleast |
|
private |
◆ nleast [2/2]
| MUTDEC unsigned long TQueue::nleast |
|
private |
◆ nleastsrch
| unsigned long TQueue::nleastsrch |
|
private |
◆ nmove
| unsigned long TQueue::nmove |
|
private |
◆ nrem [1/2]
| unsigned long TQueue::nrem |
|
private |
◆ nrem [2/2]
| MUTDEC unsigned long TQueue::nrem |
|
private |
◆ nshift_
◆ root_
◆ sptree2_
◆ sptree_ [1/2]
◆ sptree_ [2/2]
◆ tpool_
| TQItemPool* TQueue::tpool_ |
|
private |
The documentation for this class was generated from the following files:
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/bbtqueue.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/rbtqueue.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/spt2queue.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptbinq.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptfifoq.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptqueue.h
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/bbtqueue.cpp
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/rbtqueue.cpp
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/spt2queue.cpp
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptbinq.cpp
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptfifoq.cpp
- /home/docs/checkouts/readthedocs.org/user_builds/nrn/checkouts/8.2.6/src/nrncvode/sptqueue.cpp