C++Primer模板

1. find 算法模板

    template<typename Iterator, typename Value>
    auto find(Iterator first, Iterator last, Value const& value)
    {
        for (; first != last && *first != value; ++first);
        return first;
    }

• print 函数模板

template<typename Arr>
void print(Arr const& arr)
{
    for (auto const& elem : arr)
        std::cout << elem << std::endl;
}

• 接受数组对象的begin 和 end 迭代器

template<typename T, unsigned size>
T* begin_def(T(&arr)[size])
{
    return arr;
}


// the same as std::end
template<typename T, unsigned size>
T* end_def(T (&arr)[size])
     ^^//We usually don't use a function name which is the same as the function of standard libary
       ^^ //This should not be const
{
    return arr + size;
}

• 返回数组大小的模板

template<typename T, unsigned size>
constexpr unsigned getSize(const T(&)[size])
{
    return size;
}