findGreedySequencesWithDict

private fn

Lz4Sequence[] findGreedySequencesWithDict(
       const(ubyte)[]  src,
       uint  hashBits,
       const(ubyte)[]  dict
)

Find sequences using a greedy match-finding algorithm with dictionary support.

When a dictionary is provided, it is treated as data that precedes the source. Matches can reference positions in the dictionary, allowing for better compression when the source data is similar to the dictionary.

The hash table is pre-populated with positions from the dictionary, using a unified position space where:

Positions 0..dictLen-1 refer to the dictionary
Positions dictLen..dictLen+srcLen-1 refer to the source

Parameters

`src`	Input data to compress.
`hashBits`	Number of hash bits for the table (determines table size).
`dict`	Optional dictionary data (may be null or empty).

Returns

An array of Lz4Sequence structs describing the compressed

representation. The final sequence will have matchLen == 0.