Data.RingBuffer.SeqBuffer

A RingBuffer based on Seq. Asymptotic behavior is quite good in all cases, but constant factors are very high.

Documentation

data SeqBuffer a

Instances

Eq a => Eq (SeqBuffer a)

Ord a => Ord (SeqBuffer a)

Show a => Show (SeqBuffer a)

RingBuffer (SeqBuffer a)

Initializable (SeqBuffer a)

class RingBuffer c where

The RingBuffer interface.

Instances must define length, push, and '(!)'. Instances may define slice for better performance.

Methods

length :: c -> Int

push :: c -> El c -> c

(!) :: c -> Int -> El c

slice :: c -> Int -> Int -> [El c]

Instances

RingBuffer T30

RingBuffer T29

RingBuffer T28

RingBuffer T27

RingBuffer T26

RingBuffer T25

RingBuffer T24

RingBuffer T23

RingBuffer T22

RingBuffer T21

RingBuffer T20

RingBuffer T19

RingBuffer T18

RingBuffer T17

RingBuffer T16

RingBuffer T15

RingBuffer T14

RingBuffer T13

RingBuffer T12

RingBuffer T11

RingBuffer T10

RingBuffer T9

RingBuffer T8

RingBuffer T7

RingBuffer T6

RingBuffer T5

RingBuffer T4

RingBuffer T3

RingBuffer T2

RingBuffer T1

Unbox el => RingBuffer (Vector el)

RingBuffer (MapBuffer el)

RingBuffer (SeqBuffer a)

Unbox a => RingBuffer (Chord a)

Unbox a => RingBuffer (ComboBuffer a)

RingBuffer (TVec32 a)

Unbox el => RingBuffer (VBuffer el)

new :: Num a => Int -> SeqBuffer a

Create a new SeqBuffer, initialized to all 0's, of the given size