Enregistrement_hash_HashLongestMatch
Vue de l’ensemble
encode_hash_HashLongestMatch est une classe dans Aspose.Font FOSS pour Python.
Cette classe fournit 5 méthodes pour travailler avec les objets de encode_hash_HashLongestMatch dans les programmes Python. Les méthodologies disponibles comprennent: ‘FindAllMatches’, ‘Réset’, Store, ‘init’. Tous les membres publics sont accessibles à n’importe quelle application Pythone après l’installation du package Aspose.Font FOSS pour PyThon. Propriétés: buckets_ , ‘kBlockBits ; 'KBlocMask; ’ kBockSize` et 4 autres.
Propriétés
| Name | Type | Access | Description |
|---|---|---|---|
num_dict_matches_ | `` | Read | Gets the num dict matches . |
num_dict_lookups_ | `` | Read | Gets the num dict lookups . |
buckets_ | `` | Read | Gets the buckets . |
num_ | `` | Read | Gets the num . |
kBucketBits | `` | Read | Gets the k bucket bits. |
kBlockBits | `` | Read | Gets the k block bits. |
kNumLastDistancesToCheck | `` | Read | Gets the k num last distances to check. |
kBucketSize | `` | Read | Gets the k bucket size. |
kBlockSize | `` | Read | Gets the k block size. |
kBlockMask | `` | Read | Gets the k block mask. |
méthodes
| Signature | Description |
|---|---|
__init__(kBucketBits, kBlockBits, kNumLastDistancesToCheck) | Calls init on this encode_hash_HashLongestMatch instance. |
Reset() | Resets the matcher’s internal buffers and counters |
Store(data, data_off, ix) | Stores a hash entry for data at offset data_off with index ix |
FindLongestMatch(data, ring_buffer_mask, distance_cache, cur_ix, max_length, max_backward, best_len_out, best_len_code_out, best_distance_out, best_score_out) | Method scans the ring buffer to locate the longest backward match, returning length, code, distance, and score for optimal compression |
FindAllMatches(data, ring_buffer_mask, cur_ix, max_length, max_backward, num_matches, num_matches_off, matches, matches_off) | Finds all matches at the current index and writes them into the matches array |
Voir aussi
- Aspose.Font — référence API d’entreprise
