Awesome Open Source
Search
Programming Languages
Languages
All Categories
Categories
About
Search results for performance data structure
data-structure
x
performance
x
4 search results found
Jsonparser
⭐
5,223
One of the fastest alternative JSON parser for Go that does not require schema
Datatable
⭐
1,763
A Python package for manipulating 2-dimensional tabular data structures
Dart
⭐
1,642
All Algorithms implemented in Dart
Nearestneighbors.jl
⭐
379
High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
Excaliburhash
⭐
279
Excalibur Hash is a high-speed hash map and hash set, ideal for performance-critical uses like video games
Imtools
⭐
218
Fast and memory-efficient immutable collections and helper data structures
Extcore
⭐
174
An extended core library for F#.
Quitnow Cache
⭐
111
⌛ A collection to store data for a given time
Nitro
⭐
104
A high performance in-memory index storage engine
Go Tdigest
⭐
102
A T-Digest implementation in golang
Splay Tree
⭐
101
Fast splay-tree data structure
Stroika
⭐
88
Modern C++ made easy
Go Benchmarks
⭐
82
Benchmarks for various Go data structures and services
Libdynamic
⭐
62
High performance utility library for C
Fast Cartesian
⭐
56
Fast cartesian product
Deque
⭐
40
Package deque implements a very fast and efficient general purpose queue/stack/deque data structure that is specifically optimized to perform when used by Microservices and Serverless services running in production environments. https://godoc.org/github.com/ef-ds/deque
Pygm
⭐
39
🐍 Python library implementing sorted containers with state-of-the-art query performance and compressed memory usage
Big O Performance
⭐
35
A simple html app to demonstrate performance costs of data structures
Erlbench
⭐
34
Erlang Performance Measurements
Micromap
⭐
33
📈 A much faster (for very small maps!) alternative of Rust HashMap, which doesn't use hashing and doesn't use heap
Lazy Tree With Zipper
⭐
27
Lazy rose tree (multiway tree) with zipper. In Elm
Lightgrid
⭐
24
Header-only, fast implementation of a grid for spatial lookups
Pawlib
⭐
17
Performance meets elegance.
Sled
⭐
16
A high performance lock free map type for go.
Baguette
⭐
14
High-performance concurrency and parallelism in Rust.
Big Cartesian
⭐
13
Cartesian product for big inputs
Leetcode Solutions And Data Structure Analysis
⭐
13
A collection of LeetCode novel solutions that is implemented in Java. An overview about data structure for interview questions
Collections
⭐
12
High performance and low latency Exchange Collections written in Java
Eytzinger
⭐
11
Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
Golds
⭐
10
Go data structures
Push_swap
⭐
9
A highly efficient sorting algorithm on two stacks
Fsharpadvent2016
⭐
9
F# Advent repo for my blog on persistent hash map 2016-12-10
Dotnet Collections Benchmark
⭐
8
🚀 A comprehensive performance comparison benchmark between different .NET collections.
Hashing Containers
⭐
8
Hashing-based container datastructures for Elm
Electra
⭐
7
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.
Hhprolog
⭐
6
hitchhiker Prolog - an implementation of a novel virtual machine
Smap
⭐
5
Fast persistent immutable Map data-structure for Scala with minimal memory footprint
Sharpcollections
⭐
5
A set of specialized high-performance data structures, not available in the framework
Related Searches
Algorithms Data Structure (3,891)
C Plus Plus Data Structure (2,202)
Javascript Performance (1,810)
Java Data Structure (1,708)
Python Data Structure (1,647)
Javascript Data Structure (1,411)
Data Structure Leetcode (630)
1-4 of 4 search results
Privacy
|
About
|
Terms
|
Follow Us On Twitter
Copyright 2018-2024 Awesome Open Source. All rights reserved.