We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
A set is a data structure that holds an unordered list of unique values. It's optimized to know whether a value is present in the set.
<1, 2, 5>
Set<Any>
setIntersection
setUnion
setDifference
&
|
+
-
setContains
in
setSize
setIsEmpty
setIsSubsetOf
setPut
setRemove
setClear
intervalToSet
arrayToSet
setToMap
mapKeysToSet
setToArray
setAverage
setEvery
setSome
setFold
setIter
setMax
setMin
setSum
setFilter
toString
The text was updated successfully, but these errors were encountered:
No branches or pull requests
A set is a data structure that holds an unordered list of unique values. It's optimized to know whether a value is present in the set.
<1, 2, 5>
[set] Implements syntax & typing #25Set<Any>
[set] Implements syntax & typing #25setIntersection
,setUnion
,setDifference
; aliased respectively to the operators&
,|
(and+
), and-
.setContains
(aliased to the operatorin
),setSize
,setIsEmpty
,setIsSubsetOf
[set] Add basic set methods #27setPut
,setRemove
,setClear
[set] Add basic set methods #27intervalToSet
,arrayToSet
,setToMap
,mapKeysToSet
,setToArray
setAverage
,setEvery
,setSome
,setFold
,setIter
,setMax
,setMin
,setSum
,setFilter
toString
The text was updated successfully, but these errors were encountered: