some standard containers, safe, nogc

An unrolled linked list is a linear data structure that is a variant on the linked list. Instead of just storing 1 element at each node, unrolled linked lists store an entire array at each node.

Normal and Unrolled Linked List implementation, testing, and benchmarking in C11.

A (mostly) POSIX program that scans intervals for vampire numbers

Convert between BMP565 image and RGB565 pixmap.

High-performance implementation of unrolled linked list data structure in C++

PLALLOC - dynamic linear pool allocator (ULL Based)

A Java implementation of an unrolled linked list (ChunkyList), with an unsynchronized and a thread-safe variant backed by a ReentrantReadWriteLock. Features configurable growing and shrinking strategies, a native Spliterator for efficient parallel streams, and a reorganize() operation to compact sparsely filled chunks.

Multi-platform library of containers and their associated algorithms. This is very much a work in progress; especially the readme.

Unrolled Linked List in pure Go

Assignment 1 of Data structure and Algorithm

UnrolledLinkedList STL container

Segmented List