package bwd

  1. Overview
  2. Docs

Module Bwd.BwdSource

This module is similar to List but for backward lists.

Notes on the discrepancies with List:

  • Functions rev, rev_append, rev_map, and rev_map2 will never be included.
  • A new function prepend was added as the forward version of append.
  • A new module Notation was added for the infix notation.
  • Functions for association lists are currently missing, but might be added later.
  • Functions init, tl (as hd for lists), hd (as tl for lists), merge, to_seq, and of_seq are also missing, but might be added in the future.

Please open a GitHub issue if you want a function to be included. We want to make this library useful to you, too!

Sourcetype 'a t = 'a bwd =
  1. | Emp
  2. | Snoc of 'a bwd * 'a
Sourceval length : 'a bwd -> int
Sourceval compare_lengths : 'a bwd -> 'a bwd -> int
Sourceval compare_length_with : 'a bwd -> int -> int
Sourceval snoc : 'a bwd -> 'a -> 'a bwd
Sourceval nth : 'a bwd -> int -> 'a
Sourceval nth_opt : 'a bwd -> int -> 'a option
Sourceval append : 'a bwd -> 'a list -> 'a bwd
Sourceval prepend : 'a bwd -> 'a list -> 'a list

Comparison

Sourceval equal : ('a -> 'a -> bool) -> 'a bwd -> 'a bwd -> bool
Sourceval compare : ('a -> 'a -> int) -> 'a bwd -> 'a bwd -> int

Iterators

Note that the iteration direction is from the right to the left, in the opposite direction of the corresponding functions in List.

Sourceval iter : ('a -> unit) -> 'a bwd -> unit
Sourceval iteri : (int -> 'a -> unit) -> 'a bwd -> unit
Sourceval map : ('a -> 'b) -> 'a bwd -> 'b bwd
Sourceval mapi : (int -> 'a -> 'b) -> 'a bwd -> 'b bwd
Sourceval filter_map : ('a -> 'b option) -> 'a bwd -> 'b bwd
Sourceval fold_left : ('a -> 'b -> 'a) -> 'a -> 'b bwd -> 'a
Sourceval fold_right_map : ('a -> 'b -> 'b * 'c) -> 'a bwd -> 'b -> 'b * 'c bwd
Sourceval fold_right : ('a -> 'b -> 'b) -> 'a bwd -> 'b -> 'b

Iterators on two lists

Note that the iteration direction is from the right to the left, in the opposite direction of the corresponding functions in List.

Sourceval iter2 : ('a -> 'b -> unit) -> 'a bwd -> 'b bwd -> unit
Sourceval map2 : ('a -> 'b -> 'c) -> 'a bwd -> 'b bwd -> 'c bwd
Sourceval fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b bwd -> 'c bwd -> 'a
Sourceval fold_right2 : ('a -> 'b -> 'c -> 'c) -> 'a bwd -> 'b bwd -> 'c -> 'c

List scanning

Note that the iteration direction is from the right to the left, in the opposite direction of the corresponding functions in List.

Sourceval for_all : ('a -> bool) -> 'a bwd -> bool
Sourceval exists : ('a -> bool) -> 'a bwd -> bool
Sourceval for_all2 : ('a -> 'b -> bool) -> 'a bwd -> 'b bwd -> bool
Sourceval exists2 : ('a -> 'b -> bool) -> 'a bwd -> 'b bwd -> bool
Sourceval mem : 'a -> 'a bwd -> bool
Sourceval memq : 'a -> 'a bwd -> bool

List searching

Note that the iteration direction is from the right to the left, in the opposite direction of the corresponding functions in List.

Sourceval find : ('a -> bool) -> 'a bwd -> 'a
Sourceval find_opt : ('a -> bool) -> 'a bwd -> 'a option
Sourceval find_map : ('a -> 'b option) -> 'a bwd -> 'b option
Sourceval filter : ('a -> bool) -> 'a bwd -> 'a bwd
Sourceval find_all : ('a -> bool) -> 'a bwd -> 'a bwd
Sourceval filteri : (int -> 'a -> bool) -> 'a bwd -> 'a bwd
Sourceval partition : ('a -> bool) -> 'a bwd -> 'a bwd * 'a bwd
Sourceval partition_map : ('a -> ('b, 'c) Either.t) -> 'a bwd -> 'b bwd * 'c bwd

Lists of pairs

Sourceval split : ('a * 'b) bwd -> 'a bwd * 'b bwd
Sourceval combine : 'a bwd -> 'b bwd -> ('a * 'b) bwd

Backward and forward lists

Sourceval to_list : 'a bwd -> 'a list
Sourceval of_list : 'a list -> 'a bwd

Infix notation

Sourcemodule Infix : sig ... end

Notation inspired by Conor McBride.