-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNumber.cs
275 lines (231 loc) · 8.27 KB
/
Number.cs
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
using System;
using System.Text;
namespace NumberlessNumber
{
public class Number
{
public static Number operator ++(Number numberToIncrement)
{
//Get the next number
return numberToIncrement.Next();
}
public static Number operator --(Number numberToDecrement)
{
//Get the previous number
return numberToDecrement.Previous();
}
public static bool operator >(Number leftOperand, Number rightOperand)
{
bool result;
//If they're equal
if (leftOperand == rightOperand)
{
result = false;
}
//If they're different
else
{
//Simultaneously search predecessors and successors of leftOperand until rightOperand is found
Number successorOfLeftOperand = leftOperand;
Number predecessorOfLeftOperand = leftOperand;
do
{
successorOfLeftOperand++;
predecessorOfLeftOperand--;
} while (successorOfLeftOperand != rightOperand && predecessorOfLeftOperand != rightOperand);
//If number2 was predecessor --> number1 was greater
result = predecessorOfLeftOperand == rightOperand;
}
return result;
}
public static bool operator <(Number leftOperand, Number rightOperand)
{
//If not greater than or equal to
return leftOperand != rightOperand && !(leftOperand > rightOperand);
}
public static bool operator >=(Number leftOperand, Number rightOperand)
{
//If either greater than or equal to
return leftOperand == rightOperand || leftOperand > rightOperand;
}
public static bool operator <=(Number leftOperand, Number rightOperand)
{
//If eithe less than or equal to
return leftOperand == rightOperand || leftOperand < rightOperand;
}
private bool IsPositive()
{
//If greater than origin
return this > Origin();
}
private bool IsNegative()
{
//If less than origin
return this < Origin();
}
public static Number operator -(Number numberToNegate)
{
Number result = Origin();
//If positive --> count down from origin, for each
if (numberToNegate.IsPositive())
for (Number i = numberToNegate; i != Origin(); i--)
result--;
//If negative --> count up from origin, for each
else if (numberToNegate.IsNegative())
for (Number i = numberToNegate; i != Origin(); i++)
result++;
return result;
}
private Number AbsoluteValue()
{
//Invert if negative
return IsPositive()
? this
: -this;
}
public static Number operator +(Number leftOperand, Number rightOperand)
{
//Start with left operand
Number result = leftOperand;
//If positive, increment for each right operand
for (Number i = rightOperand.AbsoluteValue(); i != Origin(); i--)
{
if (rightOperand.IsPositive())
result++;
else
//If negative, decrement for each right operand
result--;
}
return result;
}
public static Number operator -(Number leftOperand, Number rightOperand)
{
//Add the inverse
return leftOperand + -rightOperand;
}
public static Number operator *(Number leftOperand, Number rightOperand)
{
Number result = Origin();
//If positive, add the left operand for each right operand
for(Number i = rightOperand.AbsoluteValue(); i != Origin(); i--)
{
if (rightOperand.IsPositive())
result += leftOperand;
//If negative, subtract the left operand for each right operand
else
result -= leftOperand;
}
return result;
}
public static Number operator /(Number dividend, Number divisor)
{
//Validate
if (divisor == Origin())
throw new ArgumentOutOfRangeException();
//Initialize counters
Number absoluteQuotient = Origin();
Number absoluteRemainder = dividend.AbsoluteValue();
Number absoluteDivisor = divisor.AbsoluteValue();
//Subtract divisor as many times as possible
while(absoluteRemainder >= absoluteDivisor)
{
absoluteQuotient++;
absoluteRemainder -= absoluteDivisor;
}
//Return with correct sign
if ((dividend.IsPositive() && divisor.IsPositive())
|| (dividend.IsNegative() && divisor.IsNegative()))
return absoluteQuotient;
else
return -absoluteQuotient;
}
public static Number operator %(Number dividend, Number divisor)
{
//Get absolute remainder
Number quotient = dividend / divisor;
Number product = divisor * quotient;
Number absoluteRemainder = dividend.AbsoluteValue() - product.AbsoluteValue();
//Return with correct sign
if ((dividend.IsPositive() && divisor.IsPositive())
|| (dividend.IsNegative() && divisor.IsNegative()))
return absoluteRemainder;
else
return -absoluteRemainder;
}
public static Number Parse(string numberString)
{
//Start at origin
Number result = Origin();
//Increment for each 'O'
foreach(char c in numberString.ToCharArray())
{
if (c.ToString().ToUpper() == "O")
result++;
//Decrement for each 'X'
else if (c.ToString().ToUpper() == "X")
result--;
else
throw new ArgumentException();
}
return result;
}
public override string ToString()
{
StringBuilder sb = new StringBuilder();
//If positive, output O for each
if (this >= Origin())
for(Number currentNumber = this; currentNumber != Origin(); currentNumber--)
sb.Append("O");
//If negative, output X for each
else
for(Number currentNumber = this; currentNumber != Origin(); currentNumber++)
sb.Append("X");
return sb.ToString();
}
private Number() { }
private Number Next()
{
//Ensure next exists
lock(typeof(Number))
{
if (_Next == null)
{
_Next = new Number();
_Next._Previous = this;
}
}
//Return next
return _Next;
}
private Number _Next;
private Number Previous()
{
//Ensure previous exists
lock(typeof(Number))
{
if (_Previous == null)
{
_Previous = new Number();
_Previous._Next = this;
}
}
//Return previous
return _Previous;
}
private Number _Previous;
private static Number Origin()
{
//Ensure origin exists
lock(typeof(Number))
{
if (_Origin == null)
{
_Origin = new Number();
}
}
//Return origin
return _Origin;
}
private static Number _Origin;
}
}