red-black-tree - Generic red-black tree library (by Julienne Walker).

  •        81

Generic red-black tree library (by Julienne Walker).

https://github.com/clibs/red-black-tree

Tags
Implementation
License
Platform

   




Related Projects

Red-Black Binary Search Tree - Generic Class in C++

  •    

A well documented, simple and straight-forward implementation of a red-black-binary search tree generic collection. This template class is fully compatible with the C++ standard template library (STL) algorithms. This project is meant for students and c++ programmers who want...

GoLLRB - A Left-Leaning Red-Black (LLRB) implementation of balanced binary search trees for Google Go

  •    Go

GoLLRB is a Left-Leaning Red-Black (LLRB) implementation of 2-3 balanced binary search trees in Go Language. As of this writing and to the best of the author's knowledge, Go still does not have a balanced binary search tree (BBST) data structure. These data structures are quite useful in a variety of cases. A BBST maintains elements in sorted order under dynamic updates (inserts and deletes) and can support various order-specific queries. Furthermore, in practice one often implements other common data structures like Priority Queues, using BBST's.

C# .NET Generic Data structures Library

  •    DotNet

C# .NET Generic Data structures Library like Binary Tree, B-Tree, Red-Black tree implementation. Suggestions/Contributions welcome on what more can be provided in this project.

gods - GoDS (Go Data Structures)

  •    Go

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

DataStructure

  •    

01. Stack 02. Queue 03. List 04. Hash Table 05. Binary Tree 06. Red Black Tree


go-datastructures

  •    Go

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.

STL AVL map/set library

  •    C++

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++).

Towel - Throw in the towel.

  •    CSharp

Note This project has a goal of keeping up-to-date on modern coding practices rather than maintaining backwards compatibility such as targetting the latest non-preview version of .NET and embracing favorable breaking changes ("Semantic Versioning" is not being respected at this time). Towel has Examples included in this repository.

nedtries

  •    C

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

binarytree - Python Library for Studying Binary Trees

  •    Python

Binarytree is a Python library which provides a simple API to generate, visualize, inspect and manipulate binary trees. It allows you to skip the tedious work of setting up test data, and dive straight into practising your algorithms. Heaps and BSTs (binary search trees) are also supported. You may need to use sudo depending on your environment.

FinLib

  •    C++

Math-fi library written in C++ and boost library. This contains a C++ library with severals financial models (Monte carlo, Binary Tree, Black and Schools formulas) and a managed C++ wrapper that allows end user to use library within Excel.

timeout - A script to measure and limit CPU time and memory consumption of black-box processes in Linux

  •    Perl

The timeout script is a resource monitoring program for limiting time and memory consumption of black-boxed processes under Linux. It runs a command you specify in the command line and watches for its memory and time consumption, interrupting the process if it goes out of the limits, and notifying the user with the preset message. The killer feature of this script (and, actually, the reason why it appeared) is that it not only watches the process spawned directly, but also keeps track of its subsequently forked children. You may choose if the scope of the watched processes is constrained by process group or by the process tree.

Evasor - A tool to be used in post exploitation phase for blue and red teams to bypass APPLICATIONCONTROL policies

  •    CSharp

The Evasor is an automated security assessment tool which locates existing executables on the Windows operating system that can be used to bypass any Application Control rules. It is very easy to use, quick, saves time and fully automated which generates for you a report including description, screenshots and mitigations suggestions, suites for both blue and red teams in the assessment of a post-exploitation phase. Download the Evasor project and complie it. Verify to exclude from the project the App.config file from the reference tree.

node-red-nodes - Extra nodes for Node-RED

  •    Javascript

A collection of nodes for Node-RED. See below for a list. All of these nodes are available as individual npm packages. See the list below for the npm package names, or search npm.

Simple Generic Library for C

  •    C

Sglib is a C library freely inspired by Standard Template Library (STL). It defines generic macros and functions for sorting arrays, manipulating lists, sorted lists, double linked lists, hashed containers, and red-black trees.

httpdwatch - apache's log file parser

  •    PHP

A parser that matches httpd access/error logs entries, recognizes spoiled accesses and split entries by date filter and good/bad accesses. Also feeds red and black lists to deny access. In/out paths and file names and spoiled URI can be configured.

paraffin

  •    

A suite of Ada 2012 generics to facilitate iterative and recursive parallelism for multicore systems and provide safer recursion for single and multicore systems. Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees

algorithms - Ruby algorithms and data structures. C extensions

  •    Ruby

Using the right data structure or algorithm for the situation is an important aspect of programming. In computer science literature, many data structures and algorithms have been researched and extensively documented. However, there is still no standard library in Ruby implementing useful structures and algorithms like Red/Black Trees, tries, different sorting algorithms, etc. This project will create such a library with documentation on when to use a particular structure/algorithm. It will also come with a benchmark suite to compare performance in different situations. See LICENSE.md.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.