尝试使用比较运算符对对象向量进行排序

trying to sort a vector of objects with a comparison operators

本文关键字：向量 对象 排序 运算符 比较      更新时间：2023-10-16

我正在尝试实现一个纸牌游戏，我正在使用一个纸牌向量。我实现了每一个比较运算符，希望"排序"函数能根据这些运算符进行排序，但我总是知道王牌是最小的牌。

我试着手动排序，但它变得很难看。

class Card {
int worth;
int num;
Shapes shape_id;
string name;
string shape_name;
string color;
char symbol;
string intToShape(int n);
string intToColor(int n);
public:
Card(int n, int shap);
Card();
int getNumOfCard() const;
int getShapeOfCard() const;
friend std::ostream& operator<<(std::ostream& os, const Card& c);
bool operator >(Card& other);
bool operator <(Card& other);
bool operator ==(Card& other);
bool operator >=(Card& other);
bool operator <=(Card& other);
bool operator !=(Card& other);
};

卡片名称：

Card::Card(int n, int shap) : num(n) , shape_id((Shapes)shap) {
if (num>10 || num ==1) {
switch (num) {
case 11:
name = "Jack" + intToShape(shap);
symbol ='J';
break;
case 12:
name = "Quin" + intToShape(shap);
symbol = 'Q';
break;
case 13:
name = "King" + intToShape(shap);
symbol = 'K';
break;
case 1:
name = "Ace" + intToShape(shap);
symbol = 'A';
break;
default:
string exceptionMessage("num > 13"); 
throw (PckErr(exceptionMessage));
}
} else {
symbol = 'N';
name = std::to_string(num) + intToShape(shap);
}
if (num == 1) {
worth = 14;  //ace worth 14!
} else {
worth = num;
}
shape = intToShape(shap);
color = intToColor(shap);
}

分拣部分：

for (int i = 0; i < 12; ++i) {
histogram[pCard[i]->getNumOfCard()]++;
it = sorted_hand.insert(it,pCard[i]);
}
std::sort(sorted_hand.begin(), sorted_hand.end());

操作员实现：

bool Card::operator>(Card &other) {
return this->worth > other.worth;
}
bool Card::operator<(Card &other) {
return this->worth < other.worth;
}
... same for all

我预计5张牌的排序向量为：2,3,4,5,1但实际矢量是：1,2,3,4,5.

我可以想出几种方法来处理这个问题。

解决方案1

将值14指定给ace。

解决方案2

在比较函数中说明ace的特殊性质。

bool Card::operator<(Card &other) {
int l = (this->worth == 1) ? 14 : this->worth;
int r = (other.worth == 1) ? 14 : other.worth;
return (l < r);
}

清理建议

更改函数以使用const对象。

bool Card::operator<(Card const& other) const {
int l = (this->worth == 1) ? 14 : this->worth;
int r = (other.worth == 1) ? 14 : other.worth;
return (l < r);
}

@Jon Doe编写

我写道：

sort(sorted_hand.begin(), sorted_hand.end(), cardCompare);

而：

bool cardCompare(const Card* lh, const Card* rh) {
return *lh <= *rh;
}
相关文章：