Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

SGIextensions


Classes

class  unary_compose
 An SGI extension . More...

class  binary_compose
 An SGI extension . More...

struct  select1st
 An SGI extension . More...

struct  select2nd
 An SGI extension . More...

struct  project1st
 An SGI extension . More...

struct  project2nd
 An SGI extension . More...

struct  constant_void_fun
 An SGI extension . More...

struct  constant_unary_fun
 An SGI extension . More...

struct  constant_binary_fun
 An SGI extension . More...

class  subtractive_rng
class  hash_map
class  hash_multimap
class  hash_set
class  hash_multiset
struct  temporary_buffer
struct  rb_tree
class  rope
class  slist

[NOHEADER]

bitset< _Nb > & _GLIBCXX_STD::bitset::_Unchecked_set (size_t __pos)
bitset< _Nb > & _GLIBCXX_STD::bitset::_Unchecked_set (size_t __pos, int __val)
bitset< _Nb > & _GLIBCXX_STD::bitset::_Unchecked_reset (size_t __pos)
bitset< _Nb > & _GLIBCXX_STD::bitset::_Unchecked_flip (size_t __pos)
bool _GLIBCXX_STD::bitset::_Unchecked_test (size_t __pos) const

Functions

template<typename _Tp> const _Tp & std::__median (const _Tp &__a, const _Tp &__b, const _Tp &__c)
 Find the median of three values.

template<typename _Tp, typename _Compare> const _Tp & std::__median (const _Tp &__a, const _Tp &__b, const _Tp &__c, _Compare __comp)
 Find the median of three values using a predicate for comparison.

size_t _GLIBCXX_STD::bitset::_Find_first () const
 Finds the index of the first "on" bit.

size_t _GLIBCXX_STD::bitset::_Find_next (size_t __prev) const
 Finds the index of the next "on" bit after prev.

template<typename _InputIterator, typename _Size, typename _OutputIterator> pair< _InputIterator, _OutputIterator > __gnu_cxx::copy_n (_InputIterator __first, _Size __count, _OutputIterator __result)
 Copies the range [first,first+count) into [result,result+count).

template<typename _InputIterator1, typename _InputIterator2> int __gnu_cxx::lexicographical_compare_3way (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2)
 memcmp on steroids.

template<typename _ForwardIterator, typename _OutputIterator, typename _Distance> _OutputIterator __gnu_cxx::random_sample_n (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __out, const _Distance __n)
template<typename _ForwardIterator, typename _OutputIterator, typename _Distance, typename _RandomNumberGenerator> _OutputIterator __gnu_cxx::random_sample_n (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __out, const _Distance __n, _RandomNumberGenerator &__rand)
template<typename _InputIterator, typename _RandomAccessIterator> _RandomAccessIterator __gnu_cxx::random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out_first, _RandomAccessIterator __out_last)
template<typename _InputIterator, typename _RandomAccessIterator, typename _RandomNumberGenerator> _RandomAccessIterator __gnu_cxx::random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out_first, _RandomAccessIterator __out_last, _RandomNumberGenerator &__rand)
template<typename _RandomAccessIterator> bool __gnu_cxx::is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last)
template<typename _RandomAccessIterator, typename _StrictWeakOrdering> bool __gnu_cxx::is_heap (_RandomAccessIterator __first, _RandomAccessIterator __last, _StrictWeakOrdering __comp)
template<typename _ForwardIterator> bool __gnu_cxx::is_sorted (_ForwardIterator __first, _ForwardIterator __last)
template<typename _ForwardIterator, typename _StrictWeakOrdering> bool __gnu_cxx::is_sorted (_ForwardIterator __first, _ForwardIterator __last, _StrictWeakOrdering __comp)
template<class _Tp> _Tp __gnu_cxx::identity_element (std::plus< _Tp >)
 An SGI extension .

