package accessor_base
Module Accessor_base.SetSource
Source
val mem :
'key ->
(_, Base.bool, ('key, _) Base.Set.t, [< Accessor_base__.Import.field ])
Accessor.tAccess whether a key is present in the set. true means the key is present, and false means it is absent.
Source
val at :
'key ->
(_, Base.bool, ('key, _) Base.Set.t, [< Accessor_base__.Import.field ])
Accessor.tSource
val memi :
'key ->
('key * _,
Base.bool,
('key, _) Base.Set.t,
[< Accessor_base__.Import.field ])
Accessor.Indexed.tThe indexed version of mem adds the given key to the index.
Source
val ati :
'key ->
('key * _,
Base.bool,
('key, _) Base.Set.t,
[< Accessor_base__.Import.field ])
Accessor.Indexed.tSource
val found :
'key ->
(_, Base.unit, ('key, _) Base.Set.t, [< Accessor_base__.Import.optional ])
Accessor.tAccess () iff the set contains the given key.
Source
val foundi :
'key ->
('key * _,
Base.unit,
('key, _) Base.Set.t,
[< Accessor_base__.Import.optional ])
Accessor.Indexed.tThe indexed version of found adds the given key to the index.
Source
val each :
('i ->
'key ->
_,
'i ->
('key, 'cmp) Base.Set.t ->
_,
[< Accessor_base__.Import.many_getter ])
Accessor.General.tAccess every element in a set.
Source
val empty_default :
('k1, 'cmp1) Base.Comparator.Module.t ->
('i ->
('k1, 'cmp1) Base.Set.t ->
('k2, 'cmp2) Base.Set.t,
'i ->
('k1, 'cmp1) Base.Set.t Base.option ->
('k2, 'cmp2) Base.Set.t Base.option,
[< Accessor_base__.Import.isomorphism ])
Accessor.General.tTreat None equivalently with the empty set. This accessor is not well-behaved, as it violates construct (get at) = at:
construct (get (Some Foo.Set.empty)) = construct Foo.Set.empty = None
Source
val of_accessor :
('a, 'cmp) Base.Comparator.Module.t ->
(Base.unit ->
'a ->
_,
Base.unit ->
'at ->
_,
[> Accessor_base__.Import.many_getter ])
Accessor.General.t ->
'at ->
('a, 'cmp) Base.Set.tof_accessor (module M) accessor x is a M.Set.t that contains everything accessed by accessor in x.