Is your input size bounded in any way?Input size bound is usually in the million "char" range, though it could be 10M or so.
What ballpark is the maximum repetition counter you can store, and the repeated string's maximum length?
Maximum repeat counter is 64K. Maximum repeated string length is ~10M, though typically less than 10K.
The maximum number of distinct repeat groups is ~4K, but I think that's only for sequential repeated groups. What actually matters is repeated groups plus transitions to "normal" groups. So it's data dependent, with worst case being ~2K.
-QM
--
Quantum Mechanics: The dreams stuff is made of
In reply to Re^2: String Compression Optimization (repeated concatenated subsequences)
by QM
in thread String Compression Optimization (repeated concatenated subsequences)
by QM
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |