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

	Commit message (Expand)	Author	Age	Files	Lines
*	951 - done with break/loop	Kartik K. Agaram	2015-03-18	1	-0/+168

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 4LineNr { color: #444444; } .muData { color: #ffff00; } .Delimiter { color: #800080; } .Comment { color: #9090ff; } .Comment a { color:#0000ee; text-decoration:underline; } .Constant { color: #00a0a0; } .Special { color: #c00000; } .muControl { color: #c0a020; } .muRecipe { color: #ff8700; } --> </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <pre id='vimCodeElement'> 1 # A table is like an array, except that you can index it with arbitrary types 2 # and not just non-negative whole numbers. 3 4 # incomplete; doesn't handle hash conflicts 5 6 scenario table-read-write [ 7 local-scope 8 tab:&:<a href='070table.mu.html#L44'>table</a>:num:num <- <a href='070table.mu.html#L56'>new-table</a> 30 9 run [ 10 ¦ put-index tab, 12, 34 11 ¦ 60:num/raw, 61:bool/raw <- index tab, 12 12 ] 13 memory-should-contain [ 14 ¦ 60 <- 34 15 ¦ 61 <- 1 # found 16 ] 17 ] 18 19 scenario table-read-write-non-integer [ 20 local-scope 21 tab:&:<a href='070table.mu.html#L44'>table</a>:text:num <- <a href='070table.mu.html#L56'>new-table</a> 30 22 run [ 23 ¦ put-index tab, [abc def], 34 24 ¦ 1:num/raw, 2:bool/raw <- index tab, [abc def] 25 ] 26 memory-should-contain [ 27 ¦ 1 <- 34 28 ¦ 2 <- 1 # found 29 ] 30 ] 31 32 scenario table-read-not-found [ 33 local-scope 34 tab:&:<a href='070table.mu.html#L44'>table</a>:text:num <- <a href='070table.mu.html#L56'>new-table</a> 30 35 run [ 36 ¦ 1:num/raw, 2:bool/raw <- index tab, [abc def] 37 ] 38 memory-should-contain [ 39 ¦ 1 <- 0 40 ¦ 2 <- 0 # not found 41 ] 42 ] 43 44 container <a href='070table.mu.html#L44'>table</a>:_key:_value [ 45 length:num 46 <a href='075channel.mu.html#L399'>capacity</a>:num 47 data:&:@:<a href='070table.mu.html#L50'>table-row</a>:_key:_value 48 ] 49 50 container <a href='070table.mu.html#L50'>table-row</a>:_key:_value [ 51 occupied?:bool 52 key:_key 53 value:_value 54 ] 55 56 def <a href='070table.mu.html#L56'>new-table</a> <a href='075channel.mu.html#L399'>capacity</a>:num -> result:&:<a href='070table.mu.html#L44'>table</a>:_key:_value [ 57 local-scope 58 load-inputs 59 result <- new {(table _key _value): type} 60 data:&:@:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- new {(table-row _key _value): type}, <a href='075channel.mu.html#L399'>capacity</a> 61 *result <- merge 0/length, <a href='075channel.mu.html#L399'>capacity</a>, data 62 ] 63 64 # todo: tag results as /required so that call-sites are forbidden from ignoring them 65 # then we could handle conflicts simply by resizing the table 66 def put-index <a href='070table.mu.html#L44'>table</a>:&:<a href='070table.mu.html#L44'>table</a>:_key:_value, key:_key, value:_value -> <a href='070table.mu.html#L44'>table</a>:&:<a href='070table.mu.html#L44'>table</a>:_key:_value [ 67 local-scope 68 load-inputs 69 hash:num <- hash key 70 hash <- <a href='070table.mu.html#L103'>abs</a> hash 71 <a href='075channel.mu.html#L399'>capacity</a>:num <- get *table, <a href='075channel.mu.html#L399'>capacity</a>:offset 72 _, hash-key:num <- divide-with-remainder hash, <a href='075channel.mu.html#L399'>capacity</a> 73 hash-key <- <a href='070table.mu.html#L103'>abs</a> hash-key # in case hash overflows from a double into a negative integer inside 'divide-with-remainder' above 74 table-data:&:@:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- get *table, data:offset 75 x:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- index *table-data, hash-key 76 occupied?:bool <- get x, occupied?:offset 77 not-occupied?:bool <- not occupied?:bool 78 assert not-occupied?, [can't handle collisions yet] 79 new-row:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- merge 1/true, key, value 80 *table-data <- put-index *table-data, hash-key, new-row 81 ] 82 83 def index <a href='070table.mu.html#L44'>table</a>:&:<a href='070table.mu.html#L44'>table</a>:_key:_value, key:_key -> result:_value, found?:bool [ 84 local-scope 85 load-inputs 86 hash:num <- hash key 87 hash <- <a href='070table.mu.html#L103'>abs</a> hash 88 <a href='075channel.mu.html#L399'>capacity</a>:num <- get *table, <a href='075channel.mu.html#L399'>capacity</a>:offset 89 _, hash-key:num <- divide-with-remainder hash, <a href='075channel.mu.html#L399'>capacity</a> 90 hash-key <- <a href='070table.mu.html#L103'>abs</a> hash-key # in case hash overflows from a double into a negative integer inside 'divide-with-remainder' above 91 table-data:&:@:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- get *table, data:offset 92 x:<a href='070table.mu.html#L50'>table-row</a>:_key:_value <- index *table-data, hash-key 93 empty:&:_value <- new _value:type 94 result <- copy *empty 95 found?:bool <- get x, occupied?:offset 96 return-unless found? 97 key2:_key <- get x, key:offset 98 found?:bool <- equal key, key2 99 return-unless found? 100 result <- get x, value:offset 101 ] 102 103 def <a href='070table.mu.html#L103'>abs</a> n:num -> result:num [ 104 local-scope 105 load-inputs 106 positive?:bool <- greater-or-equal n, 0 107 return-if positive?, n 108 result <- multiply n, -1 109 ] </pre> </body> </html>