-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbit.c
187 lines (176 loc) · 3.08 KB
/
bit.c
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
#include<stdio.h>
#include<stdlib.h>
#include "bit.h"
void bit_DeleteString(Bit *bit);
Bit *bit_CreateBit()
{
Bit *bit = (Bit*)malloc(sizeof(Bit));
if (bit == NULL)
{
return NULL;
}
bit->string = NULL;
bit->invalid = 0;
bit->length = 0;
return bit;
}
Bit *bit_CopyFrom(Bit *binFrom)
{
Bit *newBin = (Bit*)malloc(sizeof(Bit));
newBin->string = (char*)malloc(binFrom->length*sizeof(char));
for(int i=0; i < binFrom->length; i++)
{
newBin->string[i] = binFrom->string[i];
}
newBin->length = binFrom->length;
newBin->invalid = binFrom->invalid;
return newBin;
}
void bit_Pop(Bit *bit)
{
if(bit->length == 1 && bit->invalid == 8)
{
printf("SHIT HAPPEN");
}
if(bit->invalid == sizeof(char)*8-1)
{
char *newString = NULL;
int newLength = bit->length - 1;
newString = (char*)calloc(newLength,sizeof(char));
if(newString == NULL)
{
printf("Shit Happened!!!");
}
for(int i = 0; i < newLength; i++)
{
newString[i] = 0;
}
for(int i = 0; i < newLength; i++)
{
newString[i] = (bit->string)[i];
}
bit_DeleteString(bit);
bit->string = newString;
--(bit->length);
bit->invalid = 0;
}
else
{
++bit->invalid;
}
}
void bit_Input(Bit *bit, int num, int seat)
{
char a = 1;
if(seat>8)
{
seat=seat%8;
}
if(num == 1)
{
a = a<<(7-seat);
*(bit->string) = *(bit->string)|a;
}
if(num == 0)
{
a = a<<(7-seat);
a = ~a;
*(bit->string) = *(bit->string)&a;
}
}
void bit_Append(Bit *bit, int value)
{
if(bit->invalid == 0)
{
char *newString = NULL;
int newLength = bit->length + 1;
newString = (char*)calloc(newLength,sizeof(char));
if(newString == NULL)
{
printf("Shit happened!");
}
for(int i = 0; i < newLength; i++)
{
newString[i] = 0;
}
for(int i = 0; i < bit->length; i++)
{
newString[i] = (bit->string)[i];
}
bit_DeleteString(bit);
bit->string = newString;
++(bit->length);
bit->invalid = sizeof(char)*8;
}
char *lastChar = &((bit->string)[bit->length-1]);
char newLastChar;
if(value == 1)
{
newLastChar = (*lastChar)|(1<<(bit->invalid-1));
}
else
{
newLastChar = (*lastChar)&(~(1<<(bit->invalid-1)));
}
*lastChar = newLastChar;
--(bit->invalid);
}
void bit_DeleteString(Bit *bit)
{
free(bit->string);
}
long bit_Length(Bit *bit)
{
return bit->length * sizeof(char) * 8 - bit->invalid;
}
int bit_Get(Bit *bit, long pos)
{
int charPos = pos / (sizeof(char)*8); //Õâ¸öλÖÃÊÇÔÚµÚ¼¸¸öcharÉÏ
int invalid = (sizeof(char)*8)-((pos+1) % (sizeof(char)*8));
invalid %= 8;
char b = bit->string[charPos] & (1 << invalid);
if(b == 0)
{
return 0;
}
else
{
return 1;
}
}
void bit_Print(Bit *bit)
{
long n = bit_Length(bit);
for(int i = 0; i < n; i++)
{
printf("%d",bit_Get(bit,i));
}
}
void bit_AppendFromString(Bit *bit, char *data)
{
for(int i = 0; data[i] != '\0'; i++)
{
int b = 0;
if(data[i] == '1')
{
b = 1;
bit_Append(bit,b);
}
else if(data[i] == '0')
{
b = 0;
bit_Append(bit,b);
}
}
}
void bit_AppendFromBit(Bit *bit1, Bit *bit2)
{
for(int i=0; i<bit_Length(bit2); i++)
{
bit_Append(bit1, bit_Get(bit2,i));
}
}
int bit_GetUnitSize()
{
return sizeof(char);
}