Skip to content

Naming nit #175

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
lrvideckis merged 8 commits into from
Jan 23, 2026
Merged

Naming nit #175

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
e2cdebb
Refactor lazy segment tree apply and update methods
lrvideckis Jan 23, 2026
2166a3d
Refactor update method for lazy segment tree
lrvideckis Jan 23, 2026
820635c
Move operation function inside seg_tree struct
lrvideckis Jan 23, 2026
60eb693
Update lazy_seg_tree.hpp
lrvideckis Jan 23, 2026
5af37a5
Fix cppcheck suppression for lazy_seg_tree.hpp
lrvideckis Jan 23, 2026
3c99182
Refactor operation function in lazy segment tree
lrvideckis Jan 23, 2026
75aa1f3
Update lazy_seg_tree.hpp
lrvideckis Jan 23, 2026
f64522a
Update cppcheck suppression for lazy_seg_tree.hpp
lrvideckis Jan 23, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 9 additions & 11 deletions library/data_structures_[l,r)/lazy_seg_tree.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,9 +11,9 @@ struct seg_tree {
for (int i = n - 1; i >= 1; i--)
tree[i] = op(tree[2 * i], tree[2 * i + 1]);
}
void apply(ll change, int tl, int tr, int v) {
tree[v] += (tr - tl) * change;
if (v < n) lazy[v] += change;
void apply(ll d, int tl, int tr, int v) {
tree[v] += (tr - tl) * d;
if (v < n) lazy[v] += d;
}
void push(int tl, int tm, int tr, int v) {
if (lazy[v]) {
Expand All @@ -22,18 +22,16 @@ struct seg_tree {
lazy[v] = 0;
}
}
void update(int l, int r, ll change) {
update(l, r, change, 0, n, 1);
void update(int l, int r, ll d) {
update(l, r, d, 0, n, 1);
}
void update(int l, int r, ll change, int tl, int tr,
int v) {
void update(int l, int r, ll d, int tl, int tr, int v) {
if (r <= tl || tr <= l) return;
if (l <= tl && tr <= r)
return apply(change, tl, tr, v);
if (l <= tl && tr <= r) return apply(d, tl, tr, v);
int tm = split(tl, tr);
push(tl, tm, tr, v);
update(l, r, change, tl, tm, 2 * v);
update(l, r, change, tm, tr, 2 * v + 1);
update(l, r, d, tl, tm, 2 * v);
update(l, r, d, tm, tr, 2 * v + 1);
tree[v] = op(tree[2 * v], tree[2 * v + 1]);
}
ll query(int l, int r) { return query(l, r, 0, n, 1); }
Expand Down
20 changes: 9 additions & 11 deletions library/data_structures_[l,r]/lazy_seg_tree.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,9 +11,9 @@ struct seg_tree {
for (int i = n - 1; i >= 1; i--)
tree[i] = op(tree[2 * i], tree[2 * i + 1]);
}
void apply(ll change, int tl, int tr, int v) {
tree[v] += (tr - tl + 1) * change;
if (v < n) lazy[v] += change;
void apply(ll d, int tl, int tr, int v) {
tree[v] += (tr - tl + 1) * d;
if (v < n) lazy[v] += d;
}
void push(int tl, int tm, int tr, int v) {
if (lazy[v]) {
Expand All @@ -22,18 +22,16 @@ struct seg_tree {
lazy[v] = 0;
}
}
void update(int l, int r, ll change) {
update(l, r, change, 0, n - 1, 1);
void update(int l, int r, ll d) {
update(l, r, d, 0, n - 1, 1);
}
void update(int l, int r, ll change, int tl, int tr,
int v) {
void update(int l, int r, ll d, int tl, int tr, int v) {
if (r < tl || tr < l) return;
if (l <= tl && tr <= r)
return apply(change, tl, tr, v);
if (l <= tl && tr <= r) return apply(d, tl, tr, v);
int tm = split(tl, tr);
push(tl, tm, tr, v);
update(l, r, change, tl, tm, 2 * v);
update(l, r, change, tm + 1, tr, 2 * v + 1);
update(l, r, d, tl, tm, 2 * v);
update(l, r, d, tm + 1, tr, 2 * v + 1);
tree[v] = op(tree[2 * v], tree[2 * v + 1]);
}
ll query(int l, int r) {
Expand Down
Loading