List module:Data

Operations on lists.

WARNING

This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any way whatsoever and without any warning between minor versions of this package. Authors importing this module are expected to track development closely.

Description

Extra list functions In separate module to aid testing.
NOTE It is recommended to start using Data.Conduit.Combinators instead of this module. Higher-level functions to interact with the elements of a stream. Most of these are based on list functions. Note that these functions all deal with individual elements of a stream as a sort of "black box", where there is no introspection of the contained elements. Values such as ByteString and Text will likely need to be treated specially to deal with their contents properly (Word8 and Char, respectively). See the Data.Conduit.Binary and Data.Conduit.Text modules in the conduit-extra package.
Heterogeneous list. Represented in a configuration file as an opening square bracket "[", followed by a comma-separated series of values, ending with a closing square bracket "]".
Exports showbListWith, showtListWith, and showtlListWith, and TextShow instances for lists.
Lists. See also Fcf.Class.Foldable for additional functions.
This module defines a list over two parameters. The first is a fixed type-level function k -> * for some kind k, and the second is a list of types with kind k that provide the indices for the values in the list. This type is closely related to the Assignment type in Data.Parameterized.Context.

Motivating example - the List type

For this example, we need the following extensions:
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeOperators #-}
We also require the following imports:
import Data.Parameterized
import Data.Parameterized.List
import GHC.TypeLits
Suppose we have a bitvector type:
data BitVector (w :: Nat) :: * where
BV :: NatRepr w -> Integer -> BitVector w
This type contains a NatRepr, a value-level representative of the vector width, and an Integer, containing the actual value of the bitvector. We can create values of this type as follows:
BV (knownNat @8) 0xAB
We can also create a smart constructor to handle the NatRepr automatically, when the width is known from the type context:
bitVector :: KnownNat w => Integer -> BitVector w
bitVector x = BV knownNat x
Note that this does not check that the value can be represented in the given number of bits; that is not important for this example. If we wish to construct a list of BitVectors of a particular length, we can do:
[bitVector 0xAB, bitVector 0xFF, bitVector 0] :: BitVector 8
However, what if we wish to construct a list of BitVectors of different lengths? We could try:
[bitVector 0xAB :: BitVector 8, bitVector 0x1234 :: BitVector 16]
However, this gives us an error:
<interactive>:3:33: error:
• Couldn't match type ‘16’ with ‘8’
Expected type: BitVector 8
Actual type: BitVector 16
• In the expression: bitVector 0x1234 :: BitVector 16
In the expression:
[bitVector 0xAB :: BitVector 8, bitVector 0x1234 :: BitVector 16]
In an equation for ‘it’:
it
= [bitVector 0xAB :: BitVector 8, bitVector 0x1234 :: BitVector 16]
A vanilla Haskell list cannot contain two elements of different types, and even though the two elements here are both BitVectors, they do not have the same type! One solution is to use the Some type:
[Some (bitVector 0xAB :: BitVector 8), Some (bitVector 0x1234 :: BitVector 16)]
The type of the above expression is [Some BitVector], which may be perfectly acceptable. However, there is nothing in this type that tells us what the widths of the bitvectors are, or what the length of the overall list is. If we want to actually track that information on the type level, we can use the List type from this module.
(bitVector 0xAB :: BitVector 8) :< (bitVector 0x1234 :: BitVector 16) :< Nil
The type of the above expression is List BitVector '[8, 16] -- That is, a two-element list of BitVectors, where the first element has width 8 and the second has width 16.

Summary

In general, if we have a type constructor Foo of kind k -> * (in our example, Foo is just BitVector, and we want to create a list of Foos where the parameter k varies, and we wish to keep track of what each value of k is inside the list at compile time, we can use the List type for this purpose.
Parameterized list of elements.
Newtype wrapper to parse and produce a comma separated list of values.
A collection of list utilities, useful when working with symbolic lists. To the extent possible, the functions in this module follow those of Data.List so importing qualified is the recommended workflow. Also, it is recommended you use the OverloadedLists extension to allow literal lists to be used as symbolic-lists.
A list diff.
Operations on lists.
A class for list types. Every list has an underlying monad.
Bidirectional version of Data.List and other operations over lists.