Search Results for "red black tree animated"
Sort By:
Showing 26 open source projects for "red black tree animated"
View related business solutions-
Streamline everything you do online when you install Shift and access thousands of apps without leaving your browser. Connect all of your Gmail, Outlook, and Office 365 accounts and manage everything from one centralized window. Build out your Shift browser with apps that integrate seamlessly so you have ultra-fast access to all the tools you use to stream, shop, work, browse, and stay connected. Shift brings it all together.
-
ConnectWise CPQ, formerly ConnectWise Sell, is a professional quote and proposal automation software for IT solution providers. ConnectWise CPQ offers a wide range of tools that enables IT solution providers to save time, quote more, and win big. Top features include professional quote or proposal templates, product catalog and sourcing, workflow automation, sales reporting, and integrations with best-in-breed solutions like Cisco, Dell, HP, and Salesforce.
-
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
tsParticles
Easily create highly customizable particles
Easily create highly customizable particles, confetti and fireworks animations and use them as animated backgrounds for your website. Ready to use components available for React.js, Vue.js (2.x and 3.x), Angular, Svelte, jQuery, Preact, Inferno, Solid, Riot and Web Components. A lightweight TypeScript library for creating particles. Dependency-free, browser ready and compatible with React.js, Vue.js (2.x and 3.x), Angular, Svelte, jQuery, Preact, Inferno, Riot.js, Solid.js, and Web Components... -
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 -
ConnectWise PSA (formerly Manage) allows you to stop working in separate systems, and helps you build a more profitable business. No more duplicate data entries, inefficient employees, manual invoices, and the inability to accurately track client service issues. Get a behind the scenes look into the award-winning PSA that automates processes for each area of business: sales, help desk, support, finance, and HR.
-
5
PhotoScape is an all-in-one style photo editor. Major capabilities are: viewer, editor, batch editor, page, combine, animated GIF, print, splitter, screen capture, color picker, rename, raw converter, resizing, brightness, color, or white-balance adjustment, backlight correction, frames, balloons, text, drawing pictures, cropping, filters, red eye removal and blooming. What's new in this version: Version 3.7: Added 'Black & White' and 'Bandicoot' filters (Editor / Home) Added a 'Smart Blur...
-
6
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.
-
7
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 -
8
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 -
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!
-
BrightGauge, a ConnectWise solution, was started in 2011 to fill a missing need in the small-to-medium IT Services industry: a better way to manage data and provide the value of work to clients. BrightGauge Software allows you to display all of your important business metrics in one place through the use of gauges, dashboards, and client reports. Used by more than 1,800 companies worldwide, BrightGauge integrates with popular business solutions on the market, like ConnectWise, Continuum, Webroot, QuickBooks, Datto, IT Glue, Zendesk, Harvest, Smileback, and so many more. Dig deeper into your data by adding, subtracting, multiplying, and dividing one metric against another. BrightGauge automatically computes these formulas for you. Want to show your prospects how quick you are to respond to tickets? Show off your data with embeddable gauges on public sites.
-
10
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... -
11
-
12
rbtree
a smply red black tree achieve
a hot-mind red black tree achieve, just for fun -
13
-
14
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.
-
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
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++).
-
22
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.
-
23
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.
-
24
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.
-
25
A project to develop the Left-leaning Red Black Tree algorithm designed to manage a balanced tree of text word nodes over a series of insertions and deletions. The intent is to provide implementations in as many programming languages as possible.