JH-Toolkit v1.4.1
An engineering-oriented C++20 toolkit with duck-typed concepts, static design, async coroutines, and semantic containers — header-only, RTTI-free, and concurrency-friendly.
Loading...
Searching...
No Matches
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
 Njh
 NasyncAggregated entry point for coroutine-based asynchronous facilities
 NconceptsBehavioral concept namespace of the JH Toolkit
 NrangesSemantic pipeline namespace for JH range operations
 NconcAggregated namespace for concurrency-aware resource containers
 NavlInternal AVL-tree implementation namespace for jh::ordered_set and jh::ordered_map
 Nruntime_arr_helperHelper utilities and auxiliary types for jh::runtime_arr
 NmetaAggregated entry point for compile-time metaprogramming utilities
 NpodAggregated entry point for Plain-Old-Data and layout-stable value utilities
 NtypedAggregated entry point for lightweight typing and semantic placeholder utilities
 NserioAggregated entry point for serialization and codec utilities
 NsyncAggregated entry point for synchronization and coordination facilities
 Ccontainer_deductionUser customization point for container element deduction
 ChashBehaviorally deduced hash functor
 Chash< T, std::enable_if_t< jh::concepts::has_std_hash< T > > >Case 1: std::hash<T> is valid
 Chash< T, std::enable_if_t<!jh::concepts::has_std_hash< T > &&jh::concepts::has_adl_hash< T > > >Case 2: ADL-discovered hash(T)
 Chash< T, std::enable_if_t<!jh::concepts::has_std_hash< T > &&!jh::concepts::has_adl_hash< T > &&jh::concepts::has_mbr_hash< T > > >Case 3: Member hash()
 CiteratorForward declaration of jh::iterator<Container>
 Crecursive_registryTrait registry for detecting counting reentrance (recursive)
 Creentrant_registryTrait registry for detecting idempotent (structural) reentrance
 Crecursive_registry< std::recursive_mutex >Specialization for std::recursive_mutex
 Crecursive_registry< std::recursive_timed_mutex >Specialization for std::recursive_timed_mutex
 Cweak_ptr_hashContent-based hash functor for std::weak_ptr<T>
 Cweak_ptr_eqEquality functor for std::weak_ptr<T>
 Cflat_multimapFlat ordered multimap implemented as a sorted contiguous container
 Cimmutable_strImmutable string with optional automatic trimming and thread-safe hash caching
 Catomic_str_hashCustom hash functor for atomic_str_ptr and compatible types
 Catomic_str_eqCustom equality functor for atomic_str_ptr and compatible types
 Cruntime_arrA move-only, fixed-capacity array with runtime-determined length and RAII-based ownership
 Cruntime_arr< bool >Specialized implementation of jh::runtime_arr<bool> — a compact, bit-packed boolean array
 Cgenerator_rangeA range-like wrapper that enables iteration over a generator factory
 Nstd
 Ctuple_size< jh::meta::flatten_proxy< Tuple > >
 Ctuple_element< I, jh::meta::flatten_proxy< Tuple > >
 Ctuple_size< jh::pod::tuple< Ts... > >
 Ctuple_element< I, jh::pod::tuple< Ts... > >
 Ctuple_size< jh::pod::pair< T1, T2 > >
 Ctuple_element< I, jh::pod::pair< T1, T2 > >
 Ctuple_size< jh::pod::array< T, N > >
 Ctuple_element< I, jh::pod::array< T, N > >
 Ctuple_size< jh::ranges::zip_reference_proxy< Elems... > >
 Ctuple_element< I, jh::ranges::zip_reference_proxy< Elems... > >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... >, std::tuple< Us... > >
 Ccommon_reference< std::tuple< Ts... >, jh::ranges::zip_reference_proxy< Us... > >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... >, jh::ranges::zip_reference_proxy< Us... > >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... > &&, std::tuple< Us... > & >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... > &, std::tuple< Us... > & >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... > &&, std::tuple< Us... > && >
 Ccommon_reference< std::tuple< Ts... > &, jh::ranges::zip_reference_proxy< Us... > && >
 Ccommon_reference< jh::ranges::zip_reference_proxy< Ts... > &&, jh::ranges::zip_reference_proxy< Us... > & >