package frenetic
The Frenetic Programming Language and Runtime System
Install
Dune Dependency
Authors
Maintainers
Sources
5.0.5.tar.gz
md5=baf754df13a759c32f2c86a1b6f328da
sha512=80140900e7009ccab14b25e244fe7edab87d858676f8a4b3799b4fea16825013cf68363fe5faec71dd54ba825bb4ea2f812c2c666390948ab217ffa75d9cbd29
doc/frenetic.netkat/Frenetic_netkat/Fdd/Action/Seq/Tree/index.html
Module Seq.Tree
type 'a t = (Key.t, 'a, Key.comparator_witness) Core_kernel__Map_intf.Tree.t
val empty : 'a t
val of_alist_or_error : (Key.t * 'a) list -> 'a t Base.Or_error.t
val of_sorted_array : (Key.t * 'a) array -> 'a t Base.Or_error.t
val of_increasing_sequence :
(Key.t * 'a) Base.Sequence.t ->
'a t Base.Or_error.t
val of_sequence :
(Key.t * 'a) Base.Sequence.t ->
[ `Duplicate_key of Key.t | `Ok of 'a t ]
val of_sequence_or_error : (Key.t * 'a) Base.Sequence.t -> 'a t Base.Or_error.t
val of_sequence_exn : (Key.t * 'a) Base.Sequence.t -> 'a t
val of_sequence_multi : (Key.t * 'a) Base.Sequence.t -> 'a list t
val of_sequence_fold :
(Key.t * 'a) Base.Sequence.t ->
init:'b ->
f:('b -> 'a -> 'b) ->
'b t
val of_sequence_reduce :
(Key.t * 'a) Base.Sequence.t ->
f:('a -> 'a -> 'a) ->
'a t
val of_key_set :
(Key.t, Key.comparator_witness) Base.Set.t ->
f:(Key.t -> 'v) ->
'v t
val invariants : 'a t -> bool
val is_empty : 'a t -> bool
val length : 'a t -> int
val iter : 'a t -> f:('a -> unit) -> unit
val partition_mapi :
'a t ->
f:(key:Key.t -> data:'a -> ('b, 'c) Base.Either.t) ->
'b t * 'c t
val partition_map : 'a t -> f:('a -> ('b, 'c) Base.Either.t) -> 'b t * 'c t
val combine_errors : 'a Base.Or_error.t t -> 'a t Base.Or_error.t
val data : 'a t -> 'a list
val validate :
name:(Key.t -> string) ->
'a Base.Validate.check ->
'a t Base.Validate.check
val validatei :
name:(Key.t -> string) ->
(Key.t * 'a) Base.Validate.check ->
'a t Base.Validate.check
val symmetric_diff :
'a t ->
'a t ->
data_equal:('a -> 'a -> bool) ->
(Key.t * [ `Left of 'a | `Right of 'a | `Unequal of 'a * 'a ])
Base.Sequence.t
val for_all : 'a t -> f:('a -> bool) -> bool
val exists : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val subrange :
'a t ->
lower_bound:Key.t Base.Maybe_bound.t ->
upper_bound:Key.t Base.Maybe_bound.t ->
'a t
val to_sequence :
?order:[ `Decreasing_key | `Increasing_key ] ->
?keys_greater_or_equal_to:Key.t ->
?keys_less_or_equal_to:Key.t ->
'a t ->
(Key.t * 'a) Base.Sequence.t
val key_set : 'a t -> (Key.t, Key.comparator_witness) Base.Set.t
module Provide_of_sexp (K : sig ... end) : sig ... end
val t_of_sexp : (Sexplib0__.Sexp.t -> 'a) -> Sexplib0__.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib0__.Sexp.t) -> 'a t -> Sexplib0__.Sexp.t
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>