the item type
The empty hashset.
the item type
Curried predicate to find out whether the HashSet is empty.
Vector.of(HashSet.of(1), HashSet.empty<number>())
.filter(HashSet.isEmpty)
=> Vector.of(HashSet.empty<number>())
Curried predicate to find out whether the HashSet is empty.
Vector.of(HashSet.of(1), HashSet.empty<number>())
.filter(HashSet.isNotEmpty)
=> Vector.of(HashSet.of(1))
Build a hashset from a series of items (any number, as parameters)
the item type
Build a hashset from any iterable, which means also an array for instance.
the item type
Implementation of the Iterator interface.
Add an element to this set.
Add multiple elements to this set.
Returns true if the predicate returns true for all the elements in the collection.
Returns true if there the predicate returns true for any element in the collection.
Matches each element with a unique key that you extract from it. If the same key is present twice, the function will return None.
also see HashSet.groupBy
Returns true if the element you give is present in the set, false otherwise.
Returns a new Set containing the difference between this set and the other Set passed as parameter. also see HashSet.intersect
Two objects are equal if they represent the same value, regardless of whether they are the same object physically in memory.
Call a predicate for each element in the collection, build a new collection holding only the elements for which the predicate returned true.
Search for an item matching the predicate you pass, return Option.Some of that element if found, Option.None otherwise. We name the method findAny instead of find to emphasize that there is not ordering in a hashset.
HashSet.of(1,2,3).findAny(x => x>=3)
=> Option.of(3)
HashSet.of(1,2,3).findAny(x => x>=4)
=> Option.none<number>()
Calls the function you give for each item in the set, your function returns a set, all the sets are merged.
Reduces the collection to a single value using the associative binary function you give. Since the function is associative, order of application doesn't matter.
Example:
HashSet.of(1,2,3).fold(0, (a,b) => a + b);
=> 6
Reduces the collection to a single value. Left-associative. No guarantees for the order of items in a hashset!
Example:
HashSet.of("a", "bb", "ccc").foldLeft(0, (soFar,item) => soFar+item.length);
=> 6
The initial value
A function taking the previous value and the current collection item, and returning an updated value.
Reduces the collection to a single value. Right-associative. No guarantees for the order of items in a hashset!
Example:
HashSet.of("a", "bb", "ccc").foldRight(0, (item,soFar) => soFar+item.length);
=> 6
The initial value
A function taking the current collection item and the previous value , and returning an updated value.
Call a function for element in the collection.
Group elements in the collection using a classifier function. Elements are then organized in a map. The key is the value of the classifier, and in value we get the list of elements matching that value.
also see HashSet.arrangeBy
Get a number for that object. Two different values may get the same number, but one value must always get the same number. The formula can impact performance.
Returns a new Set containing the intersection of this set and the other Set passed as parameter (the elements which are common to both sets) also see HashSet.diff
true if the set is empty, false otherwise.
Returns the number of elements in the set.
Return a new collection where each element was transformed by the mapper function you give. The resulting set may be smaller than the source.
Apply the mapper function on every element of this collection. The mapper function returns an Option; if the Option is a Some, the value it contains is added to the result Collection, if it's a None, the value is discarded.
HashSet.of(1,2,6).mapOption(x => x%2===0 ?
Option.of(x+1) : Option.none<number>())
=> HashSet.of(3, 7)
Compare values in the collection and return the largest element. Returns Option.none if the collection is empty.
also see HashSet.maxOn
Call the function you give for each value in the collection and return the element for which the result was the largest. Returns Option.none if the collection is empty.
also see HashSet.maxBy
Compare values in the collection and return the smallest element. Returns Option.none if the collection is empty.
also see HashSet.minOn
Call the function you give for each value in the collection and return the element for which the result was the smallest. Returns Option.none if the collection is empty.
also see HashSet.minBy
Joins elements of the collection by a separator. Example:
HashSet.of(1,2,3).mkString(", ")
=> "1, 2, 3"
(of course, order is not guaranteed)
Returns a pair of two sets; the first one will only contain the items from this sets for which the predicate you give returns true, the second will only contain the items from this collection where the predicate returns false.
HashSet.of(1,2,3,4).partition(x => x%2===0)
=> [HashSet.of(2,4), HashSet.of(1,3)]
Reduces the collection to a single value by repeatedly calling the combine function. No starting value. The order in which the elements are passed to the combining function is undetermined.
Returns a new set with the element you give removed if it was present in the set.
Returns a new set with all the elements of the current Set, minus the elements of the iterable you give as a parameter. If you call this function with a HashSet as parameter, rather call 'diff', as it'll be faster.
If the collection contains a single element, return Some of its value, otherwise return None.
Call the function you give for each element in the collection and sum all the numbers, return that sum. Will return 0 if the collection is empty.
HashSet.of(1,2,3).sumOn(x=>x)
=> 6
Converts this set to an array. Since a Set is not ordered and since this method returns a JS array, it can be awkward to get an array sorted in the way you'd like. So you can pass an optional sorting function too.
HashSet.of(1,2,3).toArray().sort()
=> [1,2,3]
HashSet.of(1,2,3).toArray({sortOn:x=>x})
=> [1,2,3]
HashSet.of(1,2,3).toArray({sortBy:(x,y)=>x-y})
=> [1,2,3]
You can also pass an array in sortOn, listing lambdas to several fields to sort by those fields, and also {desc:lambda} to sort by some fields descending.
Convert to an ES6 Set. You must provide a function to convert the key to a string, number or boolean, because with other types equality is not correctly managed by JS. https://stackoverflow.com/questions/29759480/how-to-customize-object-equality-for-javascript-set https://esdiscuss.org/topic/maps-with-object-keys
HashSet.of("a", "b").toJsSet(x=>x);
=> new Set(["a", "b"])
Converts this set to an list
Get a human-friendly string representation of that value.
Also see HashSet.mkString
Converts this set to an vector
Transform this value to another value type. Enables fluent-style programming by chaining calls.
Generated using TypeDoc
An unordered collection of values, where no two values may be equal. A value can only be present once.