diff options
| author | eunhhu <[email protected]> | 2026-09-28 05:22:14 +0100 |
|---|---|---|
| committer | eunhhu <[email protected]> | 2026-09-28 05:22:14 +0100 |
| commit | 25af3db3643c7a4e961b172104ca289f5923e83a (patch) | |
| tree | 8d431d9dc0e6d0f455fe5d0fb93b726c6a3a134a /examples/words.aup | |
| parent | 0134f492c9fcb4ecf079a9dad93db1f8c70ced79 (diff) | |
| download | aup-25af3db3643c7a4e961b172104ca289f5923e83a.tar.gz aup-25af3db3643c7a4e961b172104ca289f5923e83a.zip | |
Slice a keyed list by its keys
list[low .. high], as a fold's or a for's list, is the items whose keys
are from low up to before high (a list keyed by a number), read by key:
distinct(l.item for l in lines[o * 16 .. o * 16 + 16] where
stock[l.item].quantity < t) reads one order's lines, whatever its test
does outside them. It compiles to Pure's sliced folds and walks; an empty
for over a slice still computes its keys. Two diagnostics and an app of
slices are checked.
Diffstat (limited to 'examples/words.aup')
0 files changed, 0 insertions, 0 deletions
