The following data structures are as of the latest release (7.1.0) provided (but note support varies by processor, as atomic support varies by processor); * Binary Tree (add-only, unbalanced) * Freelist * Hash (add-only) * List (add-only, ordered, singly-linked) * List (add-only, singly-linked, unordered) * PRNG * Queue (bounded, many-producer, many-consumer) * Queue (bounded, single-producer, single-consumer) * Queue (unbounded, many-producer, many-consumer) * Ringbuffer * Stack

Includes: * Object-based software transactional memory * Multi-word compare-and-swap * Range of search structures (skip lists, binary search trees, red-black trees).