Search Results for "red black tree java"

Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. Bitarray used to detect existence without having...

Some generic container library Red-Black tree, AVL tree, Decart tree, Weight-balanced tree - persistent and nonpersistent version HashMaps, FIFO, ResPool and other

A library written in C that provides a sorted list (based on an AVL or Red-Black tree) for sorting large amounts of data without using up all the physical memory. Uses disk if there is more data in the sorted list than there is memory available.

This application's purpose is to visualize 5 common in computer science, tree data structures as well as visualizing their insertion, deletion, search and traversal operations. Supported trees: AVL, Red-Black, Splay, Treap, AB. Multilingual. Enjoy!

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.

"That Random RPG", a top down 32-bit old-school RPG where nostalgia-gasms are guaranteed. The twist is... wait for it... you are the villain fighting those pesky flamboyant heroes that keep ruining your awesome set up, get your mace, evil red beady eyes and mace ready. Hyper-extended alpha gold x-wing GOTY platinum bacon edition, COMING SOON. OpenGL provided by LWJGL (http://lwjgl.org/). Also uses Slick-Util, a subset of Slick2D (http://slick.cokeandcode.com/) See us on Facebook...

Advanced algorithm library implemented by C

This application is a tree algorithms visualizator. The user can create his own tree of a certain type (among binary, binary search, and red black), his algorithm and then can observe the execution in real time of his algorithm on his tree.

Red-Black Maps and Trees, written in Java. These Classes try to advoid the overhead produced by Sun's implementations. For example Trees are just Trees, nor self mapped Maps. Access on nodelevel is possible, reducing overhead while iterating over an map

This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).

spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.

MultiTreeMap: A TreeMap that allows duplicate keys to be entered. Supports the java.util.Collections interface and an enhanced Iterator. Implemented by using a Red-Black Tree.

Red Setter is a Eclipse plug-in that allows transformations between java objects. You can drag classes from the project tree onto the mapping editor and visually map the fields from one to the other. Currently it is capable of generating Dozer mappings.