Price/squad-js-map-vote
1
0
Fork 0
mirror of https://github.com/AsgardEternal/squad-js-map-vote.git synced 2025-01-24 00:13:52 -06:00
Code Issues Packages Projects Releases Wiki Activity

Add minimum votes to accept result configuration

Browse Source
This commit is contained in:
komatoo 2023-01-12 12:06:06 +02:00
parent 47b647cfec
commit 4eae81f5db
1 changed files with 15 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
mapvote.js
View File

@ -150,6 +150,11 @@ export default class MapVote extends DiscordBasePlugin {
required: false, required: false,
description: 'Array of timeframes to override options', description: 'Array of timeframes to override options',
default: [] default: []
},
minimumVotesToAcceptResult: {
required: false,
description: "Minimum votes per map to accept result.",
default: 1
} }
}; };
} }
@ -278,7 +283,6 @@ export default class MapVote extends DiscordBasePlugin {
} }
} }
setSeedingMode(isNewGameEvent = false) { setSeedingMode(isNewGameEvent = false) {
// setTimeout(()=>{this.msgDirect('76561198419229279',"MV\ntest\ntest")},1000)
// this.msgBroadcast("[MapVote] Seeding mode active") // this.msgBroadcast("[MapVote] Seeding mode active")
const baseDataExist = this && this.options && this.server && this.server.players; const baseDataExist = this && this.options && this.server && this.server.players;
if (baseDataExist) { if (baseDataExist) {
@ -853,15 +857,17 @@ export default class MapVote extends DiscordBasePlugin {
let highestScore = -Infinity; let highestScore = -Infinity;
for (let choice in this.tallies) { for (let choice in this.tallies) {
const score = this.tallies[ choice ]; const score = this.tallies[ choice ];
if (score < highestScore) if (score >= this.options.minimumVotesToAcceptResult) {
continue; if (score < highestScore)
else if (score > highestScore) { continue;
highestScore = score; else if (score > highestScore) {
ties.length = 0; highestScore = score;
ties.push(choice); ties.length = 0;
ties.push(choice);
}
else // equal
ties.push(choice);
} }
else // equal
ties.push(choice);
} }
return ties.map(i => this.nominations[ i ]); return ties.map(i => this.nominations[ i ]);