fun add(item: E) is abstract
# Add each item of `coll`.
+ #
# var a = [1,2]
# a.add_all([3..5])
# assert a.has(4) == true
import hash_collection
# Data structure to keeps track of elements partitioned into disjoint subsets
+#
# var s = new DisjointSet[Int]
# s.add(1)
# s.add(2)
end
# Are all elements of `es` in the same subset?
+ #
# var s = new DisjointSet[Int]
# s.add_all([1,2,3,4,5,6])
# s.union_all([1,2,3])
# Return the corresponding digit character
# If 0 <= `self` <= 9, return the corresponding character.
+ #
# assert 5.to_c == '5'
+ #
# If 10 <= `self` <= 36, return the corresponding letter [a..z].
+ #
# assert 15.to_c == 'f'
fun to_c: Char
do
# n : number of required free identifiers
# idc : This array will be filled with n free identifiers
# return the size of hashTable to create for theses identifiers (mask + 1)
+ #
# var ph = new Perfecthashing
# var idc = new Array[Int]
# assert ph.pnand([3, 7, 10], 1, idc) == 6
# * delete average O(lg n) worst O(n)
#
# Usage:
+#
# var tree = new BinTreeMap[Int, String]
# tree[1] = "n1"
# assert tree.min == "n1"