我正在创建一个使用set来保存对值的地图数据结构。我为该程序制作了一个自定义对类。我完成了大部分调试,现在我在内置的xfunction类中遇到了这些错误。
错误6错误C2784:'bool std :: operator<(const std :: basic_string< _Elem,_Traits,_Alloc>&,const _Elem *)':无法推断'const std :: basic_string&lt的模板参数; _Elem,_Traits,_Alloc> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误7错误C2784:'bool std :: operator<(const _Elem *,const std :: basic_string< _Elem,_Traits,_Alloc>&)':无法推断'const _Elem *'的模板参数'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误8错误C2784:'bool std :: operator<(const std :: basic_string< _Elem,_Traits,_Alloc>&,const std :: basic_string< _Elem,_Traits,_Alloc>&)':can不推断'const std :: basic_string< _Elem,_Traits,_Alloc>的模板参数&安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误9错误C2784:'bool std :: operator<(const std :: move_iterator< _RanIt>&,const std :: move_iterator< _RanIt2>&)':无法推断'const std的模板参数:: move_iterator< _RanIt> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误10错误C2784:'bool std :: operator<(const std :: _ Tree< _Traits>&,const std :: _ Tree< _Traits>&)':无法推断'const std的模板参数:: _树< _Traits> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误11错误C2784:'bool std :: operator<(const std :: list< _Ty,_Ax>&,const std :: list< _Ty,_Ax>&)':无法推断出模板参数对于'const std :: list< _Ty,_Ax> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误12错误C2784:'bool std :: operator<(const std :: unique_ptr< _Ty,_Dx>&,const std :: unique_ptr< _Ty2,_Dx2>&)':无法推断出模板参数对于'const std :: unique_ptr< _Ty,_Dx> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误13错误C2784:'bool std :: operator<(const std :: reverse_iterator< _RanIt>&,const std :: reverse_iterator< _RanIt2>&)':无法推断'const std的模板参数:: reverse_iterator的< _RanIt> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误14错误C2784:'bool std :: operator<(const std :: _ Revranit< _RanIt,_Base>&,const std :: _ Revranit< _RanIt2,_Base2>&)':无法推断出模板参数对于'const std :: _ Revranit< _RanIt,_Base> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误15错误C2784:'bool std :: operator<(const std :: pair< _Ty1,_Ty2>&,const std :: pair< _Ty1,_Ty2>&)':无法推断出模板参数对于'const std :: pair< _Ty1,_Ty2> &安培;”来自'const Pair'c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
错误16错误C2676:二进制'<' :'const Pair'未定义此运算符或转换为预定义运算符可接受的类型c:\ program files(x86)\ microsoft visual studio 10.0 \ vc \ include \ xfunctional 125
这是我的map2.h代码
#ifndef MAP_H_2
#define MAP_H_2
#include <list>
#include <set>
#include <utility>
#include <iterator>
#include <iostream>
#include <string>
using namespace std;
//pair class header
template<typename F, typename S>
class Pair
{
public:
Pair(const F& a, const S& b);
Pair();
F get_first() const;
S get_second() const;
private:
F first;
S second;
};
//pair class definitions
template<typename F, typename S>
inline Pair<F, S>::Pair(const F& a, const S& b):first(a),second(b){}
template<typename F, typename S>
inline Pair<F, S>::Pair()
{
}
template<typename F, typename S>
inline F Pair<F, S>::get_first() const
{
return first;
}
template<typename F, typename S>
inline S Pair<F, S>::get_second() const
{
return second;
}
//map header
class map2
{
public:
map2();
void at_put(string key, int value);
Pair<string, int> at(string key);
bool contain_key(string key);
int value_of(string key);
void remove_key(string key);
void print();
private:
set<Pair<string, int>> theList;
};
//map definition
map2::map2(){}
void map2::at_put(string key, int value)
{
bool notThere = true;
if(contain_key(key))
{
notThere = false;
}
if(notThere)
{
Pair<string, int> thePair(key, value);
theList.insert(thePair);
}
}
Pair<string, int> map2::at(string key)
{
set<Pair<string, int>>::iterator iter = theList.begin();
Pair<string, int> thePair;
string temp;
for(int x = 0; x<theList.size() ; x++)
{
thePair = *iter;
temp = thePair.get_first();
if(!key.compare(temp))
{
return thePair;
}
iter++;
}
Pair<string, int> noPair = Pair<string, int>("none", -1);
return noPair;
}
bool map2::contain_key(string key)
{
set<Pair<string, int>>::iterator iter = theList.begin();
Pair<string, int> thePair;
string temp;
for(int x = 0; x<theList.size() ; x++)
{
thePair = *iter;
temp = thePair.get_first();
if(!key.compare(temp))
{
return true;
}
iter++;
}
return false;
}
int map2::value_of(string key)
{
set<Pair<string, int>>::iterator iter = theList.begin();
Pair<string, int> thePair;
string temp;
for(int x = 0; x<theList.size() ; x++)
{
thePair = *iter;
temp = thePair.get_first();
if(!key.compare(temp))
{
return thePair.get_second();
}
iter++;
}
return NULL;
}
void map2::remove_key(string key)
{
set<Pair<string, int>>::iterator iter = theList.begin();
Pair<string, int> thePair;
string temp;
for(int x = 0; x<theList.size() ; x++)
{
thePair = *iter;
temp = thePair.get_first();
if(!key.compare(temp))
{
theList.erase(iter);
}
iter++;
}
}
void map2::print()
{
set<Pair<string, int>>::iterator iter = theList.begin();
Pair<string, int> thePair;
string temp;
int temp2;
for(int x = 0; x<theList.size() ; x++)
{
thePair = *iter;
temp = thePair.get_first();
temp2 = thePair.get_second();
cout << "Key:" << temp << " Value:" << temp2 << "\n";
iter++;
}
}
#endif
这是我的主要功能
的代码#include "map2.h"
#include <string>
#include <iostream>
using namespace std;
int main()
{
map2 theMap;
theMap.at_put("John", 1000);
theMap.at_put("Chris", 1000);
theMap.at_put("John", 1500);
theMap.at_put("Bob", 1250);
theMap.print();
theMap.remove_key("bob");
theMap.print();
string findKey;
cout << "please enter a key to remove" << "\n";
cin >> findKey;
bool keyFound = theMap.contain_key(findKey);
if(keyFound)
{
cout << "We found it! The value is:" << theMap.value_of(findKey) << "\n";
}
else
{
cout << "we don’t have this key " << findKey << "in the map" << "\n";
}
}
答案 0 :(得分:1)
问题在于:
error C2676:二进制
<
:const Pair
未定义此运算符或转换为预定义运算符可接受的类型
<
类Pair
没有定义map2.h
运算符。 C ++ STL集合类使用平衡搜索树(例如Red-black tree)实现。集合中的所有元素都存储在二叉树中。集合通过将元素与树的根进行比较来检查它是否包含元素,然后如果没有匹配则仅递归到一个适当的子树。这需要设置元素的比较运算符,以确定树的哪一侧包含所寻找的元素。
此要求隐含在documentation for set
。
不幸的是,C ++ STL编译器消息通常是非常糟糕的事情。随着时间的推移,你会习惯它。你可以试着弄清楚它们的一些事情: