Skip to content

Commit 0bd3a54

Browse files
lrvideckisweb-flow
andauthored
Ds reorg (#169)
* initial re org * [auto-verifier] verify commit 6705162 * add fix here too * more reorg * more changes * more reorg * some fixes * more fixes * more fixes * fix * more fixes * fix * [auto-verifier] verify commit 1d9621c * format * [auto-verifier] verify commit 803e3b3 * fix script * another fix * shorten name * [auto-verifier] verify commit 1e38582 * fix * fix * missed this one * actually fix it this time haha * updates to script * fix --------- Co-authored-by: GitHub <noreply@github.com>
1 parent 93c85b4 commit 0bd3a54

File tree

121 files changed

+200
-365
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

121 files changed

+200
-365
lines changed

.verify-helper/timestamps.remote.json

Lines changed: 31 additions & 92 deletions
Large diffs are not rendered by default.

library/data_structures/README.md

Lines changed: 0 additions & 7 deletions
This file was deleted.

library/data_structures/uncommon/disjoint_rmq_inc.hpp

Lines changed: 0 additions & 33 deletions
This file was deleted.
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
struct BIT {
66
vector<ll> s;
77
BIT(int n): s(n) {}
8-
#include "bit_uncommon/vector_constructor.hpp"
8+
#include "bit_uncommon/init.hpp"
99
void update(int i, ll d) {
1010
for (; i < sz(s); i |= i + 1) s[i] += d;
1111
}

library/data_structures/bit_uncommon/vector_constructor.hpp renamed to library/data_structures_[l,r)/bit_uncommon/init.hpp

File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.

library/data_structures/lazy_seg_tree.hpp renamed to library/data_structures_[l,r)/lazy_seg_tree.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
#pragma once
2-
#include "lazy_seg_tree_midpoint.hpp"
2+
#include "seg_tree_midpoint.hpp"
33
ll op(ll vl, ll vr) { return vl + vr; }
44
struct seg_tree {
55
int n;

0 commit comments

Comments
 (0)