Benjamin Scher Purcell
|
c49ab09dea
|
fix more travis issues
|
9 years ago |
|
Benjamin Scher Purcell
|
b8c9d1188f
|
fix travis errors
|
9 years ago |
|
Benjamin Scher Purcell
|
5507a9ec4d
|
Revert "fix import paths back to emirpasic" The paths have to point to spewspews for the build to succeed
This reverts commit 6da2e38be5.
|
9 years ago |
|
Benjamin Scher Purcell
|
6da2e38be5
|
fix import paths back to emirpasic
|
9 years ago |
|
Benjamin Scher Purcell
|
dfbd06908b
|
fix golint issues
|
9 years ago |
|
Benjamin Scher Purcell
|
0e4eb1c32c
|
convert treemap in the same way as treeset
|
9 years ago |
|
Benjamin Scher Purcell
|
67a0d2f547
|
Make treeset take an interface, make the trees satisfy that interface
|
9 years ago |
|
Benjamin Scher Purcell
|
d84c1f0a42
|
fix documentation
|
9 years ago |
|
Benjamin Scher Purcell
|
2339521ad9
|
put tests back
|
9 years ago |
|
Benjamin Scher Purcell
|
d43b189795
|
add random put and remove
|
9 years ago |
|
Benjamin Scher Purcell
|
64f44f66bc
|
more tests, revise existing tests
|
9 years ago |
|
Benjamin Scher Purcell
|
e3980e5b80
|
add avl implementation
|
9 years ago |
Emir Pasic
|
4ea857183a
|
- optimization to bulk insert into heap as per @cristaloleg suggestion #32
|
9 years ago |
|
Emir Pasic
|
196706bb29
|
- set key to key if direct match when inserting into red-black tree. fixes the issue when the key is a struct type, which is how treeset uses the red-black tree #31
|
9 years ago |
|
Emir Pasic
|
0790df9fd0
|
- errcheck
|
9 years ago |
|
Emir Pasic
|
efcbbe6274
|
- detailed extensive tests with breakdown on number of elements
|
9 years ago |
|
Emir Pasic
|
b38c99bf33
|
- btree deletion fixes with more tests (done)
|
9 years ago |
|
Emir Pasic
|
288c1a4ca3
|
- btree deletion with tests
|
9 years ago |
|
Emir Pasic
|
eb4171fdb0
|
- btree Keys() and Values() implemented with tests (using iterator)
|
9 years ago |
|
Emir Pasic
|
53898058bb
|
- btree iterator implemented with tests
|
9 years ago |
|
Emir Pasic
|
76711f5b71
|
- btree don't allow order less than 3
- btree Left(), Right(), LeftKey(), RightKey(), LeftValue(), RightValue() implementation with tests
|
9 years ago |
|
Emir Pasic
|
4e3ff20469
|
- btree get and put tests
|
9 years ago |
|
Emir Pasic
|
9663093961
|
- btree put fixes
|
9 years ago |
|
Emir Pasic
|
2df9ce1ab5
|
- btree put fixes
|
9 years ago |
|
Emir Pasic
|
eecaef5625
|
- btree Height() and String() implementations
|
9 years ago |
|
Emir Pasic
|
ab73314ad4
|
- btree expose its root, nodes and entries (for extension purposes)
|
9 years ago |
|
Emir Pasic
|
19bf8e5c15
|
- remove inOrder function in red-black tree and use iterator
|
9 years ago |
|
Emir Pasic
|
28b826151a
|
- btree insertion with tests
|
9 years ago |
|
Emir Pasic
|
9563b15010
|
- btree insertion with tests
|
9 years ago |
|
Emir Pasic
|
213367f1ca
|
- replace long bsd text with short in all .go files
|
9 years ago |
|
Emir Pasic
|
20229603ab
|
- refactor all iterators and enumerables into separate files
|
9 years ago |
|
Emir Pasic
|
02f40db0cf
|
- test iterator end on reverse-iterable data structures
- fix red-black tree
|
9 years ago |
|
Emir Pasic
|
f052c96069
|
- iterator end on reverse-iterable data structures
|
9 years ago |
|
Emir Pasic
|
57162feff5
|
- rename Reset() to Begin() in iterators (this will allow End() which will make reverse loops more readable)
|
9 years ago |
|
Emir Pasic
|
cbc23a5b79
|
- test iterator first on all iterable data structures
|
9 years ago |
|
Emir Pasic
|
bdfeab4912
|
- iterator first on all structures with reversible iterators
|
9 years ago |
|
Emir Pasic
|
3d1014bf63
|
- test iterator last on all structures with reversible iterators
|
9 years ago |
|
Emir Pasic
|
f8b0747409
|
- iterator last on all structures with reversible iterators
|
9 years ago |
|
Emir Pasic
|
3a938233a0
|
- test iterator reset on all structures
|
9 years ago |
|
Emir Pasic
|
b86d413e66
|
- iterator reset on all structures
|
9 years ago |
|
Emir Pasic
|
eb4bb224e3
|
- add reversible iterators to tree set and tree map
|
9 years ago |
|
Emir Pasic
|
178bc76d62
|
- add reversible iterators to red-black tree
|
9 years ago |
|
Emir Pasic
|
ae143689c6
|
- add reversible iterators to binary heap
|
9 years ago |
|
Emir Pasic
|
d7a31571cc
|
- add reversible iterators to lists (array list and doubly-linked list)
- documentation and tests updates
|
9 years ago |
|
Emir Pasic
|
59bebe43ce
|
- update all documentation to be in godoc style
|
9 years ago |
|
Emir Pasic
|
ef9baa808a
|
- golint
|
9 years ago |
|
Emir Pasic
|
35457aba81
|
- fix spelling
|
9 years ago |
|
Emir Pasic
|
ab6656e286
|
- refactor trees' tests
|
9 years ago |
|
Emir Pasic
|
8cb4635c2c
|
- code document all enumarable functions and iterators in containers
|
9 years ago |
|
Emir Pasic
|
e4c3d8a0d8
|
- split iterators into two type (iterator with index and iterator with key)
|
9 years ago |