Search Results for "red black tree java"

... are linked each together, in other words it is a network of Stars, as a constellation is. Linked AMAS Stars combine their power to generate the attack. They cannot die but they need to reload themselves to generate a new attack. Defense Stars have Defense Points (DP). When a Star does not have enough DP to survive, it can either simply die, transform to powerful (yet weak) Stars or explode becoming a Black Hole! It depends on the type of star (red giant, blue giant, yellow dwarf, white dwarf...).

"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...

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

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.