skip-list

Here are 39 public repositories matching this topic...

Softmotions / iowow

Multipurpose C library and persistent key/value storage

c freebsd database osx nosql key-value kvstore persistent-data-structure persistent-storage skiplist c11 database-engine key-value-database embedded-c ejdb key-value-store kv-store android-database skip-list

Updated
C

zrwusa / data-structure-typed

Sponsor

Star

TypeScript & Javascript Data Structures

javascript typescript avl-tree linked-list leetcode graph trie priority-queue hash-map data-structures binary-tree red-black-tree heap segment-tree deque skip-list zero-dependencies tree-map sorted-collections tree-set

Updated
TypeScript

👁 extra-collections

Anwarvic / extra-collections

Sponsor

Star

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

avl-tree linked-list stack queue trie data-structures binary-search-tree red-black-tree heap tree-structure bst radix-trie deque doubly-linked-list circular-linked-list treap skip-list splay-tree suffix-trie

Updated
Python

pspanoudakis / System-Programming-Projects

Star

System Programming projects on Multiprocessing, Multithreading, FIFO Pipes, Network Sockets, Bash Scripting & building Data Structures

sockets bloom-filter processes pipes system-programming bash-scripting semaphores skip-list mutlithreading

Updated
C++

Vaggelis-Arg / C-data-structures

Star

Basic data structures in C with useful comments and explanations

avl-tree stack queue vector bloom-filter priority-queue data-structures red-black-tree abstract-data-types double-linked-list separate-chaining skip-list double-hashing

Updated
C

asimba / qbp

Star

Simple LZSS+RLE+RC32 compression algorithm realization (C/C++/Rust/Go).

c go rust golang compression cpp rle lempel-ziv ringbuffer arithmetic ring-buffer run-length-encoding lzss range-coder rle-compression-algorithm runlengthencoding skip-list rc32

Updated
C

mrsladoje / HundDB

Star

A complete LSM tree key-value storage engine written in Go. Implements SSTables, memtables, and write-ahead logging with a modern Wails and React desktop interface

react golang hll sstable bloom-filter hashmap iterative-methods merkle-tree btree lru-cache key-value-database disk-usage lsm-tree write-ahead-log skip-list wails prefix-scan memtable range-scanner token-bucket-rate-limiter

Updated
Go

UnixJunkie / slist

Star

Skip list implementation in OCaml

set find ocaml-library delete insert set-operations skip-list randomized-data-structure randomized-binary-search-trees

Updated
OCaml

TmLev / skipper

Star

Various skip list implementations

cmake cpp ci modern-cpp clang-format clang-tidy google-benchmark skip-list catch2 modern-cmake cmake-format

Updated
C++

zhuichao001 / hawker

Star

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

hashing algorithm avl-tree graphics lru bloom-filter astar edit-distance permutation lock-free union-find lfu skip-list bplus-tree

Updated
C++

taylordotfish / skippy

Star

Highly flexible worst-case O(log n) intrusive skip list

rust list tree data-structure skip-list intrusive

Updated
Rust

A Skip List is a Probabilistic Data Structure Allowing for Efficient Searching, Insertion, and Deletion of Elements Within a Sorted Sequence, Mostly used with Balanced Search Trees (AVL, Red-Black) Due to its Comparable Average-Case Performance (O log n)

avl-tree skip-list parsonlabs