module decoding_attempts_table

Methods to build the rich.table used to display decoding attempts of a given bytes array.

Final output should be a rich.table of decoding attempts that are sorted like this:

1. String representation of undecoded bytes is always the first row

2. Encodings which chardet.detect() ranked as > 0% likelihood are sorted based on that confidence

3. Then the unchardetectable:

4. Decodings that were successful, unforced, and new

5. Decodings that were "successful" but forced

6. Decodings that were the same as other decodings

7. Failed decodings

Global Variables

• DEFAULT_TABLE_OPTIONS

---

function new_decoding_attempts_table

new_decoding_attempts_table(bytes_match: BytesMatch) → Table

Build a new rich Table with two rows, the raw and hex views of the bytes_match data.

---

This file was automatically generated via lazydocs.