如何将结构插入 stl::map C++

How to insert struct into stl::map C++

我正在尝试使用循环来使用插入方法填充地图。我有一张地图,我正尝试使用此方法填充:

void board:: insertToMap(Letter c, int num){
    this->myRackMap.insert(pair<Letter, int>(c, num));
}

我在另一个方法的这个循环中调用这个辅助方法:

void board:: getRackAsMap(){
    for (int i = 0; i < this->getMyRack().size(); ++i){
        insertToMap(this->getMyRack().at(i), this->getMyRack().at(i).readScore());
    }
}
//myRackMap is a map<Letter, int>
//myRack is a vector<Letter>

vector<Letter>& board::getMyRack(){
    return this->myRack;
}

//readScore returns an Int value based on the char value of the current Letter

当我尝试 运行 时,我收到一条长得离谱的错误消息,太长了,无法放入其中。错误消息的结尾行是这样的;然而:

"‘const Letter’ is not derived from ‘const std::multimap<_Key, _Tp, _Compare, _Alloc>’ { return __x < __y; }"

这让我相信该错误与将我的结构字母而不是原始数据类型插入映射有关。任何建议将不胜感激,因为我不太熟悉 c++,感谢您提供的任何帮助!

编辑:这是 Letter.h 的样子

struct Letter{
private:
    char theLetter;
    int xPos;
    int yPos;
public:
    Letter();
    Letter(char c);
    Letter(int x, int y, char c);
    void setPos(int x, int y);
    void setLetter(char c);
    int getXPos();
    int getYPos();
    char getTheLetter();
    int readScore();
};

和letter.cpp

Letter:: Letter(){
    this->xPos = -1;
    this->yPos = -1;
    this->theLetter = '?';
}

Letter:: Letter(char c){
    this->xPos = -1;
    this->yPos = -1;
    this->theLetter = c;
}

Letter:: Letter(int x, int y, char c){
    this->xPos = x;
    this->yPos = y;
    this->theLetter = c;
}
int Letter:: getXPos(){
    return this->xPos;
}
int Letter:: getYPos(){
    return this->yPos; 
} 
char Letter:: getTheLetter(){
    return this->theLetter;
}
void Letter:: setPos(int x, int y){
    this->xPos = x;
    this->yPos = y;
}
void Letter:: setLetter(char c){
    this->theLetter = c;
}
int Letter:: readScore(){
    switch (this->getTheLetter()){
        case 'A':
        return 1;
        break;
    case 'B':
        return 3;
        break;
    //etc etc, returns int based on char of Letter
    }
}

std::map 的元素根据 key 排序。因此,您需要为您的关键对象定义一个 operator<,在您的示例中是 Letter。或者在构建 std::map 时提供一个比较器。

bool cmp(const Letter& lhs, const Letter &rhs) { ...define order... }
std::map<Letter, int, bool(*)(const Letter&, const Letter&)> myRackMap(cmp);

无论您决定使用哪种解决方案,您都需要定义一种排序字母的方式,我想 xposypos 的组合定义了 Letter 的唯一标识符。因此你可以这样写:

bool cmp(const Letter& lhs, const Letter &rhs) {
   return std::tie(lhs.xPos, lhs.yPos) < std::tie(rhs.xPos, rhs.yPos);
}

或者如果您选择重载 < 运算符:

bool Letter::operator<(const Letter &other) const {
   return std::tie(xPos, yPos) < std::tie(other.xPos, other.yPos);
}