Module adseq.implementations

Sub-modules

adseq.implementations.base

adseq.implementations.bgpq1

adseq.implementations.binary_heap

Assumes sorted inputs, ie homogeneous delays

adseq.implementations.bitarray32

adseq.implementations.do_nothing

adseq.implementations.fifo_ring

Assumes sorted inputs, ie homogeneous delays

adseq.implementations.lossy_ring

adseq.implementations.ring

adseq.implementations.single_spike

adseq.implementations.single_spike_keep

adseq.implementations.sorted_array

Priority queue. Every insert is a full memory move. Better would be circular but then finding the insertion point is a bit harder