std Namespace Reference


Classes

class  numeric_limits< T[Size]>
 Specialization of numeric_limits for arrays. More...
class  numeric_limits< Arageli::big_int >
 Specialization of std::numeric_limits for Arageli::big_int. More...
class  numeric_limits< Arageli::rational< T > >
 Specialization of standard template std::numeric_limits for rationals. More...

Specialization of std::sqrt for all integer type as Arageli::intsqrt.

char sqrt (char a)
unsigned char sqrt (unsigned char a)
signed char sqrt (signed char a)
unsigned short sqrt (unsigned short a)
signed short sqrt (signed short a)
unsigned int sqrt (unsigned int a)
signed int sqrt (signed int a)
unsigned long sqrt (unsigned long a)
signed long sqrt (signed long a)

Standard mathematical functions on vector.

template<typename T, bool REFCNT>
Arageli::vector< T, true > sin (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > cos (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > tan (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > sinh (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > cosh (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > tanh (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > asin (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > acos (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > atan (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > abs (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > exp (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > floor (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > ceil (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > log (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > log10 (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, true > sqrt (const Arageli::vector< T, REFCNT > &x)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1 > pow (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename P>
Arageli::vector< T1, REFCNT1 > pow (const Arageli::vector< T1, REFCNT1 > &a, const P &b)

Standard algorithm overloading for Arageli::vector.

template<typename T, bool REFCNT, typename Fu>
Fu for_each (Arageli::vector< T, REFCNT > &x, Fu f)
template<typename T, bool REFCNT, typename Fu>
Fu for_each (const Arageli::vector< T, REFCNT > &x, Fu f)
template<typename T, bool REFCNT, typename T1>
Arageli::vector< T, REFCNT
>::iterator 		find (Arageli::vector< T, REFCNT > &x, const T1 &val)
template<typename T, bool REFCNT, typename T1>
Arageli::vector< T, REFCNT
>::const_iterator 		find (const Arageli::vector< T, REFCNT > &x, const T1 &val)
template<typename T, bool REFCNT, typename Fu>
Arageli::vector< T, REFCNT
>::iterator 		find_if (Arageli::vector< T, REFCNT > &x, Fu f)
template<typename T, bool REFCNT, typename Fu>
Arageli::vector< T, REFCNT
>::const_iterator 		find_if (const Arageli::vector< T, REFCNT > &x, Fu f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::iterator 		find_end (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::const_iterator 		find_end (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::iterator 		find_end (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::const_iterator 		find_end (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::iterator 		find_first_of (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::const_iterator 		find_first_of (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::iterator 		find_first_of (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::const_iterator 		find_first_of (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T, bool REFCNT>
Arageli::vector< T, REFCNT
>::iterator 		adjacent_find (Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT>
Arageli::vector< T, REFCNT
>::const_iterator 		adjacent_find (const Arageli::vector< T, REFCNT > &x)
template<typename T, bool REFCNT, typename Fb>
Arageli::vector< T, REFCNT
>::iterator 		adjacent_find (Arageli::vector< T, REFCNT > &x, Fb f)
template<typename T, bool REFCNT, typename Fb>
Arageli::vector< T, REFCNT
>::const_iterator 		adjacent_find (const Arageli::vector< T, REFCNT > &x, Fb f)
template<typename T, bool REFCNT, typename T1>
Arageli::vector< T, REFCNT
>::difference_type 		count (const Arageli::vector< T, REFCNT > &x, const T1 &val)
template<typename T, bool REFCNT, typename Fu>
Arageli::vector< T, REFCNT
>::difference_type 		count_if (const Arageli::vector< T, REFCNT > &x, Fu f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T2, REFCNT2 >::const_iterator > 		mismatch (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T2, REFCNT2 >::const_iterator > 		mismatch (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T2, REFCNT2 >::iterator > 		mismatch (const Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T2, REFCNT2 >::iterator > 		mismatch (const Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<
T1, REFCNT1 >::iterator,
typename Arageli::vector<
T2, REFCNT2 >::const_iterator > 		mismatch (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<
T1, REFCNT1 >::iterator,
typename Arageli::vector<
T2, REFCNT2 >::const_iterator > 		mismatch (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
bool equal (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
bool equal (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::const_iterator 		search (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::const_iterator 		search (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T1, REFCNT1
>::iterator 		search (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector< T1, REFCNT1
>::iterator 		search (Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Fb f)
template<typename T1, bool REFCNT1, typename Size, typename T>
Arageli::vector< T1, REFCNT1
>::const_iterator 		search (const Arageli::vector< T1, REFCNT1 > &a, Size count, const T &value)
template<typename T1, bool REFCNT1, typename Size, typename T, typename Fb>
Arageli::vector< T1, REFCNT1
>::const_iterator 		search (const Arageli::vector< T1, REFCNT1 > &a, Size count, const T &value, Fb f)
template<typename T1, bool REFCNT1, typename Size, typename T>
Arageli::vector< T1, REFCNT1
>::iterator 		search (Arageli::vector< T1, REFCNT1 > &a, Size count, const T &value)
template<typename T1, bool REFCNT1, typename Size, typename T, typename Fb>
Arageli::vector< T1, REFCNT1
>::iterator 		search (Arageli::vector< T1, REFCNT1 > &a, Size count, const T &value, Fb f)
template<typename T1, bool REFCNT1, typename Out>
Out copy (const Arageli::vector< T1, REFCNT1 > &a, Out out)
template<typename T1, bool REFCNT1, typename Out>
Out copy_backward (const Arageli::vector< T1, REFCNT1 > &a, Out out)
template<typename T1, bool REFCNT1, typename Fu>
void transform (Arageli::vector< T1, REFCNT1 > &a, Fu f)
 Applies f to each item of a and stores the result to the same item.
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fu>
void transform (const Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b, Fu f)
 Applies f to each item in a and stores the result to corresponding item of b.
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename T3, bool REFCNT3, typename Fb>
void transform (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Arageli::vector< T3, REFCNT3 > &c, Fb f)
template<typename T1, bool REFCNT1, typename T2>
void replace (Arageli::vector< T1, REFCNT1 > &a, const T2 &oldv, const T2 &newv)
template<typename T1, bool REFCNT1, typename Fu, typename T2>
void replace_if (Arageli::vector< T1, REFCNT1 > &a, Fu f, const T2 &newv)
template<typename T1, bool REFCNT1, typename Out, typename T2>
Out replace_copy (Arageli::vector< T1, REFCNT1 > &a, Out out, const T2 &oldv, const T2 &newv)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename T3>
void replace_copy (Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b, const T3 &oldv, const T3 &newv)
template<typename T1, bool REFCNT1, typename Out, typename Fu, typename T2>
Out replace_copy_if (Arageli::vector< T1, REFCNT1 > &a, Out out, Fu f, const T2 &newv)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fu, typename T3>
void replace_copy_if (Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b, Fu f, const T3 &newv)
template<typename T1, bool REFCNT1, typename T2>
void fill (Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename Fn>
void generate (Arageli::vector< T1, REFCNT1 > &a, Fn f)
template<typename T1, bool REFCNT1, typename T2>
Arageli::vector< T1, REFCNT1
>::iterator 		remove (Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector< T1, REFCNT1
>::iterator 		remove_if (Arageli::vector< T1, REFCNT1 > &a, Fu f)
template<typename T1, bool REFCNT1, typename T2, typename Out>
Out remove_copy (const Arageli::vector< T1, REFCNT1 > &a, Out out, const T2 &v)
template<typename T1, bool REFCNT1, typename Fu, typename Out>
Out remove_copy (const Arageli::vector< T1, REFCNT1 > &a, Out out, Fu f)
template<typename T1, bool REFCNT1>
Arageli::vector< T1, REFCNT1
>::iterator 		unique (Arageli::vector< T1, REFCNT1 > &a)
template<typename T1, bool REFCNT1, typename Fb>
Arageli::vector< T1, REFCNT1
>::iterator 		unique (Arageli::vector< T1, REFCNT1 > &a, Fb f)
template<typename T1, bool REFCNT1, typename Out>
Out unique_copy (const Arageli::vector< T1, REFCNT1 > &a, Out out)
template<typename T1, bool REFCNT1, typename Out, typename Fu>
Out unique_copy (const Arageli::vector< T1, REFCNT1 > &a, Out out, Fu f)
template<typename T1, bool REFCNT1>
void reverse (Arageli::vector< T1, REFCNT1 > &a)
template<typename T1, bool REFCNT1, typename Out>
Out reverse_copy (const Arageli::vector< T1, REFCNT1 > &a, Out out)
template<typename T1, bool REFCNT1>
void rotate (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle)
template<typename T1, bool REFCNT1>
void rotate (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle)
template<typename T1, bool REFCNT1, typename Out>
Out rotate (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle, Out out)
template<typename T1, bool REFCNT1, typename Out>
Out rotate (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle, Out out)
template<typename T1, bool REFCNT1>
void random_shuffle (Arageli::vector< T1, REFCNT1 > &a)
template<typename T1, bool REFCNT1, typename Rand>
void random_shuffle (Arageli::vector< T1, REFCNT1 > &a, Rand r)
template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector< T1, REFCNT1
>::iterator 		partition (Arageli::vector< T1, REFCNT1 > &a, Fu f)
template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector< T1, REFCNT1
>::iterator 		stable_partition (Arageli::vector< T1, REFCNT1 > &a, Fu f)
template<typename T1, bool REFCNT1>
void sort (Arageli::vector< T1, REFCNT1 > &a)
template<typename T1, bool REFCNT1, typename Cmp>
void sort (Arageli::vector< T1, REFCNT1 > &a, Cmp cmp)
template<typename T1, bool REFCNT1>
void stable_sort (Arageli::vector< T1, REFCNT1 > &a)
template<typename T1, bool REFCNT1, typename Cmp>
void stable_sort (Arageli::vector< T1, REFCNT1 > &a, Cmp cmp)
template<typename T1, bool REFCNT1>
void partial_sort (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle)
template<typename T1, bool REFCNT1>
void partial_sort (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle)
template<typename T1, bool REFCNT1, typename Cmp>
void partial_sort (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle, Cmp cmp)
template<typename T1, bool REFCNT1, typename Cmp>
void partial_sort (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector< T2, REFCNT2
>::iterator 		partial_sort_copy (const Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Cmp>
Arageli::vector< T2, REFCNT2
>::iterator 		partial_sort_copy (const Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b, Cmp cmp)
template<typename T1, bool REFCNT1>
void nth_element (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator nth)
template<typename T1, bool REFCNT1, typename Cmp>
void nth_element (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator nth, Cmp cmp)
template<typename T1, bool REFCNT1>
void nth_element (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type nth)
template<typename T1, bool REFCNT1, typename Cmp>
void nth_element (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type nth, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
Arageli::vector< T1, REFCNT1
>::iterator 		lower_bound (Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector< T1, REFCNT1
>::iterator 		lower_bound (Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
Arageli::vector< T1, REFCNT1
>::const_iterator 		lower_bound (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector< T1, REFCNT1
>::const_iterator 		lower_bound (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
Arageli::vector< T1, REFCNT1
>::iterator 		upper_bound (Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector< T1, REFCNT1
>::iterator 		upper_bound (Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
Arageli::vector< T1, REFCNT1
>::const_iterator 		upper_bound (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector< T1, REFCNT1
>::const_iterator 		upper_bound (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
pair< typename Arageli::vector<
T1, REFCNT1 >::iterator,
typename Arageli::vector<
T1, REFCNT1 >::iterator > 		equal_range (Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
pair< typename Arageli::vector<
T1, REFCNT1 >::iterator,
typename Arageli::vector<
T1, REFCNT1 >::iterator > 		equal_range (Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T1, REFCNT1 >::const_iterator > 		equal_range (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v)
template<typename T1, bool REFCNT1, typename T2, typename Cmp>
pair< typename Arageli::vector<
T1, REFCNT1 >::const_iterator,
typename Arageli::vector<
T1, REFCNT1 >::const_iterator > 		equal_range (const Arageli::vector< T1, REFCNT1 > &a, const T2 &v, Cmp cmp)
template<typename T, bool REFCNT, typename T1>
bool binary_search (const Arageli::vector< T, REFCNT > &x, const T1 &val)
template<typename T, bool REFCNT, typename T1, typename Cmp>
bool binary_search (const Arageli::vector< T, REFCNT > &x, const T1 &val, Cmp cmp)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Out>
Out merge (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Out out)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Out, typename Cmp>
Out merge (const Arageli::vector< T1, REFCNT1 > &a, const Arageli::vector< T2, REFCNT2 > &b, Out out, Cmp cmp)
template<typename T1, bool REFCNT1, typename Out>
Out inplace_merge (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle)
template<typename T1, bool REFCNT1, typename Out, typename Cmp>
Out inplace_merge (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::iterator middle, Cmp cmp)
template<typename T1, bool REFCNT1, typename Out>
Out inplace_merge (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle)
template<typename T1, bool REFCNT1, typename Out, typename Cmp>
Out inplace_merge (Arageli::vector< T1, REFCNT1 > &a, typename Arageli::vector< T1, REFCNT1 >::difference_type middle, Cmp cmp)

Functions

Arageli::big_int sqrt (const Arageli::big_int &a)
Arageli::big_int abs (const Arageli::big_int &x)
 Returns absolutly value of x.
Arageli::big_int pow (const Arageli::big_int &x, int p)
 Raise x to a power p.
Arageli::big_int pow (const Arageli::big_int &x, const Arageli::big_int &p)
 Raise x to a power p.
void swap (Arageli::big_int &a, Arageli::big_int &b)
 Swaps two numbers without actually copying.
template<typename T>
Arageli::interval< T > abs (const Arageli::interval< T > &x)
template<typename T>
void swap (Arageli::_Internal::Rep_matrix< T > &a, Arageli::_Internal::Rep_matrix< T > &b)
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
void swap (Arageli::matrix< T1, REFCNT1 > &a, Arageli::matrix< T2, REFCNT2 > &b)
 Swaps two matrix without actully copying (if possible).
template<typename T1, bool REFCNT1>
void swap (Arageli::matrix< T1, REFCNT1 > &a, Arageli::matrix< T1, REFCNT1 > &b)
 Swaps two matrix without actully copying (if possible).
template<typename T>
Arageli::rational< T > abs (const Arageli::rational< T > &x)
 Absolute value of x.
template<typename T>
Arageli::rational< T > floor (const Arageli::rational< T > &x)
 Floor of x.
template<typename T>
Arageli::rational< T > ceil (const Arageli::rational< T > &x)
 Ceiling of x.
template<typename T>
void swap (Arageli::rational< T > &a, Arageli::rational< T > &b)
 Swaps two rationals without actully copying (if possible).
template<typename T1, typename T2>
void swap (Arageli::rational< T1 > &a, Arageli::rational< T2 > &b)
 Swaps two rationals without actully copying (if possible).
template<typename T1, bool REFCNT1, typename TC1, typename A1, typename T2, bool REFCNT2, typename TC2, typename A2>
void swap (Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &a, Arageli::refcntr_proxy< T2, REFCNT2, TC2, A2 > &b)
template<typename T1, bool REFCNT1, typename TC1, typename A1>
void swap (Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &a, Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &b)
template<class T>
std::ostream & operator<< (std::ostream &s, std::vector< T > &v)
template<typename F1, typename I1, bool REFCNT1, typename I2>
Arageli::sparse_polynom< F1,
I1, REFCNT1 > 		pow (const Arageli::sparse_polynom< F1, I1, REFCNT1 > &a, const I2 &n)
template<typename F1, typename I1, typename F2, typename I2>
void swap (Arageli::monom< F1, I1 > &a, Arageli::monom< F2, I2 > &b)
template<typename F1, typename I1, bool REFCNT1, typename F2, typename I2, bool REFCNT2>
void swap (Arageli::sparse_polynom< F1, I1, REFCNT1 > &a, Arageli::sparse_polynom< F2, I2, REFCNT2 > &b)
template<typename F, typename I>
void swap (Arageli::monom< F, I > &a, Arageli::monom< F, I > &b)
template<typename F, typename I, bool REFCNT>
void swap (Arageli::sparse_polynom< F, I, REFCNT > &a, Arageli::sparse_polynom< F, I, REFCNT > &b)
template<typename F, typename I>
Arageli::monom< F, I > abs (const Arageli::monom< F, I > &x)
 Absolute value for monom.
template<typename F, typename I, bool REFCNT>
Arageli::sparse_polynom< F,
I, REFCNT > 		abs (const Arageli::sparse_polynom< F, I, REFCNT > &x)
 Absolute value for polynomial.
template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
void swap (Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T2, REFCNT2 > &b)
 Swaps two vectors without actully copying (if possible).
template<typename T1, bool REFCNT1>
void swap (Arageli::vector< T1, REFCNT1 > &a, Arageli::vector< T1, REFCNT1 > &b)
 Swaps two vectors without actully copying (if possible).

Function Documentation

Arageli::big_int std::sqrt ( const Arageli::big_int &  a  )  [inline]

Definition at line 852 of file big_int.hpp.

Arageli::big_int std::abs ( const Arageli::big_int &  x  )  [inline]

Returns absolutly value of x.

Definition at line 856 of file big_int.hpp.

Arageli::big_int std::pow ( const Arageli::big_int &  x,
int  p 
) [inline]

Raise x to a power p.

Just uses Arageli::power.

Definition at line 861 of file big_int.hpp.

Arageli::big_int std::pow ( const Arageli::big_int &  x,
const Arageli::big_int &  p 
) [inline]

Raise x to a power p.

Just uses Arageli::power.

Definition at line 867 of file big_int.hpp.

void std::swap ( Arageli::big_int &  a,
Arageli::big_int &  b 
) [inline]

Swaps two numbers without actually copying.

Definition at line 912 of file big_int.hpp.

char std::sqrt ( char  a  )  [inline]

Definition at line 320 of file intalg.hpp.

unsigned char std::sqrt ( unsigned char  a  )  [inline]

Definition at line 321 of file intalg.hpp.

signed char std::sqrt ( signed char  a  )  [inline]

Definition at line 322 of file intalg.hpp.

unsigned short std::sqrt ( unsigned short  a  )  [inline]

Definition at line 323 of file intalg.hpp.

signed short std::sqrt ( signed short  a  )  [inline]

Definition at line 324 of file intalg.hpp.

unsigned int std::sqrt ( unsigned int  a  )  [inline]

Definition at line 325 of file intalg.hpp.

signed int std::sqrt ( signed int  a  )  [inline]

Definition at line 326 of file intalg.hpp.

unsigned long std::sqrt ( unsigned long  a  )  [inline]

Definition at line 327 of file intalg.hpp.

signed long std::sqrt ( signed long  a  )  [inline]

Definition at line 328 of file intalg.hpp.

template<typename T>
Arageli::interval<T> std::abs ( const Arageli::interval< T > &  x  )  [inline]

Definition at line 414 of file interval.hpp.

template<typename T>
void std::swap ( Arageli::_Internal::Rep_matrix< T > &  a,
Arageli::_Internal::Rep_matrix< T > &  b 
) [inline]

Definition at line 129 of file matrix.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
void std::swap ( Arageli::matrix< T1, REFCNT1 > &  a,
Arageli::matrix< T2, REFCNT2 > &  b 
) [inline]

Swaps two matrix without actully copying (if possible).

Definition at line 3570 of file matrix.hpp.

template<typename T1, bool REFCNT1>
void std::swap ( Arageli::matrix< T1, REFCNT1 > &  a,
Arageli::matrix< T1, REFCNT1 > &  b 
) [inline]

Swaps two matrix without actully copying (if possible).

Definition at line 3580 of file matrix.hpp.

template<typename T>
Arageli::rational<T> std::abs ( const Arageli::rational< T > &  x  )  [inline]

Absolute value of x.

Definition at line 728 of file rational.hpp.

template<typename T>
Arageli::rational<T> std::floor ( const Arageli::rational< T > &  x  )  [inline]

Floor of x.

See Arageli::ifloor.

Definition at line 734 of file rational.hpp.

template<typename T>
Arageli::rational<T> std::ceil ( const Arageli::rational< T > &  x  )  [inline]

Ceiling of x.

See Arageli::iceil.

Definition at line 740 of file rational.hpp.

template<typename T>
void std::swap ( Arageli::rational< T > &  a,
Arageli::rational< T > &  b 
)

Swaps two rationals without actully copying (if possible).

Definition at line 791 of file rational.hpp.

template<typename T1, typename T2>
void std::swap ( Arageli::rational< T1 > &  a,
Arageli::rational< T2 > &  b 
)

Swaps two rationals without actully copying (if possible).

Definition at line 796 of file rational.hpp.

template<typename T1, bool REFCNT1, typename TC1, typename A1, typename T2, bool REFCNT2, typename TC2, typename A2>
void std::swap ( Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &  a,
Arageli::refcntr_proxy< T2, REFCNT2, TC2, A2 > &  b 
) [inline]

Definition at line 294 of file refcntr.hpp.

template<typename T1, bool REFCNT1, typename TC1, typename A1>
void std::swap ( Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &  a,
Arageli::refcntr_proxy< T1, REFCNT1, TC1, A1 > &  b 
) [inline]

Definition at line 305 of file refcntr.hpp.

template<class T>
std::ostream& std::operator<< ( std::ostream &  s,
std::vector< T > &  v 
)

Definition at line 25 of file smithpoly.cpp.

template<typename F1, typename I1, bool REFCNT1, typename I2>
Arageli::sparse_polynom<F1, I1, REFCNT1> std::pow ( const Arageli::sparse_polynom< F1, I1, REFCNT1 > &  a,
const I2 &  n 
) [inline]

Definition at line 2547 of file sparse_polynom.hpp.

template<typename F1, typename I1, typename F2, typename I2>
void std::swap ( Arageli::monom< F1, I1 > &  a,
Arageli::monom< F2, I2 > &  b 
) [inline]

Definition at line 2557 of file sparse_polynom.hpp.

template<typename F1, typename I1, bool REFCNT1, typename F2, typename I2, bool REFCNT2>
void std::swap ( Arageli::sparse_polynom< F1, I1, REFCNT1 > &  a,
Arageli::sparse_polynom< F2, I2, REFCNT2 > &  b 
) [inline]

Definition at line 2570 of file sparse_polynom.hpp.

template<typename F, typename I>
void std::swap ( Arageli::monom< F, I > &  a,
Arageli::monom< F, I > &  b 
) [inline]

Definition at line 2579 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
void std::swap ( Arageli::sparse_polynom< F, I, REFCNT > &  a,
Arageli::sparse_polynom< F, I, REFCNT > &  b 
) [inline]

Definition at line 2588 of file sparse_polynom.hpp.

template<typename F, typename I>
Arageli::monom<F, I> std::abs ( const Arageli::monom< F, I > &  x  )  [inline]

Absolute value for monom.

It is a monom with the same degree and abs(x.coef()) coefficient.

Definition at line 2599 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
Arageli::sparse_polynom<F, I, REFCNT> std::abs ( const Arageli::sparse_polynom< F, I, REFCNT > &  x  )  [inline]

Absolute value for polynomial.

It is x if leading coefficient of x is positive and -x if leading coefficient is negative.

Definition at line 2607 of file sparse_polynom.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::sin ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Each of this function evaluate specific mathematical function of each element in vector and results store to returned vector.

Definition at line 2370 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::cos ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2371 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::tan ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2372 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::sinh ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2373 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::cosh ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2374 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::tanh ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2375 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::asin ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2376 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::acos ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2377 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::atan ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2378 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::abs ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2379 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::exp ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2380 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::floor ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2381 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::ceil ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2382 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::log ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2383 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::log10 ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2384 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, true> std::sqrt ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2385 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1> std::pow ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2393 of file vector.hpp.

template<typename T1, bool REFCNT1, typename P>
Arageli::vector<T1, REFCNT1> std::pow ( const Arageli::vector< T1, REFCNT1 > &  a,
const P &  b 
) [inline]

Definition at line 2405 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
void std::swap ( Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Swaps two vectors without actully copying (if possible).

Definition at line 2423 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::swap ( Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T1, REFCNT1 > &  b 
) [inline]

Swaps two vectors without actully copying (if possible).

Definition at line 2433 of file vector.hpp.

template<typename T, bool REFCNT, typename Fu>
Fu std::for_each ( Arageli::vector< T, REFCNT > &  x,
Fu  f 
) [inline]

See C++ International Standard ISO/IEC 14882:1998(E), 25.1--25.3. WARNING. Not all functions are implemented yet.

Definition at line 2450 of file vector.hpp.

template<typename T, bool REFCNT, typename Fu>
Fu std::for_each ( const Arageli::vector< T, REFCNT > &  x,
Fu  f 
) [inline]

Definition at line 2454 of file vector.hpp.

template<typename T, bool REFCNT, typename T1>
Arageli::vector<T, REFCNT>::iterator std::find ( Arageli::vector< T, REFCNT > &  x,
const T1 &  val 
) [inline]

Definition at line 2461 of file vector.hpp.

template<typename T, bool REFCNT, typename T1>
Arageli::vector<T, REFCNT>::const_iterator std::find ( const Arageli::vector< T, REFCNT > &  x,
const T1 &  val 
) [inline]

Definition at line 2466 of file vector.hpp.

template<typename T, bool REFCNT, typename Fu>
Arageli::vector<T, REFCNT>::iterator std::find_if ( Arageli::vector< T, REFCNT > &  x,
Fu  f 
) [inline]

Definition at line 2473 of file vector.hpp.

template<typename T, bool REFCNT, typename Fu>
Arageli::vector<T, REFCNT>::const_iterator std::find_if ( const Arageli::vector< T, REFCNT > &  x,
Fu  f 
) [inline]

Definition at line 2478 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::iterator std::find_end ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2490 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::const_iterator std::find_end ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2504 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::iterator std::find_end ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2519 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::const_iterator std::find_end ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2535 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::iterator std::find_first_of ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2551 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::const_iterator std::find_first_of ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2565 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::iterator std::find_first_of ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2580 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::const_iterator std::find_first_of ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2596 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, REFCNT>::iterator std::adjacent_find ( Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2607 of file vector.hpp.

template<typename T, bool REFCNT>
Arageli::vector<T, REFCNT>::const_iterator std::adjacent_find ( const Arageli::vector< T, REFCNT > &  x  )  [inline]

Definition at line 2612 of file vector.hpp.

template<typename T, bool REFCNT, typename Fb>
Arageli::vector<T, REFCNT>::iterator std::adjacent_find ( Arageli::vector< T, REFCNT > &  x,
Fb  f 
) [inline]

Definition at line 2617 of file vector.hpp.

template<typename T, bool REFCNT, typename Fb>
Arageli::vector<T, REFCNT>::const_iterator std::adjacent_find ( const Arageli::vector< T, REFCNT > &  x,
Fb  f 
) [inline]

Definition at line 2622 of file vector.hpp.

template<typename T, bool REFCNT, typename T1>
Arageli::vector<T, REFCNT>::difference_type std::count ( const Arageli::vector< T, REFCNT > &  x,
const T1 &  val 
) [inline]

Definition at line 2629 of file vector.hpp.

template<typename T, bool REFCNT, typename Fu>
Arageli::vector<T, REFCNT>::difference_type std::count_if ( const Arageli::vector< T, REFCNT > &  x,
Fu  f 
) [inline]

Definition at line 2636 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T2, REFCNT2>::const_iterator > std::mismatch ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2653 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T2, REFCNT2>::const_iterator > std::mismatch ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2679 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T2, REFCNT2>::iterator > std::mismatch ( const Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2705 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T2, REFCNT2>::iterator > std::mismatch ( const Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2731 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
pair< typename Arageli::vector<T1, REFCNT1>::iterator, typename Arageli::vector<T2, REFCNT2>::const_iterator > std::mismatch ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2757 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
pair< typename Arageli::vector<T1, REFCNT1>::iterator, typename Arageli::vector<T2, REFCNT2>::const_iterator > std::mismatch ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2783 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
bool std::equal ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2804 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
bool std::equal ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2818 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::const_iterator std::search ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2837 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::const_iterator std::search ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2852 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T1, REFCNT1>::iterator std::search ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 2867 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fb>
Arageli::vector<T1, REFCNT1>::iterator std::search ( Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Fb  f 
) [inline]

Definition at line 2882 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Size, typename T>
Arageli::vector<T1, REFCNT1>::const_iterator std::search ( const Arageli::vector< T1, REFCNT1 > &  a,
Size  count,
const T &  value 
) [inline]

Definition at line 2898 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Size, typename T, typename Fb>
Arageli::vector<T1, REFCNT1>::const_iterator std::search ( const Arageli::vector< T1, REFCNT1 > &  a,
Size  count,
const T &  value,
Fb  f 
) [inline]

Definition at line 2912 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Size, typename T>
Arageli::vector<T1, REFCNT1>::iterator std::search ( Arageli::vector< T1, REFCNT1 > &  a,
Size  count,
const T &  value 
) [inline]

Definition at line 2926 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Size, typename T, typename Fb>
Arageli::vector<T1, REFCNT1>::iterator std::search ( Arageli::vector< T1, REFCNT1 > &  a,
Size  count,
const T &  value,
Fb  f 
) [inline]

Definition at line 2940 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out 
) [inline]

Definition at line 2954 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::copy_backward ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out 
) [inline]

Definition at line 2968 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu>
void std::transform ( Arageli::vector< T1, REFCNT1 > &  a,
Fu  f 
) [inline]

Applies f to each item of a and stores the result to the same item.

Definition at line 2978 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fu>
void std::transform ( const Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b,
Fu  f 
) [inline]

Applies f to each item in a and stores the result to corresponding item of b.

Requires: a.size() <= b.size()

Definition at line 2991 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename T3, bool REFCNT3, typename Fb>
void std::transform ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Arageli::vector< T3, REFCNT3 > &  c,
Fb  f 
) [inline]

Definition at line 3010 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
void std::replace ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  oldv,
const T2 &  newv 
) [inline]

Definition at line 3029 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu, typename T2>
void std::replace_if ( Arageli::vector< T1, REFCNT1 > &  a,
Fu  f,
const T2 &  newv 
) [inline]

Definition at line 3044 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out, typename T2>
Out std::replace_copy ( Arageli::vector< T1, REFCNT1 > &  a,
Out  out,
const T2 &  oldv,
const T2 &  newv 
) [inline]

Definition at line 3058 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename T3>
void std::replace_copy ( Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b,
const T3 &  oldv,
const T3 &  newv 
) [inline]

Definition at line 3074 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out, typename Fu, typename T2>
Out std::replace_copy_if ( Arageli::vector< T1, REFCNT1 > &  a,
Out  out,
Fu  f,
const T2 &  newv 
) [inline]

Definition at line 3093 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Fu, typename T3>
void std::replace_copy_if ( Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b,
Fu  f,
const T3 &  newv 
) [inline]

Definition at line 3108 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
void std::fill ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3126 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fn>
void std::generate ( Arageli::vector< T1, REFCNT1 > &  a,
Fn  f 
) [inline]

Definition at line 3140 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
Arageli::vector<T1, REFCNT1>::iterator std::remove ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3155 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector<T1, REFCNT1>::iterator std::remove_if ( Arageli::vector< T1, REFCNT1 > &  a,
Fu  f 
) [inline]

Definition at line 3170 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Out>
Out std::remove_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out,
const T2 &  v 
) [inline]

Definition at line 3184 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu, typename Out>
Out std::remove_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out,
Fu  f 
) [inline]

Definition at line 3199 of file vector.hpp.

template<typename T1, bool REFCNT1>
Arageli::vector<T1, REFCNT1>::iterator std::unique ( Arageli::vector< T1, REFCNT1 > &  a  )  [inline]

Definition at line 3209 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fb>
Arageli::vector<T1, REFCNT1>::iterator std::unique ( Arageli::vector< T1, REFCNT1 > &  a,
Fb  f 
) [inline]

Definition at line 3214 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::unique_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out 
) [inline]

Definition at line 3225 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out, typename Fu>
Out std::unique_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out,
Fu  f 
) [inline]

Definition at line 3235 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::reverse ( Arageli::vector< T1, REFCNT1 > &  a  )  [inline]

Definition at line 3241 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::reverse_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Out  out 
) [inline]

Definition at line 3247 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::rotate ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle 
) [inline]

Definition at line 3254 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::rotate ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle 
) [inline]

Definition at line 3262 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::rotate ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle,
Out  out 
) [inline]

Definition at line 3272 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::rotate ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle,
Out  out 
) [inline]

Definition at line 3281 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::random_shuffle ( Arageli::vector< T1, REFCNT1 > &  a  )  [inline]

Definition at line 3291 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Rand>
void std::random_shuffle ( Arageli::vector< T1, REFCNT1 > &  a,
Rand  r 
) [inline]

Definition at line 3296 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector<T1, REFCNT1>::iterator std::partition ( Arageli::vector< T1, REFCNT1 > &  a,
Fu  f 
) [inline]

Definition at line 3303 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Fu>
Arageli::vector<T1, REFCNT1>::iterator std::stable_partition ( Arageli::vector< T1, REFCNT1 > &  a,
Fu  f 
) [inline]

Definition at line 3310 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::sort ( Arageli::vector< T1, REFCNT1 > &  a  )  [inline]

Definition at line 3316 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::sort ( Arageli::vector< T1, REFCNT1 > &  a,
Cmp  cmp 
) [inline]

Definition at line 3320 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::stable_sort ( Arageli::vector< T1, REFCNT1 > &  a  )  [inline]

Definition at line 3326 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::stable_sort ( Arageli::vector< T1, REFCNT1 > &  a,
Cmp  cmp 
) [inline]

Definition at line 3330 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::partial_sort ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle 
) [inline]

Definition at line 3337 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::partial_sort ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle 
) [inline]

Definition at line 3345 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::partial_sort ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle,
Cmp  cmp 
) [inline]

Definition at line 3353 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::partial_sort ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle,
Cmp  cmp 
) [inline]

Definition at line 3362 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2>
Arageli::vector<T2, REFCNT2>::iterator std::partial_sort_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b 
) [inline]

Definition at line 3378 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Cmp>
Arageli::vector<T2, REFCNT2>::iterator std::partial_sort_copy ( const Arageli::vector< T1, REFCNT1 > &  a,
Arageli::vector< T2, REFCNT2 > &  b,
Cmp  cmp 
) [inline]

Definition at line 3392 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::nth_element ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  nth 
) [inline]

Definition at line 3403 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::nth_element ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  nth,
Cmp  cmp 
) [inline]

Definition at line 3411 of file vector.hpp.

template<typename T1, bool REFCNT1>
void std::nth_element ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  nth 
) [inline]

Definition at line 3420 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Cmp>
void std::nth_element ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  nth,
Cmp  cmp 
) [inline]

Definition at line 3428 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
Arageli::vector<T1, REFCNT1>::iterator std::lower_bound ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3440 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector<T1, REFCNT1>::iterator std::lower_bound ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3453 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
Arageli::vector<T1, REFCNT1>::const_iterator std::lower_bound ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3462 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector<T1, REFCNT1>::const_iterator std::lower_bound ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3475 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
Arageli::vector<T1, REFCNT1>::iterator std::upper_bound ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3486 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector<T1, REFCNT1>::iterator std::upper_bound ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3499 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
Arageli::vector<T1, REFCNT1>::const_iterator std::upper_bound ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3508 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
Arageli::vector<T1, REFCNT1>::const_iterator std::upper_bound ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3521 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
pair< typename Arageli::vector<T1, REFCNT1>::iterator, typename Arageli::vector<T1, REFCNT1>::iterator> std::equal_range ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3537 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
pair< typename Arageli::vector<T1, REFCNT1>::iterator, typename Arageli::vector<T1, REFCNT1>::iterator> std::equal_range ( Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3555 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T1, REFCNT1>::const_iterator> std::equal_range ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v 
) [inline]

Definition at line 3569 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, typename Cmp>
pair< typename Arageli::vector<T1, REFCNT1>::const_iterator, typename Arageli::vector<T1, REFCNT1>::const_iterator> std::equal_range ( const Arageli::vector< T1, REFCNT1 > &  a,
const T2 &  v,
Cmp  cmp 
) [inline]

Definition at line 3587 of file vector.hpp.

template<typename T, bool REFCNT, typename T1>
bool std::binary_search ( const Arageli::vector< T, REFCNT > &  x,
const T1 &  val 
) [inline]

Definition at line 3597 of file vector.hpp.

template<typename T, bool REFCNT, typename T1, typename Cmp>
bool std::binary_search ( const Arageli::vector< T, REFCNT > &  x,
const T1 &  val,
Cmp  cmp 
) [inline]

Definition at line 3606 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Out>
Out std::merge ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Out  out 
) [inline]

Definition at line 3618 of file vector.hpp.

template<typename T1, bool REFCNT1, typename T2, bool REFCNT2, typename Out, typename Cmp>
Out std::merge ( const Arageli::vector< T1, REFCNT1 > &  a,
const Arageli::vector< T2, REFCNT2 > &  b,
Out  out,
Cmp  cmp 
) [inline]

Definition at line 3632 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::inplace_merge ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle 
) [inline]

Definition at line 3643 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out, typename Cmp>
Out std::inplace_merge ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::iterator  middle,
Cmp  cmp 
) [inline]

Definition at line 3655 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out>
Out std::inplace_merge ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle 
) [inline]

Definition at line 3664 of file vector.hpp.

template<typename T1, bool REFCNT1, typename Out, typename Cmp>
Out std::inplace_merge ( Arageli::vector< T1, REFCNT1 > &  a,
typename Arageli::vector< T1, REFCNT1 >::difference_type  middle,
Cmp  cmp 
) [inline]

Definition at line 3676 of file vector.hpp.

Generated on Thu Aug 31 17:38:48 2006 for Arageli by  doxygen 1.4.7