There are 4 repositories under skiplist topic.
c common functions library extracted from my open source project FastDFS. this library is very simple and stable. functions including: string, logger, chain, hash, socket, ini file reader, base64 encode / decode, url encode / decode, fast timer, skiplist, object pool etc. detail info please see the c header files.
A C utility library and persistent key/value storage engine
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
Go library for protobuf compatible sstables, a skiplist, a recordio format and other database building blocks like a write-ahead log. Ships now with an embedded key-value store.
🍀 c++ standalone header-only basic library. || c++头文件实现无第三方依赖基础库
skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.
skip list with rank, code less than z_set in redis
High-Performance C++ Data System
A comparison of skip lists written in Go
Simple Relational Database System Implemented in Golang
advanced data structure in Pascal, include B-Tree,B+-Tree,B*-Tree,T-Tree,HashMap,priority queue,red-black-Tree,AVL-tree,Quad-Tree,SkipList,Sortable Single Linklist,Sort Function,LockFreeQueue,nth_element,M-tree,PDQSort
Pure python implementation of a skiplist data structure
Fast AVL Trees & WAVL Trees in Java
golang实现常用集合
🌳 A tiny skiplist based log-structured merge-tree written in Rust.
A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.
A Concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer.
A swift implementation of concurrent (thread-safe) skip list.
A Simple Relational Database implemented in Golang
基于内存的高性能数字货币交易所撮合引擎核心
The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operations can be performed together across multiple threads. The implementation uses hand-over-hand locking to access nodes for writing and atomic variables while reading (no locks needed while reading).
本项目使用C++实现基于跳表实现的轻量级键值型存储引擎,其主要功能有:插入数据、查询数据、删除数据、数据展示、数据库大小、数据库清空、数据落盘以及文件加载数据。