1#ifndef MSL_ALGORITHM_H_
2#define MSL_ALGORITHM_H_
5template <
class ForwardIterator,
class T>
8template <
class ForwardIterator,
class T>
11template<
class InputIt,
class UnaryPredicate>
40template<
class ForwardIt,
class T>
42 for (; first != last; ++first){
47template<
class InputIt,
class OutputIt>
50 for (; first < last; ++first, ++
d_first) {
56template<
class B
idirIt1,
class B
idirIt2>
58 while (first != last) {
T cLib_calcTimer(T *value)
Definition c_lib.h:74
static const double T[]
Definition k_tan.c:106
Definition d_a_e_wb.cpp:12
OutputIt copy(InputIt first, InputIt last, OutputIt d_first)
Definition algorithm.h:48
BidirIt2 copy_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last)
Definition algorithm.h:57
void fill(ForwardIt first, ForwardIt last, const T &value)
Definition algorithm.h:41