▼Adobe Source Libraries | |
ASL Overview | |
▼ASL Tutorials | |
Eve | |
Namespaces | |
any_regular_t | |
array_t | |
dictionary_t | |
forest | |
▼Libraries | |
▼ABI-Safe Libraries | |
ABI-Safe Containers: hash containers, vector, ... | |
ABI-Safe Utilities | |
ABI-Safe type_info | Partial re-implementation of standard type_info . As part of namespace version_1 it is guaranteed to remain binary compatible over time. It is a purely static mechanism. In addition, classes must manually register to using the provided macros |
ABI-safe Strings | |
any_regular_t | |
▼Algorithms | |
▶Container Algorithms | |
String Algorithms | |
erase [review] | |
exists | |
▶Mutating Algorithms | |
copy | |
fill | |
filter | |
gather | |
generate | |
partition | |
random_shuffle | |
remove | |
replace | |
reverse | |
rotate | |
swap_ranges | |
transform | |
unique | |
Node Algorithms | |
▶Non-Mutating Algorithms | |
count | |
equal | |
▶find | |
find_if_not | |
find_not | |
find_match | |
for_each | |
for_each_position | |
mismatch | |
other_of | |
pin | |
search | |
▶Numeric Algorithms | Extends the C++ standard numeric algorithms with ConvertibleToRange and ConvertibleToFunction concepts |
accumulate | |
adjacent_difference | |
inner_product | |
iota | |
max_adjacent_difference | |
partial_sum | |
reduce | |
Security Related | |
▶Sorting Algorithms | |
binary_search | |
clamp | |
equal_range | |
heap operations | |
lexicographical_compare | |
lower_bound | |
median | |
merge | |
min / max | |
permutation | |
select | |
set operations on sorted ranges | |
sort | |
sorted | |
upper_bound | |
selection | |
▼Concepts | |
Assignable | |
BackInsertionSequence | |
Controller | |
ConvertibleToBool | |
ConvertibleToFunction | |
ConvertibleToRange | |
DefaultConstructible | |
EqualityComparable | |
FrontInsertionSequence | |
LessThanComparable | |
Movable | |
Regular | |
ReversibleContainer | |
TransformFunction | |
View | |
▼Containers | |
ABI-Safe Containers: hash containers, vector, ... | |
Forest | |
Other containers: circular_queue, table_index, static_table, etc. | |
Expression Reference | |
▼Functional | |
Bitwise Operations | |
Member Data Accessor | |
Miscellaneous Functional Operators | Utility class to obtain the identity element for an operation |
Object Member Comparsion | |
Iterator Utilities | |
▼Layout Library (Eve) | |
Extents | |
Layout Attributes | |
▶Layout Engine | |
Implementing Right-To-Left Layout | |
Layout Library Evaluate | |
Layout Library Language Reference | |
Layout Library Parser | |
Placeable | |
Placeable Concept | |
PlaceableTwopass | |
Poly Library | Support for creating Regular, runtime-polymorphic objects with value semantics |
Widget Attributes | |
poly_placeable | |
▼Property Model Library (Adam) | |
External Model | |
Property Model Engine | |
Property Model Evaluate | |
Property Model Language Reference | |
Property Model Parser | |
Selection | |
▼Utility | |
▶Concurrent Programming | |
Once | Thread safety code for compilation in environments both with and without thread support |
Thread ID | |
Thread-safe counter | |
Conversions | |
Final | |
Identifier Generator | |
Memory | |
Misc utilities (Testing, Timer, ignore_unused,...) | |
Move Library | The move library is a collection of utilities for creating and using types that leverage return value optimization (RVO) to avoid unnecessary copies |
▶Parsing, Serialization, and Strings | |
I/O Manipulators | |
Unicode Utilities | Basic unicode utilities |
XML Parser (and supporting constructs) | |
localization | |
xstring Glossary System | A context-sensitive string lookup system |
▶Runtime Concepts | |
Poly Library | Support for creating Regular, runtime-polymorphic objects with value semantics |
any_regular_t | |
TR1 Components | |
Typesafe Integers and Bit Fields (enums) | |
cmath Extensions | |
pair | |
▼Templates for Documentation | |
DocumentationTemplateForAConcept | |
Tutorial Template | |
▼Widget Library | |
Concrete Widget Library (Carbon) | |
Widget Reference | |
arg_stream | |