package async_unix

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
include Core_kernel.Set_intf.Make_S_plain_tree(Core__.Core_unix.Cidr.Set.Elt).S
type t = (Core__.Core_unix.Cidr.t, Core__.Core_unix.Cidr.comparator_witness) Core_kernel__.Set_intf.Tree.t
include sig ... end
val compare : t -> t -> Base.Int.t
include Core_kernel.Set_intf.Creators_and_accessors0 with type ('a, 'b) set := ('a, 'b) Core_kernel__.Set_intf.Tree.t with type t := t with type tree := t with type elt := Core__.Core_unix.Cidr.t with type comparator_witness := Core__.Core_unix.Cidr.comparator_witness
include Core_kernel.Set_intf.Accessors0 with type t := t with type tree := t with type elt := Core__.Core_unix.Cidr.t with type comparator_witness := Core__.Core_unix.Cidr.comparator_witness
val length : t -> int
val is_empty : t -> bool
val iter : t -> f:(Core__.Core_unix.Cidr.t -> unit) -> unit
val fold : t -> init:'accum -> f:('accum -> Core__.Core_unix.Cidr.t -> 'accum) -> 'accum
val fold_result : t -> init:'accum -> f:('accum -> Core__.Core_unix.Cidr.t -> ('accum, 'e) Base__.Result.t) -> ('accum, 'e) Base__.Result.t
val exists : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> bool
val for_all : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> bool
val count : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> int
val sum : (module Base__.Commutative_group.S with type t = 'sum) -> t -> f:(Core__.Core_unix.Cidr.t -> 'sum) -> 'sum
val find : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> Core__.Core_unix.Cidr.t option
val find_map : t -> f:(Core__.Core_unix.Cidr.t -> 'a option) -> 'a option
val to_list : t -> Core__.Core_unix.Cidr.t list
val to_array : t -> Core__.Core_unix.Cidr.t array
val invariants : t -> bool
val mem : t -> Core__.Core_unix.Cidr.t -> bool
val add : t -> Core__.Core_unix.Cidr.t -> t
val remove : t -> Core__.Core_unix.Cidr.t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val symmetric_diff : t -> t -> (Core__.Core_unix.Cidr.t, Core__.Core_unix.Cidr.t) Base__.Either.t Base__.Sequence.t
val compare_direct : t -> t -> int
val equal : t -> t -> bool
val is_subset : t -> of_:t -> bool
val subset : t -> t -> bool
  • deprecated [since 2016-09] Replace [Set.subset t1 t2] with [Set.is_subset t1 ~of_:t2]
val fold_until : t -> init:'b -> f: ('b -> Core__.Core_unix.Cidr.t -> ('b, 'stop) Core_kernel__.Set_intf.Set_intf.Continue_or_stop.t) -> ('b, 'stop) Core_kernel__.Set_intf.Set_intf.Finished_or_stopped_early.t
val fold_right : t -> init:'b -> f:(Core__.Core_unix.Cidr.t -> 'b -> 'b) -> 'b
val iter2 : t -> t -> f: ([ `Both of Core__.Core_unix.Cidr.t * Core__.Core_unix.Cidr.t | `Left of Core__.Core_unix.Cidr.t | `Right of Core__.Core_unix.Cidr.t ] -> unit) -> unit
val filter : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> t
val partition_tf : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> t * t
val elements : t -> Core__.Core_unix.Cidr.t list
val min_elt : t -> Core__.Core_unix.Cidr.t option
val min_elt_exn : t -> Core__.Core_unix.Cidr.t
val max_elt : t -> Core__.Core_unix.Cidr.t option
val max_elt_exn : t -> Core__.Core_unix.Cidr.t
val choose : t -> Core__.Core_unix.Cidr.t option
val choose_exn : t -> Core__.Core_unix.Cidr.t
val split : t -> Core__.Core_unix.Cidr.t -> t * Core__.Core_unix.Cidr.t option * t
val group_by : t -> equiv:(Core__.Core_unix.Cidr.t -> Core__.Core_unix.Cidr.t -> bool) -> t list
val find_exn : t -> f:(Core__.Core_unix.Cidr.t -> bool) -> Core__.Core_unix.Cidr.t
val find_index : t -> int -> Core__.Core_unix.Cidr.t option
  • deprecated [since 2016-10] Use [nth]
val nth : t -> int -> Core__.Core_unix.Cidr.t option
val remove_index : t -> int -> t
val to_tree : t -> t
val to_sequence : ?order:[ `Decreasing | `Increasing ] -> ?greater_or_equal_to:Core__.Core_unix.Cidr.t -> ?less_or_equal_to:Core__.Core_unix.Cidr.t -> t -> Core__.Core_unix.Cidr.t Base__.Sequence.t
val merge_to_sequence : ?order:[ `Decreasing | `Increasing ] -> ?greater_or_equal_to:Core__.Core_unix.Cidr.t -> ?less_or_equal_to:Core__.Core_unix.Cidr.t -> t -> t -> (Core__.Core_unix.Cidr.t, Core__.Core_unix.Cidr.t) Core_kernel__.Set_intf.Set_intf.Merge_to_sequence_element.t Base__.Sequence.t
val to_map : t -> f:(Core__.Core_unix.Cidr.t -> 'data) -> (Core__.Core_unix.Cidr.t, 'data, Core__.Core_unix.Cidr.comparator_witness) Core_kernel.Map.t
include Core_kernel.Set_intf.Creators0 with type t := t with type tree := t with type elt := Core__.Core_unix.Cidr.t with type comparator_witness := Core__.Core_unix.Cidr.comparator_witness with type ('a, 'b) set := ('a, 'b) Core_kernel__.Set_intf.Tree.t
val empty : t
val singleton : Core__.Core_unix.Cidr.t -> t
val union_list : t list -> t
val of_list : Core__.Core_unix.Cidr.t list -> t
val of_array : Core__.Core_unix.Cidr.t array -> t
val of_sorted_array : Core__.Core_unix.Cidr.t array -> t Base__.Or_error.t
val of_sorted_array_unchecked : Core__.Core_unix.Cidr.t array -> t
val of_increasing_iterator_unchecked : len:int -> f:(int -> Core__.Core_unix.Cidr.t) -> t
val stable_dedup_list : Core__.Core_unix.Cidr.t list -> Core__.Core_unix.Cidr.t list
val map : ('a, 'b) Core_kernel__.Set_intf.Tree.t -> f:('a -> Core__.Core_unix.Cidr.t) -> t
val filter_map : ('a, 'b) Core_kernel__.Set_intf.Tree.t -> f:('a -> Core__.Core_unix.Cidr.t option) -> t
val of_tree : t -> t
val of_hash_set : Core__.Core_unix.Cidr.t Core_kernel.Hash_set.t -> t
val of_hashtbl_keys : (Core__.Core_unix.Cidr.t, _) Core_kernel.Hashtbl.t -> t
val of_map_keys : (Core__.Core_unix.Cidr.t, _, Core__.Core_unix.Cidr.comparator_witness) Core_kernel.Map.t -> t
module Provide_of_sexp (Elt : sig ... end) : sig ... end
include Core_kernel.Sexpable.S with type t := t
val t_of_sexp : Base__.Sexplib.Sexp.t -> t
val sexp_of_t : t -> Base__.Sexplib.Sexp.t
OCaml

Innovation. Community. Security.