Implements the first vertical slices of RFC-CM-0001/0002 on top of a113d89:
- P1: opaque Memory regions (64 KiB pages, budgets, grow-only), byte
read/write, Memory-index place assignment, wire/host-boundary rejection.
- CM-A04/A05: value-semantics List/Map/Text/Table primitives and the
recoverable Result map convention.
- CM-A06: opaque Resource handles, resource.open/read/write/close, stdout
write, granted project-file read and buffered write, strict fail-closed.
- CM-A07 Compat-A: explicit .mq.md format/utf8/io chain matching builtin
print for the covered value types; builtin remains default.
- P2 fixtures: allocators, list/tree/graph/hash, integer codecs, UTF-8
encode/decode, CSV/JSON subsets, table filter/sort/join, bytecode VM.
- ADRs 0022-0027, spec updates, evidence reports and 68 semantic goldens.
Gate: cargo fmt --check, clippy -D warnings, 407 tests passed.
165 lines
2.5 KiB
Markdown
165 lines
2.5 KiB
Markdown
## 写32
|
|
|
|
`(内存, 基址, 值)`
|
|
|
|
**字节3 = 值 % 256**
|
|
|
|
**字节2 = 值 // 256 % 256**
|
|
|
|
**字节1 = 值 // 65536 % 256**
|
|
|
|
**字节0 = 值 // 16777216 % 256**
|
|
|
|
**`内存[基址] = 字节0`**
|
|
|
|
**`内存[基址 + 1] = 字节1`**
|
|
|
|
**`内存[基址 + 2] = 字节2`**
|
|
|
|
**`内存[基址 + 3] = 字节3`**
|
|
|
|
*None*
|
|
|
|
## 读32
|
|
|
|
`(内存, 基址)`
|
|
|
|
*内存[基址] * 16777216 + 内存[基址 + 1] * 65536 + 内存[基址 + 2] * 256 + 内存[基址 + 3]*
|
|
|
|
## 成功
|
|
|
|
`(值)`
|
|
|
|
*{ok: true, value: 值}*
|
|
|
|
## 失败
|
|
|
|
`(代码, 消息)`
|
|
|
|
*{ok: false, code: 代码, message: 消息}*
|
|
|
|
## 初始化
|
|
|
|
`(内存, 容量)`
|
|
|
|
头部 8 字节:0..3 是元素数,4..7 是槽数。槽从偏移 8 开始,每槽 8 字节:
|
|
键 u32 + 值 u32。键 0 表示空槽,因此业务键必须从 1 开始。
|
|
|
|
> 写32(内存, 0, 0)
|
|
|
|
> 写32(内存, 4, 容量)
|
|
|
|
*成功(None)*
|
|
|
|
## 插入
|
|
|
|
`(内存, 键, 值)`
|
|
|
|
线性探测;键已存在时只更新值,不增加元素数。
|
|
|
|
**容量 = 读32(内存, 4)**
|
|
|
|
**位置 = 键 % 容量**
|
|
|
|
**尝试 = 0**
|
|
|
|
**完成 = false**
|
|
|
|
- `尝试 < 容量 and not 完成`
|
|
|
|
**槽 = 8 + (位置 + 尝试) % 容量 * 8**
|
|
|
|
**槽键 = 读32(内存, 槽)**
|
|
|
|
1. `槽键 == 0`
|
|
|
|
> 写32(内存, 槽, 键)
|
|
|
|
> 写32(内存, 槽 + 4, 值)
|
|
|
|
> 写32(内存, 0, 读32(内存, 0) + 1)
|
|
|
|
**完成 = true**
|
|
|
|
2. `槽键 == 键`
|
|
|
|
> 写32(内存, 槽 + 4, 值)
|
|
|
|
**完成 = true**
|
|
|
|
3. `true`
|
|
|
|
**尝试 = 尝试 + 1**
|
|
|
|
1. `完成`
|
|
|
|
*成功(None)*
|
|
|
|
2. `true`
|
|
|
|
*失败("hash.full", "哈希表已满")*
|
|
|
|
## 查找
|
|
|
|
`(内存, 键)`
|
|
|
|
遇到空槽即停止;找不到返回 None。
|
|
|
|
**容量 = 读32(内存, 4)**
|
|
|
|
**位置 = 键 % 容量**
|
|
|
|
**尝试 = 0**
|
|
|
|
**结果 = None**
|
|
|
|
- `尝试 < 容量`
|
|
|
|
**槽 = 8 + (位置 + 尝试) % 容量 * 8**
|
|
|
|
**槽键 = 读32(内存, 槽)**
|
|
|
|
1. `槽键 == 键`
|
|
|
|
**结果 = 读32(内存, 槽 + 4)**
|
|
|
|
**尝试 = 容量**
|
|
|
|
2. `槽键 == 0`
|
|
|
|
**尝试 = 容量**
|
|
|
|
3. `true`
|
|
|
|
**尝试 = 尝试 + 1**
|
|
|
|
*结果*
|
|
|
|
## main
|
|
|
|
业务键从 1 开始。37 与 5 在 32 个槽中同余,用来验证线性探测。
|
|
|
|
**内存 = memory.new(1, 1)**
|
|
|
|
> 初始化(内存, 32)
|
|
|
|
**插入5 = 插入(内存, 5, 50)**
|
|
|
|
> 插入(内存, 37, 370)
|
|
|
|
> 插入(内存, 12, 120)
|
|
|
|
> 插入(内存, 5, 55)
|
|
|
|
**内存2 = memory.new(1, 1)**
|
|
|
|
> 初始化(内存2, 2)
|
|
|
|
> 插入(内存2, 1, 10)
|
|
|
|
> 插入(内存2, 2, 20)
|
|
|
|
**表满 = 插入(内存2, 4, 40)**
|
|
|
|
*[插入5, 查找(内存, 5), 查找(内存, 37), 查找(内存, 12), 查找(内存, 99), 读32(内存, 0), 表满, 查找(内存2, 1), 查找(内存2, 2)]*
|