Buckets-JS - A complete, fully tested and documented data structure library written in pure JavaScript

•    Javascript

---

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmap

leakage - 🐛 Memory leak testing for node.

•    Javascript

---

Memory leak testing for node. Javascript memory footprinting using your favorite test runner.

memory-leak testing node v8 heap

mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

ngraph.path - Path finding in a graph

•    Javascript

---

Fast path finding for arbitrary graphs. Play with a demo or watch it on YouTube. If you want to learn how the demo was made, please refer to the demo's source code. I tried to describe it in great details.

graph pathfinder heuristic heap finder algorithm ngraph path find astar a-star pathfinding

typescript-collections - A generically typed set of collections for use with TypeScript

•    TypeScript

---

It is a complete, fully tested data structure library written in TypeScript. This project uses TypeScript Generics so you need TS 0.9 and above.

typescript generics data structures collections linked list dictionary default multi binary search tree key value stack queue set bag heap priority array

binarytree - Python Library for Studying Binary Trees

•    Python

---

Binarytree is a Python library which provides a simple API to generate, visualize, inspect and manipulate binary trees. It allows you to skip the tedious work of setting up test data, and dive straight into practising your algorithms. Heaps and BSTs (binary search trees) are also supported. You may need to use sudo depending on your environment.

python3 python2 python-3 python-2 python-library binary-trees binary-tree interview-practice interview learning practise python-3-5 algorithm data-structures data-structure heap heaps bst binary-search-tree

algodeck - An Open-Source Collection of 200+ Algorithmic Flash Cards to Help you Preparing your Algorithm & Data Structure Interview 💯

•    

---

Algo Deck is an open-source collection of 200+ algorithmic flash cards. It helps you preparing and succeeding in your algorithm & data structure interview. The code examples are in Java.

tree algorithm linked-list stack queue math algorithms graph array recursion bit-manipulation data-structures complexity sorting-algorithms heap interview-practice dynamic-programming hashtable greedy-algorithms

heap-exploitation - This book on heap exploitation is a guide to understanding the internals of glibc's heap and various attacks possible on the heap structure

•    C

---

This short book is written for people who want to understand the internals of 'heap memory', particularly the implementation of glibc's 'malloc' and 'free' procedures, and also for security researchers who want to get started in the field of heap exploitation.The first section of the book covers and in-depth, yet concise, description about heap internals. The second section covers some of the most famous attacks. It is assumed that the reader is unfamiliar with this topic. For experienced readers, this text might be good for a quick revision.

book heap security

dsjslib - A library implementing several standard data structures and utilities, in JavaScript

•    Javascript

---

This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filter

jemalloc - Scalable, Concurrent, Malloc Implementation

•    C

---

jemalloc is a general purpose malloc(3) implementation that emphasizes fragmentation avoidance and scalable concurrency support. It is intended for use as the system-provided memory allocator, as in FreeBSD's libc library, as well as for linking into C/C++ applications. jemalloc provides many introspection, memory management, and tuning features beyond the standard allocator functionality.

malloc memory-allocator memory heap

OHC - Java large off heap cache

•    Java

---

Off-Heap concurrent hash map intended to store GBs of serialized data. It has optional per entry or default TTL/expireAt, Entry eviction and expiration without a separate thread, Capable of maintaining huge amounts of cache memory, Suitable for tiny/small entries with low overhead using the chunked implementation.

cache off-heap heap

DebugHelpers

•    DotNet

---

DebugHelpers is/will be a collection of utilities that work along with other debugging tools such as WinDbg and CDB with a focus on managed .NET debugging. The first utility is the HeapView. HeapView enables you to easily analyze multiple results of the SOS !DumpHeap command ...

cdb debugging dump dump-analysis dumpheap heap

NDataStructure

•    CSharp

---

A library providing a handful of useful data structures omitted from the .NET framework.

binarytree btree data-structures graph heap linked-list

strongloop - StrongLoop: Enterprise Node to Power the API Economy

•    Javascript

---

slc is the command shell for the StrongLoop Process Manager, strong-pm, and the LoopBack framework.It includes both a CLI and a GUI.

backend loopback mobile platform strongloop alerts analytics agent apm build bundle cluster config dependencies deploy devops event-loop forever git heap heroku logging mbaas manager master memory metrics monitoring nodeops npm npmrc openshift ops performance pm process profiler profiling registry response runner service slc slowest-functions streams strong-agent strong-cli strong-cluster-control strong-pm strong-supervisor strongops supervisor switch time upstart

LearningMasteringAlgorithms-C - Mastering Algorithms with C 《算法精解：C语言描述》源码及Xcode工程、Linux工程

•    C

---

Mastering Algorithms with C 《算法精解：C语言描述》源码及Xcode工程、Linux工程

mastering-algorithms-c algorithm xcode tree graph list linked-list set lz77 haffman queue sort heap stack bfs dfs bistree rsa des

FastPriorityQueue.js - a fast heap-based priority queue in JavaScript

•    Javascript

---

Fast heap-based priority queue in JavaScript

priority-queue heap binary-heap data-structure performance

heap - Heap priority queue written in C, licensed under a BSD license

•    C

---

A heap abstract data type implemented within an array.Written in C with a BSD license.

heap priority-queue queue

heapunit - Heap introspection for test puposes

•    Java

---

HeapUnit parent pom

testing heap

StablePriorityQueue.js - A stable heap-based priority queue in JavaScript

•    Javascript

---

In a priority queue, you can...In practice, "quickly" often means in logarithmic time (O(log n)).

heap binary-heap data-structure priority-queue

strong-agent - Profile, control, and monitor Node.js processes and clusters

•    Javascript

---

Profile and control Node.js processes and clusters using StrongOps.NOTE: This project is not released under an open source license. We welcome bug reports as we continue development, but we are not accepting pull requests at this time.

apm monitoring performance profiling heap event-loop analytics metrics alerts profiler response time memory slowest-functions