Emir Pasic
|
549b6388f5
|
Merge pull request #34 from emirpasic/rbt_fix_struct_key
Fix duplicate struct key insertion in red-black tree
|
8 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
|
8 years ago |
Emir Pasic
|
62b6e90ed7
|
- documentation update on removing elements while iterating #28
|
8 years ago |
Emir Pasic
|
f310ac001e
|
- fix comparator test
|
8 years ago |
Emir Pasic
|
b143e3a370
|
Merge pull request #29 from glenherb/patch-1
Make IntComparator a bit more direct
|
8 years ago |
Emir Pasic
|
fbd5d5a0b2
|
Merge pull request #30 from emirpasic/btree
- errcheck
|
8 years ago |
Emir Pasic
|
0790df9fd0
|
- errcheck
|
8 years ago |
glenherb
|
84564da2b4
|
Make IntComparator a bit more direct
|
8 years ago |
Emir Pasic
|
7f89ed30ec
|
Merge pull request #26 from emirpasic/btree
Btree
|
8 years ago |
Emir Pasic
|
8e34c656ab
|
Update README.md
|
8 years ago |
Emir Pasic
|
7728a69eae
|
- benchmarks in documentation
|
8 years ago |
Emir Pasic
|
63d434cce6
|
- benchmarks in documentation
|
8 years ago |
Emir Pasic
|
3066d0de5e
|
- benchmarks in documentation
|
8 years ago |
Emir Pasic
|
ce647c94dd
|
- btree example and documentation
|
8 years ago |
Emir Pasic
|
efcbbe6274
|
- detailed extensive tests with breakdown on number of elements
|
8 years ago |
Emir Pasic
|
b38c99bf33
|
- btree deletion fixes with more tests (done)
|
8 years ago |
Emir Pasic
|
288c1a4ca3
|
- btree deletion with tests
|
8 years ago |
Emir Pasic
|
eb4171fdb0
|
- btree Keys() and Values() implemented with tests (using iterator)
|
8 years ago |
Emir Pasic
|
53898058bb
|
- btree iterator implemented with tests
|
8 years ago |
Emir Pasic
|
76711f5b71
|
- btree don't allow order less than 3
- btree Left(), Right(), LeftKey(), RightKey(), LeftValue(), RightValue() implementation with tests
|
8 years ago |
Emir Pasic
|
4e3ff20469
|
- btree get and put tests
|
8 years ago |
Emir Pasic
|
9663093961
|
- btree put fixes
|
8 years ago |
Emir Pasic
|
2df9ce1ab5
|
- btree put fixes
|
8 years ago |
Emir Pasic
|
eecaef5625
|
- btree Height() and String() implementations
|
8 years ago |
Emir Pasic
|
ab73314ad4
|
- btree expose its root, nodes and entries (for extension purposes)
|
8 years ago |
Emir Pasic
|
19bf8e5c15
|
- remove inOrder function in red-black tree and use iterator
|
8 years ago |
Emir Pasic
|
28b826151a
|
- btree insertion with tests
|
8 years ago |
Emir Pasic
|
9563b15010
|
- btree insertion with tests
|
8 years ago |
Emir Pasic
|
2be4769d2b
|
Merge pull request #25 from emirpasic/treebidimap
TreeBidiMap
|
8 years ago |
Emir Pasic
|
7c82c74b00
|
- TreeBidiMap documentation
|
8 years ago |
Emir Pasic
|
d8c5aa20eb
|
- TreeBidiMap example implemented
- TreeMap string output fixed to be consistent with other maps
|
8 years ago |
Emir Pasic
|
b41257272c
|
- TreeBidiMap enumerable implemented (with tests)
|
8 years ago |
Emir Pasic
|
cec0ec524f
|
- TreeBidiMap iterator implemented (with tests)
|
8 years ago |
Emir Pasic
|
0d9a0e6124
|
- TreeBidiMap core implemented (with tests)
|
8 years ago |
Emir Pasic
|
20e2a00f13
|
- start on treebidimap
|
8 years ago |
Emir Pasic
|
16fd6c0e09
|
Merge pull request #23 from emirpasic/bidi_map
- bidimap implemention as dual hashmap bidirectional map
|
8 years ago |
Emir Pasic
|
52d942a053
|
- hashbidimap documentation and example
|
8 years ago |
Emir Pasic
|
a7ad28443d
|
- bidimap implemention as dual hashmap bidirectional map
- tests
|
8 years ago |
Emir Pasic
|
e86802a747
|
Merge pull request #21 from emirpasic/refactor
Refactor
|
8 years ago |
Emir Pasic
|
213367f1ca
|
- replace long bsd text with short in all .go files
|
8 years ago |
Emir Pasic
|
20229603ab
|
- refactor all iterators and enumerables into separate files
|
8 years ago |
Emir Pasic
|
9078485d8b
|
Merge pull request #20 from emirpasic/iterator_reset
Iterator Reset
|
8 years ago |
Emir Pasic
|
e49a74aa91
|
- test iterator end on reverse-iterable data structures
- fix red-black tree iteration with explicit begin and end states
- examples for iterators (with index and key) (with forward and reverse iteration)
|
8 years ago |
Emir Pasic
|
02f40db0cf
|
- test iterator end on reverse-iterable data structures
- fix red-black tree
|
8 years ago |
Emir Pasic
|
f052c96069
|
- iterator end on reverse-iterable data structures
|
8 years ago |
Emir Pasic
|
57162feff5
|
- rename Reset() to Begin() in iterators (this will allow End() which will make reverse loops more readable)
|
8 years ago |
Emir Pasic
|
cbc23a5b79
|
- test iterator first on all iterable data structures
|
8 years ago |
Emir Pasic
|
bdfeab4912
|
- iterator first on all structures with reversible iterators
|
8 years ago |
Emir Pasic
|
3d1014bf63
|
- test iterator last on all structures with reversible iterators
|
8 years ago |
Emir Pasic
|
f8b0747409
|
- iterator last on all structures with reversible iterators
|
8 years ago |