Twilight Princess
Decompilation of The Legend of Zelda: Twilight Princess
Loading...
Searching...
No Matches
algorithm.h
Go to the documentation of this file.
1#ifndef MSL_ALGORITHM_H_
2#define MSL_ALGORITHM_H_
3
4namespace std {
5template <class ForwardIterator, class T>
7
8template <class ForwardIterator, class T>
10
11template<class InputIt, class UnaryPredicate>
13
14/*
15template<class OutputIt, class Size, int A2>
16struct __fill_n {
17 OutputIt fill_n(OutputIt first, Size count, const unsigned long& value);
18};
19
20template<>
21unsigned long* __fill_n<unsigned long, long, 0>::fill_n(unsigned long* first, long count, const unsigned long& value) {
22 for (; count > 0; count--) {
23 *first++ = value;
24 }
25 return first;
26}
27
28template<class OutputIt, class Size, class T>
29OutputIt fill_n(OutputIt first, Size count, const T& value) {
30 return __fill_n::fill_n(first, count, value);
31}
32
33
34template<class ForwardIt, class T>
35void __fill(ForwardIt first, ForwardIt last, const T& value, std::random_access_iterator_tag param_3) {
36 fill_n(first, last - first, value);
37}
38*/
39
40template<class ForwardIt, class T>
41inline void fill(ForwardIt first, ForwardIt last, const T& value) {
42 for (; first != last; ++first){
43 *first = value;
44 }
45}
46
47template<class InputIt, class OutputIt>
48inline OutputIt copy(InputIt first, InputIt last,
50 for (; first < last; ++first, ++d_first) {
51 *d_first = *first;
52 }
53 return d_first;
54}
55
56template<class BidirIt1, class BidirIt2>
58 while (first != last) {
59 *(--d_last) = *(--last);
60 }
61 return d_last;
62}
63
64} // namespace std
65
66#endif
T cLib_calcTimer(T *value)
Definition c_lib.h:74
p
Definition e_acos.c:98
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
void lower_bound()
void find_if()
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
void upper_bound()