-
Notifications
You must be signed in to change notification settings - Fork 0
/
LotteryPractice1.sol
114 lines (79 loc) · 4.26 KB
/
LotteryPractice1.sol
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
113
114
pragma solidity ^0.4.20;
//16 person lottery that only unlocks once completely filled
//
// array of available tickets that are numbered 1 - 16
// an empty array of purchasedLotteryTickets strucs
// purchasedLotteryTickets are strucs made up of an address purchaser & a uint ticketNumber
// a new array records, for users that send the right amount, the ticket number & address sent from
// once all tickets are purchased, award an address, based on a pgrn, the total lottery amount
// buy ticket function (ticketChoice) return (confirmation, tickets remaining); if ticketChoice is not available or out of range, or if the etherAmount != .5 ether, reject ticket purchase
// check remaining tickets function () return ([]uint availableTickets)
contract LotteryPractice1 {
function LotteryPractice1 () {
bytes32 myHash = block.blockhash(block.number - 1);
uint256 hashNum = uint256(myHash);
// Last Character alone
// Shift left by 252 bits (leaving just 4 bits left), then shift back to the right
uint256 last = (hashNum * 2 ** 252) / (2 ** 252);
}
uint[] _availableTickets = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16];
struct _purchasedLotteryTicket {
address _ticketBuyer;
uint _ticketNumber;
uint _etherReceived;
}
event __purchasedLotteryTicket(
address ___ticketBuyer,
uint ___ticketNumber,
uint ___etherReceived
);
_purchasedLotteryTicket[] _surprisedIfThisWorks;
// try creating three private functions that push each new struct property of a new lottery purchase to an initially empty array. one for address, one for number & one for ether. Then just have another function that simply calls those three private functions & returns three individual arrays
function all(uint pos) private returns(address __ticketBuyer, uint __ticketNumber, uint __etherReceived) {
_purchasedLotteryTicket storage _PT = _surprisedIfThisWorks[pos];
return (_PT._ticketBuyer, _PT._ticketNumber, _PT._etherReceived);
}
mapping(address => _purchasedLotteryTicket) _purchasedLotteryTicketBuyer;
address[] _purchasedLotteryTickets;
function purchaseLotteryTicket(address _ticketPurchaser, uint _ticketPurchasedNumber) payable public returns (uint[] _ticketsRemainingAfterPurchase) {
var lotteryTicket = _purchasedLotteryTicketBuyer[_ticketPurchaser];
require(msg.value == .5 ether);
lotteryTicket._etherReceived = msg.value;
lotteryTicket._ticketBuyer = _ticketPurchaser;
lotteryTicket._ticketNumber = _ticketPurchasedNumber;
_purchasedLotteryTickets.push(_ticketPurchaser);
uint testRemove = 16 - _availableTickets.length + 1;
remove(_ticketPurchasedNumber - testRemove);
_purchasedLotteryTicket memory testStruct = _purchasedLotteryTicket(msg.sender,_ticketPurchasedNumber,msg.value);
_surprisedIfThisWorks.push(testStruct);
return _availableTickets;
}
function ticketsRemaining() public returns(uint[]) {
return _availableTickets;
}
function ticketsPurchased() public returns(address[],uint[],uint[]) {
address[] _ticketBuyerArr;
uint[] _ticketNumberArr;
uint[] _ticketEtherReceivedArr;
if(_availableTickets.length < 16) {
// for(uint i = 0; i <= 16 - _availableTickets.length; i++) {
// _ticketBuyerArr.push(_surprisedIfThisWorks[i]._ticketBuyer);
//_ticketNumberArr.push(_surprisedIfThisWorks[i]._ticketNumber);
//_ticketEtherReceivedArr.push(_surprisedIfThisWorks[i]._etherReceived);
//}
_ticketBuyerArr.push(_surprisedIfThisWorks[0]._ticketBuyer);
_ticketNumberArr.push(_surprisedIfThisWorks[0]._ticketNumber);
_ticketEtherReceivedArr.push(_surprisedIfThisWorks[0]._etherReceived);
}
return (_ticketBuyerArr,_ticketNumberArr,_ticketEtherReceivedArr);
}
function remove(uint index) private returns(uint[]) {
if (1 >= _availableTickets.length) return;
for (uint i = index; i<_availableTickets.length-1; i++){
_availableTickets[i] = _availableTickets[i+1];
}
delete _availableTickets[_availableTickets.length-1];
_availableTickets.length--;
return _availableTickets;
}
}