| adam_callback_suite_t | Callback class for the Adam parser |
| aggregate_name_t | |
| aggregate_pair | |
| aggregate_type_info_t | |
| aligned_storage | |
| allocator | STL class |
| always_true | |
| any_bidirectional_iterator_instance | |
| any_bidirectional_iterator_interface | |
| any_iterator | An iterator wrapping another iterator of the same element type; a "polymorphic" iterator |
| any_random_access_iterator_instance | |
| any_random_access_iterator_interface | |
| any_regular_t | A runtime polymorphic type similar to boost::any which can hold any type which models Regular |
| asl_cel_format | |
| assign | |
| attribute_set_t | An associated array based on adobe::token_range_t. A utility class for the xml_parser_t |
| auto_ptr | STL class |
| auto_ptr | The adobe::auto_ptr<> template adds a number of extensions to std::auto_ptr<> |
| auto_resource | 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 |
| back_move_iterator | Similar to std::back_insert_iterator but with move semantics, for movable types, otherwise with copy semantics |
| bad_alloc | STL class |
| bad_cast | An exception class thrown during ASL failures to cast |
| bad_cast | STL class |
| bad_exception | STL class |
| bad_typeid | STL class |
| basic_bounded_width | |
| basic_format | |
| basic_fstream | STL class |
| basic_ifstream | STL class |
| basic_ios | STL class |
| basic_iostream | STL class |
| basic_istream | STL class |
| basic_istringstream | STL class |
| basic_ofstream | STL class |
| basic_omanipulator | |
| basic_omanipulator2 | |
| basic_ostream | STL class |
| basic_ostringstream | STL class |
| basic_string | STL class |
| basic_stringstream | STL class |
| begin_atom | |
| begin_bag | |
| bidirectional_iter | |
| binary_compose | |
| bitset | STL class |
| bitwise_and | operator() returns x & y |
| bitwise_or | operator() returns x | y |
| bitwise_xor | operator() returns x ^ y |
| capture_allocator | |
| capture_allocator< void > | |
| external_model_t::cell_t | |
| chain | Chain 2 arg_streams together by calling the first stream until depleted, then calling the second |
| child_adaptor | |
| child_iterator | An iterator used to traverse the children of a specific node in a forest |
| circular_queue | 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 |
| auto_resource::clear_type | |
| auto_ptr::clear_type | |
| closed_hash_map | A hash based associative container |
| closed_hash_set | A hash based associative container |
| vector::header_t::compact_header_t | |
| closed_hash_set::header_t::compact_header_t | |
| compare_members_t | Utility class for adobe::compare_members |
| complex | STL class |
| function< R()>::concept_t | |
| basic_string::const_iterator | STL iterator class |
| string::const_iterator | STL iterator class |
| wstring::const_iterator | STL iterator class |
| deque::const_iterator | STL iterator class |
| list::const_iterator | STL iterator class |
| map::const_iterator | STL iterator class |
| multimap::const_iterator | STL iterator class |
| set::const_iterator | STL iterator class |
| multiset::const_iterator | STL iterator class |
| vector::const_iterator | STL iterator class |
| const_once_name_t | Utility wrapper to construct name_t without initializing the string pointer |
| basic_string::const_reverse_iterator | STL iterator class |
| string::const_reverse_iterator | STL iterator class |
| wstring::const_reverse_iterator | STL iterator class |
| deque::const_reverse_iterator | STL iterator class |
| list::const_reverse_iterator | STL iterator class |
| map::const_reverse_iterator | STL iterator class |
| multimap::const_reverse_iterator | STL iterator class |
| set::const_reverse_iterator | STL iterator class |
| multiset::const_reverse_iterator | STL iterator class |
| vector::const_reverse_iterator | STL iterator class |
| constructor | |
| copy_on_write | A copy-on-write wrapper for any model of Regular |
| copy_sink | Copy_sink and move_sink are used to select between overloaded operations according to whether type T is movable and convertible to type U |
| copyable | "Handle" class used in poly<copyable> implementation |
| counter_t | A thread safe counter |
| counting_output_iterator | |
| dancing_links | An optimized implementation of the 1-cover problem [class under review] |
| dancing_links_t | |
| dec | Operator-- wrapped in a function object |
| delete_array | A function object for type T that invokes delete[] on an array of T |
| delete_ptr | A function object for type T that invokes delete on a T* |
| delete_ptr_trait< T * > | |
| delete_ptr_trait< T(*)[]> | |
| depth_fullorder_cursor | An iterator-like type for the depth-tracked traversal of a forest |
| depth_fullorder_iterator | |
| deque | STL class |
| dictionary_arg_stream | Dictionary_arg_stream implements the arg_stream interface |
| dictionary_arg_stream< Dictionary, InputRange, std::nothrow_t > | |
| dictionary_arg_stream_base | |
| domain_error | STL class |
| name_t::dont_copy_t | |
| name_t::dont_initialize_t | |
| edge_iterator | An iterator used to traverse a specific edge type within a forest |
| element | |
| element< 0, pair< T1, T2 > > | |
| element< 0, std::pair< T1, T2 > > | |
| element< 1, pair< T1, T2 > > | |
| element< 1, std::pair< T1, T2 > > | |
| empty_base | |
| empty_base_t | |
| empty_ptr< T * > | |
| empty_ptr< T(*)[]> | |
| empty_t | An empty regular- and less-than-comparable- type |
| equal_to | |
| equivalent | |
| auto_ptr::error_on_const_auto_type< auto_ptr< Y, typename traits_type::template rebind< Y * >::other > const > | |
| auto_resource::error_on_const_auto_type< auto_resource< Y, typename traits_type::template rebind< Y >::other > const > | |
| eve_callback_suite_t | |
| eve_t | Eve engine |
| exception | STL class |
| extents_slices_t | A utility class for referencing the two slices of a extents_t |
| extents_t | An intrinsic geometry class for objects with a graphical representation |
| external_model_t | |
| ios_base::failure | STL class |
| filter_fullorder_cursor | An iterator-like type for fullorder (pre- and post-order) traversal of a forest |
| filter_fullorder_iterator | |
| forest | A homogeneous hierarchical structure class |
| format_base | |
| format_element_t | |
| fstream | STL class |
| function< R()> | |
| function_not_present | |
| generator_t | A function object for value generation within a domain |
| get_element | |
| get_element< 0, pair< T1, T2 > > | |
| get_element< 0, std::pair< T1, T2 > > | |
| get_element< 1, pair< T1, T2 > > | |
| get_element< 1, std::pair< T1, T2 > > | |
| greater | |
| greater_equal | |
| with_transform::has_entry_if_has_inverse_lookup | |
| with_transform::has_entry_if_has_inverse_lookup< Class, R, true > | |
| has_eof_member | |
| has_get_dictionary_entry_function | |
| has_get_dictionary_entry_template | |
| with_transform::has_inverse_lookup | |
| has_nothrow_constructor< adobe::version_1::closed_hash_map< Key, T, Hash, Pred, A > > | |
| has_nothrow_constructor< adobe::version_1::closed_hash_set< T, KeyTransform, Hash, Pred, A > > | |
| has_nothrow_constructor< adobe::version_1::string16_t > | |
| has_nothrow_constructor< adobe::version_1::string_t > | |
| with_transform::has_transform | |
| has_trivial_constructor< adobe::version_1::empty_t > | |
| has_trivial_destructor< adobe::version_1::empty_t > | |
| has_type_type | T::type a valid type (or a compile error?) |
| hash_index | |
| vector::header_t | |
| closed_hash_set::header_t | |
| identity | |
| identity_element | |
| identity_element< std::multiplies< T > > | Specialization of identity_element for std::multiplies<T> |
| identity_element< std::plus< T > > | Specialization of identity_element for std::plus<T> |
| type_or_default::if_has_type | |
| type_or_default::if_has_type< false, IFtype, ELSEtype > | |
| if_range_base | |
| if_range_base< std::nothrow_t, false > | |
| if_range_base< void, false > | |
| if_range_base< void, true > | |
| if_range_else_key | |
| ifstream | STL class |
| inc | Operator++ wrapped in a function object |
| indents | |
| index_iterator | An iterator over elements which are the result of applying a function to an index |
| indirect | |
| indirect_t | Adapter used to convert pointers to references |
| invalid_argument | STL class |
| invoker | |
| invoker< F, To, To > | |
| ios | STL class |
| ios_base | STL class |
| is_convertible | |
| is_empty< adobe::version_1::empty_t > | |
| is_member | |
| is_movable | The is_movable trait can be used to identify movable types |
| is_movable< copy_on_write< T, A > > | |
| is_pod< adobe::name_t > | |
| is_pod< adobe::version_1::empty_t > | |
| is_range | Does T model the boost::range concepts? |
| is_range_for_dictionary | |
| istream | STL class |
| istringstream | STL class |
| iter | |
| multiset::iterator | STL iterator class |
| basic_string::iterator | STL iterator class |
| string::iterator | STL iterator class |
| wstring::iterator | STL iterator class |
| deque::iterator | STL iterator class |
| set::iterator | STL iterator class |
| list::iterator | STL iterator class |
| map::iterator | STL iterator class |
| multimap::iterator | STL iterator class |
| vector::iterator | STL iterator class |
| javascript_format | |
| key_type< Dictionary, DefaultKey, false > | |
| key_type< Dictionary, DefaultKey, true > | |
| layout_attributes_alignment_t | A utility class for referencing the alignment characteristics in layout_attributes_t |
| layout_attributes_placement_t | |
| layout_attributes_t | Layout data interface from the client to the engine |
| length_error | STL class |
| less | |
| less< adobe::version_1::type_info_t > | Compares the x and y. Returns true if x precedes y in the implementationís collation order |
| less_equal | |
| attribute_set_t::less_key_only_t | |
| attribute_set_t::less_t | |
| lex_stream_t | |
| lex_token_t | |
| line_position_t | A type detailing parser position information |
| list | STL class |
| closed_hash_set::list_node_base | |
| logic_error | STL class |
| logical_and | |
| logical_not | |
| logical_or | |
| logical_xor | Xor funtion object |
| make_type_info | |
| make_type_info< const T0[Size], Any > | |
| make_type_info< T0[Size], Any > | |
| manipulator_base | |
| map | STL class |
| marshaled_exception | |
| md5_t | MD5 hash generator |
| mem_data_t | Adaptor similar to boost::mem_fn() used by boost::bind |
| mem_data_t< const T, R > | |
| member_test_helper | |
| function< R()>::model | |
| move_from | Move_from is used for move_ctors |
| move_sink | Move_sink and copy_sink are used to select between overloaded operations according to whether type T is movable and convertible to type U |
| multimap | STL class |
| multiset | STL class |
| my_class_t | A one-line synopsis of what the class does |
| name_t | A character string class for immutable strings |
| name_t | |
| nearest_cast_fn | |
| nearest_cast_fn< A, double > | |
| nearest_cast_fn< A, float > | |
| new_delete_t | |
| no_more_args | |
| no_struct | |
| closed_hash_set::node_t | |
| nonarg | Empty-set arg stream has no arguments. Not sure what this might be useful for |
| not_equal_to | |
| null_output_iterator_t | A stub iterator that models OutputIterator and outputs nothing |
| ofstream | STL class |
| optimized_storage_type | 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 |
| ostream | STL class |
| ostringstream | STL class |
| out_of_range | STL class |
| overflow_error | STL class |
| pair | |
| pdf_format | |
| place_data_t | Layout data interface from the engine to the client |
| placeable | Representative of adobe::PlaceableConcept so that placeable models adobe::PlaceableConcept when T does |
| placeable_twopass | |
| PlaceableConcept | Concept map and constraints checking for the Placeable concept |
| PlaceableConcept< T * > | Concept map and constraints checking for to allow boost::reference_wrapper<T> to model this concept when T does |
| PlaceableTwoPassConcept | Concept map and constraints checking for the PlaceableTwoPass concept |
| PlaceableTwoPassConcept< T * > | Concept map and constraints checking for to allow boost::reference_wrapper<T> to model this concept when T does |
| plus_asymmetric | Plus function object whose arguments may be of different type |
| point_2d | |
| pointer_to | |
| poly | adobe::poly<foo> will be a runtime polymorphic value type wrapper modelling a concept represented by foo |
| poly_base | 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 |
| poly_copyable_instance | Implementation of a trivial poly interface in terms of types modeling Copyable . Used in poly<copyable> implementation |
| poly_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 |
| poly_iterator_instance | |
| poly_iterator_interface | |
| poly_placeable_instance | Implementation of virtual interface for the poly<placeable> modeling adobe::PlaceableConcept |
| poly_placeable_interface | Pure virtual interface for the poly<placeable> modeling adobe::PlaceableConcept |
| poly_placeable_twopass_instance | Implementation of virtual interface for the poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept |
| poly_placeable_twopass_interface | Pure virtual interface for poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept |
| poly_regular_instance | Implementation of a trivial poly interface in terms of types modeling regular . Used in poly<regular> implementation |
| poly_regular_interface | Virtual interface for RegularConcept. Used in poly<regular> implementation |
| priority_queue | STL class |
| promote | A struct for compile-time type promotion |
| promote< aggregate_name_t > | |
| promote< const char * > | |
| promote< float > | |
| promote< int > | |
| promote< long > | |
| promote< short > | |
| promote< static_name_t > | |
| promote< std::string > | |
| promote< unsigned int > | |
| promote< unsigned long > | |
| promote< unsigned short > | |
| ptr_traits< auto_ptr< T, Traits > > | |
| ptr_traits< auto_resource< T, Traits > > | |
| ptr_traits< std::auto_ptr< T > > | |
| ptr_traits< T * > | This section defines requirements on classes representing pointer traits. The template class ptr_traits< ptrT > is defined along with several specializations |
| ptr_traits< T(*)[]> | |
| queue | STL class |
| random_access_iter | |
| range_error | STL class |
| ptr_traits< std::auto_ptr< T > >::rebind | |
| capture_allocator< void >::rebind | |
| capture_allocator::rebind | |
| ptr_traits< T(*)[]>::rebind | |
| ptr_traits< T * >::rebind | |
| regular | "Handle" class used in poly<regular> implementation |
| RegularConcept | |
| sheet_t::relation_t | Adam support class for related relationships |
| adam_callback_suite_t::relation_t | Struct containing details of a relation expression for client callbacks from the Adam parser |
| eve_callback_suite_t::relation_t | |
| remove_cv_ref | |
| result_type | Result_type<F>::type is the return type of the function f |
| reverse_fullorder_cursor | An iterator-like type for reverse fullorder (pre- and post-order) traversal of a forest |
| reverse_fullorder_iterator | |
| multimap::reverse_iterator | STL iterator class |
| basic_string::reverse_iterator | STL iterator class |
| map::reverse_iterator | STL iterator class |
| multiset::reverse_iterator | STL iterator class |
| set::reverse_iterator | STL iterator class |
| deque::reverse_iterator | STL iterator class |
| string::reverse_iterator | STL iterator class |
| list::reverse_iterator | STL iterator class |
| vector::reverse_iterator | STL iterator class |
| wstring::reverse_iterator | STL iterator class |
| runtime_cast_t | |
| runtime_cast_t< R, any_regular_t * > | |
| runtime_cast_t< R, any_regular_t > | |
| runtime_cast_t< R, auto_ptr< T, Traits > > | |
| runtime_cast_t< R, auto_resource< T, Traits > > | |
| runtime_cast_t< R, const any_regular_t * > | |
| runtime_cast_t< R, const any_regular_t > | |
| runtime_cast_t< R, std::auto_ptr< T > > | |
| runtime_error | STL class |
| segmented_iterator | |
| select | |
| selection_t | A container used to represent a linear boolean selection |
| sequence_t | A function object for sequence generation within a domain |
| set | STL class |
| set_monitor_t | Adam support class |
| set_next_fn< child_iterator< I > > | |
| sha1_t | A bit-oriented implementation of the SHA-1 Secure Hash Algorithm |
| sha224_t | A bit-oriented implementation of the SHA-224 Secure Hash Algorithm |
| sha256_t | A bit-oriented implementation of the SHA-256 Secure Hash Algorithm |
| sha384_t | A bit-oriented implementation of the SHA-384 Secure Hash Algorithm |
| sha512_t | A bit-oriented implementation of the SHA-512 Secure Hash Algorithm |
| sheet_t | The fundamental data structure for the Property Model engine |
| short_name | |
| signature | Returns the function signature of the callable object type F |
| signature< boost::function< F > > | |
| single | Holds a single value, and returns it as an arg n (default 1) times |
| extents_t::slice_t | A class containing element geometry for a single orientation |
| layout_attributes_t::slice_t | Placeable object geometry for a single orientation of layout_attributes_t |
| place_data_t::slice_t | Element geometry for a single orientation of place_data_t |
| stack | STL class |
| static_name_t | |
| static_name_t | Utility wrapper to construct name_t with strings of static storage duration |
| static_table | A simple lookup table of fixed size. [under review] |
| static_table_traits | A traits class for use with adobe::static_table |
| step_iterator_adaptor | Step iterator adaptor |
| str_less_t | |
| stream_error_t | An exception class thrown during parsing failures |
| string | STL class |
| string16_t | Lightweight string class designed to hold UTF16 strings in fixed binary structure |
| string16_t | |
| string_t | |
| string_t | Lightweight string class designed to hold UTF8 strings in fixed binary structure |
| stringstream | STL class |
| table_index | Utility class for indexing objects based on specific member variable values |
| timer_t | A class for measuring periods of elapsed time. Can also accrue split times for some basic statistical reporting |
| timer_t | |
| traits | Defines any traits that help with the implementation of arg_stream::call() and/or helper objects like arg_stream::chain |
| traits< chain< S1, S2 > > | |
| traits< nonarg > | |
| traits< single< T > > | |
| any_regular_t::transform | Function object used in binding for instance value access |
| transform | Function object used in binding for instance value access |
| transposer | |
| any_random_access_iterator_instance::type | |
| any_bidirectional_iterator_instance::type | |
| poly_iterator_instance::type | |
| type_info_t | Partial re-implementation of standard type_info |
| type_or_default | |
| unary_compose | |
| underflow_error | STL class |
| uuid_t | |
| valarray | STL class |
| value_iterator | |
| vector | STL class |
| vector | |
| virtual_machine_t | |
| wfstream | STL class |
| wifstream | STL class |
| wios | STL class |
| wistream | STL class |
| wistringstream | STL class |
| with_transform | |
| wofstream | STL class |
| wostream | STL class |
| wostringstream | STL class |
| wstring | STL class |
| wstringstream | STL class |
| xml_format | |
| xml_parser_t | A relatively lightweight and simple xml (subset) parser |
| xstring_context_t | Scope-based runtime context stack for glossary lookups |
| yes_struct | |
| zuid_t | UUID-like identifier generator |
