Cadam_callback_suite_t | Callback class for the Adam parser |
Caggregate_name_t | |
Caggregate_pair< T1, T2 > | |
Caggregate_type_info_t | |
Caligned_storage< T > | |
Caligned_storage< adobe::closed_hash_set::header_t::compact_header_t > | |
Caligned_storage< adobe::version_1::vector::header_t::compact_header_t > | |
►Cand_ | |
Cis_movable< T > | The is_movable trait can be used to identify movable types |
Cany_bidirectional_iterator_instance< V, R, D > | |
Cany_iterator | An iterator wrapping another iterator of the same element type; a "polymorphic" iterator |
Cany_random_access_iterator_instance< V, R, D > | |
Cassign | |
Cauto_resource< X, Traits > | The template class auto_resource< X, Traits > provides similar functionality to auto_ptr for resources for which the pointer is opaque refered to by a non-pointer type |
►Cauto_resource< X *, Traits > | |
Cauto_ptr< X, Traits > | The adobe::auto_ptr<> template adds a number of extensions to std::auto_ptr<> |
Cbinary_compose< F, G, H > | |
►Cbinary_function | |
Cattribute_set_t::less_key_only_t | |
Cattribute_set_t::less_t | |
Cbitwise_and< T > | operator() returns x & y |
Cbitwise_or< T > | operator() returns x | y |
Cbitwise_xor< T > | operator() returns x ^ y |
Ccompare_members_t< T, R, Compare > | Utility class for adobe::compare_members |
Cequivalent< O > | |
Clogical_xor< C1, C2 > | Xor funtion object |
Cplus_asymmetric< T1, T2 > | Plus function object whose arguments may be of different type |
Cstr_less_t | |
Ctransposer< F > | |
Cless< adobe::version_1::type_info_t > | Compares the x and y. Returns true if x precedes y in the implementationís collation order |
Ccapture_allocator< T > | |
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_map< Key, T, Hash, Pred, A > | |
Cclosed_hash_set< T, KeyTransform, Hash, Pred, A > | |
Cvector< T, A >::header_t::compact_header_t | |
Cclosed_hash_set< T, KeyTransform, Hash, Pred, A >::header_t::compact_header_t | |
►Cconcept_base_t< concept_t, vtable_type > | |
Cfunction< R()>::concept_t | |
►Cconcept_t | |
►Cmodel_base< model< T >, concept_t > | |
Cfunction< R()>::model< T > | |
Cconst_once_name_t | Utility wrapper to construct name_t without initializing the string pointer |
Cconstructor< T > | |
Ccopy_on_write< T, A > | A copy-on-write wrapper for any model of Regular |
Ccopy_on_write< set_type > | |
Ccounter_t | A thread safe counter |
Ccounting_output_iterator | |
Cdancing_links | An optimized implementation of the 1-cover problem [class under review] |
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 > | |
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_base< Dictionary, InputRange > | |
Cdictionary_arg_stream< Dictionary, InputRange, NoThrow > | Dictionary_arg_stream implements the arg_stream interface |
Cdictionary_arg_stream< Dictionary, InputRange, std::nothrow_t > | |
Celement< N, T > | |
Celement< 0, pair< T1, T2 > > | |
Celement< 0, std::pair< T1, T2 > > | |
Celement< 1, pair< T1, T2 > > | |
Celement< 1, std::pair< T1, T2 > > | |
Cempty_base< Derived > | |
Cempty_base_t< Derived > | |
Cempty_ptr< T > | |
►Cenable_if | |
Ccopy_sink< T, U, R > | Copy_sink and move_sink are used to select between overloaded operations according to whether type T is movable and convertible to type U |
Cmove_sink< T, U, R > | Move_sink and copy_sink are used to select between overloaded operations according to whether type T is movable and convertible to type U |
Cequal_to | |
►Cequality_comparable | |
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 |
Cclosed_hash_set< T, KeyTransform, Hash, Pred, A > | A hash based associative container |
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 boost::any which can hold any type which models Regular |
Ctype_info_t | Partial re-implementation of standard type_info |
►Cclosed_hash_set< pair< Key, T >, get_element< 0, pair< Key, T > >, Hash, Pred, A > | |
Cclosed_hash_map< Key, T, Hash, Pred, A > | A hash based associative container |
Cclosed_hash_set< pointer, indirect_key_function_type, hasher, key_equal > | |
Ceve_callback_suite_t | |
Ceve_t | Eve engine |
►Cexception | STL class |
Cno_more_args | |
Cmarshaled_exception | |
►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 |
Cextents_t | An intrinsic geometry class for objects with a graphical representation |
►CF | |
Cpoly< F > | adobe::poly<foo> will be a runtime polymorphic value type wrapper modelling a concept represented by foo |
Cfilter_fullorder_cursor | An iterator-like type for fullorder (pre- and post-order) traversal of a forest |
Cforest< T > | A homogeneous hierarchical structure class |
►Cformat_base | |
Casl_cel_format | |
Cjavascript_format | |
Cpdf_format | |
Cxml_format | |
Cformat_element_t | |
Cfunction< F > | |
Cfunction< F > | |
Cfunction< bool(const token_range_t &)> | |
Cfunction< position_t(const position_t &parent, const line_position_t &parse_location, name_t name, const array_t ¶meters, const string_t &brief, const string_t &detailed)> | |
Cfunction< void()> | |
Cfunction< void(cell_type_t type, name_t cell_name, const line_position_t &position, const array_t &expr_or_init, const std::string &brief, const std::string &detailed)> | |
Cfunction< void(cell_type_t type, name_t name, const line_position_t &position, const array_t &initializer, const string_t &brief, const string_t &detailed)> | |
Cfunction< void(const any_regular_t &)> | |
Cfunction< void(const line_position_t &position, const array_t &conditional, const relation_t *first, const relation_t *last, const std::string &brief, const std::string &detailed)> | |
Cfunction< void(const line_position_t &position, const array_t &conditional, const relation_t *first, const relation_t *last, const string_t &brief, const string_t &detailed)> | |
Cfunction< void(name_t cell_name, bool linked, const line_position_t &position1, const array_t &initializer, const line_position_t &position2, const array_t &expression, const std::string &brief, const std::string &detailed)> | |
Cfunction< void(name_t cell_name, bool linked, const line_position_t &position1, const array_t &initializer, const line_position_t &position2, const array_t &expression, const string_t &brief, const string_t &detailed)> | |
Cfunction< void(name_t cell_name, const line_position_t &position, const std::string &brief, const std::string &detailed)> | |
►Cfunction_base< function< R()> > | |
Cfunction< R()> | |
Cfunction_not_present | |
Cgenerator_t< Result > | A function object for value generation within a domain |
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_eof_member< T > | |
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_index< T, H, C, P > | |
Cidentity< T > | |
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_ | |
Coptimized_storage_type< ConcreteType, Interface > | Authors of adobe::poly concept representatives must derive their instance class from this. See of adobe::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 > | |
Cindirect< T > | |
Cindirect_t | Adapter used to convert pointers to references |
Cinvoker< F, From, To > | |
Cinvoker< F, To, To > | |
Cis_member< I, O > | |
Cis_range< T > | Does T model the boost::range concepts? |
Cis_range_for_dictionary< Dictionary, Range > | |
►Citerator | |
Cback_move_iterator< C > | Similar to std::back_insert_iterator but with move semantics, for movable types, otherwise with copy semantics |
►Citerator_adaptor | |
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 | |
Cbidirectional_iter< V, R, D > | |
Cindex_iterator< F, T, R, I, D > | An iterator over elements which are the result of applying a function to an index |
Citer< V, R, D > | |
Crandom_access_iter< V, R, D > | |
Creverse_fullorder_iterator< I > | |
Csegmented_iterator< I > | |
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_placement_t | |
Clayout_attributes_t | Layout data interface from the client to the engine |
Cless | |
Cless_equal | |
Clex_stream_t | |
Clex_token_t< E > | |
Cline_position_t | A type detailing parser position information |
Clogical_and | |
Clogical_not | |
Clogical_or | |
Cmake_type_info< T, Any > | |
Cmake_type_info< const T0[Size], Any > | |
Cmake_type_info< T0[Size], Any > | |
►Cmanipulator_base | |
Cbasic_omanipulator< ArgumentType, charT, traits > | |
Cbasic_omanipulator2< ArgumentType1, ArgumentType2, charT, traits > | |
►Cbasic_omanipulator< const any_regular_t, char, std::char_traits< char > > | |
Cbegin_atom< T > | |
►Cbasic_omanipulator< std::size_t, char, std::char_traits< char > > | |
Cindents | |
►Cbasic_omanipulator< std::string, char, std::char_traits< char > > | |
Cbegin_bag | |
►Cbasic_omanipulator< T, char, std::char_traits< char > > | |
Cbasic_format< T > | |
►Cbasic_omanipulator< unsigned int, charT, traits > | |
Cbasic_bounded_width< charT, traits > | |
Cmd5_t | MD5 hash generator |
Cmember_test_helper< size_t > | |
Cmove_from< T > | Move_from is used for move_ctors |
Cmy_class_t | A one-line synopsis of what the class does |
Cname_t | A character string class for immutable strings |
Cnew_delete_t | |
Cno_struct | |
Cnonarg | Empty-set arg stream has no arguments. Not sure what this might be useful for |
►Cnoncopyable | |
Cdancing_links_t | |
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_convertible< T, U > | |
Cplace_data_t | Layout data interface from the engine to the client |
►CPlaceableConcept< T > | Concept map and constraints checking for the Placeable concept |
CPlaceableConcept< T * > | Concept map and constraints checking for to allow boost::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 boost::reference_wrapper<T> to model this concept when T does |
Cpointer_to< T > | |
Cpoly_base< I, Instance > | Authors of a Concept representative F, intended as a template parameter to adobe::poly, will inherit from adobe::poly_base. The first template parameter for adobe::poly_base provides the virtual interface for the concept representative. The second template parameter for adobe::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< any_bidirectional_iterator_interface< V, R, D >, any_bidirectional_iterator_instance< V, R, D >::template type > | |
Cbidirectional_iter< V, R, D > | |
►Cpoly_base< any_random_access_iterator_interface< V, R, D >, any_random_access_iterator_instance< V, R, D >::template type > | |
Crandom_access_iter< V, R, D > | |
►Cpoly_base< poly_copyable_interface, poly_copyable_instance > | |
Ccopyable | "Handle" class used in poly<copyable> implementation |
►Cpoly_base< poly_iterator_interface< V, R, D >, poly_iterator_instance< V, R, D >::template type > | |
Citer< V, R, D > | |
►Cpoly_base< poly_placeable_interface, poly_placeable_instance > | |
Cplaceable | Representative of adobe::PlaceableConcept so that placeable models adobe::PlaceableConcept when T does |
►Cpoly_base< poly_placeable_twopass_interface, poly_placeable_twopass_instance > | |
Cplaceable_twopass | |
►Cpoly_base< poly_regular_interface, poly_regular_instance > | |
Cregular | "Handle" class used in poly<regular> implementation |
►Cpoly_copyable_interface | Abstract interface providing signatures needed to implement "handle" objects modeling a Value (Copyable/Movable) concept. Authors of adobe::poly classes must derive their interfaces from this. See adobe::poly_placeable_interface for an example |
►Cpoly_iterator_interface< V, R, D > | |
►Cany_bidirectional_iterator_interface< V, R, D > | |
Cany_random_access_iterator_interface< V, R, D > | |
►Cpoly_placeable_interface | Pure virtual interface for the poly<placeable> modeling adobe::PlaceableConcept |
Cpoly_placeable_twopass_interface | Pure virtual interface for poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept |
Cpoly_regular_interface | Virtual interface for RegularConcept. Used in poly<regular> implementation |
Cpoly_iterator_instance< V, R, D > | |
Cpromote< T > | A struct for compile-time type promotion |
Cpromote< aggregate_name_t > | |
Cpromote< const char * > | |
Cpromote< float > | |
Cpromote< int > | |
Cpromote< long > | |
Cpromote< short > | |
Cpromote< static_name_t > | |
Cpromote< std::string > | |
Cpromote< unsigned int > | |
Cpromote< unsigned long > | |
Cpromote< unsigned short > | |
Cptr_traits< ptrT > | |
Cptr_traits< auto_ptr< T, Traits > > | |
Cptr_traits< auto_resource< T, Traits > > | |
Cptr_traits< std::auto_ptr< T > > | |
Cptr_traits< T * > | This section defines requirements on classes representing pointer traits. The template class ptr_traits< ptrT > is defined along with several specializations |
Cptr_traits< T(*)[]> | |
Ccapture_allocator< T >::rebind< U > | |
Cptr_traits< T * >::rebind< U > | |
Cptr_traits< T(*)[]>::rebind< U > | |
Cptr_traits< std::auto_ptr< T > >::rebind< U > | |
Ccapture_allocator< void >::rebind< U > | |
CRegularConcept< T > | |
Ceve_callback_suite_t::relation_t | |
Csheet_t::relation_t | Adam support class for related relationships |
Cadam_callback_suite_t::relation_t | Struct containing details of a relation expression for client callbacks from the Adam parser |
►Cremove_cv | |
Cremove_cv_ref< T > | |
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, auto_ptr< T, Traits > > | |
Cruntime_cast_t< R, auto_resource< T, Traits > > | |
Cruntime_cast_t< R, const any_regular_t * > | |
Cruntime_cast_t< R, const any_regular_t > | |
Cruntime_cast_t< R, std::auto_ptr< T > > | |
Cselect< T > | |
Csequence_t< T > | A function object for sequence generation within a domain |
Cset_next_fn< I > | |
Cset_next_fn< child_iterator< I > > | |
Csha1_t | A bit-oriented implementation of the SHA-1 Secure Hash Algorithm |
Csha224_t | A bit-oriented implementation of the SHA-224 Secure Hash Algorithm |
Csha256_t | A bit-oriented implementation of the SHA-256 Secure Hash Algorithm |
Csha384_t | A bit-oriented implementation of the SHA-384 Secure Hash Algorithm |
Csha512_t | A bit-oriented implementation of the SHA-512 Secure Hash Algorithm |
Cshort_name< T > | |
Csignature< F > | Returns the function signature of the callable object type F |
Csignature< boost::function< F > > | |
Csingle< T > | Holds a single value, and returns it as an arg n (default 1) times |
Cplace_data_t::slice_t | Element geometry for a single orientation of place_data_t |
Clayout_attributes_t::slice_t | Placeable object geometry for a single orientation of layout_attributes_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 |
Cstring16_t | Lightweight string class designed to hold UTF16 strings in fixed binary structure |
Cstring_t | Lightweight string class designed to hold UTF8 strings in fixed binary structure |
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 | |
Cpair< T1, T2 > | |
Ctimer_t | |
Cempty_t | An empty regular- and less-than-comparable- type |
►Cname_t | |
Cstatic_name_t | |
Cstring16_t | |
Cstring_t | |
Cvector< T, A > | |
Cvector< adobe::version_1::name_t > | |
Cvector< any_regular_t > | |
Cvector< value_type > | |
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 |
Ctransform | Function object used in binding for instance value access |
►Ctrue_ | |
Cis_movable< copy_on_write< T, A > > | |
Chas_nothrow_constructor< adobe::version_1::closed_hash_map< Key, T, Hash, Pred, A > > | |
Chas_nothrow_constructor< adobe::version_1::closed_hash_set< T, KeyTransform, Hash, Pred, A > > | |
Chas_nothrow_constructor< adobe::version_1::string16_t > | |
Chas_nothrow_constructor< adobe::version_1::string_t > | |
Chas_trivial_constructor< adobe::version_1::empty_t > | |
Chas_trivial_destructor< adobe::version_1::empty_t > | |
Cis_empty< adobe::version_1::empty_t > | |
Cis_pod< adobe::name_t > | |
Cis_pod< adobe::version_1::empty_t > | |
►Ctype | |
Cany_bidirectional_iterator_instance< V, R, D >::type< I > | |
Cany_random_access_iterator_instance< V, R, D >::type< I > | |
Cpoly_copyable_instance< T > | Implementation of a trivial poly interface in terms of types modeling Copyable . Used in poly<copyable> implementation |
Cpoly_iterator_instance< V, R, D >::type< I > | |
Cpoly_placeable_instance< T > | Implementation of virtual interface for the poly<placeable> modeling adobe::PlaceableConcept |
Cpoly_placeable_twopass_instance< T > | Implementation of virtual interface for the poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept |
Cpoly_regular_instance< T > | Implementation of a trivial poly interface in terms of types modeling regular . Used in poly<regular> implementation |
Ctype_or_default< T, Default > | |
Cunary_compose< F, G > | |
►Cunary_function | |
Calways_true< T > | |
Cdec< T > | Operator-- wrapped in a function object |
Cdelete_ptr_trait< T * > | |
Cdelete_ptr_trait< T(*)[]> | |
Cempty_ptr< T * > | |
Cempty_ptr< T(*)[]> | |
Cget_element< N, T > | |
Cget_element< 0, pair< T1, T2 > > | |
Cget_element< 0, std::pair< T1, T2 > > | |
Cget_element< 1, pair< T1, T2 > > | |
Cget_element< 1, std::pair< T1, T2 > > | |
Cinc< T > | Operator++ wrapped in a function object |
Cmem_data_t< T, R > | Adaptor similar to boost::mem_fn() used by boost::bind |
Cmem_data_t< const T, R > | |
Cnearest_cast_fn< A, R > | |
Cnearest_cast_fn< A, double > | |
Cnearest_cast_fn< A, float > | |
Cset_monitor_t | Adam support class |
Cuuid_t | |
Cvalue_iterator< I, F > | |
Cvirtual_machine_t | |
Cwith_transform< ArgStream, Transformer > | |
Cyes_struct | |
Czuid_t | UUID-like identifier generator |
CConcept | |