* it possible to implement this code:
*
* - divsufsort (author: Yuta Mori), for the suffix array construction code,
- * located in a separate directory (divsufsort/).
+ * located in a separate file (divsufsort.c).
*
* - "Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its
* Applications" (Kasai et al. 2001), for the LCP array computation.
* Although this could be disabled by default in all cases, it only
* takes around 2-3% of the running time of the slow algorithm to do the
* verification. */
-#if defined(ENABLE_LZX_DEBUG) || defined(ENABLE_VERIFY_COMPRESSION)
+ if (ctx->params.algorithm == WIMLIB_LZX_ALGORITHM_SLOW
+ #if defined(ENABLE_LZX_DEBUG) || defined(ENABLE_VERIFY_COMPRESSION)
+ || 1
+ #endif
+ )
{
struct wimlib_decompressor *decompressor;
"data verification!");
}
}
-#endif
return compressed_size;
}