 adobe | |
  arg_stream | |
   detail | |
    has_eof_member | |
    invoker | |
    invoker< F, To, To > | |
    remove_cv_ref | |
   chain | Chain 2 arg_streams together by calling the first stream until depleted, then calling the second |
   no_more_args | |
   nonarg | Empty-set arg stream has no arguments. Not sure what this might be useful for |
   result_type | Result_type<F>::type is the return type of the function f |
   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 |
   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 > > | |
   with_transform | |
    has_entry_if_has_inverse_lookup | |
    has_entry_if_has_inverse_lookup< Class, R, true > | |
    has_inverse_lookup | |
    has_transform | |
  detail | |
   no_struct | |
   yes_struct | |
  dictionary_arg_stream_detail | |
   function_not_present | |
   has_get_dictionary_entry_function | |
   has_get_dictionary_entry_template | |
   if_range_base | |
   if_range_base< std::nothrow_t, false > | |
   if_range_base< void, false > | |
   if_range_base< void, true > | |
   if_range_else_key | |
   is_range_for_dictionary | |
   key_type< Dictionary, DefaultKey, false > | |
   key_type< Dictionary, DefaultKey, true > | |
   member_test_helper | |
  fn | |
  implementation | |
  unsafe | |
   set_next_fn< child_iterator< I > > | |
  version_0 | The version_0 libraries have defined binary layout and will be supported going forward |
  version_1 | |
   aggregate_name_t | |
   aggregate_type_info_t | |
   any_regular_t | A runtime polymorphic type similar to boost::any which can hold any type which models Regular |
    transform | Function object used in binding for instance value access |
   capture_allocator | |
    rebind | |
   capture_allocator< void > | |
    rebind | |
   copy_on_write | A copy-on-write wrapper for any model of Regular |
   empty_base_t | |
   empty_t | An empty regular- and less-than-comparable- type |
   function< R()> | |
    concept_t | |
    model | |
   make_type_info | |
   make_type_info< const T0[Size], Any > | |
   make_type_info< T0[Size], Any > | |
   name_t | |
   new_delete_t | |
   static_name_t | |
   string16_t | |
   string_t | |
   type_info_t | Partial re-implementation of standard type_info |
   vector | |
  adam_callback_suite_t | Callback class for the Adam parser |
   relation_t | Struct containing details of a relation expression for client callbacks from the Adam parser |
  aggregate_pair | |
  aligned_storage | |
  always_true | |
  any_bidirectional_iterator_instance | |
   type | |
  any_bidirectional_iterator_interface | |
  any_iterator | An iterator wrapping another iterator of the same element type; a "polymorphic" iterator |
  any_random_access_iterator_instance | |
   type | |
  any_random_access_iterator_interface | |
  asl_cel_format | |
  assign | |
  attribute_set_t | An associated array based on adobe::token_range_t. A utility class for the xml_parser_t |
   less_key_only_t | |
   less_t | |
  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_cast | An exception class thrown during ASL failures to cast |
  basic_bounded_width | |
  basic_format | |
  basic_omanipulator | |
  basic_omanipulator2 | |
  begin_atom | |
  begin_bag | |
  bidirectional_iter | |
  binary_compose | |
  bitwise_and | operator() returns x & y |
  bitwise_or | operator() returns x | y |
  bitwise_xor | operator() returns x ^ y |
  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 |
  closed_hash_map | A hash based associative container |
  closed_hash_set | A hash based associative container |
  compare_members_t | Utility class for adobe::compare_members |
  const_once_name_t | Utility wrapper to construct name_t without initializing the string pointer |
  constructor | |
  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 | |
  dictionary_arg_stream | Dictionary_arg_stream implements the arg_stream interface |
  dictionary_arg_stream< Dictionary, InputRange, std::nothrow_t > | |
  dictionary_arg_stream_base | |
  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_ptr< T * > | |
  empty_ptr< T(*)[]> | |
  equal_to | |
  equivalent | |
  eve_callback_suite_t | |
   relation_t | |
  eve_t | Eve engine |
  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 |
   slice_t | A class containing element geometry for a single orientation |
  external_model_t | |
  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 | |
  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 | |
  has_type_type | T::type a valid type (or a compile error?) |
  hash_index | |
  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> |
  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 |
  is_convertible | |
  is_member | |
  is_movable | The is_movable trait can be used to identify movable types |
  is_movable< copy_on_write< T, A > > | |
  is_range | Does T model the boost::range concepts? |
  iter | |
  javascript_format | |
  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 |
   slice_t | Placeable object geometry for a single orientation of layout_attributes_t |
  less | |
  less_equal | |
  lex_stream_t | |
  lex_token_t | |
  line_position_t | A type detailing parser position information |
  logical_and | |
  logical_not | |
  logical_or | |
  logical_xor | Xor funtion object |
  manipulator_base | |
  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 > | |
  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 |
  my_class_t | A one-line synopsis of what the class does |
  name_t | A character string class for immutable strings |
  nearest_cast_fn | |
  nearest_cast_fn< A, double > | |
  nearest_cast_fn< A, float > | |
  not_equal_to | |
  null_output_iterator_t | A stub iterator that models OutputIterator and outputs nothing |
  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 |
  pair | |
  pdf_format | |
  place_data_t | Layout data interface from the engine to the client |
   slice_t | Element geometry for a single orientation of place_data_t |
  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 | |
   type | |
  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 |
  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 > > | |
   rebind | |
  ptr_traits< T * > | This section defines requirements on classes representing pointer traits. The template class ptr_traits< ptrT > is defined along with several specializations |
   rebind | |
  ptr_traits< T(*)[]> | |
   rebind | |
  random_access_iter | |
  regular | "Handle" class used in poly<regular> implementation |
  RegularConcept | |
  reverse_fullorder_cursor | An iterator-like type for reverse fullorder (pre- and post-order) traversal of a forest |
  reverse_fullorder_iterator | |
  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 > > | |
  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_monitor_t | Adam support class |
  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 |
   relation_t | Adam support class for related relationships |
  short_name | |
  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 |
  string16_t | Lightweight string class designed to hold UTF16 strings in fixed binary structure |
  string_t | Lightweight string class designed to hold UTF8 strings in fixed binary structure |
  table_index | Utility class for indexing objects based on specific member variable values |
  timer_t | |
  transposer | |
  type_or_default | |
   if_has_type | |
   if_has_type< false, IFtype, ELSEtype > | |
  unary_compose | |
  uuid_t | |
  value_iterator | |
  virtual_machine_t | |
  xml_format | |
  xml_parser_t | A relatively lightweight and simple xml (subset) parser |
  xstring_context_t | Scope-based runtime context stack for glossary lookups |
  zuid_t | UUID-like identifier generator |
 boost | |
  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 > | |
  has_trivial_constructor< adobe::version_1::empty_t > | |
  has_trivial_destructor< adobe::version_1::empty_t > | |
  is_empty< adobe::version_1::empty_t > | |
  is_pod< adobe::name_t > | |
  is_pod< adobe::version_1::empty_t > | |
 std | STL namespace |
  less< adobe::version_1::type_info_t > | Compares the x and y. Returns true if x precedes y in the implementationís collation order |
 version_1 | |
  any_regular_t | |
   transform | Function object used in binding for instance value access |
 concept_t | |
 equality_comparable | |
 timer_t | A class for measuring periods of elapsed time. Can also accrue split times for some basic statistical reporting |
 totally_ordered | |