Created
March 6, 2022 11:12
-
-
Save Tee-py/8696fc1827deb0dc0a08c0225e74e415 to your computer and use it in GitHub Desktop.
Optimized Ballot Smart Contract using Mappings
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// SPDX-License-Identifier: GPL-3.0 | |
pragma solidity >=0.7.0 <0.9.0; | |
// Optimized version of the ballot contract on solidity docs | |
/// @title Voting with delegation. | |
contract Ballot { | |
// This declares a new complex type which will | |
// be used for variables later. | |
// It will represent a single voter. | |
struct Voter { | |
uint weight; // weight is accumulated by delegation | |
bool voted; // if true, that person already voted | |
address delegate; // person delegated to | |
uint vote; // index of the voted proposal | |
} | |
// This is a type for a single proposal. | |
struct Proposal { | |
bytes32 name; // short name (up to 32 bytes) | |
uint voteCount; // number of accumulated votes | |
} | |
address public chairperson; | |
// This declares a state variable that | |
// stores a `Voter` struct for each possible address. | |
mapping(address => Voter) public voters; | |
// A mapping of `Proposal` structs. | |
mapping(uint => Proposal) proposals; | |
// Keeps track of the number of proposals | |
uint private proposalCount = 0; | |
//Proposal[] public proposals; | |
/// Create a new ballot to choose one of `proposalNames`. | |
constructor(bytes32[] memory proposalNames) { | |
chairperson = msg.sender; | |
voters[chairperson].weight = 1; | |
for (uint i = 0; i < proposalNames.length; i++) { | |
proposals[i] = Proposal({ | |
name: proposalNames[i], | |
voteCount: 0 | |
}); | |
} | |
proposalCount = proposalNames.length; | |
} | |
modifier onlyChairPerson() { | |
require(msg.sender == chairperson, "Not Permitted"); | |
_; | |
} | |
// Give `voter` the right to vote on this ballot. | |
// May only be called by `chairperson`. | |
function giveRightToVote(address[] memory arr) external onlyChairPerson { | |
for(uint i = 0; i < arr.length; i++){ | |
require(!voters[arr[i]].voted); | |
require(voters[arr[i]].weight == 0); | |
voters[arr[i]].weight = 1; | |
} | |
} | |
/// Delegate your vote to the voter `to`. | |
function delegate(address to) external { | |
// assigns reference | |
Voter storage sender = voters[msg.sender]; | |
require(!sender.voted, "You already voted."); | |
require(to != msg.sender, "Self-delegation is disallowed."); | |
// Forward the delegation as long as | |
// `to` also delegated. | |
// In general, such loops are very dangerous, | |
// because if they run too long, they might | |
// need more gas than is available in a block. | |
// In this case, the delegation will not be executed, | |
// but in other situations, such loops might | |
// cause a contract to get "stuck" completely. | |
while (voters[to].delegate != address(0)) { | |
to = voters[to].delegate; | |
// We found a loop in the delegation, not allowed. | |
require(to != msg.sender, "Found loop in delegation."); | |
} | |
// Since `sender` is a reference, this | |
// modifies `voters[msg.sender].voted` | |
sender.voted = true; | |
sender.delegate = to; | |
Voter storage delegate_ = voters[to]; | |
if (delegate_.voted) { | |
// If the delegate already voted, | |
// directly add to the number of votes | |
proposals[delegate_.vote].voteCount += sender.weight; | |
} else { | |
delegate_.weight += sender.weight; | |
} | |
} | |
/// Give your vote (including votes delegated to you) | |
/// to proposal `proposals[proposal].name`. | |
function vote(uint proposal) external { | |
Voter storage sender = voters[msg.sender]; | |
require(sender.weight != 0, "Has no right to vote"); | |
require(!sender.voted, "Already voted."); | |
sender.voted = true; | |
sender.vote = proposal; | |
// If `proposal` is out of the range of the array, | |
// this will throw automatically and revert all | |
// changes. | |
proposals[proposal].voteCount += sender.weight; | |
} | |
/// @dev Computes the winning proposal taking all | |
/// previous votes into account. | |
function winningProposal() public view returns (uint winningProposal_){ | |
uint winningVoteCount = 0; | |
for (uint p = 0; p < proposalCount; p++) { | |
if (proposals[p].voteCount > winningVoteCount) { | |
winningVoteCount = proposals[p].voteCount; | |
winningProposal_ = p; | |
} | |
} | |
} | |
// Calls winningProposal() function to get the index | |
// of the winner contained in the proposals array and then | |
// returns the name of the winner | |
function winnerName() external view returns (bytes32 winnerName_){ | |
winnerName_ = proposals[winningProposal()].name; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment