forked from devanshslnk/ClaimChain
-
Notifications
You must be signed in to change notification settings - Fork 1
/
FamilyTree.sol
233 lines (178 loc) · 6.26 KB
/
FamilyTree.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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
pragma solidity ^0.4.0;
contract FamilyTree {
int256 public numberOfFamilyMemmber;
mapping (address => bool) public Wallets;
function setWallet(address _wallet) public{
Wallets[_wallet]=true;
}
function contains(address _wallet) returns (bool){
return Wallets[_wallet];
}
struct FamilyNode{
int256 id;
string
publicKey;
string
firstName;
string
lastName;
int128 dob;
int128 dod;
int8 gender;
string
spouse;
int8 marriageStatus;
string
[] parents;
string
[] children;
int256 numberOfChildren;
string
deathCerti;
}
mapping (string
=>FamilyNode) familyTree;
constructor(
string
publicKey,
string
firstName,
string
lastName,
int128 dob,
int8 gender,
int8 marriageStatus
) public {
string
[] memory parents;
string
[] memory children;
FamilyNode memory node=FamilyNode(
0,
publicKey,
firstName,
lastName,
dob,
-1,
gender,
"",
marriageStatus,
parents,
children,
0,
""
);
familyTree[publicKey]=node;
// setWallet(address);
numberOfFamilyMemmber++;
}
function addFamilyMember
(string
publicKey,
string
firstName,
string
lastName,
int128 dob,
int8 gender,
int8 marriageStatus
) public {
string
[] memory parents;
string
[] memory children;
familyTree[publicKey]=FamilyNode(
numberOfFamilyMemmber,
publicKey,
firstName,
lastName,
dob,
-1,
gender,
"",
marriageStatus,
parents,
children,
0,
""
);
numberOfFamilyMemmber++;
}
function addFather(string
father,string
son) public {
familyTree[son].parents.push(father);
familyTree[father].children.push(son);
// add mother as well
if(bytes(familyTree[father].spouse).length!=0 && familyTree[son].parents.length==1){
familyTree[familyTree[father].spouse].children.push(son);
familyTree[son].parents.push(familyTree[father].spouse);
}
}
function addMother(string
mother,string
son) public {
familyTree[son].parents.push(mother);
familyTree[mother].children.push(son);
// add father as well
if(bytes(familyTree[mother].spouse).length !=0 && familyTree[son].parents.length==1){
familyTree[familyTree[mother].spouse].children.push(son);
familyTree[son].parents.push(familyTree[mother].spouse);
}
}
function addChild(string
child,string
father) public {
familyTree[father].children.push(child);
familyTree[child].parents.push(father);
// add the other parent
if(bytes(familyTree[father].spouse).length!=0){
familyTree[familyTree[father].spouse].children.push(child);
familyTree[child].parents.push(familyTree[father].spouse);
}
}
function onDeath(string
deceased,string
deathCerti) public {
familyTree[deceased].dod=-1;
familyTree[deceased].deathCerti=deathCerti;
}
function mairrage(string
wife,string
husband) public{
familyTree[husband].spouse=wife;
familyTree[husband].marriageStatus=1;
familyTree[wife].spouse=husband;
familyTree[wife].marriageStatus=1;
}
function divorce(string
wife,string
husband) public {
familyTree[husband].marriageStatus=-1;
familyTree[wife].marriageStatus=-1;
}
function check() public view returns (int256){
return numberOfFamilyMemmber;
}
function get(string publicKey) public view returns (string,string,int8,string){
FamilyNode memory node=familyTree[publicKey];
return (
node.firstName,
node.lastName,
node.gender,
node.publicKey
);
}
function getChildrenLength(string publicKey) public view returns(uint256){
return familyTree[publicKey].children.length;
}
function getChild(string publicKey,uint256 i)public constant returns(string){
return (familyTree[publicKey].children[i]);
}
function getParentLength(string publicKey) public view returns(uint256){
return familyTree[publicKey].parents.length;
}
function getParent(string publicKey,uint256 i)public constant returns(string){
return (familyTree[publicKey].parents[i]);
}
}