:books: collection of JavaScript and TypeScript data structures and algorithms for education purposes. Source code bundle of JavaScript algorithms and data structures book

Commonly used data structures for Swift

A library of generic data structures for the C language.

Data structure and algorithm library for go, designed to provide functions similar to C++ STL

Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go

A javascript standard data structure library which benchmark against C++ STL.

Fast ring-buffer deque (double-ended queue)

Easy to use, modular, header only, macro based, generic and type-safe Data Structures in C

HugAi是由Springboot Vue2 elementUI集成各大AI大模型平台开发的智能问答助手，文本对话模型支持流式响应，现已接入OpenAi、chatGpt、讯飞星火、文心一言、Ollama，以及主流AI绘图Midjourney、Stable Diffusion，完全开源搭建属于自己的AI聊天室

A highly optimized double-ended queue

TypeScript & Javascript Data Structures

This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.

Double-ended queue

Swift Collection Data Structures Library

🎀 Just the cutest and tiniest queue/deque implementation!

Contains some useful custom Data-Structures/Containers & Algorithms, developed during my 3rd semester at University.

Persistent Deque for Clojure(Script)

Accessibility auditing for Vue.js 3 applications using axe-core

Computer science data structures and algorithms implementation from scratch

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.

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

A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

Scala implementation of data structures from Chris Okasaki's book

Algorithms and Data Structures, solutions to common CS problems.

C++ code for "A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque"

Numpy ring buffer at a fixed memory address to allow for significantly sped up numpy, sigpy, numba & pyFFTW calculations.

Java data structures for primitive and/or Object items

No description provided.

Data structures for Redis

JavaScript implementation of a double-ended queue