sco/pokerth
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

new distributePot function

Browse Source
This commit is contained in:
doitux
2007-08-10 00:17:46 +00:00
parent 3ec9c3d0bd
commit cf656d4ac2
1 changed files with 1 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/engine/local_engine/localboard.cpp
+1 -15
View File
@@ -56,7 +56,7 @@ void LocalBoard::distributePot() {
size_t i,j,k; size_t i,j,k;
// filling player stes vector // filling player sets vector
vector<int> playerSets; vector<int> playerSets;
for(i=0; i<(size_t)MAX_NUMBER_OF_PLAYERS; i++) { for(i=0; i<(size_t)MAX_NUMBER_OF_PLAYERS; i++) {
if(playerArray[i]->getMyActiveStatus()) { if(playerArray[i]->getMyActiveStatus()) {
@@ -70,9 +70,6 @@ void LocalBoard::distributePot() {
vector<int> playerSetsSort = playerSets; vector<int> playerSetsSort = playerSets;
sort(playerSetsSort.begin(), playerSetsSort.end()); sort(playerSetsSort.begin(), playerSetsSort.end());
// pot[0] = potLevel0, pot[1] = potLevel1, ...
// vector< vector<int> > pot;
// potLevel[0] = amount, potLevel[1] = sum, potLevel[2..n] = winner // potLevel[0] = amount, potLevel[1] = sum, potLevel[2..n] = winner
vector<int> potLevel; vector<int> potLevel;
@@ -85,7 +82,6 @@ void LocalBoard::distributePot() {
// level loop // level loop
for(i=0; i<playerSetsSort.size(); i++) { for(i=0; i<playerSetsSort.size(); i++) {
// for(i=0; i<4; i++) {
// restart levelHighestCardsValue // restart levelHighestCardsValue
highestCardsValue = 0; highestCardsValue = 0;
@@ -174,16 +170,6 @@ void LocalBoard::distributePot() {
} }
} }
// playerSetsSort output
// for(i=0; i<playerSetsSort.size(); i++) cout << i << ": " << playerSetsSort.at(i) << endl;
// potLevel output
// cout << "potLevel" << endl;
// for(i=0; i<potLevel.size(); i++) cout << i << ": " << potLevel.at(i) << endl;
// cout << pot << endl;
// ERROR-Outputs // ERROR-Outputs
if(pot!=0) cout << "distributePot-ERROR: Pot = " << pot << endl; if(pot!=0) cout << "distributePot-ERROR: Pot = " << pot << endl;