Skip to content

(Lazy)SegTree: toString #34

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
NASU41 merged 1 commit into from
Sep 19, 2020
Merged

(Lazy)SegTree: toString #34

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
30 changes: 30 additions & 0 deletions LazySegTree/LazySegTree.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -236,4 +236,34 @@ private void inclusiveRangeCheck(int p) {
);
}
}

// **************** DEBUG **************** //

private int indent = 6;

public void setIndent(int newIndent) {
this.indent = newIndent;
}

@Override
public String toString() {
return toString(1, 0);
}

private String toString(int k, int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}

private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
}
30 changes: 30 additions & 0 deletions SegTree/SegTree.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -140,4 +140,34 @@ private void inclusiveRangeCheck(int p) {
);
}
}

// **************** DEBUG **************** //

private int indent = 6;

public void setIndent(int newIndent) {
this.indent = newIndent;
}

@Override
public String toString() {
return toString(1, 0);
}

private String toString(int k, int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}

private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
}