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

Method upd

Data Structures/Segment Tree NonRecursive.cpp:30–33  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

28 }
29
30 void upd(int p, int v) {
31 p--;
32 for (t[p += n] = Node(v); p >>= 1; ) t[p] = combine(t[p << 1], t[p << 1 | 1]);
33 }
34
35 Node query(int l, int r) {
36 --l;

Callers 1

mainFunction · 0.45

Calls 2

NodeClass · 0.85
combineFunction · 0.70

Tested by

no test coverage detected