Data.List.Infinite

data Step a

Constructors

• Cons a (List a)

Instances

• (Eq a) => Eq (Step a)
• (Ord a) => Ord (Step a)

newtype List a

Constructors

• List (Lazy (Step a))

Instances

• (Eq a) => Eq (List a)
• (Ord a) => Ord (List a)
• Lazy (List a)
• Functor List
• Semigroup (List a)
• Apply List
• Applicative List

runList :: forall a. List a -> Lazy (Step a)

step :: forall a. List a -> Step a

fromStep :: forall a. Step a -> List a

index :: forall a. List a -> Int -> a

Operator alias for Data.List.Infinite.index (left-associative / precedence 8)

cons :: forall a. a -> List a -> List a

Operator alias for Data.List.Infinite.cons (right-associative / precedence 6)

insertBy :: forall a. (a -> a -> Ordering) -> a -> List a -> List a

insert :: forall a. Ord a => a -> List a -> List a

iterate :: forall a. (a -> a) -> a -> List a

repeat :: forall a. a -> List a

uncons :: forall a. List a -> { head :: a, tail :: List a }

head :: forall a. List a -> a

tail :: forall a. List a -> List a

filter :: forall a. (a -> Boolean) -> List a -> List a

insertAt :: forall a. Int -> a -> List a -> List a

deleteAt :: forall a. Int -> List a -> List a

updateAt :: forall a. Int -> a -> List a -> List a

alterAt :: forall a. Int -> (a -> Maybe a) -> List a -> List a

modifyAt :: forall a. Int -> (a -> a) -> List a -> List a

merge :: forall a. List a -> List a -> List a

drop :: forall a. Int -> List a -> List a

dropWhile :: forall a. (a -> Boolean) -> List a -> List a

deleteBy :: forall a. (a -> a -> Boolean) -> a -> List a -> List a

delete :: forall a. Eq a => a -> List a -> List a

zipWith :: forall c b a. (a -> b -> c) -> List a -> List b -> List c

zip :: forall b a. List a -> List b -> List (Tuple a b)