| Cadam_callback_suite_t | Callback class for the Adam parser |
| Caggregate_pair< T1, T2 > | |
| Caligned_storage< T > | |
| Calways_true< T > | |
| Casl_json_helper_t | A utility class can be used with json_parser and json_generator to round trip JSON data through the common ASL data structures |
| Cassign | |
| Cauto_resource< X, Traits > | The template class auto_resource< X, Traits > provides similar functionality to unique_ptr for resources for which the pointer is opaque refered to by a non-pointer type |
| Cbinary_compose< F, G, H > | |
| Cbitwise_and< T > | |
| Cbitwise_or< T > | |
| Cbitwise_xor< T > | |
| Cblock_tag | |
| Ccontiguous_tag | |
| Ccancellation_token | |
| Ccancellation_token_source | |
| Ccapture_allocator< T > | |
| Ccapture_allocator< T > | |
| Ccapture_allocator< void > | |
| Ccapture_allocator< void > | |
| Cchain< ArgStreamFirst, ArgStreamSecond > | Chain 2 arg_streams together by calling the first stream until depleted, then calling the second |
| Cchild_adaptor< Forest > | |
| Cclosed_hash_set< T, KeyTransform, Hash, Pred, A >::header_t::compact_header_t | |
| Cvector< T, A >::header_t::compact_header_t | |
| Ccompare_members_t< T, R, Compare > | Utility class for adobe::compare_members |
| Cconcurrent_queue< T > | |
| Cconstructor< T > | |
| Ccounting_output_iterator | |
| Cdancing_links | An optimized implementation of the 1-cover problem [class under review] |
| Cdec< T > | Operator-- wrapped in a function object |
| Cdelete_array | A function object for type T that invokes delete[] on an array of T |
| Cdelete_ptr | A function object for type T that invokes delete on a T* |
| Cdelete_ptr_trait< T > | |
| Cdelete_ptr_trait< T * > | |
| Cdelete_ptr_trait< T(*)[]> | |
| Cdepth_fullorder_cursor | An iterator-like type for the depth-tracked traversal of a forest |
| Cdictionary_arg_stream_base< Dictionary, InputRange, NoThrow > | |
| Cdictionary_arg_stream< Dictionary, InputRange, std::nothrow_t > | |
| Cdictionary_arg_stream< Dictionary, InputRange, NoThrow > | Dictionary_arg_stream implements the arg_stream interface |
| Cdictionary_arg_stream< Dictionary, InputRange, std::nothrow_t > | |
| Cempty_base< Derived > | |
| Cempty_ptr< T > | |
| Cempty_ptr< T * > | |
| Cempty_ptr< T(*)[]> | |
| Cequal_to | |
| Cequality_comparable | |
| Cpoint_2d< int > | |
| Cclosed_hash_set< std::pair< Key, T >, get_element< 0 >, Hash, Pred, A > | |
| Cclosed_hash_map< Key, T, Hash, Pred, A > | A hash based associative container |
| Cattribute_set_t | An associated array based on adobe::token_range_t. A utility class for the xml_parser_t |
| Ccircular_queue< T > | A queue with a fixed capacity which supports putting back elements. Pushing more elements than there is capacity will pop the least recently pushed elements |
| Cextents_t | An intrinsic geometry class for objects with a graphical representation |
| Cextents_t::slice_t | A class containing element geometry for a single orientation |
| Cpoint_2d< T > | |
| Cselection_t | A container used to represent a linear boolean selection |
| Cany_regular_t | A runtime polymorphic type similar to std::any which can hold any type which models Regular |
| Cclosed_hash_set< T, KeyTransform, Hash, Pred, A > | A hash based associative container |
| Cclosed_hash_map< name_t, any_regular_t > | |
| Cequivalent< O > | |
| Ceve_callback_suite_t | |
| Cexception | STL class |
| Cno_more_args | |
| Ctask_canceled | |
| Cbad_cast | STL class |
| Cbad_cast | An exception class thrown during ASL failures to cast |
| Clogic_error | STL class |
| Cstream_error_t | An exception class thrown during parsing failures |
| Cextents_slices_t | A utility class for referencing the two slices of a extents_t |
| Ceve_t | Eve engine |
| Cextents_t | An intrinsic geometry class for objects with a graphical representation |
| Clayout_attributes_t | Layout data interface from the client to the engine |
| Cplace_data_t | Layout data interface from the engine to the client |
| CF | |
| Cpoly< F > | poly<foo> will be a runtime polymorphic value type wrapper modelling a concept represented by foo |
| CF | |
| Cpoly< F > | poly<foo> will be a runtime polymorphic value type wrapper modelling a concept represented by foo |
| Cname_t::fast_compare | |
| Cfilter_fullorder_cursor | An iterator-like type for fullorder (pre- and post-order) traversal of a forest |
| Cforest< T > | A homogeneous hierarchical structure class |
| Cfunction_not_present | |
| Cgenerator_t< Result > | A function object for value generation within a domain |
| Cgenerator_t< T > | |
| Csequence_t< T > | A function object for sequence generation within a domain |
| Cget_element< I, T > | |
| Cget_element< I, void > | |
| Cgreater | |
| Cgreater_equal | |
| Cwith_transform< ArgStream, Transformer >::has_entry_if_has_inverse_lookup< Class, R, bool > | |
| Cwith_transform< ArgStream, Transformer >::has_entry_if_has_inverse_lookup< Class, R, true > | |
| Chas_get_dictionary_entry_function< Dictionary, Key, R > | |
| Chas_get_dictionary_entry_template< Dictionary, Key > | |
| Cwith_transform< ArgStream, Transformer >::has_inverse_lookup< Class > | |
| Cwith_transform< ArgStream, Transformer >::has_transform< Class, R > | |
| Chas_type_type< T > | T::type a valid type (or a compile error?) |
| Chash< adobe::name_t > | |
| Chash< adobe::static_name_t > | |
| Chash_index< T, H, C, P > | |
| Cany_regular_t::helper< any_regular_t > | |
| Cidentity< T > | |
| Cidentity< void > | |
| Cidentity_element< Op > | |
| Cidentity_element< std::multiplies< T > > | Specialization of identity_element for std::multiplies<T> |
| Cidentity_element< std::plus< T > > | Specialization of identity_element for std::plus<T> |
| Cif_ | |
| Ctype< T, poly_copyable_interface > | |
| Cpoly_copyable_instance< T > | Implementation of a trivial poly interface in terms of types modeling Copyable . Used in poly<copyable> implementation |
| Ctype< T, poly_placeable_interface > | |
| Cpoly_placeable_instance< T > | Implementation of virtual interface for the poly<placeable> modeling PlaceableConcept |
| Ctype< T, poly_placeable_twopass_interface > | |
| Cpoly_placeable_twopass_instance< T > | Implementation of virtual interface for the poly<placeable_twopass> modeling PlaceableTwoPassConcept |
| Ctype< T, poly_regular_interface > | |
| Cpoly_regular_instance< T > | Implementation of a trivial poly interface in terms of types modeling regular . Used in poly<regular> implementation |
| Coptimized_storage_type< ConcreteType, Interface > | Authors of poly concept representatives must derive their instance class from this. See of poly_placeable_instance, for example. This metafunction is used in the implementation of the small storage optimization |
| Ctype_or_default< T, Default >::if_has_type< condition, IFtype, ELSEtype > | |
| Ctype_or_default< T, Default >::if_has_type< false, IFtype, ELSEtype > | |
| Cif_range_base< NoThrow, isRange > | |
| Cif_range_base< NoThrow, is_range_for_dictionary< Dictionary, T >::value > | |
| Cif_range_else_key< NoThrow, Dictionary, T > | |
| Cif_range_base< std::nothrow_t, false > | |
| Cif_range_base< void, false > | |
| Cif_range_base< void, true > | |
| Cinc< T > | Operator++ wrapped in a function object |
| Cindirect< T > | |
| Cintegral_constant | |
| Cexpand_utf< T, U > | |
| Cis_member< I, O > | |
| Cis_range< T > | Does T model the boost::range concepts? |
| Cis_range_for_dictionary< Dictionary, Range > | |
| Citerator_adaptor | |
| Cchild_iterator< iterator > | |
| Cchild_iterator< const_iterator > | |
| Cedge_iterator< iterator, forest_leading_edge > | |
| Cedge_iterator< const_iterator, forest_leading_edge > | |
| Cedge_iterator< iterator, forest_trailing_edge > | |
| Cedge_iterator< const_iterator, forest_trailing_edge > | |
| Cchild_iterator< I > | An iterator used to traverse the children of a specific node in a forest |
| Cdepth_fullorder_iterator< I > | |
| Cedge_iterator< I, Edge > | An iterator used to traverse a specific edge type within a forest |
| Cfilter_fullorder_iterator< I, P > | |
| Cstep_iterator_adaptor< DERIVED, IT, S_FN > | Step iterator adaptor |
| Citerator_facade | |
| Creverse_fullorder_iterator< iterator > | |
| Creverse_fullorder_iterator< const_iterator > | |
| Cindex_iterator< F, T, R, I, D > | An iterator over elements which are the result of applying a function to an index |
| Creverse_fullorder_iterator< I > | |
| Csegmented_iterator< I > | |
| Cjson_generator< T, O > | A utility class that uses a helper class to access a provided data structure and output well-formed JSON |
| Cjson_parser< T > | A utility class that parses raw JSON data and uses a helper class to construct the desired representations of what is parsed |
| Ckey_type< Dictionary, DefaultKey, has_type > | |
| Ckey_type< Dictionary, DefaultKey, false > | |
| Ckey_type< Dictionary, DefaultKey, true > | |
| Clayout_attributes_alignment_t | A utility class for referencing the alignment characteristics in layout_attributes_t |
| Clayout_attributes_t | Layout data interface from the client to the engine |
| Clayout_attributes_placement_t | |
| Ceve_t | Eve engine |
| Clayout_attributes_t | Layout data interface from the client to the engine |
| Cless | |
| Cless_equal | |
| Cattribute_set_t::less_key_only_t | |
| Cattribute_set_t::less_t | |
| Cline_position_t | A type detailing parser position information |
| Clogical_and | |
| Clogical_not | |
| Clogical_or | |
| Clogical_xor< C1, C2 > | Xor funtion object |
| Cmd5_t | MD5 hash generator |
| Cmem_data_t< T, R > | Adaptor similar to boost::mem_fn() used by std::bind |
| Cmem_data_t< const T, R > | |
| Cmember_test_helper< size_t > | |
| Cmy_class_t | A one-line synopsis of what the class does |
| Cnearest_cast_fn< A, R > | |
| Cnearest_cast_fn< A, double > | |
| Cnearest_cast_fn< A, float > | |
| Cnew_delete_t | |
| Cnew_delete_t | |
| Cnode_tag | |
| Cnonarg | Empty-set arg stream has no arguments. Not sure what this might be useful for |
| Cnoncopyable | |
| Ccallback_proc_t<> | |
| Cpreorder_predicate_t<> | |
| Ccounter_t | A thread safe counter |
| Cdancing_links_t | |
| Ceve_t | Eve engine |
| Cexpression_parser | |
| Cexternal_model_t | |
| Csheet_t | The fundamental data structure for the Property Model engine |
| Cxml_parser_t< O > | A relatively lightweight and simple xml (subset) parser |
| Cxstring_context_t | Scope-based runtime context stack for glossary lookups |
| Cnot_equal_to | |
| Cnull_output_iterator_t | A stub iterator that models OutputIterator and outputs nothing |
| Cor_ | |
| Cis_base_derived_or_same< T, U > | |
| CPlaceableConcept< T > | Concept map and constraints checking for the Placeable concept |
| CPlaceableTwoPassConcept< T * > | Concept map and constraints checking for to allow std::reference_wrapper<T> to model this concept when T does |
| CPlaceableConcept< T * > | Concept map and constraints checking for to allow std::reference_wrapper<T> to model this concept when T does |
| CPlaceableTwoPassConcept< T > | Concept map and constraints checking for the PlaceableTwoPass concept |
| CPlaceableTwoPassConcept< T * > | Concept map and constraints checking for to allow std::reference_wrapper<T> to model this concept when T does |
| Cplus_asymmetric< T1, T2 > | Plus function object whose arguments may be of different type |
| Cpointer_to< T > | |
| Cpoly_base< I, Instance > | Authors of a Concept representative F, intended as a template parameter to poly, will inherit from poly_base. The first template parameter for poly_base provides the virtual interface for the concept representative. The second template parameter for poly_base must inherit from the Concept interface representative. The author's third duty is to provide forwarding functions in a their Concept representative. See the placeable_concept.hpp header file for details |
| Cpoly_base< poly_copyable_interface, poly_copyable_instance > | |
| Ccopyable | "Handle" class used in poly<copyable> implementation |
| Cpoly< copyable > | |
| Cpoly_base< poly_placeable_interface, poly_placeable_instance > | |
| Cplaceable | Representative of PlaceableConcept so that placeable models PlaceableConcept when T does |
| Cpoly< placeable > | |
| Cpoly_base< poly_placeable_twopass_interface, poly_placeable_twopass_instance > | |
| Cplaceable_twopass | |
| Cpoly< placeable_twopass > | |
| Cpoly_base< poly_regular_interface, poly_regular_instance > | |
| Cregular | "Handle" class used in poly<regular> implementation |
| Cpoly< regular > | |
| Cpoly_copyable_interface | Abstract interface providing signatures needed to implement "handle" objects modeling a Value (Copyable/Movable) concept. Authors of poly classes must derive their interfaces from this. See poly_placeable_interface for an example |
| Cpoly_placeable_interface | Pure virtual interface for the poly<placeable> modeling PlaceableConcept |
| Cpoly_placeable_twopass_interface | Pure virtual interface for poly<placeable_twopass> modeling PlaceableTwoPassConcept |
| Cpoly_regular_interface | Virtual interface for RegularConcept. Used in poly<regular> implementation |
| Cpromote< T > | A struct for compile-time type promotion |
| Cpromote< const char * > | |
| Cpromote< static_name_t > | |
| Cptr_traits< ptrT > | |
| Cptr_traits< T * > | The ptr_traits class provide basic information and operations associated with a pointer type |
| Cptr_traits< T(*)[]> | |
| Cptr_traits< T * >::rebind< U > | |
| Cptr_traits< T(*)[]>::rebind< U > | |
| Ccapture_allocator< T >::rebind< U > | |
| Ccapture_allocator< void >::rebind | |
| CRegularConcept< T > | |
| Cadam_callback_suite_t::relation_t | Struct containing details of a relation expression for client callbacks from the Adam parser |
| Ceve_callback_suite_t::relation_t | |
| Csheet_t::relation_t | Adam support class for related relationships |
| Cresult_type< F > | Result_type<F>::type is the return type of the function f |
| Creverse_fullorder_cursor | An iterator-like type for reverse fullorder (pre- and post-order) traversal of a forest |
| Cruntime_cast_t< R, T > | |
| Cruntime_cast_t< R, any_regular_t * > | |
| Cruntime_cast_t< R, any_regular_t > | |
| Cruntime_cast_t< R, const any_regular_t * > | |
| Cruntime_cast_t< R, const any_regular_t > | |
| Cselect< T > | |
| Cserializable_t | |
| Cserialize< T > | |
| Cserialize< std::reference_wrapper< T > > | |
| Cset_monitor_t | Adam support class |
| Cset_next_fn< I > | |
| Cset_next_fn< child_iterator< I > > | |
| Csha< Traits > | |
| Cshared_task_queue | |
| Csignature< F > | Returns the function signature of the callable object type F |
| Csignature< std::function< F > > | |
| Csingle< T > | Holds a single value, and returns it as an arg n (default 1) times |
| Clayout_attributes_t::slice_t | Placeable object geometry for a single orientation of layout_attributes_t |
| Cplace_data_t::slice_t | Element geometry for a single orientation of place_data_t |
| Cstatic_name_t | Utility wrapper to construct name_t with strings of static storage duration |
| Cstatic_table< KeyType, ValueType, Size, Traits > | A simple lookup table of fixed size. [under review] |
| Cstatic_table_traits< KeyType, ValueType > | A traits class for use with adobe::static_table |
| Cstorage_category< T > | |
| Cstorage_category< std::deque< T, A > > | |
| Cstorage_category< std::list< T, A > > | |
| Cstorage_category< std::map< K, T, C, A > > | |
| Cstorage_category< std::multimap< K, T, C, A > > | |
| Cstorage_category< std::multiset< T, C, A > > | |
| Cstorage_category< std::set< T, C, A > > | |
| Cstorage_category< std::vector< T, A > > | |
| Cstr_equal_to_t | |
| Cstr_less_t | |
| Ctable_index< Key, T, Transform, Compare > | Utility class for indexing objects based on specific member variable values |
| Ctimer_t | A class for measuring periods of elapsed time. Can also accrue split times for some basic statistical reporting |
| Ctotally_ordered | |
| Cname_t | A character string class for immutable strings |
| Ctimer_t | |
| Cempty_t | An empty regular- and less-than-comparable- type |
| Cvector< T, A > | |
| Czuid_t | UUID-like identifier generator |
| Ctraits< T > | Defines any traits that help with the implementation of arg_stream::call() and/or helper objects like arg_stream::chain |
| Ctraits< chain< S1, S2 > > | |
| Ctraits< nonarg > | |
| Ctraits< single< T > > | |
| Cany_regular_t::transform< T > | Function object used in binding for instance value access |
| Ctranspose< F > | |
| Ctype_or_default< T, Default > | |
| Ctypeid_ | Typeid(x) wrapped in a function object |
| Cunary_compose< F, G > | |
| Cuuid_t | |
| Cvalue_iterator< I, F > | |
| Cvirtual_machine_t | Stack-based non-branching expression evaluator |
| Cwith_transform< ArgStream, Transformer > | |
1.14.0