Skip to content

Instantly share code, notes, and snippets.

@emurmotol
Created July 7, 2018 07:20
Show Gist options
  • Save emurmotol/cd7136b32bbb60a7461d2aa0c87b0b45 to your computer and use it in GitHub Desktop.
Save emurmotol/cd7136b32bbb60a7461d2aa0c87b0b45 to your computer and use it in GitHub Desktop.
Created using remix-ide: Realtime Ethereum Contract Compiler and Runtime. Load this file by pasting this gists URL or ID at https://remix.ethereum.org/#version=soljson-v0.4.24+commit.e67f0147.js&optimize=true&gist=
pragma solidity ^0.4.0;
contract Ballot {
struct Voter {
uint weight;
bool voted;
uint8 vote;
address delegate;
}
struct Proposal {
uint voteCount;
}
address chairperson;
mapping(address => Voter) voters;
Proposal[] proposals;
/// Create a new ballot with $(_numProposals) different proposals.
function Ballot(uint8 _numProposals) public {
chairperson = msg.sender;
voters[chairperson].weight = 1;
proposals.length = _numProposals;
}
/// Give $(toVoter) the right to vote on this ballot.
/// May only be called by $(chairperson).
function giveRightToVote(address toVoter) public {
if (msg.sender != chairperson || voters[toVoter].voted) return;
voters[toVoter].weight = 1;
}
/// Delegate your vote to the voter $(to).
function delegate(address to) public {
Voter storage sender = voters[msg.sender]; // assigns reference
if (sender.voted) return;
while (voters[to].delegate != address(0) && voters[to].delegate != msg.sender)
to = voters[to].delegate;
if (to == msg.sender) return;
sender.voted = true;
sender.delegate = to;
Voter storage delegateTo = voters[to];
if (delegateTo.voted)
proposals[delegateTo.vote].voteCount += sender.weight;
else
delegateTo.weight += sender.weight;
}
/// Give a single vote to proposal $(toProposal).
function vote(uint8 toProposal) public {
Voter storage sender = voters[msg.sender];
if (sender.voted || toProposal >= proposals.length) return;
sender.voted = true;
sender.vote = toProposal;
proposals[toProposal].voteCount += sender.weight;
}
function winningProposal() public constant returns (uint8 _winningProposal) {
uint256 winningVoteCount = 0;
for (uint8 prop = 0; prop < proposals.length; prop++)
if (proposals[prop].voteCount > winningVoteCount) {
winningVoteCount = proposals[prop].voteCount;
_winningProposal = prop;
}
}
}
pragma solidity ^0.4.7;
import "remix_tests.sol"; // this import is automatically injected by Remix.
import "./ballot.sol";
contract test3 {
Ballot ballotToTest;
function beforeAll () {
ballotToTest = new Ballot(2);
}
function checkWinningProposal () public {
ballotToTest.vote(1);
Assert.equal(ballotToTest.winningProposal(), uint(1), "1 should be the winning proposal");
}
function checkWinninProposalWithReturnValue () public constant returns (bool) {
return ballotToTest.winningProposal() == 1;
}
}
pragma solidity 0.4.24;
contract Coin {
address owner;
uint public totalSupply = 1000; //sample initial supply
mapping (address => uint) public balances;
event Transfer(address indexed _to, address indexed _from, uint _value);
event NewCoinLog(address _to, uint _amount, uint _newSupply);
modifier ownerOnly() {
if (msg.sender != owner) {
revert();
} else {
_; //all good, may proceed...
}
}
//constructor(uint _supply) public {
// owner = msg.sender;
// totalSupply = _supply;
// balances[owner] += _supply;
//}
function getBalance(address _address) public constant returns (uint) {
return balances[_address];
}
function transfer(address _to, uint _amount) public returns (bool) {
if (balances[msg.sender] < _amount) revert();
balances[msg.sender] -= _amount;
balances[_to] += _amount;
emit Transfer(_to, msg.sender, _amount);
return true;
}
function mint(uint _amount) public ownerOnly returns (bool) {
totalSupply += _amount;
balances[owner] += _amount;
emit NewCoinLog(owner, _amount, totalSupply);
return true;
}
function disable() public ownerOnly {
selfdestruct(owner);
}
}
pragma solidity ^0.4.0;
contract SimpleStorage {
uint storedData;
function set(uint x) public {
storedData = x;
}
function get() public view returns (uint) {
return storedData;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment