- * @mf
- * The matchfinder structure.
- * @in_begin
- * Pointer to the beginning of the input buffer.
- * @cur_pos
- * The current position in the input buffer.
- * @max_len
- * The maximum permissible match length at this position. Must be >= 5.
- * @nice_len
- * Stop searching if a match of at least this length is found.
- * @max_search_depth
- * Limit on the number of potential matches to consider.
- * @next_hash
- * Pointer to the hash code for the current sequence, which was computed
- * one position in advance so that the binary tree root could be
- * prefetched. This is an input/output parameter.
- *
- * Note: this is very similar to bt_matchfinder_get_matches() because both
- * functions must do hashing and tree re-rooting. This version just doesn't
- * actually record any matches.
+ * This is very similar to bt_matchfinder_get_matches() because both functions
+ * must do hashing and tree re-rooting.