Documentation of `Data.Text.replace`
Open
documentation
- Dominant language
- Haskell
- Stars
- 421
- Forks
- 163
- PR merge metrics
- No merged PRs in 30d
Description
The docs say:
> O(m+n)
> [...]
> In (unlikely) bad cases, this function's time complexity degrades towards O(n*m).
How unlikely are these bad cases? In any case the O(m+n) is misleading if the worst case is proportional to n*m.
I think we may want to spell this out further.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.