emirpasic
|
5123d6be01
|
- fix comments/documentation, rigorous serialization testing
|
7 years ago |
|
emirpasic
|
370f7ab252
|
- fix https://github.com/emirpasic/gods/issues/85
|
7 years ago |
Benjamin Scher Purcell
|
08df807efe
|
speed up redblack put performance
|
9 years ago |
|
Emir Pasic
|
7eadb02f45
|
- all trees (de)serialization
|
9 years ago |
|
Emir Pasic
|
42299026d8
|
- flip the output of avl tree (swap left with right children in output to mimick the output given by red-black tree)
|
9 years ago |
|
Emir Pasic
|
bf32da08f2
|
- mimicking iterator behavior as with red-black tree (copied/pasted same test from red-black tree and fixed the iterator logic)
|
9 years ago |
|
Emir Pasic
|
240822f445
|
- avl tree: reshuffle functions around to resemble the red-black tree ordering of functions (makes it easier to maintain code of various trees)
|
9 years ago |
|
Emir Pasic
|
9f8722300a
|
- AVL tree, remove dynamic func initialization within a func, simply extract those put/remove func on its own
|
9 years ago |
|
Emir Pasic
|
d6611c11d3
|
- getting rid of min/max from avl tree for now, until we figure out if these should be implemented on all trees (probably, yes)
|
9 years ago |
|
Emir Pasic
|
31294e57de
|
- remove copy-constructor like initialization in avl tree, could be ambiguous for clients of what the output might be. an explicit initialization with explicit comparator is a lot more obvious, more code, but more obvious.
|
9 years ago |
|
Emir Pasic
|
59734f8164
|
- avl tree: expose children and parent nodes, can be useful when extending structure to have access to these
|
9 years ago |
|
Emir Pasic
|
f480e9419a
|
- simplify avl tree by exposing its comparator , i.e. del getter for comparator
|
9 years ago |
|
Emir Pasic
|
6f20e11a99
|
- remove logging and panics from avl tree
|
9 years ago |
|
Emir Pasic
|
dbba07eb57
|
- go fmt/vet
|
9 years ago |
|
Emir Pasic
|
6c67eb0b06
|
- revert some of changes coming from avl tree merge
|
9 years ago |
|
Emir Pasic
|
b5004c7e71
|
- fix import path
|
9 years ago |
|
Emir Pasic
|
cac4f90f91
|
- move license of avl tree to root's license
|
9 years ago |
|
Benjamin Scher Purcell
|
38b9436208
|
fix tests
|
9 years ago |
|
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 |