Returns a copy of the tree with items removed whenever the callback function returns false.
A function to call for each item in the set.
The second parameter to callback exists because ISetF
is a subinterface of IMapF. If the object is a map, v
is the value associated with the key, otherwise v could be
undefined or another copy of the third parameter (counter).
OptionalreturnThisIfUnchanged: booleanReturns a boolean asserting whether the key exists in the map object or not.
Returns a new iterator for iterating the items in the set (the order is implementation-dependent).
Returns a copy of the tree with all the keys in the specified array present.
The keys to add.
OptionalreturnThisIfUnchanged: boolean
If true, the method returns this when
all of the keys are already present in the collection. The
default value may be true or false depending on the concrete
implementation of the interface (in BTree, the default is false.)
An interface for a functional set, in which the set object could be read-only but new versions of the set can be created by calling "with" or "without" methods to add or remove keys. This is a subinterface of IMapF<K,V>, so the items in the set may be referred to as "keys".