stlab 3.0.0
Modern, modular C++ algorithms, data structures, and concurrency primitives
Loading...
Searching...
No Matches
Reference
Here is a list of all topics with brief descriptions:
 forestForest (tree-of-sequences) iterators, ranges, and algorithms
 forest_algorithmsHigher-level forest algorithms (stlab::forests)
 functionalReference unwrapping and related functional helpers
 memorySmall memory-related utilities (make_weak_ptr)
 scopeRAII scope helpers (scope, mutex guard)
 utilityType utilities (move, copy, static_max, etc.)
 versionLibrary version number macros
 algorithmHeaders under stlab/algorithm/
  reverseReverse algorithms for iterators and intrusive forward sequences
 concurrencyHeaders under stlab/concurrency/
  awaitBlocking wait helpers for futures (await, etc.)
  channelProcess-oriented channels (sender/receiver) and related types
  futureFutures, packaged tasks, and coroutine integration
  progressProgress tracking wrapper for concurrent tasks
  ready_futureFactory functions for already-resolved futures
  serial_queueSerial executor and scheduling modes built on futures
  traitsType traits and detection helpers used by the concurrency library
  tuple_algorithmTuple algorithms and utilities (including for future combiners)
 iteratorHeaders under stlab/iterator/
  conceptsIterator concepts when the compiler supports C++20 concepts
  set_nextIntrusive forward/bidirectional iterator helpers (set_next, splice, skip)
 testHeaders under stlab/test/
  modelTest-only instrumented types for verifying move/copy/destroy behavior