From 22df891893d30e9906d0b14fc3ae5d8e67d500b2 Mon Sep 17 00:00:00 2001 From: Cliff Click Date: Sat, 3 Oct 2026 14:03:48 -0700 Subject: Chapter renumber, and split ch 17 Renumber chapters 10a, 10b, 11, 12, 13, 14 -> 10, 11, 13, 12, [11,14]. Split ch 17 into a 17a and 17b; shuffle around im/mutable syntax to be consistent, and present it more slowly. THe new immutable syntax is pushed through all later chapters --- chapter25/docs/examples/BubbleSort.smp | 2 +- chapter25/docs/examples/Dijkstra.smp | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'chapter25/docs/examples') diff --git a/chapter25/docs/examples/BubbleSort.smp b/chapter25/docs/examples/BubbleSort.smp index 1b3b83e6..ca6906b5 100644 --- a/chapter25/docs/examples/BubbleSort.smp +++ b/chapter25/docs/examples/BubbleSort.smp @@ -4,7 +4,7 @@ // // Bubble sort, with reading (parsing) and writing (formatting) the data. -val sort = { sys.aryi64 nums -> +val sort = { !sys.aryi64 nums -> sys.aryi64?! more = nums; while( more ) { more = null; diff --git a/chapter25/docs/examples/Dijkstra.smp b/chapter25/docs/examples/Dijkstra.smp index d2f1dc4f..fd595eb5 100644 --- a/chapter25/docs/examples/Dijkstra.smp +++ b/chapter25/docs/examples/Dijkstra.smp @@ -2,7 +2,7 @@ // An implementation of // https://sampleprograms.io/projects/dijkstra/ -val shortestPath = { sys.aryi64 matrix, int nodes, int src, int dst -> +val shortestPath = { !sys.aryi64 matrix, int nodes, int src, int dst -> i64 infinity = (1 << 63)-1; var dist = new i64[nodes]; var visited = new sys.adt.bitset(); -- cgit v1.2.3