Ideas.Common.Traversal.Iterator

Iterator type class

class Iterator a where

Minimal complete definition

next, previous

Methods

next :: a -> Maybe a

previous :: a -> Maybe a

first :: a -> a

final :: a -> a

position :: a -> Int

Instances

Iterator a => Iterator (Mirror a)

Iterator (ListIterator a)

Navigator a => Iterator (Leafs a)

Navigator a => Iterator (Horizontal a)

Navigator a => Iterator (LevelOrder a)

Navigator a => Iterator (PostOrder a)

Navigator a => Iterator (PreOrder a)

isFirst :: Iterator a => a -> Bool

isFinal :: Iterator a => a -> Bool

hasNext :: Iterator a => a -> Bool

hasPrevious :: Iterator a => a -> Bool

searchForward :: Iterator a => (a -> Bool) -> a -> Maybe a

searchBackward :: Iterator a => (a -> Bool) -> a -> Maybe a

searchNext :: Iterator a => (a -> Bool) -> a -> Maybe a

searchPrevious :: Iterator a => (a -> Bool) -> a -> Maybe a

searchWith :: (a -> Maybe a) -> (a -> Bool) -> a -> Maybe a

List iterator

data ListIterator a

Instances

Update ListIterator

Eq a => Eq (ListIterator a)

Show a => Show (ListIterator a)

Arbitrary a => Arbitrary (ListIterator a)

Focus (ListIterator a)

Iterator (ListIterator a)

type Unfocus (ListIterator a) = [a]