package electrod

You can search for identifiers within the package.

in-package search v0.2.0

Formal analysis for the Electrod formal pivot language

Install

dune-project

Dependency

github.com Readme Changelog MPL-2.0 License Edit opam file Versions (10)

Authors

Maintainers

D

David Chemouil <david.chemouil+git@onera.fr>

Sources

electrod-0.7.1.tbz

sha256=e5d2278c99128621110cd015dafcbcae9792bbf2c8bb09d7b02c57d50fa28075

sha512=e08ecf720d35b6ee72f37d780cc3da22f61e22314ffd093ff3314fb89684b863b5c96c97375d48bcb4ba2838ec8f61a495105c989f292c5dbcd095e14f52bdba

doc/electrod.libelectrod/Libelectrod/Tuple/Set/index.html

Module `Tuple.Set`Source

include Set.S with type elt = t

Sourcetype elt = t

The type of the set elements.

Sourcetype t

The type of sets.

Sourceval empty : t

The empty set.

Sourceval is_empty : t -> bool

Test whether a set is empty or not.

Sourceval mem : elt -> t -> bool

mem x s tests whether x belongs to the set s.

Sourceval add : elt -> t -> t

add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

before 4.03
Physical equality was not ensured.

Sourceval singleton : elt -> t

singleton x returns the one-element set containing only x.

Sourceval remove : elt -> t -> t

remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

before 4.03
Physical equality was not ensured.

Sourceval union : t -> t -> t

Set union.

Sourceval inter : t -> t -> t

Set intersection.

Sourceval disjoint : t -> t -> bool

Test if two sets are disjoint.

since 4.08.0

Sourceval diff : t -> t -> t

Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

Sourceval compare : t -> t -> int

Total ordering between sets. Can be used as the ordering function for doing sets of sets.

Sourceval equal : t -> t -> bool

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

Sourceval subset : t -> t -> bool

subset s1 s2 tests whether the set s1 is a subset of the set s2.

Sourceval iter : (elt -> unit) -> t -> unit

iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

Sourceval map : (elt -> elt) -> t -> t

map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

since 4.04.0

Sourceval fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a

fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

Sourceval for_all : (elt -> bool) -> t -> bool

for_all f s checks if all elements of the set satisfy the predicate f.

Sourceval exists : (elt -> bool) -> t -> bool

exists f s checks if at least one element of the set satisfies the predicate f.

Sourceval filter : (elt -> bool) -> t -> t

filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

before 4.03
Physical equality was not ensured.

Sourceval filter_map : (elt -> elt option) -> t -> t

filter_map f s returns the set of all v such that f x = Some v for some element x of s.

For example,

filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

is the set of halves of the even elements of s.

If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

since 4.11.0

Sourceval partition : (elt -> bool) -> t -> t * t

partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

Sourceval cardinal : t -> int

Return the number of elements of a set.

Sourceval elements : t -> elt list

Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Stdlib.Set.Make.

Sourceval min_elt : t -> elt

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Sourceval max_elt : t -> elt

Same as min_elt, but returns the largest element of the given set.

Sourceval choose : t -> elt

Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

Sourceval split : elt -> t -> t * bool * t

split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

Sourceval find : elt -> t -> elt

find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

since 4.01.0

Iterators

Sourceval to_seq_from : elt -> t -> elt Seq.t

to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

since 4.07

Sourceval to_rev_seq : t -> elt Seq.t

Iterate on the whole set, in descending order

since 4.12

Sourceval min_elt_opt : t -> elt option

Safe version of min_elt.

since 1.5

Sourceval max_elt_opt : t -> elt option

Safe version of max_elt.

since 1.5

Sourceval choose_opt : t -> elt option

Safe version of choose.

since 1.5

Sourceval find_opt : elt -> t -> elt option

Safe version of find.

since 1.5

Sourceval find_first : (elt -> bool) -> t -> elt

Find minimum element satisfying predicate.

since 1.5

Sourceval find_first_opt : (elt -> bool) -> t -> elt option

Safe version of find_first.

since 1.5

Sourceval find_last : (elt -> bool) -> t -> elt

Find maximum element satisfying predicate.

since 1.5

Sourceval find_last_opt : (elt -> bool) -> t -> elt option

Safe version of find_last.

since 1.5

Sourceval of_iter : elt CCSet.iter -> t

Build a set from the given iter of elements.

since 2.8

Sourceval add_iter : t -> elt CCSet.iter -> t

since 2.8

Sourceval to_iter : t -> elt CCSet.iter

to_iter t converts the set t to a iter of the elements.

since 2.8

Sourceval of_seq : elt CCSet.sequence -> t

deprecated use of_iter instead

Sourceval add_seq : t -> elt CCSet.sequence -> t

deprecated use add_iter instead

Sourceval to_seq : t -> elt CCSet.sequence

deprecated use to_iter instead

Sourceval of_list : elt list -> t

Build a set from the given list of elements, added in order using add.

Sourceval add_list : t -> elt list -> t

since 0.14

Sourceval to_list : t -> elt list

to_list t converts the set t to a list of the elements.

Source

val to_string : 
  ?start:string ->
  ?stop:string ->
  ?sep:string ->
  (elt -> string) ->
  t ->
  string

Print the set in a string

since 2.7

Source

val pp : 
  ?start:string ->
  ?stop:string ->
  ?sep:string ->
  elt CCSet.printer ->
  t CCSet.printer

Print the set.