MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / node

Class node

code/data-structures/dancing_links.cpp:3–9  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1template <class T>
2struct dancing_links {
3 struct node {
4 T item;
5 node *l, *r;
6 node(const T &_item, node *_l = NULL, node *_r = NULL)
7 : item(_item), l(_l), r(_r) {
8 if (l) l->r = this;
9 if (r) r->l = this; } };
10 node *front, *back;
11 dancing_links() { front = back = NULL; }
12 node *push_back(const T &item) {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected