Search Results for "red black tree java"
Sort By:
Showing 29 open source projects for "red black tree java"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
Ship AI Apps Faster with Vertex AIShip AI apps and features faster with Vertex AI—your end-to-end AI platform. Access Gemini 3 and 200+ foundation models, fine-tune for your needs, and deploy with enterprise-grade MLOps. Build chatbots, agents, or custom models. New customers get $300 in free credit.
-
1
VS Code Java Dependency
Manage Java projects in Visual Studio Code
This lightweight VS Code extension enhances the Java Project Explorer by displaying dependency trees and JARs. It complements Red Hat’s Java Language Support and simplifies dependency management. -
2
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. -
3
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. -
4
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 -
Deploy Apps in Seconds with Cloud RunCloud Run is the fastest way to deploy containerized apps. Push your code in Go, Python, Node.js, Java, or any language and Cloud Run builds and deploys it automatically. Get fast autoscaling, pay only when your code runs, and skip the infrastructure headaches. Two million requests free per month. And new customers get $300 in free credit.
-
5
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.
-
6
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 -
7
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 -
8
Pulsar Game
Pulsar is a card video game using Stars as gameplay key elements.
Pulsar is a card video game. A card represents a star constellation, and thus contains stars that can be used in two ways : * Attack Stars (also called AMAS Stars) will generate an attack to flip opponents cards (and take them) ; * Defense Stars will protect the card from opponents. It is also the interface with other cards to begin a battle. The inner gameplay is much more complex as Cards and Stars can evolve, be damaged. AMAS Stars are "AutoMated Attack System" Stars. Stars are... -
9
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!
-
Cut Cloud Costs with Google Compute EngineSave on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
-
10
rbtree
a smply red black tree achieve
a hot-mind red black tree achieve, just for fun -
11
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 doesnt use a stack, so you can start traversing from any node Nodes are public and can use them to move tru collection line in a LinkedList (moving takes O(1) for half of nodes and O(logN) in worst case) Modifying the Tree doesnt invalidate the iterators -
12
-
13
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... -
14
-
15
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.
-
16
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.
-
17
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.
-
18
-
19
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.
-
20
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.
-
21
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.
-
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
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
-
24
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.
-
25
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.
