Documentation

Create singleton strict ByteString.

>>> one 97 :: ByteString
"a"

law> length (one x) ≡ 1

Create singleton lazy ByteString.

>>> one 97 :: LByteString
"a"

law> length (one x) ≡ 1

Create singleton ShortByteString.

>>> one 97 :: ShortByteString
"a"

law> length (one x) ≡ 1

Create singleton IntSet.

>>> one 42 :: IntSet
fromList [42]

law> size (one x) ≡ 1

Create singleton strict Text.

>>> one 'a' :: Text
"a"

law> length (one x) ≡ 1

Create singleton lazy Text.

>>> one 'a' :: LText
"a"

law> length (one x) ≡ 1

Allows to create singleton NonEmpty list. You might prefer function with name one instead of pure or (:|[]).

>>> one 42 :: NonEmpty Int
42 :| []

law> length (one @(NonEmpty a) x) ≡ 1

Create singleton IntMap from key-value pair.

>>> one (3, "foo") :: IntMap Text
fromList [(3,"foo")]

law> length (one @(IntMap a) x) ≡ 1

Create singleton Seq.

>>> one 42 :: Seq Int
fromList [42]

law> length (one @(Seq a) x) ≡ 1

Create singleton Set.

>>> one 42 :: Set Int
fromList [42]

law> length (one @(Set a) x) ≡ 1

Create singleton HashSet.

>>> one 42 :: HashSet Int
fromList [42]

law> length (one @(HashSet a) x) ≡ 1

Allows to create a singleton list. You might prefer function with name one instead of pure or (:[]).

>>> one 42 :: [Int]
[42]

law> length (one @[a] x) ≡ 1

Create singleton Map from key-value pair.

>>> one (3, "foo") :: Map Int Text
fromList [(3,"foo")]

law> length (one @(Map k v) (k, v)) ≡ 1

Create singleton HashMap from key-value pair.

>>> one (3, "foo") :: HashMap Int Text
fromList [(3,"foo")]

law> length (one @(HashMap k v) (k, v)) ≡ 1