nqueens.mu.html « html - mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

blob: 4c4d37614048ae4b1b5ace4606dbf6aeb9bc4d55 (plain) (tree)

2f02189d ^

c762564b ^

2f02189d ^

e5c11a51 ^

ac07e589 ^

2f02189d ^

ac07e589 ^

08a0eed6 ^

e4ac3c9e ^

ac07e589 ^

805d58c6 ^

ac07e589 ^

c762564b ^

ac07e589 ^

2f02189d ^

e5c11a51 ^

2f02189d ^

e5c11a51 ^

e4ac3c9e ^

2f02189d ^

947c639e ^

b301e0c0 ^

947c639e ^

b301e0c0 ^

947c639e ^

4a48bedc ^

947c639e ^

805d58c6 ^

generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-24 21:30:34 +0000

"Special"><- <a href='064list.mu.html#L24'>rest</a> list2 142 13:num/raw <- first list2 143 ] 144 memory-should-contain [ 145 10 <- 5 # scanning next 146 11 <- 6 # inserted element 147 12 <- 4 148 13 <- 3 149 ] 150 ] 151 152 # remove 'x' from its surrounding list 'in' 153 # 154 # Returns null if and only if list is empty. Beware: in that case any other 155 # pointers to the head are now invalid. 156 def remove x:&:<a href='064list.mu.html#L6'>list</a>:_elem/contained-in:in, in:&:<a href='064list.mu.html#L6'>list</a>:_elem -> in:&:<a href='064list.mu.html#L6'>list</a>:_elem [ 157 local-scope 158 load-inputs 159 # if 'x' is null, return 160 return-unless x 161 next-node:&:<a href='064list.mu.html#L6'>list</a>:_elem <- <a href='064list.mu.html#L24'>rest</a> x 162 # clear next pointer of 'x' 163 *x <- put *x, <a href='065duplex_list.mu.html#L31'>next</a>:offset, null 164 # if 'x' is at the head of 'in', return the new head 165 at-head?:bool <- equal x, in 166 return-if at-head?, next-node 167 # compute prev-node 168 prev-node:&:<a href='064list.mu.html#L6'>list</a>:_elem <- copy in 169 curr:&:<a href='064list.mu.html#L6'>list</a>:_elem <- <a href='064list.mu.html#L24'>rest</a> prev-node 170 { 171 return-unless curr 172 found?:bool <- equal curr, x 173 break-if found? 174 prev-node <- copy curr 175 curr <- <a href='064list.mu.html#L24'>rest</a> curr 176 } 177 # set its next pointer to skip 'x' 178 *prev-node <- put *prev-node, <a href='065duplex_list.mu.html#L31'>next</a>:offset, next-node 179 ] 180 181 scenario removing-from-list [ 182 local-scope 183 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 3, null 184 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 185 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 186 run [ 187 list2:&:<a href='064list.mu.html#L6'>list</a>:num <- <a href='064list.mu.html#L24'>rest</a> <a href='064list.mu.html#L6'>list</a> # second element 188 <a href='064list.mu.html#L6'>list</a> <- remove list2, <a href='064list.mu.html#L6'>list</a> 189 10:bool/raw <- equal list2, null 190 # check structure like before 191 list2 <- copy <a href='064list.mu.html#L6'>list</a> 192 11:num/raw <- first list2 193 list2 <- <a href='064list.mu.html#L24'>rest</a> list2 194 12:num/raw <- first list2 195 20:&:<a href='064list.mu.html#L6'>list</a>:num/raw <- <a href='064list.mu.html#L24'>rest</a> list2 196 ] 197 memory-should-contain [ 198 10 <- 0 # remove returned non-null 199 11 <- 5 # scanning next, skipping deleted element 200 12 <- 3 201 20 <- 0 # no more elements 202 ] 203 ] 204 205 scenario removing-from-start-of-list [ 206 local-scope 207 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 3, null 208 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 209 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 210 run [ 211 <a href='064list.mu.html#L6'>list</a> <- remove <a href='064list.mu.html#L6'>list</a>, <a href='064list.mu.html#L6'>list</a> 212 # check structure like before 213 list2:&:<a href='064list.mu.html#L6'>list</a>:num <- copy <a href='064list.mu.html#L6'>list</a> 214 10:num/raw <- first list2 215 list2 <- <a href='064list.mu.html#L24'>rest</a> list2 216 11:num/raw <- first list2 217 20:&:<a href='064list.mu.html#L6'>list</a>:num/raw <- <a href='064list.mu.html#L24'>rest</a> list2 218 ] 219 memory-should-contain [ 220 10 <- 4 # scanning next, skipping deleted element 221 11 <- 3 222 20 <- 0 # no more elements 223 ] 224 ] 225 226 scenario removing-from-end-of-list [ 227 local-scope 228 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 3, null 229 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 230 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 231 run [ 232 # delete last element 233 list2:&:<a href='064list.mu.html#L6'>list</a>:num <- <a href='064list.mu.html#L24'>rest</a> <a href='064list.mu.html#L6'>list</a> 234 list2 <- <a href='064list.mu.html#L24'>rest</a> list2 235 <a href='064list.mu.html#L6'>list</a> <- remove list2, <a href='064list.mu.html#L6'>list</a> 236 10:bool/raw <- equal list2, null 237 # check structure like before 238 list2 <- copy <a href='064list.mu.html#L6'>list</a> 239 11:num/raw <- first list2 240 list2 <- <a href='064list.mu.html#L24'>rest</a> list2 241 12:num/raw <- first list2 242 20:&:<a href='064list.mu.html#L6'>list</a>:num/raw <- <a href='064list.mu.html#L24'>rest</a> list2 243 ] 244 memory-should-contain [ 245 10 <- 0 # remove returned non-null 246 11 <- 5 # scanning next, skipping deleted element 247 12 <- 4 248 20 <- 0 # no more elements 249 ] 250 ] 251 252 scenario removing-from-singleton-list [ 253 local-scope 254 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 3, null 255 run [ 256 <a href='064list.mu.html#L6'>list</a> <- remove <a href='064list.mu.html#L6'>list</a>, <a href='064list.mu.html#L6'>list</a> 257 1:num/raw <- deaddress <a href='064list.mu.html#L6'>list</a> 258 ] 259 memory-should-contain [ 260 1 <- 0 # back to an empty list 261 ] 262 ] 263 264 # reverse the elements of a list 265 # (contributed by Caleb Couch) 266 def reverse <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:_elem temp:&:<a href='064list.mu.html#L6'>list</a>:_elem/contained-in:result -> result:&:<a href='064list.mu.html#L6'>list</a>:_elem [ 267 local-scope 268 load-inputs 269 return-unless <a href='064list.mu.html#L6'>list</a>, temp 270 object:_elem <- first, <a href='064list.mu.html#L6'>list</a> 271 <a href='064list.mu.html#L6'>list</a> <- <a href='064list.mu.html#L24'>rest</a> <a href='064list.mu.html#L6'>list</a> 272 temp <- push object, temp 273 result <- reverse <a href='064list.mu.html#L6'>list</a>, temp 274 ] 275 276 scenario reverse-list [ 277 local-scope 278 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 1, null 279 <a href='064list.mu.html#L6'>list</a> <- push 2, <a href='064list.mu.html#L6'>list</a> 280 <a href='064list.mu.html#L6'>list</a> <- push 3, <a href='064list.mu.html#L6'>list</a> 281 run [ 282 stash [list:], <a href='064list.mu.html#L6'>list</a> 283 <a href='064list.mu.html#L6'>list</a> <- reverse <a href='064list.mu.html#L6'>list</a> 284 stash [reversed:], <a href='064list.mu.html#L6'>list</a> 285 ] 286 trace-should-contain [ 287 app: <a href='064list.mu.html#L6'>list</a>: 3 -> 2 -> 1 288 app: reversed: 1 -> 2 -> 3 289 ] 290 ] 291 292 scenario stash-list [ 293 local-scope 294 <a href='064list.mu.html#L6'>list</a>:&:<a href='064list.mu.html#L6'>list</a>:num <- push 1, null 295 <a href='064list.mu.html#L6'>list</a> <- push 2, <a href='064list.mu.html#L6'>list</a> 296 <a href='064list.mu.html#L6'>list</a> <- push 3, <a href='064list.mu.html#L6'>list</a> 297 run [ 298 stash [list:], <a href='064list.mu.html#L6'>list</a> 299 ] 300 trace-should-contain [ 301 app: <a href='064list.mu.html#L6'>list</a>: 3 -> 2 -> 1 302 ] 303 ] 304 305 def to-text in:&:<a href='064list.mu.html#L6'>list</a>:_elem -> result:text [ 306 local-scope 307 load-inputs 308 buf:&:<a href='061text.mu.html#L120'>buffer</a>:char <- <a href='061text.mu.html#L125'>new-buffer</a> 80 309 buf <- to-buffer in, buf 310 result <- <a href='061text.mu.html#L338'>buffer-to-array</a> buf 311 ] 312 313 # variant of 'to-text' which stops printing after a few elements (and so is robust to cycles) 314 def to-text-line in:&:<a href='064list.mu.html#L6'>list</a>:_elem -> result:text [ 315 local-scope 316 load-inputs 317 buf:&:<a href='061text.mu.html#L120'>buffer</a>:char <- <a href='061text.mu.html#L125'>new-buffer</a> 80 318 buf <- to-buffer in, buf, 6 # max elements to display 319 result <- <a href='061text.mu.html#L338'>buffer-to-array</a> buf 320 ] 321 322 def to-buffer in:&:<a href='064list.mu.html#L6'>list</a>:_elem, buf:&:<a href='061text.mu.html#L120'>buffer</a>:char -> buf:&:<a href='061text.mu.html#L120'>buffer</a>:char [ 323 local-scope 324 load-inputs 325 { 326 break-if in 327 buf <- append buf, [[]] 328 return 329 } 330 # append in.value to buf 331 val:_elem <- get *in, value:offset 332 buf <- append buf, val 333 # now prepare next 334 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='064list.mu.html#L6'>list</a>:_elem <- <a href='064list.mu.html#L24'>rest</a> in 335 nextn:num <- deaddress <a href='065duplex_list.mu.html#L31'>next</a> 336 return-unless <a href='065duplex_list.mu.html#L31'>next</a> 337 buf <- append buf, [ -> ] 338 # and recurse 339 remaining:num, optional-input-found?:bool <- next-input 340 { 341 break-if optional-input-found? 342 # unlimited recursion 343 buf <- to-buffer <a href='065duplex_list.mu.html#L31'>next</a>, buf 344 return 345 } 346 { 347 break-unless remaining 348 # limited recursion 349 remaining <- subtract remaining, 1 350 buf <- to-buffer <a href='065duplex_list.mu.html#L31'>next</a>, buf, remaining 351 return 352 } 353 # past recursion depth; insert ellipses and stop 354 append buf, [...] 355 ] 356 357 scenario stash-empty-list [ 358 local-scope 359 x:&:<a href='064list.mu.html#L6'>list</a>:num <- copy null 360 run [ 361 stash x 362 ] 363 trace-should-contain [ 364 app: [] 365 ] 366 ] </pre> </body> </html>