STD Algorithms on Containers

Functions
template<typename Container1 , typename Container2 >
void	aaa::copy (const Container1 &in, Container2 &out)
template<typename Container , typename Value >
void	aaa::fill (Container &container, const Value &value)
template<typename Container >
Container::iterator	aaa::min_element (Container &container)
template<typename Container >
Container::const_iterator	aaa::min_element (const Container &container)
template<typename Container , typename Compare >
Container::iterator	aaa::min_element (Container &container, Compare comp)
template<typename Container , typename Compare >
Container::const_iterator	aaa::min_element (const Container &container, Compare comp)
template<typename Container >
Container::iterator	aaa::max_element (Container &container)
template<typename Container >
Container::const_iterator	aaa::max_element (const Container &container)
template<typename Container , typename Compare >
Container::iterator	aaa::max_element (Container &container, Compare comp)
template<typename Container , typename Compare >
Container::const_iterator	aaa::max_element (const Container &container, Compare comp)
template<typename Container >
std::pair< const_iterator< Container >, const_iterator< Container > >	aaa::minmax_element (const Container &container)
template<typename Container >
std::pair< iterator< Container >, iterator< Container > >	aaa::minmax_element (Container &container)
template<typename Container , typename Compare >
std::pair< const_iterator< Container >, const_iterator< Container > >	aaa::minmax_element (const Container &container, Compare comp)
template<typename Container , typename Compare >
std::pair< iterator< Container >, iterator< Container > >	aaa::minmax_element (Container &container, Compare comp)

Detailed Description

This module defines container versions of some range algorithms from the standard library header algorithm. It only does it for the algorithms that are used a lot for arithmetic types.