-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy patheditor.cpp
More file actions
381 lines (349 loc) · 9.45 KB
/
editor.cpp
File metadata and controls
381 lines (349 loc) · 9.45 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
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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
#include "editor.h"
#include <fstream>
#include "string.h"
#include <cstdlib>
using namespace std;
/************************************************************************/
/* set start of the link */
/************************************************************************/
bool Link::setStart()
{
fence=head;
rightcnt+=leftcnt;
leftcnt=0;
return true;
}
/************************************************************************/
/* set end of the link */
/************************************************************************/
bool Link::setEnd()
{
tail = fence;
leftcnt+=rightcnt;
rightcnt=0;
return true;
}
/************************************************************************/
/* init the link */
/************************************************************************/
void Link::init()
{
fence=tail=head=new node;
leftcnt=rightcnt=0;
}
/************************************************************************/
/* display the data to the screen. */
/************************************************************************/
void Link::read_from_infile(string filename)
{
string elem[100];
int count = 0;
ifstream infile(filename.c_str(),ios::in);
if (!infile)
{
cout<<"open error!"<<endl;
exit(1);
}
char ch;
while ((ch=infile.get()) != EOF) {
if(ch != '\n')
{
elem[count] = elem[count] + ch;
}
else
{
append(elem[count]);
count++;
}
}
append(elem[count]);
cout<<endl;
infile.close();
}
/************************************************************************/
/* input the data to the file. */
/************************************************************************/
void Link::save_to_file(string filename)
{
node* temp;
temp=head->next;
ofstream outfile(filename.c_str(), ios::out);
while (temp!=NULL) {
outfile<<temp->element<<endl;
temp=temp->next;
}
outfile.close();
}
/************************************************************************/
/* the insert member function is according the num to */
/*find the fence the insert to the next of the fence */
/************************************************************************/
bool Link::insert(int num,const string& item)
{
setpos(num);
node* temp=new node;
temp->element=item;
if (fence->next!=NULL)
{
temp->next=fence->next;
fence->next->pre=temp;
fence->next=temp;
temp->pre=fence;
}
else
{
fence->next=temp;
temp->pre=fence;
tail=fence->next;
}
rightcnt++;
return true;
}
/************************************************************************/
/* append string to end of the list */
/* the list is doubly linked list */
/************************************************************************/
bool Link::append(const string&item)
{
node* p;
p=tail;
tail=tail->next=new node;
tail->element = item;
tail->pre = p;
rightcnt++; //Added to right
return true;
}
/************************************************************************/
/* remove and return first string in right partition */
/************************************************************************/
bool Link::remove(string& it)
{
if (fence->next==NULL) { //empty right
return false;
}
it=fence->next->element; //remember value
node* itemp=fence->next; //remem link node
if (itemp->next!=NULL) {
itemp->next->pre=fence;
}
else
tail=fence; //reset tail
fence->next=itemp->next; //remove from the list
delete itemp; //reclaim space
rightcnt--; //remove from right
return true;
}
/************************************************************************/
/* move fence one stepleft ,no change if left is empty */
/************************************************************************/
void Link::prev()
{
if (fence!=head) { //cannot back up from list head
fence=fence->pre;
leftcnt--;
rightcnt++;
}
}
/************************************************************************/
/* according you enter the number to find the fence */
/************************************************************************/
bool Link::setpos(int pos)
{
fence=head;
if (pos<0) {
fence = head;
}
else if (pos>rightcnt+leftcnt) {
for(int j=0; j<rightcnt+leftcnt; j++)
fence = fence->next;
}
else{
for (int i=0;i<pos;i++) {
fence=fence->next;
}
}
return true;
}
/************************************************************************/
/* print the all the node in the list */
/************************************************************************/
void Link::print() const
{
cout <<"-------------------------------------------------" <<endl
<<" Current State of File " <<endl
<<" " <<endl;
node* temp;
int num=0;
temp=head;
while (temp!=tail->next) {
if (num>0) {
cout<<num<<" . ";
}
cout<< temp->element <<" "<<endl;
temp=temp->next;
num++;
}
cout<<endl;
}
/************************************************************************/
/* to calculate the file include the number of the row */
/* to calculate the number of the character */
/************************************************************************/
int Link::longlength()
{
string actfor;
node* temp;
int length=-1,num=0;
temp=head;
while (temp!=NULL) {
actfor=temp->element;
num=num+actfor.length();
length++;
temp=temp->next;
}
cout<<"The file length is: "<<length<<endl;
cout<<"The number of the character is: "<<num<<endl;
return length;
}
/************************************************************************/
/* display one line */
/************************************************************************/
bool Link::displayoneline()
{
if (fence!=NULL && fence!=head) {
cout<<fence->element<<endl;
}
else{
cout<<"the present line is empty."<<endl;
}
return true;
}
/************************************************************************/
/* according your enter string to find the line number */
/* print the find number */
/************************************************************************/
bool Link::findappointstring(string str)
{
node* temp;
int num=0;
bool bo=true;
temp=head->next;
while (temp!=NULL) {
num++;
if (temp->element==str) {
cout<<"Found"<<endl;
cout<<"This is at line No."<<num<<"."<<endl;
cout<<"the appointed is :"<<temp->element<<endl;
bo=false;
}
temp=temp->next;
}
if (bo) {
cout<<"Not exist"<<endl;
}
return true;
}
/************************************************************************/
/* delete one line according you enter the line number */
/************************************************************************/
bool Link::deleteoneline(int num)
{
num=num-1;
setpos(num);
node* q;
// if (fence->next==NULL) {
// fence->next=NULL;
// delete fence->next;
// }
if (fence==tail) {
q=tail;
tail=fence->pre;
delete q;
}
else{
node* p;
p = fence->next;
fence->next=fence->next->next;
fence->next->pre=fence;
delete p;
}
return true;
}
/************************************************************************/
/* according you enter line number to find the line */
/* replace the find line to you enter string */
/************************************************************************/
bool Link::changeline(int num,string& str)
{
setpos(num);
fence->element=str;
return true;
}
/************************************************************************/
/* change appointed line's character */
/************************************************************************/
bool Link::changeonelinecharacter(int num,string& str)
{
char m[256];
char n[256];
char z[256];
int len=0;
string str2;
node* temp;
setpos(num);
temp=fence;
strcpy(m,str.c_str());
strcpy(n,temp->element.c_str());
num=temp->element.find(m,0);
if (temp->element.find(m,0) != string::npos) {
cout<<"Re-enter the string(same length)";
cin>>str2;
while (str.length() != str2.length()) {
cout<<"Wrong!Different length"<<endl;
cout<<"Please re-enter:"<<endl;
cout<<"Re-enter the string(same length):";
cin>>str2;
}
len=str2.length();
strcpy(z,str2.c_str());
for (int j=0;j<len;j++) {
n[num]=z[j];
temp->element=n;
num++;
}
cout<<"Succesfully saved!"<<endl;
}
else
cout<<"No result."<<endl;
return true;
}
/************************************************************************/
/* find the postation in the file and print it out */
/************************************************************************/
bool Link::findinallstring(string& str)
{
char m[256];
char n[256];
int num=0;
node* temp;
temp=head;
strcpy(m,str.c_str());
while (temp->next!=NULL)
{
temp=temp->next;
num++;
if (temp->element.find(m,0) != string::npos) {
cout<<"No. "<<num<<" line"<<endl;
}
else
cout<<"It's not in No. "<<num<<" line"<<endl;
}
return true;
}
void createfile()
{
char newfile[30];
cout<<"Name for new file:"<<endl;
cin>>newfile;
fopen(newfile,"w+");
}