oxedyne/fe2o3/fe2o3_text/tools/cbor.py
2.2 KiB, 1 run
created by r1870400018:73162, which is this file's identity for as long as the history lasts, whatever it is later renamed to
download · who wrote it · its history
| 1 | """A minimal std-only CBOR decoder, enough to read hayagriva's archived citationberg records.""" |
| 2 | |
| 3 | import struct |
| 4 | |
| 5 | |
| 6 | def decode(data): |
| 7 | val, pos = _item(data, 0) |
| 8 | return val |
| 9 | |
| 10 | |
| 11 | def _arg(data, pos, info): |
| 12 | if info < 24: |
| 13 | return info, pos |
| 14 | n = {24: 1, 25: 2, 26: 4, 27: 8}[info] |
| 15 | return int.from_bytes(data[pos:pos + n], "big"), pos + n |
| 16 | |
| 17 | |
| 18 | def _item(data, pos): |
| 19 | b = data[pos] |
| 20 | pos += 1 |
| 21 | major, info = b >> 5, b & 31 |
| 22 | if major == 7: |
| 23 | if info == 20: |
| 24 | return False, pos |
| 25 | if info == 21: |
| 26 | return True, pos |
| 27 | if info in (22, 23): |
| 28 | return None, pos |
| 29 | if info == 25: |
| 30 | return _half(data[pos:pos + 2]), pos + 2 |
| 31 | if info == 26: |
| 32 | return struct.unpack(">f", data[pos:pos + 4])[0], pos + 4 |
| 33 | if info == 27: |
| 34 | return struct.unpack(">d", data[pos:pos + 8])[0], pos + 8 |
| 35 | if info < 24: |
| 36 | return info, pos |
| 37 | raise ValueError("cbor: simple value %d at %d" % (info, pos)) |
| 38 | if info == 31: |
| 39 | # Indefinite length. |
| 40 | out = [] if major in (4, 2, 3) else {} |
| 41 | if major in (2, 3): |
| 42 | chunks = [] |
| 43 | while data[pos] != 0xff: |
| 44 | c, pos = _item(data, pos) |
| 45 | chunks.append(c) |
| 46 | return (b"" if major == 2 else "").join(chunks), pos + 1 |
| 47 | while data[pos] != 0xff: |
| 48 | if major == 4: |
| 49 | v, pos = _item(data, pos) |
| 50 | out.append(v) |
| 51 | else: |
| 52 | k, pos = _item(data, pos) |
| 53 | v, pos = _item(data, pos) |
| 54 | out[_key(k)] = v |
| 55 | return out, pos + 1 |
| 56 | n, pos = _arg(data, pos, info) |
| 57 | if major == 0: |
| 58 | return n, pos |
| 59 | if major == 1: |
| 60 | return -1 - n, pos |
| 61 | if major == 2: |
| 62 | return bytes(data[pos:pos + n]), pos + n |
| 63 | if major == 3: |
| 64 | return data[pos:pos + n].decode("utf-8"), pos + n |
| 65 | if major == 4: |
| 66 | out = [] |
| 67 | for _ in range(n): |
| 68 | v, pos = _item(data, pos) |
| 69 | out.append(v) |
| 70 | return out, pos |
| 71 | if major == 5: |
| 72 | out = {} |
| 73 | for _ in range(n): |
| 74 | k, pos = _item(data, pos) |
| 75 | v, pos = _item(data, pos) |
| 76 | out[_key(k)] = v |
| 77 | return out, pos |
| 78 | if major == 6: |
| 79 | return _item(data, pos) |
| 80 | raise ValueError("cbor: major %d" % major) |
| 81 | |
| 82 | |
| 83 | def _key(k): |
| 84 | return tuple(k) if isinstance(k, list) else k |
| 85 | |
| 86 | |
| 87 | def _half(b): |
| 88 | h = int.from_bytes(b, "big") |
| 89 | s, e, m = h >> 15, (h >> 10) & 31, h & 1023 |
| 90 | if e == 0: |
| 91 | v = m * 2.0 ** -24 |
| 92 | elif e == 31: |
| 93 | v = float("inf") if m == 0 else float("nan") |
| 94 | else: |
| 95 | v = (1 + m / 1024.0) * 2.0 ** (e - 15) |
| 96 | return -v if s else v |