Awesome Open Source

Programming Languages

Search results for benchmark data structure

data-structure x

10 search results found

Jctools ⭐ 3,388

Cista ⭐ 1,490

Cista is a simple, high-performance, zero-copy C++ serialization & reflection library.

Atomic_queue ⭐ 1,196

C++ lockless queue.

Heapify ⭐ 629

The fastest JavaScript priority queue out there. Zero dependencies.

Libgraph ⭐ 465

A graph data structure library for Elixir projects

Ipfs Log ⭐ 372

Append-only log CRDT on IPFS

Bloom Filter Scala ⭐ 308

Bloom filter for Scala, the fastest for JVM

Gotomic ⭐ 249

Non blocking data structures for Go

Skiplist ⭐ 241

A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist

Imtools ⭐ 218

Fast and memory-efficient immutable collections and helper data structures

Efficient transactional memory in rust.

Fast Skiplist ⭐ 169

A fast, threadsafe skip list in Go

Priority Queue ⭐ 145

A priority queue for Rust with efficient change function.

Fastest Trie structure (Linux & Windows)

Qp Trie Rs ⭐ 86

An idiomatic and fast QP-trie implementation in pure Rust.

An implementation of tree data structure

Go Benchmarks ⭐ 82

Benchmarks for various Go data structures and services

Benchmarking framework for index structures on persistent memory

Immutable Array Prototype ⭐ 59

A collection of Immutable Array prototype methods(Per method packages).

Fast Cartesian ⭐ 56

Fast cartesian product

Lruclockcache ⭐ 54

A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per second.

Node Replication ⭐ 44

An operation-log based approach for data replication.

Bucklescript Benchmark ⭐ 40

A small benchmark comparing Bucklescript to plain JavaScript

B-Tree data structure implementation for iOS / objective-c without using CFTree. Keywords: iOS, tree, algorithms, data structures, binary, b-trees, core data, storage, unit tests, benchmarks.

Skiplist Survey ⭐ 34

A comparison of skip lists written in Go

Grid Benchmark.js ⭐ 29

Benchmark of Javascript grid datastructures

Bitmap Elixir ⭐ 27

Bitmap implementation in Elixir using binaries and integers. Fast space efficient data structure for lookups

Go Immutable ⭐ 27

Immutable data structures for Go

Spatial library for Rust

Safe, fast, and obvious concurrent collections in Rust.

Toolshed ⭐ 24

Arena allocator and a handful of useful data structures

Go Multimap ⭐ 21

Go-Multimap is an implementation of the `multimap` data structure in Go.

Who needs generics when you have go generate.

Efficient Prefix-Sum data structures in C++.

Performance meets elegance.

Benchmarks for set data structures: hash sets, dawg's, bloom filters, etc.

Keap is a heap data structure presenting stable PriorityQueue and stable Keapsort sorting algorithm

Benchmark various data structures / algorithms for string searching.

Skip List ⭐ 10

Pure skip lists in Haskell

Ycsb Storedsbench ⭐ 8

ycsb stored data structure benchmark suite for pmem and dram

Go Expire Map ⭐ 8

Go map with TTLs.

Hse Dsa Lab 2 ⭐ 8

This repository offers studies & implementations of several point-querying algorithms in a 2D plane. The algorithms' performance is benchmarked and compared against one another.

Dotnet Collections Benchmark ⭐ 8

🚀 A comprehensive performance comparison benchmark between different .NET collections.

Faststack ⭐ 8

FastStack is dynamically resizable data structure optimized for fast iteration over the large arrays of similar elements avoiding memory fragmentation (e.g., update and rendering cycles of a game scene).

An insanely fast and lightweight key value database with json and binary support. Provides insanely fast binary protocol server alongside with simple and robust REST service. One database to to rule them all.

Agavltree ⭐ 6

High performance C++ AVL tree implementation with unit tests, examples and benchmarks

Ds_benchmark ⭐ 6

F# Data Structure Benchmarking

Segment Tree in Go

Zero_copy_asio_boost_serialization ⭐ 5

Prototype of zero-copy transmission of data structures with Boost.Asio/Boost.Serialization

Fast persistent immutable Map data-structure for Scala with minimal memory footprint

A lock-free priority queue implementation

Related Searches

Algorithms Data Structure (3,891)

C Plus Plus Data Structure (2,202)

Python Benchmark (1,941)

Java Data Structure (1,708)

Python Data Structure (1,647)

Javascript Data Structure (1,411)

C Plus Plus Benchmark (1,219)

Javascript Benchmark (1,165)

Golang Benchmark (1,080)

Benchmark Benchmarking (1,073)

1-10 of 10 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.