Data.List.NonEmpty

The group function takes a stream and returns a list of streams such that flattening the resulting list is equal to the argument. Moreover, each stream in the resulting list contains only equal elements, and consecutive equal elements of the input end up in the same stream of the output list. For example, in list notation:

>>> group "Mississippi"["M", "i", "ss", "i", "ss", "i", "pp", "i"]

Non-empty (and non-strict) list type.

groupBy operates like group, but uses the provided equality predicate instead of ==.

The inits function takes a stream xs and returns all the finite prefixes of xs, starting with the shortest. The result is NonEmpty because the result always contains the empty list as the first element.

inits [1,2,3] == [] :| [[1], [1,2], [1,2,3]]
inits [1] == [] :| [[1]]
inits [] == [] :| []

insert x xs inserts x into the last position in xs where it is still less than or equal to the next element. In particular, if the list is sorted beforehand, the result will also be sorted.

'intersperse x xs' alternates elements of the list with copies of x.

intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3]

The isPrefixOf function returns True if the first argument is a prefix of the second.

The nub function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name nub means 'essence'.) It is a special case of nubBy, which allows the programmer to supply their own inequality test.

The nubBy function behaves just like nub, except it uses a user-supplied equality predicate instead of the overloaded == function.

The partition function takes a predicate p and a stream xs, and returns a pair of lists. The first list corresponds to the elements of xs for which p holds; the second corresponds to the elements of xs for which p does not hold.

'partition' p xs = ('filter' p xs, 'filter' (not . p) xs)

The permutations function returns the list of all permutations of the argument.

Construct a NonEmpty list from a single element.

Sort a stream.

sortBy for NonEmpty, behaves the same as sortBy

Sort a NonEmpty on a user-supplied projection of its elements. See sortOn for more detailed information.

Examples

>>> sortOn fst $ (2, "world") :| [(4, "!"), (1, "Hello")](1,"Hello") :| [(2,"world"),(4,"!")]

>>> sortOn length $ "jim" :| ["creed", "pam", "michael", "dwight", "kevin"]"jim" :| ["pam","creed","kevin","dwight","michael"]

Performance notes

This function minimises the projections performed, by materialising the projections in an intermediate list.

For trivial projections, you should prefer using sortBy with comparing, for example:

>>> sortBy (comparing fst) $ (3, 1) :| [(2, 2), (1, 3)](1,3) :| [(2,2),(3,1)]

Or, for the exact same API as sortOn, you can use `sortBy . comparing`:

>>> (sortBy . comparing) fst $ (3, 1) :| [(2, 2), (1, 3)](1,3) :| [(2,2),(3,1)]

sortWith is an alias for `sortBy . comparing`.

The tails function takes a stream xs and returns all the suffixes of xs, starting with the longest. The result is NonEmpty because the result always contains the empty list as the last element.

tails [1,2,3] == [1,2,3] :| [[2,3], [3], []]
tails [1] == [1] :| [[]]
tails [] == [] :| []

transpose for NonEmpty, behaves the same as transpose The rows/columns need not be the same length, in which case > transpose . transpose /= id

The unfoldr function is analogous to Data.List's unfoldr operation.

groupWith operates like group, but uses the provided projection when comparing for equality

sortWith for NonEmpty, behaves the same as:

sortBy . comparing

xs !! n returns the element of the stream xs at index n. Note that the head of the stream has index 0.

Beware: a negative or out-of-bounds index will cause an error.

The break p function is equivalent to span (not . p).

cycle xs returns the infinite repetition of xs:

cycle (1 :| [2,3]) = 1 :| [2,3,1,2,3,...]

drop n xs drops the first n elements off the front of the sequence xs.

dropWhile p xs returns the suffix remaining after takeWhile p xs.

Extract the first element of the stream.

Extract everything except the last element of the stream.

iterate f x produces the infinite sequence of repeated applications of f to x.

iterate f x = x :| [f x, f (f x), ..]

Extract the last element of the stream.

