MCPcopy Create free account
hub / github.com/ShahjalalShohag/code-library / set

Method set

Data Structures/Persistent UnionFind.cpp:43–47  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

41 return root.size() - 1;
42 }
43 void set(int r, int i, T x) {
44 int k = upd(r, i, x);
45 root[r] = root[k];
46 root.pop_back();
47 }
48 node* upd(node* pre, int i, T x, int l, int r) {
49 node* cur = new node();
50 if (l == r){

Callers 1

findMethod · 0.45

Calls 1

updFunction · 0.70

Tested by

no test coverage detected