#include <vector>
#include <utility>
#include <algorithm>
#include <iterator>

namespace std {
    template<class container>
    auto begin(container& rhs) -> typename container::iterator {return rhs.begin();}
    template<class container>
    auto begin(const container& rhs) -> typename container::iterator {return rhs.begin();}
    template<class element, int size>
    element* begin(element(&rhs)[size]) {return rhs;}
    template<class container>
    auto end(container& rhs) -> typename container::iterator {return rhs.end();}
    template<class container>
    auto end(const container& rhs) -> typename container::iterator {return rhs.end();}
    template<class element, int size>
    element* end(element(&rhs)[size]) {return rhs+size;}
}

template<class iter1, class iter2>
iter1 search(iter1 stackbegin, iter1 stackend, iter2 needlebegin, iter2 needleend)
{return std::search(stackbegin, stackend, needlebegin, needleend);}

template<class iter1, class needlecontainer>
iter1 search(iter1 stackbegin, iter1 stackend, const needlecontainer& needle)
{return std::search(stackbegin, stackend, std::begin(needle), std::end(needle));}

template<class stackcontainer, class needlecontainer>
decltype(std::begin(std::declval<stackcontainer>()))
search(const stackcontainer& stack, const needlecontainer& needle)
{return std::search(std::begin(stack), std::end(stack), std::begin(needle), std::end(needle));}

template<class stackcontainer, class needlecontainer>
decltype(std::begin(std::declval<stackcontainer>()))
search(stackcontainer& stack, const needlecontainer& needle)
{return std::search(std::begin(stack), std::end(stack), std::begin(needle), std::end(needle));}

int main() {
    std::vector<char> str1;
    auto it = search(str1, "Look for this");
}