-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryNumber.java
More file actions
218 lines (184 loc) · 5.34 KB
/
BinaryNumber.java
File metadata and controls
218 lines (184 loc) · 5.34 KB
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
package com.example.arithmetic;
/**
* User: Nixy
* Date: 25.03.13
* Time: 18:55
*/
public class BinaryNumber extends Number {
private boolean negative = false;
public int getWeightCoeff() {
return weightCoeff;
}
private double numbeWithoutWeightr;
private int weightCoeff;
private double numberWithWeight;
private int integer;
public int getBit(int index){
if (index > -1 & index < rank){
return number[index];
}
return -1;
}
public int[] getBitArray(){
return number;
}
public boolean isNegative(){
return negative;
}
public void setNegative(boolean negative){
numberWithWeight = -Math.abs(numberWithWeight);
numbeWithoutWeightr = -Math.abs(numbeWithoutWeightr);
this.negative = negative;
}
public int getRank() {
return rank;
}
public double getNumberWithWeight(){
double num = 0;
if (isNegative()){
inverseNumber();
}
for (int i = 1 ; i < weightCoeff+1 ; i++){
num += number[i] * Math.pow(2,weightCoeff - i);
}
for (int j = 1 , i = weightCoeff+1 ; i < rank ; i++,j++){
num += number[i] * Math.pow(2,-j);
}
if (isNegative()){
inverseNumber();
num *= -1;
}
return num;
}
public int getInteger(){
int num = 0;
if (isNegative()){
inverseNumber();
}
for (int i = rank - 1,j = 0 ; i > 0 ; i--,j++){
num += number[i] * Math.pow(2,j);
}
if (isNegative()){
inverseNumber();
num *= -1;
}
return num;
}
public double getNumberWithoutWeight(){
double num = 0;
if (isNegative()){
inverseNumber();
}
for (int i = 1 ; i < rank ; i++){
num += number[i] * Math.pow(2,-i);
}
if (isNegative()){
inverseNumber();
num *= -1;
}
return num;
}
public void moveRight(){
for (int i = rank - 1; i > 1 ; i--)
number[i] = number[i-1];
number[1] = 0;
numberWithWeight /= 2;
numbeWithoutWeightr /= 2;
integer /= 2;
}
public void moveLeft(){
numberWithWeight *= 2;
numbeWithoutWeightr *= 2;
integer *= 2;
for (int i = 1 ; i < rank-1 ; i++)
number[i] = number[i+1];
number[rank-1] = 0;
}
public void inverseNumber(){
for (int i = 0 ; i < rank ; i++){
number[i] = number[i] > 0 ? 0 : 1;
}
number[rank-1] += 1;
for (int i = rank-1 ; i > 1 ; i--){
if (this.number[i] > 1){
this.number[i] %= 2;
this.number[i-1] ++;
} else
break;
}
}
public BinaryNumber(BinaryNumber number){
this.rank = number.rank;
this.number = new int[rank];
this.weightCoeff = number.weightCoeff;
for (int i = 0 ; i < rank - 1 ; i++){
this.number[i] = number.number[i];
}
this.negative = this.number[0] == 1;
numberWithWeight = getNumberWithWeight();
numbeWithoutWeightr = getNumberWithoutWeight();
integer = getInteger();
}
public BinaryNumber(int[] number,int rank,int weightCoeff){
this.number = new int[rank];
this.weightCoeff = weightCoeff;
this.rank = rank;
if (number[0] == 1){
setNegative(true);
}
for (int i = number.length-1,j = rank-1 ; i > 0 ; i--,j--){
this.number[j] = number[i] > 0 ? 1 : 0;
}
numberWithWeight = getNumberWithWeight();
numbeWithoutWeightr = getNumberWithoutWeight();
integer = getInteger();
}
public BinaryNumber(double number,int rank,int weightCoeff){
this.rank = rank;
this.number = new int[rank];
this.weightCoeff = weightCoeff;
int numer[] = new int[weightCoeff];
int num = (int) Math.abs( number );
double den = Math.abs(number) - num;
int counter = 0;
while (num > 0){
if (!(counter < weightCoeff)){
Exeptions.getInstance().e(Exeptions.OUT_OF_RANGE);
return;
}
numer[counter] = num%2;
num /= 2;
counter++;
}
counter = 1;
for (int i = weightCoeff-1 ; i > -1 ; i-- ){
this.number[weightCoeff-i] = numer[i];
counter++;
}
while (den != 0){
num = (int) (den*2);
this.number[counter] = num;
den = den * 2 - num;
++counter;
if (counter == rank)
{
num = (int) (den*2);
this.number[counter-1] += num;
break;
}
}
for (int i = rank-1 ; i > 2 ; i--){
if (this.number[i] > 1){
this.number[i] %= 2;
this.number[i-1] ++;
} else break;
}
if (number < 0) {
negative = true;
inverseNumber();
}
numberWithWeight = getNumberWithWeight();
numbeWithoutWeightr = getNumberWithoutWeight();
integer = getInteger();
}
}