Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/SuprDewd/CompetitiveProgramming
/ erase
Function
erase
code/data-structures/sqrt_decomposition.cpp:32–34 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
30
vi arr; arr.push_back(v);
31
T.insert(T.begin() + split(at), segment(arr)); }
32
void erase(int at) {
33
int i = split(at); split(at + 1);
34
T.erase(T.begin() + i); }
35
// vim: cc=60 ts=2 sts=2 sw=2:
Callers
nothing calls this directly
Calls
2
split
Function · 0.70
erase
Method · 0.45
Tested by
no test coverage detected