325 lines
11 KiB
C++
325 lines
11 KiB
C++
#ifndef _ALGORITHM_H_
|
||
#define _ALGORITHM_H_
|
||
|
||
#include "Functional.h"
|
||
#include "TypeTraits.h"
|
||
|
||
#include <cstring>
|
||
|
||
namespace TinySTL{
|
||
//********* [fill] ********************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template<class ForwardIterator, class T>
|
||
void fill(ForwardIterator first, ForwardIterator last, const T& value)
|
||
{
|
||
for (; first != last; ++first)
|
||
*first = value;
|
||
}
|
||
inline void fill(char *first, char *last, const char& value)
|
||
{
|
||
memset(first, static_cast<unsigned char>(value), last - first);
|
||
}
|
||
inline void fill(wchar_t *first, wchar_t *last, const wchar_t& value)
|
||
{
|
||
memset(first, static_cast<unsigned char>(value), (last - first) * sizeof(wchar_t));
|
||
}
|
||
//********* [fill_n] ********************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template<class OutputIterator, class Size, class T>
|
||
OutputIterator fill_n(OutputIterator first, Size n, const T& value)
|
||
{
|
||
for (; n > 0; --n, ++first)
|
||
*first = value;
|
||
return first;
|
||
}
|
||
template<class Size>
|
||
char *fill_n(char *first, Size n, const char& value)
|
||
{
|
||
memset(first, static_cast<unsigned char>(value), n);
|
||
return first + n;
|
||
}
|
||
template<class Size>
|
||
wchar_t *fill_n(wchar_t *first, Size n, const wchar_t& value)
|
||
{
|
||
memset(first, static_cast<unsigned char>(value), n * sizeof(wchar_t));
|
||
return first + n;
|
||
}
|
||
//*********** [min] ********************
|
||
//********* [Algorithm Complexity: O(1)] ****************
|
||
template <class T>
|
||
const T& min(const T& a, const T& b){
|
||
return !(b < a) ? a : b;
|
||
}
|
||
template <class T, class Compare>
|
||
const T& min(const T& a, const T& b, Compare comp){
|
||
return !comp(b, a) ? a : b;
|
||
}
|
||
//*********** [max] ********************
|
||
//********* [Algorithm Complexity: O(1)] ****************
|
||
template <class T>
|
||
const T& max(const T& a, const T& b){
|
||
return (a < b) ? b : a;
|
||
}
|
||
template <class T, class Compare>
|
||
const T& max(const T& a, const T& b, Compare comp){
|
||
return (copm(a, b)) ? b : a;
|
||
}
|
||
//********** [make_heap] ***************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template<class RandomAccessIterator, class Compare>
|
||
//heap<61><70><EFBFBD><EFBFBD><EFBFBD>㷨
|
||
static void up(RandomAccessIterator first, RandomAccessIterator last,
|
||
RandomAccessIterator head, Compare comp){//1.[first, last], 2.headr points the header of the heap
|
||
if (first != last){
|
||
int index = last - head;
|
||
auto parentIndex = (index - 1) / 2;
|
||
for (auto cur = last; parentIndex >= 0 && cur != head; parentIndex = (index - 1) / 2){
|
||
auto parent = head + parentIndex;//get parent
|
||
if (comp(*parent, *cur))
|
||
TinySTL::swap(*parent, *cur);
|
||
cur = parent;
|
||
index = cur - head;
|
||
}
|
||
}
|
||
}
|
||
template<class RandomAccessIterator, class Compare>
|
||
//heap<61>½<EFBFBD><C2BD>㷨
|
||
static void down(RandomAccessIterator first, RandomAccessIterator last,
|
||
RandomAccessIterator head, Compare comp){//1.[first, last], 2.headr points the header of the heap
|
||
if (first != last){
|
||
auto index = first - head;
|
||
auto leftChildIndex = index * 2 + 1;
|
||
for (auto cur = first; leftChildIndex < (last - head + 1) && cur < last; leftChildIndex = index * 2 + 1){
|
||
auto child = head + leftChildIndex;//get the left child
|
||
if ((child + 1) <= last && *(child + 1) > *child)//cur has a right child
|
||
child = child + 1;
|
||
if (comp(*cur, *child))
|
||
TinySTL::swap(*cur, *child);
|
||
cur = child;
|
||
index = cur - head;
|
||
}
|
||
}
|
||
}
|
||
template <class RandomAccessIterator>
|
||
void make_heap(RandomAccessIterator first, RandomAccessIterator last){
|
||
TinySTL::make_heap(first, last,
|
||
typename TinySTL::less<TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
|
||
}
|
||
template <class RandomAccessIterator, class Compare>
|
||
void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
|
||
const auto range = last - first;
|
||
for (auto cur = first + range / 2 - 1; cur >= first; --cur){
|
||
TinySTL::down(cur, last - 1, first, comp);
|
||
if (cur == first) return;
|
||
}
|
||
}
|
||
//********* [push_heap] ***************
|
||
//********* [Algorithm Complexity: O(lgN)] ****************
|
||
template <class RandomAccessIterator>
|
||
void push_heap(RandomAccessIterator first, RandomAccessIterator last){
|
||
TinySTL::push_heap(first, last,
|
||
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
|
||
}
|
||
template <class RandomAccessIterator, class Compare>
|
||
void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
|
||
TinySTL::up(first, last - 1, first, comp);
|
||
}
|
||
//********* [pop_heap] ***************
|
||
//********* [Algorithm Complexity: O(lgN)] ****************
|
||
template <class RandomAccessIterator>
|
||
void pop_heap(RandomAccessIterator first, RandomAccessIterator last){
|
||
TinySTL::pop_heap(first, last,
|
||
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
|
||
}
|
||
template <class RandomAccessIterator, class Compare>
|
||
void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
|
||
TinySTL::swap(*first, *(last - 1));
|
||
if (last - first >= 2)
|
||
TinySTL::down(first, last - 2, first, comp);
|
||
}
|
||
//********* [sort_heap] ***************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class RandomAccessIterator>
|
||
void sort_heap(RandomAccessIterator first, RandomAccessIterator last){
|
||
return TinySTL::sort_heap(first, last,
|
||
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
|
||
}
|
||
template <class RandomAccessIterator, class Compare>
|
||
void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
|
||
for (auto cur = last; cur != first; --cur){
|
||
TinySTL::pop_heap(first, cur, comp);
|
||
}
|
||
}
|
||
//********* [is_heap] ***************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class RandomAccessIterator>
|
||
bool is_heap(RandomAccessIterator first, RandomAccessIterator last){
|
||
return TinySTL::is_heap(first, last,
|
||
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
|
||
}
|
||
template <class RandomAccessIterator, class Compare>
|
||
bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
|
||
const auto range = last - first;
|
||
auto index = range / 2 - 1;
|
||
for (auto cur = first + range / 2 - 1; cur >= first; --cur, --index){
|
||
if (*(first + (index * 2 + 1)) > *cur ||//left child > cur
|
||
((first + (index * 2 + 2)) <= last && *(first + (index * 2 + 2)) > *cur))//right child > cur
|
||
return false;
|
||
if (cur == first)
|
||
break;
|
||
}
|
||
return true;
|
||
}
|
||
//********** [all_of] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class UnaryPredicate>
|
||
bool all_of(InputIterator first, InputIterator last, UnaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (!pred(*first))
|
||
return false;
|
||
}
|
||
return true;
|
||
}
|
||
//********** [any_of] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class UnaryPredicate>
|
||
bool any_of(InputIterator first, InputIterator last, UnaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (pred(*first))
|
||
return true;
|
||
}
|
||
return false;
|
||
}
|
||
//********** [none_of] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class UnaryPredicate>
|
||
bool none_of(InputIterator first, InputIterator last, UnaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (pred(*first))
|
||
return false;
|
||
}
|
||
return true;
|
||
}
|
||
//********** [for_each] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class Function>
|
||
Function for_each(InputIterator first, InputIterator last, Function fn){
|
||
for (; first != last; ++first)
|
||
fn(*first);
|
||
return fn;
|
||
}
|
||
//********** [find] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class T>
|
||
InputIterator find(InputIterator first, InputIterator last, const T& val){
|
||
for (; first != last; ++first){
|
||
if (*first == val)
|
||
break;
|
||
}
|
||
return first;
|
||
}
|
||
//********** [find_if] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class UnaryPredicate>
|
||
InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (pred(*first))
|
||
break;
|
||
}
|
||
return first;
|
||
}
|
||
//********** [find_if_not] *************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class InputIterator, class UnaryPredicate>
|
||
InputIterator find_if_not(InputIterator first, InputIterator last, UnaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (!pred(*first))
|
||
break;
|
||
}
|
||
return first;
|
||
}
|
||
//********** [find_end] ******************************
|
||
//********* [Algorithm Complexity: O(N*N)] ****************
|
||
template <class ForwardIterator1, class ForwardIterator2>
|
||
ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
|
||
ForwardIterator2 first2, ForwardIterator2 last2){
|
||
if (first2 == last2)
|
||
return last1;
|
||
ForwardIterator1 ret = last1;
|
||
while (first1 != last1)
|
||
{
|
||
ForwardIterator1 it1 = first1;
|
||
ForwardIterator2 it2 = first2;
|
||
while (*it1 == *it2) {
|
||
++it1; ++it2;
|
||
if (it2 == last2) { ret = first1; break; }
|
||
if (it1 == last1) return ret;
|
||
}
|
||
++first1;
|
||
}
|
||
return ret;
|
||
}
|
||
template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
|
||
ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
|
||
ForwardIterator2 first2, ForwardIterator2 last2,
|
||
BinaryPredicate pred){
|
||
if (first2 == last2)
|
||
return last1;
|
||
ForwardIterator1 ret = last1;
|
||
while (first1 != last1)
|
||
{
|
||
ForwardIterator1 it1 = first1;
|
||
ForwardIterator2 it2 = first2;
|
||
while (pred(*it1, *it2)) {
|
||
++it1; ++it2;
|
||
if (it2 == last2) { ret = first1; break; }
|
||
if (it1 == last1) return ret;
|
||
}
|
||
++first1;
|
||
}
|
||
return ret;
|
||
}
|
||
//********** [find_first_of] ******************************
|
||
//********* [Algorithm Complexity: O(N*N)] ****************
|
||
template <class ForwardIterator1, class ForwardIterator2>
|
||
ForwardIterator1 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
|
||
ForwardIterator2 first2, ForwardIterator2 last2){
|
||
for (; first1 != last1; ++first1){
|
||
for (auto it = first2; it != last2; ++it){
|
||
if (*first1 == *it)
|
||
return first1;
|
||
}
|
||
}
|
||
return last1;
|
||
}
|
||
template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
|
||
ForwardIterator1 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
|
||
ForwardIterator2 first2, ForwardIterator2 last2,
|
||
BinaryPredicate pred){
|
||
for (; first1 != last1; ++first1){
|
||
for (auto it = first2; it != last2; ++it){
|
||
if (pred(*first1, *it))
|
||
return first1;
|
||
}
|
||
}
|
||
return last1;
|
||
}
|
||
//********** [adjacent_find] ******************************
|
||
//********* [Algorithm Complexity: O(N)] ****************
|
||
template <class ForwardIterator>
|
||
ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last){
|
||
return TinySTL::adjacent_find(first, last,
|
||
equal_to<iterator_traits<typename ForwardIterator>::value_type>());
|
||
}
|
||
template <class ForwardIterator, class BinaryPredicate>
|
||
ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred){
|
||
for (; first != last; ++first){
|
||
if (first + 1 != last && pred(*(first), *(first + 1)))
|
||
break;
|
||
}
|
||
return first;
|
||
}
|
||
}
|
||
|
||
|
||
#endif |