projects / feisty_meow.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: c617495) | patch
nice implementations and bad implem
authorChris Koeritz <fred@gruntose.com>
Tue, 3 Jan 2017 21:02:50 +0000 (16:02 -0500)
committerChris Koeritz <fred@gruntose.com>
Tue, 3 Jan 2017 21:02:50 +0000 (16:02 -0500)
commitd1bc81087c8f6fab5836f73a2f0ce7ad2d92e48e
treeeb11a3b37fceb0c55f49159c3cebdfd5d343458atree | snapshot
parentc6174955bb34c94dd89bc36da8244e3635312e22commit | diff
nice implementations and bad implem

the binary search tree is probably ready for general purpose use.
the rectangle intersector "good answer" is totally hosed still; need to mentally process the algorithm.  also need a better description of how to search the BST appropriately for y values.  postponing for now.
kona/src/org/feistymeow/algorithms/BinarySearchTree.java [new file with mode: 0644] blob
kona/src/org/feistymeow/algorithms/RectangleIntersector.java [new file with mode: 0644] blob