-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
862 lines (628 loc) · 22 KB
/
main.cpp
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
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
/// FILE OUTLINE USING TREE
/// LIBRARIES ARE INCLUDED
#include<iostream>
#include<string>
#include <ctype.h>
#include<stdlib.h>
#include<fstream>
using namespace std;
/// STRUCTURE FOR TREE NODES
struct Node
{
string Heading;
string Content;
Node *down;
Node *next;
int totalSections;
};
/// CLASS FOR OUTLINE OF DOCUMENT
class Outline
{
/// PRIVATE DATA MEMBERS
Node *root = NULL;
Node *temp = NULL;
Node *t = NULL;
Node *t1 = NULL;
public:
/// PUBLIC MEMBER FUNCTIONS
Node* create(string &heading,string &content);
void insertTitle();
void insertSections();
void insertSubSections();
void insertSubSubSections();
void displayOutline();
void displayDocument();
void store();
};
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: displayDocument() /// FUNCTION HEADER
/// FUNCTION displayDocument() BODY
{
system("color 0C");
/// CHECKS IF DOCUMENT EXISTS OR NOT
if(root == NULL)
{
cout<<"Document does't exist!!!"<<endl;
cin.ignore();
cin.get();
}
/// IF DOCUMENT EXISTS TRAVESES THE TREE TO DISPLAY
else
{
temp = root; /// temp NODE IS ASSIGNED TO POINT TO ROOT NODE (FOR TRAVESAL)
/// DISPLAYS THE TITLE AND IT'S CONTENT
cout<<"\nTITLE : "<<endl;
cout<<"\n\t\t\t"<<temp->Heading<<endl;
cout<<"\n "<<temp->Content;
/// CHECKS FOR SECTIONS TO DISPLAY THEM
if(temp->totalSections == 1)
{
/// IF SECTIONS ARE PRESENT FROM ROOT NODE temp GOES TO SECTION NODE
temp = temp->down;
/// LOOP TO TRAVERSE SECTIONS AND DISPLAY IT
while(temp!=NULL)
{
/// DISPLAYS ALL SECTIONS AND THIER CONTENTS
cout<<"\nSECTION : "<<endl;
cout<<"\n\t\t\t"<<temp->Heading<<endl;
cout<<"\n "<<temp->Content;
t = temp; /// NODE t POINTS TO SECTION NODES
/// CHECKS IF SECTIONS HAVE SUB-SECTIONS TO DISPLAY THEM
if(t->totalSections == 1)
{
/// IF SUB-SECTIONS ARE PRESENT t IS MADE TO POINT TO SUB-SECTION NODES
t = t->down;
/// LOOP TO TRAVERSE SUB-SECTION NODES AND DISPLAY THEM
while(t!=NULL)
{
/// DISPLAYS SUBSECTION AND IT'S CONTENTS
cout<<"\nSUBSECTION : "<<endl;
cout<<"\n\t\t\t"<<t->Heading<<endl;
cout<<"\n "<<t->Content;
t1 = t; /// t1 IS MADE TO POINT TO SUB-SECTION NODE
/// CHECKS IF SUB-SECTIONS HAVE SUB-SECTIONS
if(t1->totalSections == 1)
{
/// IF SUB-SECTIONS HAVE SUB-SECTIONS t1 POINTS TO THE SUB-SUB-SECTION
t1 = t1->down;
/// LOOP TO TRAVERSE SUB-SUB-SECTIONS AND DISPLAY THEM
while(t1!=NULL)
{
/// DISPLAYS SUB-SUB-SECTIONS AND IT'S CONTENTS
cout<<"\nSUB-SUBSECTION : "<<endl;
cout<<"\n\t\t\t"<<t1->Heading<<endl;
cout<<"\n "<<t1->Content;
t1 = t1->next; /// t1 IS INCREMENTED FOR TRAVERSAL OF SUB-SUB-SECTIONS
} //END OF WHILE
}
t = t->next; /// t IS INCREMENTED FOR TRAVERSAL OF SUB-SECTIONS
}//END OF WHILE
}
temp = temp->next; /// temp IS INCREMENTED FOR TRAVERSAL OF SECTIONS
}//END OF WHILE
}
}
cin.ignore();
cin.get();
} /// END OF FUNCTION displayDocument()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: store() /// FUNCTION HEADER
/// FUNCTION store() BODY
{
/// FILE IS OPENDED AND THE TREE IS TRAVERSED TO STORE THE DOCUMENT
fstream out;
out.open("DOCUMENTS.txt",ios::app|ios::out);
if(out.is_open())
{
system("color 0C");
if(root == NULL)
{
cout<<"Document does't exist!!!"<<endl;
cin.ignore();
cin.get();
exit(1);
}
else
{
temp = root;
out<<"\nTITLE : "<<endl;
out<<"\n\t\t\t"<<temp->Heading<<endl;
out<<"\n "<<temp->Content;
if(temp->totalSections == 1)
{
temp = temp->down;
while(temp!=NULL)
{
out<<"\nSECTION : "<<endl;
out<<"\n\t\t\t"<<temp->Heading<<endl;
out<<"\n "<<temp->Content;
t = temp;
if(t->totalSections == 1)
{
t = t->down;
while(t!=NULL)
{
out<<"\nSUBSECTION : "<<endl;
out<<"\n\t\t\t"<<t->Heading<<endl;
out<<"\n "<<t->Content;
t1 = t;
if(t1->totalSections == 1)
{
t1 = t1->down;
while(t1!=NULL)
{
out<<"\nSUB-SUBSECTION : "<<endl;
out<<"\n\t\t\t"<<t1->Heading<<endl;
out<<"\n "<<t1->Content;
t1 = t1->next;
}
}
t = t->next;
}
}
temp = temp->next;
}
}
}
out.close();
}
} /// END OF FUNCTION store()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: displayOutline() /// FUNCTION HEADER
/// FUNCTION displayOutline() BODY
{
system("color 0C");
if(root == NULL)
{
cout<<"Document does't exist!!!"<<endl;
cin.ignore();
cin.get();
}
else
{
temp = root;
cout<<"\nTITLE : "<<temp->Heading<<endl;
if(temp->totalSections == 1)
{
temp = temp->down;
while(temp!=NULL)
{
cout<<"\nSECTION : "<<temp->Heading<<endl;
t = temp;
if(t->totalSections == 1)
{
t = t->down;
while(t!=NULL)
{
cout<<"\nSUBSECTION : "<<t->Heading<<endl;
t1 = t;
if(t1->totalSections == 1)
{
t1 = t1->down;
while(t1!=NULL)
{
cout<<"\nSUB-SUBSECTION : "<<t1->Heading<<endl;
t1 = t1->next;
}
}
t = t->next;
}
}
temp = temp->next;
}
}
}
cin.ignore();
cin.get();
} /// END OF FUNCTION displayOutline()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: insertSubSubSections() /// FUNCTION HEADER
/// FUNCTION insertSubSubSections() BODY
{
system("color 0E");
string subSection,subSubSection,section,content;
int noOfSubSubSections,i,F=0,F1=0;
if(root == NULL)
{
cout<<"Title's not present"<<endl;
cin.ignore();
cin.get();
}
else
{
cout<<"Enter section to which you want to add Sub sub section"<<endl;
cin>>section;
temp = root;
if(temp->totalSections == 0)
{
cout<<"There's no sections in this document"<<endl;
cin.ignore();
cin.get();
}
else
{
temp = temp->down; ///section level
while(temp != NULL)
{
if(!section.compare(temp->Heading))
{
F=1;
if(temp->totalSections == 0)
{
cout<<"There's no sub-sections in this section"<<endl;
cin.ignore();
cin.get();
break;
}
cout<<"Enter name of sub-section you want to add the sub-sub-section"<<endl;
cin>>subSection;
if(temp->totalSections == 0)
{
cout<<"There's no sub-sections"<<endl;
cin.ignore();
cin.get();
}
else
{
temp = temp->down;
while(temp != NULL)
{
if(!subSection.compare(temp->Heading))
{
F1 = 1;
do
{
cout<<"How many sub-sub-section you want to add "<<endl;
cin>>noOfSubSubSections;
}while(noOfSubSubSections<0);
for(i=0; i<noOfSubSubSections; i++)
{
cout<<"Enter "<<i+1<<" sub-section of "<<subSection<<endl;
cin>>subSubSection;
cout<<"Enter Info for "<<subSubSection<<endl;
cin.ignore();
cin.get();
getline(cin,content);
t = create(subSubSection,content);
if(temp->totalSections == 0)
{
temp->down = t;
temp->totalSections = 1;
t1 = temp->down;
}
else
{
while(t1->next != NULL)
{
t1 = t1->next;
}
t1->next = t;
}
}
break;
}
temp = temp->next;
}
if(F1 == 0)
{
cout<<"NO SUCH SUB-SECTION AVAILABLE!!!!"<<endl;
cin.ignore();
cin.get();
break;
}
}
}
temp = temp->next;
}
if(F == 0)
{
cout<<"NO SUCH SECTION AVAILABLE!!!!"<<endl;
cin.ignore();
cin.get();
}
}
}
} /// END OF FUNCTION insertSubSubSections()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: insertSubSections() /// FUNCTION HEADER
/// FUNCTION insertSubSections() BODY
{
system("color 0E");
string section,subSection,content;
int noOfSubSections,i,F=0;
if(root == NULL)
{
cout<<"Title's not present"<<endl;
cin.ignore();
cin.get();
}
else
{
cout<<"Enter section to which you want to add subsection"<<endl;
cin>>section;
temp = root;
if(temp->totalSections == 0)
{
cout<<"There's no sections in this document"<<endl;
cin.ignore();
cin.get();
}
else
{
temp = temp->down;
while(temp != NULL)
{
if(!section.compare(temp->Heading))
{
F=1;
do
{
cout<<"How many sub-sections you want to add"<<endl;
cin>>noOfSubSections;
}while(noOfSubSections<0);
for(i=0; i<noOfSubSections; i++)
{
cout<<"Enter sub-section "<<i+1<<endl;
cin>>subSection;
cout<<"Enter Info for "<<subSection<<endl;
cin.ignore();
cin.get();
getline(cin,content);
t = create(subSection,content);
if(temp->totalSections == 0)
{
temp->down = t;
temp->totalSections = 1;
t1 = temp->down;
}
else
{
while(t1->next != NULL)
{
t1 = t1->next;
}
t1->next = t;
}
}
break;
}
temp = temp->next;
}
if(F==0)
{
cout<<"NO SUCH SECTION AVAILABLE!!!!"<<endl;
cin.ignore();
cin.get();
}
}
}
} /// END OF FUNCTION insertSubSections()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: insertSections() /// FUNCTION HEADER
/// FUNCTION insertSections() BODY
{
system("color 0E");
int noOfSections,i;
/// VARIABLES ARE DECLARED
string section,content;
/// CHECKS IF THE DOCUMENT IS AVAILABLE OR NOT
if(root == NULL)
{
/// IF TITLE IS NOT PRESENT
cout<<"Title's not present"<<endl;
cin.ignore();
cin.get();
}
else
{
/// IF TITLE IS PRESENT
/// ASKS USER FOR THE NUMBER OF SECTIONS TO BE ADDED
cout<<"How many sections do you want to add ?"<<endl;
while(!(cin>>noOfSections))
{
system("cls");
cout<<"ERROR !!!!! ENTER A NUMBER !!!!!!!"<<endl;
cout<<"How many sections would you like to add ?"<<endl;
cin.clear();
cin.ignore(120,'\n');
}
/// ASKS USER FOR SECTION AND ITS CONTENTS
for(i=0; i<noOfSections; i++)
{
cout<<"Enter section "<<i+1<<endl;
cin>>section;
cout<<"Enter Info for "<<section<<endl;
cin.ignore();
cin.get();
getline(cin,content);
/// NEW NODE IS CREATED FOR SECTION
t = create(section,content);
/// CHECKS IF SECTIONS ARE ALREADY PRESENT
if(root->totalSections == 0)
{
/// IF THERE ARE NO SECTIONS,THE NEW CREATED SECTION NODE IS ADDED DOWN TO THE ROOT NODE
root->down = t;
/// TO INDICATE CHILD NODES ARE PRESENT
root->totalSections = 1;
}
else
{
temp = root; /// TEMP NODE IS ASSIGNED TO POINT TO THE ROOT NODE FOR TRAVERSAL AS SOME CHILD
/// NODE ALREADY EXISTS
temp = temp->down;
/// LOOP FOR TRAVERSING TO GET THE LAST NODE TO ADD NEW NODE
while(temp->next != NULL)
{
temp = temp->next;
}
temp->next = t; ///INSERTS A NEW NODE AFTER THE LAST NODE
}
} /// END OF FOR
}
} /// END OF FUNCTION insertSections()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
void Outline :: insertTitle() /// FUNCTION HEADER
/// FUNCTION insertTitle() BODY
{
system("color 0E");
/// VARIABLES ARE DECLARED
string title,content;
/// CHECKS IF DOCUMENT EXISTS OR NOT
if(root == NULL)
{
/// ASKS USER FOR TITLE AND CONTENT
cout<<"Enter Title"<<endl;
cin>>title;
cout<<"Enter Info"<<endl;
cin.ignore();
cin.get();
getline(cin,content);
/// CREATING A NEW NODE FOR TITLE AND ASSIGNING IT AS THE ROOT NODE
Node *t1 = NULL;
t1 = create(title,content);
root = t1;
}
else
{
/// IF TITLE EXISTS
cout<<"Title exists"<<endl;
cin.ignore();
cin.get();
}
} /// END OF FUNCTION insertTitle()
/// CLASS Outline's MEMBER FUNCTION DEFINITION
Node* Outline :: create(string &heading,string &content) /// FUNCTION HEADER
/// FUNCTION create() BODY
{
/// CREATING NODE
Node *ptr = new struct Node;
ptr->next = NULL;
ptr->down = NULL;
ptr->totalSections = 0;
/// ASSIGNING PASSED ARGUMENTS
ptr->Heading = heading;
ptr->Content = content;
/// RETURNING POINTER TO THE CREATED NODE
return ptr;
} /// END OF FUNCTION create()
/// MAIN FUNCTION BEGINS
int main()
{
Outline *document; /// POINTER OBJECT FOR CLASS Outline
/// VARIABLES ARE DECLARED
int choice,i=0,noOfDocuments,F=1;
char ch;
system("color 0B");
/// ASKS USER FOR THE NUMBER OF DOCUMENTS TO BE CREATED
cout<<"How many documents would you like to add ?"<<endl;
while(!(cin>>noOfDocuments))
{
system("cls");
cout<<"ERROR !!!!! ENTER A NUMBER !!!!!!!"<<endl;
cout<<"How many documents would you like to add ?"<<endl;
cin.clear();
cin.ignore(120,'\n');
}
system("cls");
/// DYNAMIC MEMORY ALLOCATION FOR CLASS Outline
document = new Outline[noOfDocuments];
/// LOOP FOR CREATING NEW DOCUMENTS
for(i=0; i<noOfDocuments; i++)
{
F = 1; /// FLAG VARIABLE TO CREATE NEW DOCUMENTS
/// LOOP TO CREATE A DOCUMENT
while(F)
{
system("color 0B");
/// DISPLAYS AVAILABLE OPERATIONS
cout<<"\n 1]INSERT DOCUMENT TITLE "<<endl;
cout<<"\n 2]INSERT SECTIONS OF THE DOCUMENT"<<endl;
cout<<"\n 3]INSERT SUBSECTIONS OF THE DOCUMENT"<<endl;
cout<<"\n 4]INSERT SUBSECTIONS OF THE SUBSECTIONS OF THE DOCUMNENT"<<endl;
cout<<"\n 5]DISPLAY DOCUMENT OUTLINE"<<endl;
cout<<"\n 6]DISPLAY DOCUMENT"<<endl;
cout<<"\n 7]SAVE"<<endl;
cout<<"\n 8]EXIT"<<endl;
/// GETS REQUIRED OPERATION TO BE PERFORMED
cout<<"\n Enter your choice:"<<endl;
while(!(cin>>choice))
{
cout<<"ERROR !!!!! ENTER A NUMBER !!!!!!!"<<endl;
cout<<"\n Enter your choice:"<<endl;
cin.clear();
cin.ignore(120,'\n');
}
switch(choice)
{
/// FUNCTION CALL TO INSERT TITLE
case 1:
{
system("cls");
document[i].insertTitle();
system("cls");
}
break;
/// FUNCTION CALL TO INSERT SECTIONS
case 2:
{
system("cls");
document[i].insertSections();
system("cls");
}
break;
/// FUNCTION CALL TO INSERT SUB-SECTIONS
case 3:
{
system("cls");
document[i].insertSubSections();
system("cls");
}
break;
/// FUNCTION CALL TO INSERT SUB-SUB-SECTIONS
case 4:
{
system("cls");
document[i].insertSubSubSections();
system("cls");
}
break;
/// FUNCTION CALL TO DISPLAY DOCUMENT OUTLINE
case 5:
{
system("cls");
document[i].displayOutline();
system("cls");
}
break;
/// FUNCTION CALL TO DISPLAY DOCUMENT
case 6:
{
system("cls");
document[i].displayDocument();
system("cls");
}
break;
/// FUNCTION CALL TO SAVE DOCUMENT
case 7:
{
system("cls");
document[i].store();
system("cls");
}
break;
/// TO EXIT
case 8:
{
exit(0);
}
break;
/// DEFAULT CASE
default:
{
cout<<"INVALID OPTION !!!!!!!"<<endl;
}
} /// END OF SWITCH
} /// END OF WHILE
} /// END OF FOR LOOP
return 0;
} ///MAIN FUNCTION ENDS