Click here to Skip to main content

Collections

Great Reads

by FatCatProgrammer
Balanced Binary Search Tree (BST) (Search, Delete, PrintInOrder, PrintPreOrder, PrintPostOrder,DepthFirst, BreadthFirst, BalanceTree)
by Sike Mullivan
Shows how to do XML serialization on a collection of multiple types when the types are not known.
by Qwertie
SparseAList and some AList benchmarks
by Qwertie
In the netherworld between T[] and List

Latest Articles

by Qwertie
The A-list is an all-purpose list, a data structure that can support most standard list operation in O(log n) time and does lots of other stuff, too
by Qwertie
In the netherworld between T[] and List
by Qwertie
SparseAList and some AList benchmarks
by Eric Ouellet
An implementation of of a multi-threaded ObservableCollection.

Research Library

New and composite on-premises applications need a complex array of...
Feeling like all the top tech talent is at a party and you’re not...
Use these flashcards along with the popular open source integration...
Read this paper to learn how you can create an intelligent, integrated...

Discussions

by Eric Ouellet on Article "Asynchronous Multi-threaded...
by netizenk on Article "Asynchronous Multi-threaded...
by Qwertie on article "InternalList: the low-level List"
by SledgeHammer01 on article "InternalList: the low-level List"
by Qwertie on article "InternalList: the low-level List"

All Articles