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)

Methods

next :: Mirror a -> Maybe (Mirror a)

previous :: Mirror a -> Maybe (Mirror a)

first :: Mirror a -> Mirror a

final :: Mirror a -> Mirror a

position :: Mirror a -> Int

Iterator (ListIterator a)

Methods

next :: ListIterator a -> Maybe (ListIterator a)

previous :: ListIterator a -> Maybe (ListIterator a)

first :: ListIterator a -> ListIterator a

final :: ListIterator a -> ListIterator a

position :: ListIterator a -> Int

Navigator a => Iterator (Leafs a)

Methods

next :: Leafs a -> Maybe (Leafs a)

previous :: Leafs a -> Maybe (Leafs a)

first :: Leafs a -> Leafs a

final :: Leafs a -> Leafs a

position :: Leafs a -> Int

Navigator a => Iterator (Horizontal a)

Methods

next :: Horizontal a -> Maybe (Horizontal a)

previous :: Horizontal a -> Maybe (Horizontal a)

first :: Horizontal a -> Horizontal a

final :: Horizontal a -> Horizontal a

position :: Horizontal a -> Int

Navigator a => Iterator (LevelOrder a)

Methods

next :: LevelOrder a -> Maybe (LevelOrder a)

previous :: LevelOrder a -> Maybe (LevelOrder a)

first :: LevelOrder a -> LevelOrder a

final :: LevelOrder a -> LevelOrder a

position :: LevelOrder a -> Int

Navigator a => Iterator (PostOrder a)

Methods

next :: PostOrder a -> Maybe (PostOrder a)

previous :: PostOrder a -> Maybe (PostOrder a)

first :: PostOrder a -> PostOrder a

final :: PostOrder a -> PostOrder a

position :: PostOrder a -> Int

Navigator a => Iterator (PreOrder a)

Methods

next :: PreOrder a -> Maybe (PreOrder a)

previous :: PreOrder a -> Maybe (PreOrder a)

first :: PreOrder a -> PreOrder a

final :: PreOrder a -> PreOrder a

position :: PreOrder a -> Int

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

Methods

update :: ListIterator a -> (a, a -> ListIterator a)

Eq a => Eq (ListIterator a)

Methods

(==) :: ListIterator a -> ListIterator a -> Bool

(/=) :: ListIterator a -> ListIterator a -> Bool

Show a => Show (ListIterator a)

Methods

showsPrec :: Int -> ListIterator a -> ShowS

show :: ListIterator a -> String

showList :: [ListIterator a] -> ShowS

Arbitrary a => Arbitrary (ListIterator a)

Methods

arbitrary :: Gen (ListIterator a)

shrink :: ListIterator a -> [ListIterator a]

Focus (ListIterator a)

Associated Types

type Unfocus (ListIterator a) :: *

Methods

focus :: Unfocus (ListIterator a) -> ListIterator a

focusM :: Unfocus (ListIterator a) -> Maybe (ListIterator a)

unfocus :: ListIterator a -> Unfocus (ListIterator a)

Iterator (ListIterator a)

Methods

next :: ListIterator a -> Maybe (ListIterator a)

previous :: ListIterator a -> Maybe (ListIterator a)

first :: ListIterator a -> ListIterator a

final :: ListIterator a -> ListIterator a

position :: ListIterator a -> Int

type Unfocus (ListIterator a)

type Unfocus (ListIterator a) = [a]