-
- GitHub
- GitLab
- Bitbucket
-
By logging in you accept
our terms of service
and privacy policy
simple set class
Repository Haxelib Haxe Download
haxelib install hxSet 1.5.0
hxSet
-----
This is a simple 'set' class. It supports basic set operations. It is implemented with a list.
length
property that tells the number of items in the set
new()
create an empty set
add(item :T, ?cmp :T->T->Bool) :Bool
add an item to the set
returns true if it was added
remove(pred :T->Bool) :Int
remove items from the set that are selected by the given predicate
returns the number of items removed
has(item :T, ?cmp :T->T->Bool)
returns true if the given item is in the set
isEmpty()
returns true if the set is empty
union(otherItems :Iterable<T>, ?cmp :T->T->Bool) :Int
add the items from the given iterable to the set
returns the number of items added
intersection(otherItems :Iterable<T>, ?cmp :T->T->Bool) :Int
remove items which are not in the given iterable
returns the number of items removed
minus(otherItems :Iterable<T>, ?cmp :T->T->Bool) :Int
remove items what are in given iterable
return the number of items removed
equals(otherSet :Set<T>, ?cmp :T->T->Bool) :Bool
check if sets are equal (made up of the same items). pass in a cmp function to override item comparison. O(n^2).
return true if both sets contain the same (or equivalent if cmp is provided) items
clear()
empty the set
iterator()
iterate over items in the set. order will be filo.
The Tidelift Subscription provides access to a continuously curated stream of human-researched and maintainer-verified data on open source packages and their licenses, releases, vulnerabilities, and development practices.
Learn more →
Something wrong with this page? Make a suggestion
Export .ABOUT file for this package
Last synced: 2016-11-12 20:49:04 UTC
Login to resync this project