Voting-Simulation/basesimulation.cpp at master · naslevente/Voting-Simulation · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include "basesimulation.h"
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>

BaseSimulation::BaseSimulation(int numVoters, int numCandidates) {

    srand(time);

    this->numCandidates = numCandidates;
    this->numVoters = numVoters;

    finalCandidates = std::make_tuple<int, int>(-1, -1);

    simulationBallots = std::vector<std::shared_ptr<Ballot>>(numVoters);
}

// create 1d array of probailities and attach to 2d array of all probabilities
void BaseSimulation::GetProbabilities() {

    std::vector<double> probabilities = std::vector<double>();
    probabilities.push_back((long double)((this->numberOfManipulations / (long double)(numberOfIterations)) * 100));
    probabilities.push_back((long double)((this->numberOfSuccesses / (long double)(numberOfIterations)) * 100));
    probabilities.push_back((long double)((this->minoritySuccesses / (long double)(numberOfIterations)) * 100));

    return probabilities;
}

void BaseSimulation::CountVotes() {

    // count the votes
    for(int i = 0; i < numVoters; ++i) {

        for(int j = 0; j < numCandidates; ++j) {

            if(simulationBallots.at(i)->ballot.at(j) != 0) {

                voteCount.at(j) += 1;
            }
        }
    }
}

void BaseSimulation::Manipulation(int winningCandidateOne, int winningCandidateTwo) {

    int manipulations = 0;
    for(int i = 0; i < numVoters; ++i) {

        std::shared_ptr<Ballot> currentVoter = simulationBallots.at(i);
        bool hasManipulated = false;
        for(int j = 0; j < numCandidates; ++j) {

            // R(k - 1) iteracio szerint elokelobb helyen vegzett, de a szavazo sajat rangsoraban hatrebb sorolt szituacio
            if((j == winningCandidateOne || j == winningCandidateTwo) &&
                currentVoter->ballot.at(j) != 1 && currentVoter->ballot.at(j) != 2 && currentVoter->ballot.at(j) != 0) {

                currentVoter->ballot.at(j) = 0;

                if(!hasManipulated) {

                    manipulations += 1;
                    hasManipulated = true;
                }
            }
        }
    }

    // add up probability from each simulation and average after each iteration
    manipulationCount = manipulations;
    numberOfManipulations += (long double)(manipulations / (long double)(numVoters));
}

// accepting tuple input as reference
template<typename T, typename Y, typename U>
void BaseSimulation::UpdateWinTuple(T &finalCandidates, Y comparison, U currentCandidate) {

    int firstWinningCandidate = std::get<0>(finalCandidates);
    int secondWinningCandidate = std::get<1>(finalCandidates);

    if(firstWinningCandidate == -1 || comparison.at(currentCandidate) > comparison.at(firstWinningCandidate)) {

        secondWinningCandidate = firstWinningCandidate;
        firstWinningCandidate = currentCandidate;
    }
    else if(secondWinningCandidate == -1 || comparison.at(currentCandidate) > comparison.at(secondWinningCandidate)) {

        secondWinningCandidate = currentCandidate;
    }
    else if(comparison.at(currentCandidate) == comparison.at(secondWinningCandidate)) {

        int random = rand() % 2;
        if(random) {

            secondWinningCandidate = currentCandidate;
        }
    }

    std::get<0>(finalCandidates) = firstWinningCandidate;
    std::get<1>(finalCandidates) = secondWinningCandidate;
}

bool BaseSimulation::IsMajority() {

    // check if final candidates meet majority count requirements
    int firstCandidate = std::get<0>(finalCandidates);
    int secondCandidate = std::get<1>(finalCandidates);
    if(voteCount.get(firstCandidate) >= (int)(numVoters / 2) && voteCount.get(secondCandidate) >= (int)(numVoters / 2))
        return true;
    else
        return false;
}