Data.Carousel

Documentation

data Carousel α

Instances

Functor Carousel

Foldable Carousel

Traversable Carousel

Eq α => Eq (Carousel α)

Show α => Show (Carousel α)

empty :: Carousel α

The empty carousel.

cursor :: Traversal' (Carousel α) α

There is guaranteed to be a cursor so long as the carousel is non-empty.

moveLeft :: Carousel α -> Carousel α

The carousel may be rotated to the left; this operation is written so as to always guarantee the presence of a cursor in a non-empty carousel.

moveRight :: Carousel α -> Carousel α

The carousel may be rotated to the right; this operation is written so as to always guarantee the presence of a cursor in a non-empty carousel.

dropCursor :: Carousel α -> Carousel α

You can delete the cursor from the carousel; the items to its right will move one over to the left.

nub :: Eq α => Carousel α -> Carousel α

Remove all duplicate elements from the carousel. (TODO: this is inefficient)

append :: [α] -> Carousel α -> Carousel α

Append a list of elements to the right side of the carousel.

clSequence :: Iso (Carousel α) (Carousel β) (Seq α) (Seq β)

clList :: Iso (Carousel α) (Carousel β) [α] [β]