From 8ce072a36276e344491f1827f80ffc1bf67bdd3f Mon Sep 17 00:00:00 2001 From: TankorSmash Date: Mon, 10 Jun 2024 19:56:59 -0700 Subject: [PATCH] Tweak wording on map description This clarifies that `map` takes only two lists. I'd have gone a step further and clarify that it puts both the key list and value list back on the stack too, but wasn't sure if that was a welcome change. --- src/primitive/defs.rs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/primitive/defs.rs b/src/primitive/defs.rs index 7a9f53fd5..4f105bf2e 100644 --- a/src/primitive/defs.rs +++ b/src/primitive/defs.rs @@ -2186,7 +2186,7 @@ primitive!( /// ex: ↧5 ∞ /// ex: ↥5 ∞ (0, Infinity, Constant, ("infinity", '∞')), - /// Create a hashmap from lists of keys and values + /// Create a hashmap from a list of keys and list values /// /// A hashmap is a normal array that is used as a mapping from keys to values. /// The related map functions [insert], [has], and [get], all treat the array as an actual hashmap, so they have O(1) amortized time complexity. @@ -2200,10 +2200,10 @@ primitive!( /// Use [insert] to insert additional key-value pairs. /// ex: map 1_2 3_4 /// : insert 5 6 - /// An empty array can be used as an empty map, even if it was not created with [map]. + /// An empty array can be used as an empty map, event if it was not created with [map]. /// ex: has 5 [] /// : insert 1 2 [] - /// You can use [un][map] to get the keys and values back. + /// You can use [un][map] to get the keys list and values list back. /// ex: [] /// : insert 1 2_3 /// : insert 4 5_6