Search results

This module defines a type of strict linked lists, and associated helper functions and type class instances.

Note: Depending on your use-case, you may prefer to use Data.Sequence instead, which might give better performance for certain use cases. This module is an improvement over Data.Array when working with immutable lists of data in a purely-functional setting, but does not have good random-access performance.

This module defines a type of lazy linked lists, and associated helper functions and type class instances.

Note: Depending on your use-case, you may prefer to use Data.Sequence instead, which might give better performance for certain use cases. This module is an improvement over Data.Array when working with immutable lists of data in a purely-functional setting, but does not have good random-access performance.

Faster replacements for common methods on linked lists, which exploit mutation under the hood.

Partial helper functions for working with strict linked lists.

This module defines the type of zip lists, i.e. linked lists with a zippy Applicative instance.