I\'ve got this function:
template void Inventory::insertItem(std::vector& v, const T& x) { std::vector<
What you are doing is inefficient. Use a binary search instead:
#include template void insertItem(std::vector& v, const T& x) { v.insert(std::upper_bound(v.begin(), v.end(), x), x); }