stlab.adobe.com Adobe Systems Incorporated
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
adam_callback_suite_tCallback class for the Adam parser
aggregate_name_t
aggregate_pair
aggregate_type_info_t
aligned_storage
allocatorSTL class
always_true
any_bidirectional_iterator_instance
any_bidirectional_iterator_interface
any_iteratorAn iterator wrapping another iterator of the same element type; a "polymorphic" iterator
any_random_access_iterator_instance
any_random_access_iterator_interface
any_regular_tA runtime polymorphic type similar to boost::any which can hold any type which models Regular
asl_cel_format
assign
attribute_set_tAn associated array based on adobe::token_range_t. A utility class for the xml_parser_t
auto_ptrSTL class
auto_ptrThe adobe::auto_ptr<> template adds a number of extensions to std::auto_ptr<>
auto_resourceThe 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_iteratorSimilar to std::back_insert_iterator but with move semantics, for movable types, otherwise with copy semantics
bad_allocSTL class
bad_castAn exception class thrown during ASL failures to cast
bad_castSTL class
bad_exceptionSTL class
bad_typeidSTL class
basic_bounded_width
basic_format
basic_fstreamSTL class
basic_ifstreamSTL class
basic_iosSTL class
basic_iostreamSTL class
basic_istreamSTL class
basic_istringstreamSTL class
basic_ofstreamSTL class
basic_omanipulator
basic_omanipulator2
basic_ostreamSTL class
basic_ostringstreamSTL class
basic_stringSTL class
basic_stringstreamSTL class
begin_atom
begin_bag
bidirectional_iter
binary_compose
bitsetSTL class
bitwise_andoperator() returns x & y
bitwise_oroperator() returns x | y
bitwise_xoroperator() returns x ^ y
capture_allocator
capture_allocator< void >
external_model_t::cell_t
chainChain 2 arg_streams together by calling the first stream until depleted, then calling the second
child_adaptor
child_iteratorAn iterator used to traverse the children of a specific node in a forest
circular_queueA 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_mapA hash based associative container
closed_hash_setA hash based associative container
vector::header_t::compact_header_t
closed_hash_set::header_t::compact_header_t
compare_members_tUtility class for adobe::compare_members
complexSTL class
function< R()>::concept_t
basic_string::const_iteratorSTL iterator class
string::const_iteratorSTL iterator class
wstring::const_iteratorSTL iterator class
deque::const_iteratorSTL iterator class
list::const_iteratorSTL iterator class
map::const_iteratorSTL iterator class
multimap::const_iteratorSTL iterator class
set::const_iteratorSTL iterator class
multiset::const_iteratorSTL iterator class
vector::const_iteratorSTL iterator class
const_once_name_tUtility wrapper to construct name_t without initializing the string pointer
basic_string::const_reverse_iteratorSTL iterator class
string::const_reverse_iteratorSTL iterator class
wstring::const_reverse_iteratorSTL iterator class
deque::const_reverse_iteratorSTL iterator class
list::const_reverse_iteratorSTL iterator class
map::const_reverse_iteratorSTL iterator class
multimap::const_reverse_iteratorSTL iterator class
set::const_reverse_iteratorSTL iterator class
multiset::const_reverse_iteratorSTL iterator class
vector::const_reverse_iteratorSTL iterator class
constructor
copy_on_writeA copy-on-write wrapper for any model of Regular
copy_sinkCopy_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_tA thread safe counter
counting_output_iterator
dancing_linksAn optimized implementation of the 1-cover problem [class under review]
dancing_links_t
decOperator-- wrapped in a function object
delete_arrayA function object for type T that invokes delete[] on an array of T
delete_ptrA function object for type T that invokes delete on a T*
delete_ptr_trait< T * >
delete_ptr_trait< T(*)[]>
depth_fullorder_cursorAn iterator-like type for the depth-tracked traversal of a forest
depth_fullorder_iterator
dequeSTL class
dictionary_arg_streamDictionary_arg_stream implements the arg_stream interface
dictionary_arg_stream< Dictionary, InputRange, std::nothrow_t >
dictionary_arg_stream_base
domain_errorSTL class
name_t::dont_copy_t
name_t::dont_initialize_t
edge_iteratorAn 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_tAn 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_tEve engine
exceptionSTL class
extents_slices_tA utility class for referencing the two slices of a extents_t
extents_tAn intrinsic geometry class for objects with a graphical representation
external_model_t
ios_base::failureSTL class
filter_fullorder_cursorAn iterator-like type for fullorder (pre- and post-order) traversal of a forest
filter_fullorder_iterator
forestA homogeneous hierarchical structure class
format_base
format_element_t
fstreamSTL class
function< R()>
function_not_present
generator_tA 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_typeT::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
ifstreamSTL class
incOperator++ wrapped in a function object
indents
index_iteratorAn iterator over elements which are the result of applying a function to an index
indirect
indirect_tAdapter used to convert pointers to references
invalid_argumentSTL class
invoker
invoker< F, To, To >
iosSTL class
ios_baseSTL class
is_convertible
is_empty< adobe::version_1::empty_t >
is_member
is_movableThe 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_rangeDoes T model the boost::range concepts?
is_range_for_dictionary
istreamSTL class
istringstreamSTL class
iter
multiset::iteratorSTL iterator class
basic_string::iteratorSTL iterator class
string::iteratorSTL iterator class
wstring::iteratorSTL iterator class
deque::iteratorSTL iterator class
set::iteratorSTL iterator class
list::iteratorSTL iterator class
map::iteratorSTL iterator class
multimap::iteratorSTL iterator class
vector::iteratorSTL iterator class
javascript_format
key_type< Dictionary, DefaultKey, false >
key_type< Dictionary, DefaultKey, true >
layout_attributes_alignment_tA utility class for referencing the alignment characteristics in layout_attributes_t
layout_attributes_placement_t
layout_attributes_tLayout data interface from the client to the engine
length_errorSTL 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_tA type detailing parser position information
listSTL class
closed_hash_set::list_node_base
logic_errorSTL class
logical_and
logical_not
logical_or
logical_xorXor funtion object
make_type_info
make_type_info< const T0[Size], Any >
make_type_info< T0[Size], Any >
manipulator_base
mapSTL class
marshaled_exception
md5_tMD5 hash generator
mem_data_tAdaptor similar to boost::mem_fn() used by boost::bind
mem_data_t< const T, R >
member_test_helper
function< R()>::model
move_fromMove_from is used for move_ctors
move_sinkMove_sink and copy_sink are used to select between overloaded operations according to whether type T is movable and convertible to type U
multimapSTL class
multisetSTL class
my_class_tA one-line synopsis of what the class does
name_tA 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
nonargEmpty-set arg stream has no arguments. Not sure what this might be useful for
not_equal_to
null_output_iterator_tA stub iterator that models OutputIterator and outputs nothing
ofstreamSTL class
optimized_storage_typeAuthors 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
ostreamSTL class
ostringstreamSTL class
out_of_rangeSTL class
overflow_errorSTL class
pair
pdf_format
place_data_tLayout data interface from the engine to the client
placeableRepresentative of adobe::PlaceableConcept so that placeable models adobe::PlaceableConcept when T does
placeable_twopass
PlaceableConceptConcept 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
PlaceableTwoPassConceptConcept 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_asymmetricPlus function object whose arguments may be of different type
point_2d
pointer_to
polyadobe::poly<foo> will be a runtime polymorphic value type wrapper modelling a concept represented by foo
poly_baseAuthors 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_instanceImplementation of a trivial poly interface in terms of types modeling Copyable . Used in poly<copyable> implementation
poly_copyable_interfaceAbstract 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_instanceImplementation of virtual interface for the poly<placeable> modeling adobe::PlaceableConcept
poly_placeable_interfacePure virtual interface for the poly<placeable> modeling adobe::PlaceableConcept
poly_placeable_twopass_instanceImplementation of virtual interface for the poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept
poly_placeable_twopass_interfacePure virtual interface for poly<placeable_twopass> modeling adobe::PlaceableTwoPassConcept
poly_regular_instanceImplementation of a trivial poly interface in terms of types modeling regular . Used in poly<regular> implementation
poly_regular_interfaceVirtual interface for RegularConcept. Used in poly<regular> implementation
priority_queueSTL class
promoteA 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(*)[]>
queueSTL class
random_access_iter
range_errorSTL 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_tAdam support class for related relationships
adam_callback_suite_t::relation_tStruct containing details of a relation expression for client callbacks from the Adam parser
eve_callback_suite_t::relation_t
remove_cv_ref
result_typeResult_type<F>::type is the return type of the function f
reverse_fullorder_cursorAn iterator-like type for reverse fullorder (pre- and post-order) traversal of a forest
reverse_fullorder_iterator
multimap::reverse_iteratorSTL iterator class
basic_string::reverse_iteratorSTL iterator class
map::reverse_iteratorSTL iterator class
multiset::reverse_iteratorSTL iterator class
set::reverse_iteratorSTL iterator class
deque::reverse_iteratorSTL iterator class
string::reverse_iteratorSTL iterator class
list::reverse_iteratorSTL iterator class
vector::reverse_iteratorSTL iterator class
wstring::reverse_iteratorSTL 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_errorSTL class
segmented_iterator
select
selection_tA container used to represent a linear boolean selection
sequence_tA function object for sequence generation within a domain
setSTL class
set_monitor_tAdam support class
set_next_fn< child_iterator< I > >
sha1_tA bit-oriented implementation of the SHA-1 Secure Hash Algorithm
sha224_tA bit-oriented implementation of the SHA-224 Secure Hash Algorithm
sha256_tA bit-oriented implementation of the SHA-256 Secure Hash Algorithm
sha384_tA bit-oriented implementation of the SHA-384 Secure Hash Algorithm
sha512_tA bit-oriented implementation of the SHA-512 Secure Hash Algorithm
sheet_tThe fundamental data structure for the Property Model engine
short_name
signatureReturns the function signature of the callable object type F
signature< boost::function< F > >
singleHolds a single value, and returns it as an arg n (default 1) times
extents_t::slice_tA class containing element geometry for a single orientation
layout_attributes_t::slice_tPlaceable object geometry for a single orientation of layout_attributes_t
place_data_t::slice_tElement geometry for a single orientation of place_data_t
stackSTL class
static_name_t
static_name_tUtility wrapper to construct name_t with strings of static storage duration
static_tableA simple lookup table of fixed size. [under review]
static_table_traitsA traits class for use with adobe::static_table
step_iterator_adaptorStep iterator adaptor
str_less_t
stream_error_tAn exception class thrown during parsing failures
stringSTL class
string16_tLightweight string class designed to hold UTF16 strings in fixed binary structure
string16_t
string_t
string_tLightweight string class designed to hold UTF8 strings in fixed binary structure
stringstreamSTL class
table_indexUtility class for indexing objects based on specific member variable values
timer_tA class for measuring periods of elapsed time. Can also accrue split times for some basic statistical reporting
timer_t
traitsDefines 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::transformFunction object used in binding for instance value access
transformFunction 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_tPartial re-implementation of standard type_info
type_or_default
unary_compose
underflow_errorSTL class
uuid_t
valarraySTL class
value_iterator
vectorSTL class
vector
virtual_machine_t
wfstreamSTL class
wifstreamSTL class
wiosSTL class
wistreamSTL class
wistringstreamSTL class
with_transform
wofstreamSTL class
wostreamSTL class
wostringstreamSTL class
wstringSTL class
wstringstreamSTL class
xml_format
xml_parser_tA relatively lightweight and simple xml (subset) parser
xstring_context_tScope-based runtime context stack for glossary lookups
yes_struct
zuid_tUUID-like identifier generator

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google