#ifndef _ILIST_H
#define _ILIST_H
// 定義鏈表中的節(jié)點(diǎn)結(jié)構(gòu)
typedef struct node{
  void *data;
  struct node *next;
}Node;
// 定義鏈表結(jié)構(gòu)
typedef struct list{
  struct list *_this;
  Node *head;
  int size;
  void (*insert)(void *node);// 函數(shù)指針
  void (*drop)(void *node);
  void (*clear)();
  int (*getSize)();
  void* (*get)(int index);
  void (*print)();
}List;
void insert(void *node);
void drop(void *node);
void clear();
int getSize();
void* get(int index);
void print();
#endif /* _ILIST_H */

Node *node = NULL;
List *list = NULL;
void insert(void *node);
void drop(void *node);
void clear();
int getSize();
void print();
void* get(int index);
List *ListConstruction(){
  list = (List*)malloc(sizeof(List));
  node = (Node*)malloc(sizeof(Node));
  list->head = node;
  list->insert = insert;// 將 insert 函數(shù)實(shí)現(xiàn)注冊(cè)在 list 實(shí)體上
  list->drop = drop;
  list->clear = clear;
  list->size = 0;
  list->getSize = getSize;
  list->get = get;
  list->print = print;
  list->_this = list;// 用 _this 指針將 list 本身保存起來
  return (List*)list;
}

// 將一個(gè) node 插入到一個(gè) list 對(duì)象上
void insert(void *node){
  Node *current = (Node*)malloc(sizeof(Node));
  current->data = node;
  current->next = list->_this->head->next;
  list->_this->head->next = current;
  (list->_this->size)++;
}
// 刪除一個(gè)指定的節(jié)點(diǎn) node
void drop(void *node){
  Node *t = list->_this->head;
  Node *d = NULL;
  int i = 0;
  for(i;i < list->_this->size;i++){
    d = list->_this->head->next;
    if(d->data == ((Node*)node)->data){
      list->_this->head->next = d->next;
      free(d);
      (list->_this->size)--;
      break;
    }else{
      list->_this->head = list->_this->head->next;
    }
  }
  list->_this->head = t;
}

int main(int argc, char** argv) {
  List *list = (List*)ListConstruction();// 構(gòu)造一個(gè)新的鏈表
// 插入一些值做測(cè)試
  list->insert("Apple");
  list->insert("Borland");
  list->insert("Cisco");
  list->insert("Dell");
  list->insert("Electrolux");
  list->insert("FireFox");
  list->insert("Google");
  list->print();// 打印整個(gè)列表
  printf("list size = %d\n",list->getSize());
  Node node;
  node.data = "Electrolux";
  node.next = NULL; 
  list->drop(&node);// 刪除一個(gè)節(jié)點(diǎn)
  node.data = "Cisco";
  node.next = NULL;
  list->drop(&node);// 刪除另一個(gè)節(jié)點(diǎn)
  list->print();// 再次打印
  printf("list size = %d\n",list->getSize());
  list->clear();// 清空列表
  return 0;
}