Start Here

This is the documentation home for ThreadSafeCollections-FP 0.8.9, released on 2026-08-24.

Project README · Quick Start · API cheat sheet · Roadmap · Changelog

Choose a path#

  • New to the project: complete the

five-minute first run, then follow the learning path.

  • Adding the library to an application: read

Installation, choose a collection below, and review the thread-safety model.

  • Building or contributing: use the verified commands in

Building and verification.

  • Looking up a declaration: open the generated

API cheat sheet, then use the collection guide for behavior and examples.

Collections#

GuideUse it when you need
ListIndexed storage, sorting, searching, or range updates
DequeQueue or stack operations at both ends
DictionaryKey/value lookup, updates, or snapshots
Hash setUnique values, membership, or set operations

Concepts worth reading early#

lifetime, collection iteration, and manual-lock limits

— the synchronization model, the decided iterator policy, and where each guarantee is tested

  • Hashing — how the dictionary and hash set choose and

use hash functions, including the XXHash32 string hash

  • Recipes — complete, compiled programs for common tasks

Examples#

The repository contains 16 buildable example programs. A short progression is:

  1. SimpleNumberList
  2. SimpleDeque
  3. SimpleHashSet
  4. DictionaryIterator
  5. SimpleShoppingCart
  6. ChatMessageQueue

See Building all examples for the complete inventory and exact commands, and the Learning Path for the recommended order.

Historical records#

The documents below are preserved as snapshots of a release, benchmark, investigation, or design discussion. They may describe older APIs, measurements, toolchains, or conclusions and should not be treated as current setup or API guidance.

Release notes:

Development and design records:

Test snapshots:

FPC 3.2.2 Win64 with run-tests.ps1, including the concurrency hardening suites

To assess the current checkout, run the tests yourself using the test commands.