Programming-ReferenceOpen repository of programming topic for reverse engineering purpose.
Stars: ✭ 25 (-89.71%)
fixie-trieCompact tries for fixed-width keys
Stars: ✭ 23 (-90.53%)
gmapheterogenous Map over a GADT
Stars: ✭ 40 (-83.54%)
the-entitytainerA single header library for managing game entity hierarchies.
Stars: ✭ 31 (-87.24%)
Swift-X-Algorithms🔨 Algorithms & Data Structures implemented in Swift X. `let X = 5.0`
Stars: ✭ 22 (-90.95%)
ds🔗 Common Data Structures and Algorithms
Stars: ✭ 40 (-83.54%)
hypergraphHypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Stars: ✭ 205 (-15.64%)
data-structure-tsBasic data structures and popular algorithms implemented in Typescript.
Stars: ✭ 14 (-94.24%)
AlgorithmsJava implementation for Introduction to Algorithms book.
Stars: ✭ 58 (-76.13%)
dask-awkwardNative Dask collection for awkward arrays, and the library to use it.
Stars: ✭ 25 (-89.71%)
CS basicsMy CS learning : algorithm, data structure, and system design | #SE
Stars: ✭ 21 (-91.36%)
array-keyed-mapJS datastructure, like Map, but the keys are arrays
Stars: ✭ 29 (-88.07%)
playgroundA place to play programming
Stars: ✭ 21 (-91.36%)
nanostackSmall middleware stack library
Stars: ✭ 39 (-83.95%)
js-symbol-treeTurn any collection of objects into its own efficient tree or linked list using Symbol
Stars: ✭ 86 (-64.61%)
linked-blocking-multi-queueA concurrent collection that extends the existing Java concurrent collection library, offering an optionally-bounded blocking "multi-queue" based on linked nodes.
Stars: ✭ 41 (-83.13%)
CPTH🌟 Competitive Programming Template Headers | With documentation, CI tests and Codecov
Stars: ✭ 23 (-90.53%)
trieTrie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (-65.43%)
CPCompetitive Coding
Stars: ✭ 25 (-89.71%)