Classes | |
class | __gnu_cxx::unary_compose< Operation1, Operation2 > |
An SGI extension . More... | |
class | __gnu_cxx::binary_compose< Operation1, Operation2, Operation3 > |
An SGI extension . More... | |
struct | __gnu_cxx::select1st< Pair > |
An SGI extension . More... | |
struct | __gnu_cxx::select2nd< Pair > |
An SGI extension . More... | |
struct | __gnu_cxx::project1st< Arg1, Arg2 > |
An SGI extension . More... | |
struct | __gnu_cxx::project2nd< Arg1, Arg2 > |
An SGI extension . More... | |
struct | __gnu_cxx::constant_void_fun< Result > |
An SGI extension . More... | |
struct | __gnu_cxx::constant_unary_fun< Result, Argument > |
An SGI extension . More... | |
struct | __gnu_cxx::constant_binary_fun< Result, Arg1, Arg2 > |
An SGI extension . More... | |
class | __gnu_cxx::subtractive_rng |
class | __gnu_cxx::hash_map< Key, Type, HashFcn, EqualKey, Alloc > |
class | __gnu_cxx::hash_multimap< Key, Type, HashFcn, EqualKey, Alloc > |
class | __gnu_cxx::hash_set< Value, HashFcn, EqualKey, Alloc > |
class | __gnu_cxx::hash_multiset< Value, HashFcn, EqualKey, Alloc > |
struct | __gnu_cxx::temporary_buffer< ForwardIterator, Type > |
struct | __gnu_cxx::rb_tree< Key, Value, KeyOfValue, Compare, Alloc > |
class | __gnu_cxx::slist< Type, Alloc > |
class | __gnu_cxx::rope< CharT, Alloc > |
[NOHEADER] | |
bitset< Nb > & | std::bitset::Unchecked_set (size_t position) |
bitset< Nb > & | std::bitset::Unchecked_set (size_t position, int __val) |
bitset< Nb > & | std::bitset::Unchecked_reset (size_t position) |
bitset< Nb > & | std::bitset::Unchecked_flip (size_t position) |
bool | std::bitset::Unchecked_test (size_t position) const |
Functions | |
template<typename Type> | |
const Type & | std::__median (const Type &a, const Type &__b, const Type &c) |
Find the median of three values. | |
template<typename Type, typename Compare> | |
const Type & | std::__median (const Type &a, const Type &__b, const Type &c, Compare comp) |
Find the median of three values using a predicate for comparison. | |
size_t | std::bitset::Find_first () const |
Finds the index of the first "on" bit. | |
size_t | std::bitset::Find_next (size_t __prev) const |
Finds the index of the next "on" bit after prev. | |
template<typename InputIter, typename Size, typename OutputIter> | |
pair< InputIter, OutputIter > | __gnu_cxx::copy_n (InputIter first, Size count, OutputIter __result) |
Copies the range [first,first+count) into [result,result+count). | |
template<typename InputIter1, typename InputIter2> | |
int | __gnu_cxx::lexicographical_compare_3way (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2) |
memcmp on steroids. | |
template<typename ForwardIter, typename OutputIter, typename Distance> | |
OutputIter | __gnu_cxx::random_sample_n (ForwardIter first, ForwardIter last, OutputIter out, const Distance n) |
template<typename ForwardIter, typename OutputIter, typename Distance, typename RandomNumberGenerator> | |
OutputIter | __gnu_cxx::random_sample_n (ForwardIter first, ForwardIter last, OutputIter out, const Distance n, RandomNumberGenerator &__rand) |
template<typename InputIter, typename RandomAccessIter> | |
RandomAccessIter | __gnu_cxx::random_sample (InputIter first, InputIter last, RandomAccessIter out_first, RandomAccessIter out_last) |
template<typename InputIter, typename RandomAccessIter, typename RandomNumberGenerator> | |
RandomAccessIter | __gnu_cxx::random_sample (InputIter first, InputIter last, RandomAccessIter out_first, RandomAccessIter out_last, RandomNumberGenerator &__rand) |
template<typename RandomAccessIter> | |
bool | __gnu_cxx::is_heap (RandomAccessIter first, RandomAccessIter last) |
template<typename RandomAccessIter, typename StrictWeakOrdering> | |
bool | __gnu_cxx::is_heap (RandomAccessIter first, RandomAccessIter last, StrictWeakOrdering comp) |
template<typename ForwardIter> | |
bool | __gnu_cxx::is_sorted (ForwardIter first, ForwardIter last) |
template<typename ForwardIter, typename StrictWeakOrdering> | |
bool | __gnu_cxx::is_sorted (ForwardIter first, ForwardIter last, StrictWeakOrdering comp) |
template<class Type> | |
Type | __gnu_cxx::identity_element (std::plus< Type >) |
An SGI extension . | |
template<class Type> | |
Type | __gnu_cxx::identity_element (std::multiplies< Type >) |
An SGI extension . | |
template<class Operation1, class Operation2> | |
unary_compose< Operation1, Operation2 > | __gnu_cxx::compose1 (const Operation1 &__fn1, const Operation2 &__fn2) |
An SGI extension . | |
template<class Operation1, class Operation2, class Operation3> | |
binary_compose< Operation1, Operation2, Operation3 > | __gnu_cxx::compose2 (const Operation1 &__fn1, const Operation2 &__fn2, const Operation3 &__fn3) |
An SGI extension . | |
template<class Result> | |
constant_void_fun< Result > | __gnu_cxx::constant0 (const Result &__val) |
An SGI extension . | |
template<class Result> | |
constant_unary_fun< Result, Result > | __gnu_cxx::constant1 (const Result &__val) |
An SGI extension . | |
template<class Result> | |
constant_binary_fun< Result, Result, Result > | __gnu_cxx::constant2 (const Result &__val) |
An SGI extension . | |
template<typename InputIterator, typename Distance> | |
void | __gnu_cxx::distance (InputIterator first, InputIterator last, Distance &n) |
template<typename InputIter, typename Size, typename ForwardIter> | |
pair< InputIter, ForwardIter > | __gnu_cxx::uninitialized_copy_n (InputIter first, Size count, ForwardIter __result) |
Copies the range [first,last) into result. | |
template<typename Type, typename Integer, typename MonoidOperation> | |
Type | __gnu_cxx::power (Type x, Integer n, MonoidOperation __monoid_op) |
template<typename Type, typename Integer> | |
Type | __gnu_cxx::power (Type x, Integer n) |
template<typename ForwardIter, typename Type> | |
void | __gnu_cxx::iota (ForwardIter first, ForwardIter last, Type value) |
They are additionally documented in the online documentation, a copy of which is also shipped with the library source code (in .../docs/html/documentation.html). You can also read the documentation on SGI's site, which is still running even though the code is not maintained.
NB that the following notes are pulled from various comments all over the place, so they may seem stilted.
The identity_element
functions are not part of the C++ standard; SGI provided them as an extension. Its argument is an operation, and its return value is the identity element for that operation. It is overloaded for addition and multiplication, and you can overload it for your own nefarious operations.
As an extension to the binders, SGI provided composition functors and wrapper functions to aid in their creation. The unary_compose
functor is constructed from two functions/functors, f
and g
. Calling operator()
with a single argument x
returns f
(g(x)). The function compose1
takes the two functions and constructs a unary_compose
variable for you.
binary_compose
is constructed from three functors, f
, g1
, and g2
. Its operator()
returns f
(g1(x),g2(x)). The function takes f, g1, and g2, and constructs the binary_compose
instance for you. For example, if f
returns an int, then
int answer = (compose2(f,g1,g2))(x);
int temp1 = g1(x); int temp2 = g2(x); int answer = f(temp1,temp2);
As an extension, SGI provided a functor called identity
. When a functor is required but no operations are desired, this can be used as a pass-through. Its operator()
returns its argument unchanged.
select1st
and select2nd
are extensions provided by SGI. Their operator()s
take a std::pair
as an argument, and return either the first member or the second member, respectively. They can be used (especially with the composition functors) to "strip" data from a sequence before performing the remainder of an algorithm.
The operator()
of the project1st
functor takes two arbitrary arguments and returns the first one, while project2nd
returns the second one. They are extensions provided by SGI.
These three functors are each constructed from a single arbitrary variable/value. Later, their operator()s
completely ignore any arguments passed, and return the stored value.
constant_void_fun's
operator()
takes no argumentsconstant_unary_fun's
operator()
takes one argument (ignored)constant_binary_fun's
operator()
takes two arguments (ignored)
The helper creator functions constant0
, constant1
, and constant2
each take a "result" argument and construct variables of the appropriate functor type.
|
Find the median of three values using a predicate for comparison.
{l ,m,n} is some convolution of {a ,b,c} such that comp(l,m) and comp(m,n) are both true then the value returned will be m . This is an SGI extension.
Definition at line 120 of file stl_algo.h. |
|
Find the median of three values.
{l ,m,n} is some convolution of {a ,b,c} such that l<=m<=n then the value returned will be m . This is an SGI extension.
Definition at line 86 of file stl_algo.h. Referenced by std::nth_element(). |
|
An SGI extension .
Definition at line 143 of file ext/functional. |
|
An SGI extension .
Definition at line 170 of file ext/functional. |
|
An SGI extension .
Definition at line 305 of file ext/functional. |
|
An SGI extension .
Definition at line 312 of file ext/functional. |
|
An SGI extension .
Definition at line 320 of file ext/functional. |
|
Copies the range [first,first+count) into [result,result+count).
memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling).
Definition at line 121 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 103 of file ext/iterator. |
|
Finds the index of the first "on" bit.
|
|
Finds the index of the next "on" bit after prev.
|
|
An SGI extension .
Definition at line 91 of file ext/functional. |
|
An SGI extension .
Definition at line 87 of file ext/functional. |
|
This is an SGI extension.
Definition at line 137 of file ext/numeric. |
|
This is an SGI extension.
Definition at line 465 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 448 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 514 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 488 of file ext/algorithm. |
|
Definition at line 200 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 125 of file ext/numeric. |
|
This is an SGI extension.
Definition at line 115 of file ext/numeric. |
|
This is an SGI extension.
Definition at line 393 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 373 of file ext/algorithm. |
|
This is an SGI extension.
Definition at line 289 of file ext/algorithm. References std::distance(), and std::min(). |
|
This is an SGI extension.
Definition at line 257 of file ext/algorithm. References std::distance(), and std::min(). |
|
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking. |
|
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking. |
|
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking. |
|
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking. |
|
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking. |
|
Copies the range [first,last) into result.
Definition at line 128 of file ext/memory. |