package frama-c

  1. Overview
  2. Docs
package frama-c
Legend:
Library
Module
Module type
Parameter
Class
Class type

List with constant-time concat operation.

  • since Carbon-20101201
type 'a t
val empty : 'a t
val elt : 'a -> 'a t
val add : 'a -> 'a t -> 'a t
val append : 'a t -> 'a -> 'a t
val list : 'a list -> 'a t
val ulist : 'a t list -> 'a t
val concat : 'a t -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val umap : ('a -> 'b t) -> 'a t -> 'b t
val umap_list : ('a -> 'b t) -> 'a list -> 'b t
val iter : ('a -> unit) -> 'a t -> unit
val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filter : ('a -> bool) -> 'a t -> 'a t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val singleton : 'a t -> 'a option
val elements : 'a t -> 'a list

Might have n^2 complexity in worst cases. It might be better to use a Vector to reach linear complexity.

val sort : ('a -> 'a -> int) -> 'a t -> 'a list

The returned list preserves duplicates and order of equals elements. Uses Merge Sort (from standard List module), but might have n^2 complexity in worst cases. It might be better to use a Vector to reach linear complexity.

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct