Не получается сделать шаблонную функцию

void insertSortStringI(type &a, int size)     // будет подставляться либо std::vector <std::string>, либо std::vector <int>
{
// код
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
 
template <typename BidirectionalIterator,
          typename Comparator = std::less<typename BidirectionalIterator::value_type>>
void insertion_sort(
    const BidirectionalIterator &first,
    const BidirectionalIterator &last,
    const Comparator &comparator = Comparator())
{
    if (first != last)
    {
        for (BidirectionalIterator i = first; ++i != last;)
        {
            BidirectionalIterator j = i; // place where to insert *i
            auto x = ::std::move(*j); // *j in undefined state
            while (comparator(x, *(j - 1)))
                if (--j == first)
                    break;
            ::std::move_backward(j, i, BidirectionalIterator(i + 1)); // move [j,i-1] to [j+1,i]
            *j = ::std::move(x); // fixes *j
        }
    }
}
 
int main()
{
    ::std::vector<int> v(10);
    ::std::generate(v.begin(), v.end(), []() { return ::std::rand() % 100; });
    ::std::copy(v.begin(), v.end(), ::std::ostream_iterator<int>(::std::cout, ", "));
    ::std::cout << ::std::endl;
    ::insertion_sort(v.begin(), v.end());
    ::std::copy(v.begin(), v.end(), ::std::ostream_iterator<int>(::std::cout, ", "));
    ::std::cout << ::std::endl;
}

#include <iostream>
#include <vector>
#include <type_traits>
 
template <typename BidirectionalIterator,
    typename Comparator = std::less<std::enable_if< std::is_same<std::iterator_traits<BidirectionalIterator>::iterator_category, std::random_access_iterator_tag>::value,
    typename std::iterator_traits<BidirectionalIterator>::value_type>::type > >
    void insertion_sort(
        const BidirectionalIterator &first,
        const BidirectionalIterator &last,
        const Comparator &comparator = Comparator())
{
    if (first >= last) return;
 
    for (BidirectionalIterator i = first + 1, j; i != last; ++i)
    {
        auto tmp = std::move(*i);
        for (j = i; j > first && comparator(*(j - 1), tmp); --j)
            *j = std::move(*(j - 1));
        *j = std::move(tmp);
    }
}
 
std::vector<int> m{ 45,3,22,8,76,4 };
int mmas[] = { 45,3,22,8,76,4 };
 
struct my {};
my tt1, tt2;
int main()
{
 
    //insertSort(m);
    insertion_sort(m.begin(), m.end());
    insertion_sort(std::begin(mmas), std::end(mmas));
    insertion_sort(&mmas[0], &mmas[6]);
    for (auto i : mmas) std::cout << i << '\n';
    for (auto i : m) std::cout << i << '\n';
    system("pause");
 
    return 0;
}