You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/string.zig
+33Lines changed: 33 additions & 0 deletions
Original file line number
Diff line number
Diff line change
@@ -342,6 +342,18 @@ test "verify all" {
342
342
}
343
343
}
344
344
345
+
/// Given a `i32` slice `s` of length `n`, it returns the suffix array of `s`.
346
+
/// Here, the suffix array `sa` of `s` is a permutation of $0, \cdots, n-1$ such that `s[sa[i]..n) < s[sa[i+1]..n)` holds for all $i = 0,1, \cdots ,n-2$.
347
+
///
348
+
/// # Constraints
349
+
///
350
+
/// - $0 \leq n \leq 10^8$
351
+
/// - $0 \leq \mathrm{upper} \leq 10^8$
352
+
/// - $0 \leq x \leq \mathrm{upper}$ for all elements $x$ of $s$.
/// Given a `T` slice `s` of length `n`, it returns the suffix array of `s`.
366
+
/// Here, the suffix array `sa` of `s` is a permutation of $0, \cdots, n-1$ such that `s[sa[i]..n) < s[sa[i+1]..n)` holds for all $i = 0,1, \cdots ,n-2$.
/// Given a string `s` of length `n`, it returns the suffix array of `s`.
401
+
/// Here, the suffix array `sa` of `s` is a permutation of $0, \cdots, n-1$ such that `s[sa[i]..n) < s[sa[i+1]..n)` holds for all $i = 0,1, \cdots ,n-2$.
0 commit comments