- * In the current implementation, the memory needed will be
- * (6 * sizeof(input_idx_t) * @max_window_size) bytes.
- * For (sizeof(input_idx_t) == 4) that's 24 times the window size.
- *
- * Memory is saved by saving neither the original window nor the LCP
- * (Longest Common Prefix) array; otherwise 29 times the window size would
- * be required. (In practice the compressor will likely keep the original
- * window around anyway, although based on this property of the
- * match-finder it theoretically it could overwrite it with the compressed
- * data.)
+ * The amount of needed memory will depend on this value; see
+ * lz_sarray_get_needed_memory() for details.