base.LinkedHashMap[K,V]

read .get(k: K): mut base.Opt[read/imm V],
imm .get(k: K): mut base.Opt[imm V],
mut .get(k: K): mut base.Opt[V],
read .flow: mut base.flows.Flow[read base.Entry[K,V]],
imm .flow: mut base.flows.Flow[imm base.Entry[K,V]],
mut .flow: mut base.flows.Flow[read base.Entry[K,V]],
read .isEmpty: imm base.Bool -> …, // from base.Map/2
read .keys: mut base.flows.Flow[imm K],
mut .clear: imm base.Void,
mut .flowMut: mut base.flows.Flow[mut base.Entry[K,V]],
read .values: mut base.flows.Flow[read/imm V],
imm .values: mut base.flows.Flow[imm V],
mut .values: mut base.flows.Flow[V],
mut +(k: K, v: V): mut base.LinkedHashMap[K,V],
read .keyEq(k1: K, k2: K): imm base.Bool, // from base.Map/2
mut .remove(k: K): mut base.Opt[V],
mut .put(k: K, v: V): imm base.Void -> …,
read .get(k: K): mut base.Opt[read/imm V],
imm .get(k: K): mut base.Opt[imm V],
mut .get(k: K): mut base.Opt[V],
read .flow: mut base.flows.Flow[read base.Entry[K,V]],
imm .flow: mut base.flows.Flow[imm base.Entry[K,V]],
mut .flow: mut base.flows.Flow[read base.Entry[K,V]],
read .isEmpty: imm base.Bool -> …, // from base.Map/2
read .keys: mut base.flows.Flow[imm K],
mut .clear: imm base.Void,
mut .flowMut: mut base.flows.Flow[mut base.Entry[K,V]],
read .values: mut base.flows.Flow[read/imm V],
imm .values: mut base.flows.Flow[imm V],
mut .values: mut base.flows.Flow[V],
mut +(k: K, v: V): mut base.LinkedHashMap[K,V],
read .keyEq(k1: K, k2: K): imm base.Bool, // from base.Map/2
mut .remove(k: K): mut base.Opt[V],
mut .put(k: K, v: V): imm base.Void -> …,