【C++库】list-创新互联

list_head 入侵式的双链表。

LIST_HEAD(list);

源代码

#define LIST_HEAD(name) \
	struct list_head name = LIST_HEAD_INIT(name)

struct Node {int value;
  char *name;

  list_head list;
};

Node lists[3] = {[0] = {.value = 0, .name = "apple"},
                   [1] = {.value = 1, .name = "lionel"},
                   [2] = {.value = 2, .name = "xiaomi"}};

  LIST_HEAD(list);

  list_add_tail(&lists[0].list, &list);
  list_add_tail(&lists[1].list, &list);
  list_add_tail(&lists[2].list, &list);

  list_head *mod = nullptr;
  list_for_each(mod, &list) {Node *inode;
    //节点指针 类型 节点listhead 名字
    inode = list_entry(mod, Node, list);
    printf("%d %s\n", inode->value, inode->name);
  }

你是否还在寻找稳定的海外服务器提供商？创新互联www.cdcxhl.cn海外机房具备T级流量清洗系统配攻击溯源，准确流量调度确保服务器高可用性，企业级服务器适合批量采购，新人活动首月15元起，快前往官网查看详情吧