#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <limits.h>
#include <malloc.h>
#define MAX_CHAR_PER_LINE 1000
#define MAX_NAME 256
void warning(char *);
void error(char *);
#define FALSE 0
#define TRUE 1
typedef struct{
char a[MAX_CHAR_PER_LINE];
} element;
typedef struct ListNode{
element data;
struct ListNode *llink;
struct ListNode *rlink;
} ListNode;
typedef struct{
ListNode *head;
int length;
} LinkedListType;
void init(LinkedListType *list) // List의 초기화
{
if(list==NULL) return;
list->length=0;
list->head=NULL;
}
void insert_node(ListNode *before, ListNode *new_node)
{
new_node->llink=before;
new_node->rlink=before->rlink;
before->rlink->llink=new_node;
before->rlink=new_node;
}
void remove_node(ListNode *phead_node, ListNode *removed)
{
if(removed==phead_node) return;
removed->llink->rlink=removed->rlink;
removed->rlink->llink=removed->llink;
free(removed);
}
ListNode *get_node_at(LinkedListType *list, int pos)
{
int i;
ListNode *tmp_node=list->head;
if(pos<0) return NULL;
for(i=0;i<pos;i++) tmp_node=tmp_node->rlink;
return tmp_node;
}
int get_length(LinkedListType *list){
return list->length;
}
void add(LinkedListType *list, int position, element data)
{
ListNode *p;
if((position>=0)&&(position<=list->length)){
ListNode *node=(ListNode *)malloc(sizeof(ListNode));
if(node==NULL) error("Memory Allocate ERROR!");
node->data=data;
p=get_node_at(list, position-1);
insert_node(p, node);
list->length++;
}
}
void add_last(LinkedListType *list, element data)
{
add(list,get_length(list),data);
}
void add_first(LinkedListType *list, element data)
{
add(list, 0, data);
}
int is_empty(LinkedListType *list)
{
if(list->head==NULL) return 1;
else return 0;
}
void delete(LinkedListType *list, int pos)
{
if(!is_empty(list)&&(pos>=0)&&(pos<list->length)){
ListNode *p=get_node_at(list, pos-1);
remove_node(p,(p!=NULL)?p->rlink:NULL);
list->length--;
}
}
element get_entry(LinkedListType *list, int pos) // 주어진 위치에 해당하는 데이터 반환
{
ListNode *p;
if(pos>=list->length) error("Pos ERROR!");
p=get_node_at(list, pos);
return p->data;
}
void clear(LinkedListType *list) // 모든 노드를 삭제
{
int i;
for(i=0;i<list->length;i++)
delete(list, i);
}
void display(LinkedListType *buffer) // buffer의 내용 출력
{
int i;
ListNode *tmp_node;
tmp_node=buffer->head;
printf("********************\n");
for(i=0;i<buffer->length;i++){
printf("%s", tmp_node->data.a);
tmp_node=tmp_node->rlink;
}
printf("********************\n");
}
void warning(char *message) // 경고 메세지 출력
{
fprintf(stderr, "%s\n", message);
}
void error(char *message) // 에러 메세지 출력
{
fprintf(stderr, "%s\n", message);
exit(1);
}
void help() // 메뉴 출력
{
printf("********************\n");
printf("i: INSERT\n");
printf("d: DELETE\n");
printf("r: READ FILE\n");
printf("w: WRITE FILE\n");
printf("q: QUIT\n");
printf("********************\n");
}
void read_file(LinkedListType *buffer) // disk file로부터 data를 읽음
{
char fname[MAX_NAME];
FILE *fd;
element p;
if(!is_empty(buffer)){
clear(buffer);
}
init(buffer);
printf("FILE NAME: ");
scanf("%s", fname);
if((fd=fopen(fname,"r"))==NULL){
warning("Can't open file.\n");
return;
}
while(fgets(p.a, MAX_CHAR_PER_LINE, fd)){
add_last(buffer, p);
}
fclose(fd);
display(buffer);
}
void write_file(LinkedListType *buffer) // buffer에 있는 data를 disk file에 씀
{
FILE *fd;
char fname[MAX_NAME];
element p;
int i;
printf("FILE NAME: ");
scanf("%s", fname);
if((fd=fopen(fname, "w"))==NULL){
printf("Can't open file.\n");
return;
}
for(i=0;i<get_length(buffer);i++){
p=get_entry(buffer, i);
fputs(p.a, fd);
}
fclose(fd);
display(buffer);
}
void delete_line(LinkedListType *buffer) // 하나의 라인 삭제
{
int position;
if(is_empty(buffer))
printf("Line is already empty!\n");
else
{
printf("Input line number: ");
scanf("%d",&position);
delete(buffer, position);
}
display(buffer);
}
void insert_line(LinkedListType *buffer) // 하나의 라인 삽입
{
int position;
char line[MAX_CHAR_PER_LINE];
element p;
printf("Input line number: ");
scanf("%d", &position);
printf("Input: ");
fflush(stdin);
fgets(line, MAX_CHAR_PER_LINE, stdin);
strcpy(p.a, line);
add(buffer, position, p);
display(buffer);
}
void do_command(LinkedListType *buffer, char command) // 커맨드 창 출력
{
switch(command)
{
case 'd':
delete_line(buffer);
break;
case 'i':
insert_line(buffer);
break;
case 'r':
read_file(buffer);
break;
case 'w':
write_file(buffer);
break;
case 'q':
break;
}
}
int main()
{
char command;
LinkedListType buffer;
init(&buffer);
do{
help();
command=getchar();
do_command(&buffer, command);
fflush(stdin);
} while(command!='q');
return 0;
}
