forked from Orchid/orchid
Lawrence Bethlenfalvy
cce4b8f11c
- removed many panics from the pipeline - extracted project and const tree to representations - extended STL list support - improved loops
73 lines
1.4 KiB
Plaintext
73 lines
1.4 KiB
Plaintext
import super::(bool::*, fn::*, known::*, list, option, loop::*, proc::*)
|
|
import std::io::panic
|
|
|
|
-- utilities for using lists as pairs
|
|
|
|
export fst := \l. (
|
|
list::get l 0
|
|
(panic "nonempty expected")
|
|
\x.x
|
|
)
|
|
export snd := \l. (
|
|
list::get l 1
|
|
(panic "2 elements expected")
|
|
\x.x
|
|
)
|
|
|
|
-- constructors
|
|
|
|
export empty := list::end
|
|
export add := \m.\k.\v. (
|
|
list::cons
|
|
list::new[k, v]
|
|
m
|
|
)
|
|
|
|
-- queries
|
|
|
|
-- return the last occurrence of a key if exists
|
|
export get := \m.\key. (
|
|
loop_over (m) {
|
|
cps record, m = list::pop m option::none;
|
|
cps if fst record == key
|
|
then const $ option::some $ snd record
|
|
else identity;
|
|
}
|
|
)
|
|
|
|
-- commands
|
|
|
|
-- remove one occurrence of a key
|
|
export del := \m.\k. (
|
|
recursive r (m)
|
|
list::pop m list::end \head.\tail.
|
|
if fst head == k then tail
|
|
else list::cons head $ r tail
|
|
)
|
|
|
|
-- remove all occurrences of a key
|
|
export delall := \m.\k. (
|
|
list::filter m \record. fst record != k
|
|
)
|
|
|
|
-- replace at most one occurrence of a key
|
|
export set := \m.\k.\v. (
|
|
m
|
|
|> del k
|
|
|> add k v
|
|
)
|
|
|
|
-- ensure that there's only one instance of each key in the map
|
|
export normalize := \m. (
|
|
recursive r (m, normal=empty) with
|
|
list::pop m normal \head.\tail.
|
|
r tail $ set normal (fst head) (snd head)
|
|
)
|
|
|
|
new[...$tail:2, ...$key = ...$value:1] =0x2p84=> (
|
|
set new[...$tail] (...$key) (...$value)
|
|
)
|
|
new[...$key = ...$value:1] =0x1p84=> (add empty (...$key) (...$value))
|
|
new[] =0x1p84=> empty
|
|
|
|
export ::(new) |