repeat x returns a constant stream, where all elements are equal to x.

reverse a finite NonEmpty stream.

scanl is similar to foldl, but returns a stream of successive reduced values from the left:

scanl f z [x1, x2, ...] == z :| [z `f` x1, (z `f` x1) `f` x2, ...]

Note that

last (scanl f z xs) == foldl f z xs.

scanl1 is a variant of scanl that has no starting value argument:

scanl1 f [x1, x2, ...] == x1 :| [x1 `f` x2, x1 `f` (x2 `f` x3), ...]

scanr is the right-to-left dual of scanl. Note that

head (scanr f z xs) == foldr f z xs.

scanr1 is a variant of scanr that has no starting value argument.

span p xs returns the longest prefix of xs that satisfies p, together with the remainder of the stream.

'span' p xs == ('takeWhile' p xs, 'dropWhile' p xs)
xs == ys ++ zs where (ys, zs) = 'span' p xs

splitAt n xs returns a pair consisting of the prefix of xs of length n and the remaining stream immediately following this prefix.

'splitAt' n xs == ('take' n xs, 'drop' n xs)
xs == ys ++ zs where (ys, zs) = 'splitAt' n xs

Extract the possibly-empty tail of the stream.

take n xs returns the first n elements of xs.

takeWhile p xs returns the longest prefix of the stream xs for which the predicate p holds.

uncons produces the first element of the stream, and a stream of the remaining elements, if any.

The unzip function is the inverse of the zip function.

The zipWith function generalizes zip. Rather than tupling the elements, the elements are combined using the function passed as the first argument.

Compute n-ary logic exclusive OR operation on NonEmpty list.

Number of elements in NonEmpty list.

Map a function over a NonEmpty stream.

The zip function takes two streams and returns a stream of corresponding pairs.

filter p xs removes any elements from xs that do not satisfy p.

Convert a stream to a normal list efficiently.

Converts a normal list to a NonEmpty stream.

Raises an error if given an empty list.

A monomorphic version of <> for NonEmpty.

>>> append (1 :| []) (2 :| [3])1 :| [2,3]

Synonym for <|.

unfold produces a new stream by repeatedly applying the unfolding function to the seed value to produce an element of type b and a new seed value. When the unfolding function returns Nothing instead of a new seed value, the stream ends.

Prepend an element to the stream.

The inits1 function takes a NonEmpty stream xs and returns all the NonEmpty finite prefixes of xs, starting with the shortest.

inits1 (1 :| [2,3]) == (1 :| []) :| [1 :| [2], 1 :| [2,3]]
inits1 (1 :| []) == (1 :| []) :| []

The tails1 function takes a NonEmpty stream xs and returns all the non-empty suffixes of xs, starting with the longest.

tails1 (1 :| [2,3]) == (1 :| [2,3]) :| [2 :| [3], 3 :| []]
tails1 (1 :| []) == (1 :| []) :| []

Attach a list at the end of a NonEmpty.

>>> appendList (1 :| [2,3]) []1 :| [2,3]

>>> appendList (1 :| [2,3]) [4,5]1 :| [2,3,4,5]

group1 operates like group, but uses the knowledge that its input is non-empty to produce guaranteed non-empty output.

groupAllWith operates like groupWith, but sorts the list first so that each equivalence class has, at most, one list in the output

groupAllWith1 is to groupWith1 as groupAllWith is to groupWith

groupBy1 is to group1 as groupBy is to group.

groupWith1 is to group1 as groupWith is to group

nonEmpty efficiently turns a normal list into a NonEmpty stream, producing Nothing if the input is empty.

permutations1 operates like permutations, but uses the knowledge that its input is non-empty to produce output where every element is non-empty.

permutations1 = fmap fromList . permutations . toList

Attach a list at the beginning of a NonEmpty.

>>> prependList [] (1 :| [2,3])1 :| [2,3]

>>> prependList [negate 1, 0] (1 :| [2, 3])-1 :| [0,1,2,3]

some1 x sequences x one or more times.