Permalink
Find file
Fetching contributors…
Cannot retrieve contributors at this time
25 lines (24 sloc) 1.13 KB
* Make List#size not O(n)!
* Make List#sort/#sort_by efficient :)
* Make Set#sort/#sort_by efficient :)
* Add List #hash, #fill, #sample, #index (#find_index), #insert, #insert_by, #to_set, #permutation (aliased as #permutations), #subsequences, #transpose
* Add Set #hash, #one?, #cycle, #sample, #max(imum), #min(imum), #flatten
* Add Hash #hash, #find (#detect), #count, #partition, #one?, #sort, #sort_by, #max(imum), #min(imum), #cycle, #clear
* Implement Set#union aliased as #| and #+
* Implement Set#intersection aliased as #&
* Implement Set#difference aliased as #-
* Implement Set#subtract
* Implement Set#subset?
* Implement Set#superset?
* Implement Set#^ as equivalent to ((set | enum) - (set & enum))
* Implement Hash#merge
* Work out what we can extract into common "Enumerable-like" code.
* Make Set and Hash lazy
* Generate spec docs
* Add missing immutability tests to Set
* Add missing immutability tests to Hash
* Add missing immutability tests to Stack
* Re-write Trie test-first (it was only a spike)
* Allow Trie to efficiently add multiple pairs in one go
* Implement Vector (using a Trie and integer keys?)
* Implement a queue?