00caf49 | plum | pyrossh

git clone https://git.pyrossh.dev/plum

A statically typed, imperative programming language inspired by rust, python

00caf49 — Peter John 2026-11-01T16:43:14+05:30

T3: Map("a" => 1) examples + README

Files changed (5) hide show

README.md +2 -1
plum-examples/generics.plum +2 -4
plum-examples/maps.plum +28 -0
plum-examples/seq.plum +1 -4
plum-examples/values.plum +1 -2

README.md CHANGED Viewed

@@ -946,7 +946,8 @@ hello, world!
 - **`Buffer`** (`import std/Buffer`) — a growable, mutable byte sequence for building up a `Str`, amortized O(n) writes
 - **`Array[T]`** (`import std/Array`) — the compiler-intrinsic generic array that `List` and `Map` are written on; `Grid[T]` is a flat 2D array
 - **`List[T]`** (`import std/List`) — a growable list built on `Array`, with `get`/`add`/`set`/`removeAt`/`remove`/`sort`/`join`/`chunk` (iteration and transformation via `for`)
-- **`Map[K, V]`**, **`Set[T]`**, **`Deque[T]`**, **`Heap[T]`** — a bucketed hash table, a set over it, a ring-buffer double-ended queue and a key-ordered min-heap
+- **`Map[K, V]`** (`import std/Map`) — `Map("a" => 1, "b" => 2)` builds a `Map[Str, Int]`; `Map[K, V]()` is empty. `k => v` is sugar for `Pair(k, v)` in any call's argument list, and a key can be any expression (`Map(n + 1 => x)`). A later duplicate key wins, as with `set`. See [`plum-examples/maps.plum`](plum-examples/maps.plum)
+- **`Set[T]`**, **`Deque[T]`**, **`Heap[T]`** — a set over `Map`'s bucketed hash table, a ring-buffer double-ended queue and a key-ordered min-heap
 - **`Seq[T]`** (`import std/Seq`) — the adapters and terminals of the `for` chains
 - **`Json`**, **`Base64`**, **`Uuid`**, **`Time`**, **`Random`** — parsing, encoding, ids, wall-clock time and a seeded deterministic generator (`Random.float()` and `Random.intBelow(n)` use the wall clock)
 - **`Os`**, **`Http`** — printing and the file system; HTTP requests through the host

plum-examples/generics.plum CHANGED Viewed

@@ -152,10 +152,8 @@ test "Float specials survive an error-union payload with ? and catch"
 # --- deep ----------------------------------------------------------------
 test "List[List[Map[Str, Int]]] builds and reads back"
-  m1 := Map[Str, Int]()
-  m1.set("ok", 7)
+  m1 := Map("ok" => 7)
-  m2 := Map[Str, Int]()
-  m2.set("big", 9223372036854775807)
+  m2 := Map("big" => 9223372036854775807)
   inner1 := List[Map[Str, Int]]()
   inner1.push(m1)
   inner1.push(m2)

plum-examples/maps.plum ADDED Viewed

@@ -0,0 +1,28 @@
+# Maps: building a `Map` from `key => value` pairs. `k => v` is sugar for
+# `Pair(k, v)` in any call's argument list; later duplicate keys win.
+import std/Int
+import std/Str
+import std/Map
+test "maps_example_arrow_form"
+  m := Map("ann" => 3, "bob" => 5)
+  assert m.get("bob")! == 5
+  assert m.length() == 2
+test "maps_mixed_pair_and_arrow"
+  assert Map(Pair("a", 1), "b" => 2).length() == 2
+test "maps_duplicate_last_wins"
+  m := Map("a" => 1, "a" => 2)
+  assert m.get("a")! == 2
+  assert m.length() == 1
+test "maps_nested"
+  m := Map("a" => Map("x" => 1))
+  assert m.get("a")!.get("x")! == 1
+test "maps_int_keys"
+  assert Map(1 => "one", 2 => "two").get(1)! == "one"
+test "maps_empty_with_explicit_generics"
+  assert Map[Str, Int]().isEmpty()

plum-examples/seq.plum CHANGED Viewed

@@ -128,10 +128,7 @@ test "toList_no_body: a chain ends in a List without a for"
   assert zs.length() == 5
 test "Map keys feed Seq methods"
-  m := Map[Int, Int]()
+  m := Map(1 => 10, 2 => 20, 3 => 30)
-  m.set(1, 10)
-  m.set(2, 20)
-  m.set(3, 30)
   big := for k := range m.keys().filter()
     k > 1
   assert big.length() == 2

plum-examples/values.plum CHANGED Viewed

@@ -183,8 +183,7 @@ test "heap_field"
   assert p.hp == 3
 test "map_value"
-  m := Map[Str, Vec2]()
-  m.set("a", Vec2(x: 1.0, y: 2.0))
+  m := Map("a" => Vec2(x: 1.0, y: 2.0))
   assert m.get("a")!.y == 2.0
 test "nullable"