Overloaded.Lists

Another way to desugar overloaded list literals. See Nil and Cons.

An explicit list expression, e.g. [1, True] is desugared to

cons 1 (cons True nil)

Enabled with:

{-# OPTIONS -fplugin=Overloaded -fplugin-opt=Overloaded:Lists #-}

Documentation

class Nil a where

Class for nil, []

See test-suite for ways to define instances for Map. There are at-least two-ways.

Methods

nil :: a

Instances

Nil IntSet

Since: 0.1.3

Defined in Overloaded.Lists

Methods

nil :: IntSet

Nil [a]

Defined in Overloaded.Lists

Methods

nil :: [a]

Nil (IntMap v)

Since: 0.2

Defined in Overloaded.Lists

Methods

nil :: IntMap v

Nil (Seq a)

Since: 0.2

Defined in Overloaded.Lists

Methods

nil :: Seq a

Nil (Set a)

Since: 0.1.3

Defined in Overloaded.Lists

Methods

nil :: Set a

Nil (RAList a)

Defined in Overloaded.Lists

Methods

nil :: RAList a

Nil (Map k v)

Since: 0.2

Defined in Overloaded.Lists

Methods

nil :: Map k v

b ~ BZ => Nil (RAVec b a)

Defined in Overloaded.Lists

Methods

nil :: RAVec b a

n ~ Z => Nil (Vec n a)

Defined in Overloaded.Lists

Methods

nil :: Vec n a

xs ~ ([] :: [k]) => Nil (NP f xs)

Defined in Overloaded.Lists

Methods

nil :: NP f xs

xs ~ ([] :: [[k]]) => Nil (POP f xs)

Defined in Overloaded.Lists

Methods

nil :: POP f xs

class Cons x ys zs | zs -> x ys where

Class for Cons :.

Methods

cons :: x -> ys -> zs infixr 5

Instances

Cons Int IntSet IntSet

Since: 0.1.3

Defined in Overloaded.Lists

Methods

cons :: Int -> IntSet -> IntSet

(a ~ b, a ~ c) => Cons a (RAList b) (NERAList c)

Defined in Overloaded.Lists

Methods

cons :: a -> RAList b -> NERAList c

(a ~ b, a ~ c) => Cons a (RAList b) (RAList c)

Defined in Overloaded.Lists

Methods

cons :: a -> RAList b -> RAList c

(a ~ b, b ~ c) => Cons a (Seq b) (Seq c)

Since: 0.2

Defined in Overloaded.Lists

Methods

cons :: a -> Seq b -> Seq c

(Ord a, a ~ b, b ~ c) => Cons a (Set b) (Set c)

Since: 0.1.3

Defined in Overloaded.Lists

Methods

cons :: a -> Set b -> Set c

(a ~ b, b ~ c) => Cons a [b] (NonEmpty c)

Defined in Overloaded.Lists

Methods

cons :: a -> [b] -> NonEmpty c

(a ~ b, b ~ c) => Cons a [b] [c]

Defined in Overloaded.Lists

Methods

cons :: a -> [b] -> [c]

(bp ~ Pred b, b ~ Succ' bp) => Cons a (RAVec bp a) (NERAVec b a)

Defined in Overloaded.Lists

Methods

cons :: a -> RAVec bp a -> NERAVec b a

(b ~ BP bb, bp ~ Pred bb, bb ~ Succ' bp) => Cons a (RAVec bp a) (RAVec b a)

Defined in Overloaded.Lists

Methods

cons :: a -> RAVec bp a -> RAVec b a

(a ~ b, b ~ c, m ~ S n) => Cons a (Vec n b) (Vec m c)

Defined in Overloaded.Lists

Methods

cons :: a -> Vec n b -> Vec m c

(f ~ g, g ~ h, xxs ~ (x ': xs)) => Cons (f x) (NP g xs) (NP h xxs)

Defined in Overloaded.Lists

Methods

cons :: f x -> NP g xs -> NP h xxs

(i ~ Int, a ~ b, b ~ c) => Cons (i, a) (IntMap b) (IntMap c)

Since: 0.2

Defined in Overloaded.Lists

Methods

cons :: (i, a) -> IntMap b -> IntMap c

(Ord k, k ~ k1, k ~ k2, v ~ v1, v ~ v2) => Cons (k, v) (Map k1 v1) (Map k2 v2)

Since: 0.2

Defined in Overloaded.Lists

Methods

cons :: (k, v) -> Map k1 v1 -> Map k2 v2

(f ~ g, g ~ h, xsxss ~ (xs ': xss)) => Cons (NP f xs) (POP g xss) (POP h xsxss)

Defined in Overloaded.Lists

Methods

cons :: NP f xs -> POP g xss -> POP h xsxss

fromList :: (Nil xs, Cons x xs xs) => [x] -> xs

Since: 0.1.3