template<class _Tp> _Tp __gnu_cxx::identity_element (std::multiplies< _Tp >)
 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 _Tp, typename _Integer, typename _MonoidOperation> _Tp __gnu_cxx::power (_Tp __x, _Integer __n, _MonoidOperation __monoid_op)
template<typename _Tp, typename _Integer> _Tp __gnu_cxx::power (_Tp __x, _Integer __n)
template<typename _ForwardIter, typename _Tp> void __gnu_cxx::iota (_ForwardIter __first, _ForwardIter __last, _Tp __value)

Detailed Description

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);
is equivalent to 
  int temp1 = g1(x);
  int temp2 = g2(x);
  int answer = f(temp1,temp2);
But the first form is more compact, and can be passed around as a functor to other algorithms.

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.

The helper creator functions constant0, constant1, and constant2 each take a "result" argument and construct variables of the appropriate functor type.

Function Documentation

template<typename _Tp, typename _Compare>
const _Tp& __median (  const _Tp &  __a,
const _Tp &  __b,
const _Tp &  __c,
_Compare  __comp
)  [inline]
 

Find the median of three values using a predicate for comparison.

Parameters:
a A value.
b A value.
c A value.
comp A binary predicate.
Returns:
One of a, b or c.
If {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.

References __glibcxx_function_requires.

template<typename _Tp>
const _Tp& __median (  const _Tp &  __a,
const _Tp &  __b,
const _Tp &  __c
)  [inline]
 

Find the median of three values.

Parameters:
a A value.
b A value.
c A value.
Returns:
One of a, b or c.
If {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.

References __glibcxx_function_requires.

template<size_t _Nb>
size_t _GLIBCXX_STD::bitset< _Nb >::_Find_first (   )  const [inline, inherited]
 

Finds the index of the first "on" bit.

Returns:
The index of the first bit set, or size() if not found.
See also:
_Find_next

Definition at line 1055 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_do_find_first().

template<size_t _Nb>
size_t _GLIBCXX_STD::bitset< _Nb >::_Find_next (  size_t  __prev  )  const [inline, inherited]
 

Finds the index of the next "on" bit after prev.

Returns:
The index of the next bit set, or size() if not found.
Parameters:
prev Where to start searching.
See also:
_Find_first

Definition at line 1066 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_do_find_next().

template<size_t _Nb>
bitset<_Nb>& _GLIBCXX_STD::bitset< _Nb >::_Unchecked_flip (  size_t  __pos  )  [inline, inherited]
 

Definition at line 831 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_getword().

Referenced by _GLIBCXX_STD::bitset< _Nb >::flip().

template<size_t _Nb>
bitset<_Nb>& _GLIBCXX_STD::bitset< _Nb >::_Unchecked_reset (  size_t  __pos  )  [inline, inherited]
 

Definition at line 824 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_getword().

Referenced by _GLIBCXX_STD::bitset< _Nb >::reset().

template<size_t _Nb>
bitset<_Nb>& _GLIBCXX_STD::bitset< _Nb >::_Unchecked_set (  size_t  __pos,
int  __val
)  [inline, inherited]
 

Definition at line 814 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_getword().

template<size_t _Nb>
bitset<_Nb>& _GLIBCXX_STD::bitset< _Nb >::_Unchecked_set (  size_t  __pos  )  [inline, inherited]
 

These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking.

Definition at line 807 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_getword().

Referenced by _GLIBCXX_STD::bitset< _Nb >::set().

template<size_t _Nb>
bool _GLIBCXX_STD::bitset< _Nb >::_Unchecked_test (  size_t  __pos  )  const [inline, inherited]
 

Definition at line 838 of file bitset.

References _GLIBCXX_STD::_Base_bitset< _GLIBCXX_BITSET_WORDS(_Nb)>::_M_getword().

Referenced by _GLIBCXX_STD::bitset< _Nb >::_M_copy_to_string(), _GLIBCXX_STD::bitset< _Nb >::operator[](), and _GLIBCXX_STD::bitset< _Nb >::test().

template<class _Operation1, class _Operation2>
unary_compose<_Operation1,_Operation2> compose1 (  const _Operation1 &  __fn1,
const _Operation2 &  __fn2
)  [inline]
 

An SGI extension .

Definition at line 144 of file ext/functional.

template<class _Operation1, class _Operation2, class _Operation3>
binary_compose<_Operation1, _Operation2, _Operation3> compose2 (  const _Operation1 &  __fn1,
const _Operation2 &  __fn2,
const _Operation3 &  __fn3
)  [inline]
 

An SGI extension .

Definition at line 171 of file ext/functional.

template<class _Result>
constant_void_fun<_Result> constant0 (  const _Result &  __val  )  [inline]
 

An SGI extension .

Definition at line 306 of file ext/functional.

template<class _Result>
constant_unary_fun<_Result,_Result> constant1 (  const _Result &  __val  )  [inline]
 

An SGI extension .

Definition at line 313 of file ext/functional.

template<class _Result>
constant_binary_fun<_Result,_Result,_Result> constant2 (  const _Result &  __val  )  [inline]
 

An SGI extension .

Definition at line 321 of file ext/functional.

template<typename _InputIterator, typename _Size, typename _OutputIterator>
pair<_InputIterator, _OutputIterator> copy_n (  _InputIterator  __first,
_Size  __count,
_OutputIterator  __result
)  [inline]
 

Copies the range [first,first+count) into [result,result+count).

Parameters:
first An input iterator.
count The number of elements to copy.
result An output iterator.
Returns:
A std::pair composed of first+count and result+count.
This is an SGI extension. This inline function will boil down to a call to 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 122 of file ext/algorithm.

References __gnu_cxx::__copy_n(), and __glibcxx_function_requires.

Referenced by __gnu_cxx::rope< _CharT, _Alloc >::_S_flatten().

template<typename _InputIterator, typename _Distance>
void distance (  _InputIterator  __first,
_InputIterator  __last,
_Distance &  __n
)  [inline]
 

This is an SGI extension.

Definition at line 104 of file ext/iterator.

References __gnu_cxx::__distance().

Referenced by __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_equal(), and __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >::insert_unique().

template<class _Tp>
_Tp identity_element (  std::multiplies< _Tp >   )  [inline]
 

An SGI extension .

Definition at line 92 of file ext/functional.

template<class _Tp>
_Tp identity_element (  std::plus< _Tp >   )  [inline]
 

An SGI extension .

Definition at line 88 of file ext/functional.

Referenced by __gnu_cxx::__power().

template<typename _ForwardIter, typename _Tp>
void iota (  _ForwardIter  __first,
_ForwardIter  __last,
_Tp  __value
) 
 

This is an SGI extension.

Definition at line 135 of file ext/numeric.

References __glibcxx_function_requires.

template<typename _RandomAccessIterator, typename _StrictWeakOrdering>
bool is_heap (  _RandomAccessIterator  __first,
_RandomAccessIterator  __last,
_StrictWeakOrdering  __comp
)  [inline]
 

This is an SGI extension.

Definition at line 445 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::__is_heap().

template<typename _RandomAccessIterator>
bool is_heap (  _RandomAccessIterator  __first,
_RandomAccessIterator  __last
)  [inline]
 

This is an SGI extension.

Definition at line 427 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::__is_heap().

template<typename _ForwardIterator, typename _StrictWeakOrdering>
bool is_sorted (  _ForwardIterator  __first,
_ForwardIterator  __last,
_StrictWeakOrdering  __comp
) 
 

This is an SGI extension.

Definition at line 496 of file ext/algorithm.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _ForwardIterator>
bool is_sorted (  _ForwardIterator  __first,
_ForwardIterator  __last
) 
 

This is an SGI extension.

Definition at line 469 of file ext/algorithm.

References __glibcxx_function_requires, and __glibcxx_requires_valid_range.

template<typename _InputIterator1, typename _InputIterator2>
int lexicographical_compare_3way (  _InputIterator1  __first1,
_InputIterator1  __last1,
_InputIterator2  __first2,
_InputIterator2  __last2
) 
 

memcmp on steroids.

Parameters:
first1 An input iterator.
last1 An input iterator.
first2 An input iterator.
last2 An input iterator.
Returns:
An int, as with memcmp.
The return value will be less than zero if the first range is "lexigraphically less than" the second, greater than zero if the second range is "lexigraphically less than" the first, and zero otherwise. This is an SGI extension.

Definition at line 201 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __gnu_cxx::__lexicographical_compare_3way().

Referenced by __gnu_cxx::rope< _CharT, _Alloc >::_S_compare().

template<typename _Tp, typename _Integer>
_Tp power (  _Tp  __x,
_Integer  __n
)  [inline]
 

This is an SGI extension.

Definition at line 124 of file ext/numeric.

References __gnu_cxx::__power().

template<typename _Tp, typename _Integer, typename _MonoidOperation>
_Tp power (  _Tp  __x,
_Integer  __n,
_MonoidOperation  __monoid_op
)  [inline]
 

This is an SGI extension.

Definition at line 114 of file ext/numeric.

References __gnu_cxx::__power().

Referenced by __gnu_cxx::rope< _CharT, _Alloc >::rope().

template<typename _InputIterator, typename _RandomAccessIterator, typename _RandomNumberGenerator>
_RandomAccessIterator random_sample (  _InputIterator  __first,
_InputIterator  __last,
_RandomAccessIterator  __out_first,
_RandomAccessIterator  __out_last,
_RandomNumberGenerator &  __rand
)  [inline]
 

This is an SGI extension.

Definition at line 404 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __gnu_cxx::__random_sample().

template<typename _InputIterator, typename _RandomAccessIterator>
_RandomAccessIterator random_sample (  _InputIterator  __first,
_InputIterator  __last,
_RandomAccessIterator  __out_first,
_RandomAccessIterator  __out_last
)  [inline]
 

This is an SGI extension.

Definition at line 382 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and __gnu_cxx::__random_sample().

template<typename _ForwardIterator, typename _OutputIterator, typename _Distance, typename _RandomNumberGenerator>
_OutputIterator random_sample_n (  _ForwardIterator  __first,
_ForwardIterator  __last,
_OutputIterator  __out,
const _Distance  __n,
_RandomNumberGenerator &  __rand
) 
 

This is an SGI extension.

Definition at line 297 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::distance().

template<typename _ForwardIterator, typename _OutputIterator, typename _Distance>
_OutputIterator random_sample_n (  _ForwardIterator  __first,
_ForwardIterator  __last,
_OutputIterator  __out,
const _Distance  __n
) 
 

This is an SGI extension.

Definition at line 264 of file ext/algorithm.

References __glibcxx_function_requires, __glibcxx_requires_valid_range, and std::distance().

template<typename _InputIter, typename _Size, typename _ForwardIter>
pair<_InputIter, _ForwardIter> uninitialized_copy_n (  _InputIter  __first,
_Size  __count,
_ForwardIter  __result
)  [inline]
 

Copies the range [first,last) into result.

Parameters:
first An input iterator.
last An input iterator.
result An output iterator.
Returns:
result + (first - last)
Like copy(), but does not require an initialized output range.

Definition at line 129 of file ext/memory.

References __gnu_cxx::__uninitialized_copy_n().

Referenced by __gnu_cxx::rope< _CharT, _Alloc >::_S_RopeLeaf_from_unowned_char_ptr(), and __gnu_cxx::_Rope_RopeSubstring< _CharT, _Alloc >::operator()().

Generated on Tue Jan 30 17:31:58 2007 for GNU C++ STL by doxygen 1.3.6