Search Results for "red black tree java"
Sort By:
Showing 28 open source projects for "red black tree java"
View related business solutions-
We design our technology to make workforce management easier. APS offers core HR, payroll, benefits administration, attendance, recruiting, employee onboarding, and more.
-
Whether natural disaster, cyberattack, or plain-old human error, data can disappear in the blink of an eye. ConnectWise BCDR (formerly Recover) delivers reliable and secure backup and disaster recovery backed by powerful automation and a 24/7 NOC to get your clients back to work in minutes, not days.
-
1
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
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... -
2
avldb
Simple struct storage system, database library and engine.
Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct. -
3
CL4fpc
Containers library for fpc
Some generic container library Red-Black tree, AVL tree, Decart tree, Weight-balanced tree - persistent and nonpersistent version HashMaps, FIFO, ResPool and other -
4
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.
-
YesEvents offers a comprehensive suite of services that spans the entire conference lifecycle and ensures every detail is executed with precision. Our commitment to exceptional customer service extends beyond conventional boundaries, consistently exceeding expectations and enriching both organizer and attendee experiences.
-
5
libcollections
a library that provides collections implementations for your C code
libcollections is a library that provides a reutilisable and comprehensive set of collections to your C code. Implemented so far: - linked list, - queue - stack To be implemented: - vector (arraylist) - red black tree - set - map -
6
redblackweb
A red-black tree HTML5 showcase
A red-black tree HTML5 showcase. Contains: => the demo page => the redblack.js implementation of the redblack tree -
7
Pulsar Game
Pulsar is a card video game using Stars as gameplay key elements.
... 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...). -
8
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!
-
9
Threaded Red Black Tree in C#
Threaded Red Black Tree in C#
A Threaded Red Black Tree in C# (cand be used both like a SortedSet and LinkedList) Implementing TopDown Deletion and TopDown Insertion mainly from http://eternallyconfuzzled.com with few personal flavours Time Complexity for inserting and deleting N nodes is O(NlogN) (both are 0-10% faster than SortedSet ) Time Complexity for Exist, Find, MoveNext is O(logN) Time complexity for Traversing N nodes is O(N) ( 30-40% faster than SortedSet because of using tree threads) Traversing in sorted order... -
As your users rely more and more on Cloud and Internet-based technologies, reliable internet connectivity becomes more and more important to your business. With Bigleaf’s proven SD-WAN architecture, groundbreaking AI, and DDoS attack mitigation, you can finally deliver the reliable internet connectivity your business needs without the limitations of traditional networking platforms. Bigleaf’s Cloud Access Network and plug-and-play router allow for limitless control to and from anywhere your traffic needs to go. Bigleaf’s self-driving AI automatically identifies and adapts to any changing circuit conditions and traffic needs—addressing issues before they impact your users. Bigleaf puts you in the driver’s seat of every complaint and support call with full-path traffic and network performance data, delivered as actionable insights, reports, and alerts.
-
10
-
11
rbtree
a smply red black tree achieve
a hot-mind red black tree achieve, just for fun -
12
-
13
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.
-
14
That Random RPG
A 2D RPG written in Java and OpenGL
"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: http... -
15
Delphi class which implements an associative array. Keys can be strings or integers. Keys are stored in Red-Black tree. Array can contain TObjects or it descendants.
-
16
RED searches and deletes empty directories recursively below a given start folder and shows the result in a well arranged tree. Further you can create some custom rules for keeping and deleting folders. Empty files in directories can also be ignored.
-
17
-
18
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.
-
19
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
-
20
A C# Project Suite that contains an implementation of a Red-Black-Tree structure as well as a pretty Graphical frontent to play around with.
-
21
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
-
22
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++).
-
23
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.
-
24
Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.
-
25
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.