ranger - mirror of ranger - a simple, vim-like file manager

	Commit message (Collapse)	Author	Age	Files	Lines
*	fixed tc_displayable	hut	2009-12-31	1	-9/+11
\|
*	added documentation, clean up	hut	2009-12-31	1	-6/+6
\|
*	updated test	hut	2009-12-29	1	-2/+2
\|
*	updated / added tests	hut	2009-12-13	1	-0/+122

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <title>Mu - 065duplex_list.mu</title> <meta name="Generator" content="Vim/8.0"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="none"> <meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy="> <meta name="colorscheme" content="minimal-light"> <style type="text/css">  </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <a href='https://github.com/akkartik/mu/blob/master/065duplex_list.mu'>https://github.com/akkartik/mu/blob/master/065duplex_list.mu</a> <pre id='vimCodeElement'> 1 # A doubly linked list permits bidirectional traversal. 2 3 container <a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 4 value:_elem 5 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem 6 <a href='065duplex_list.mu.html#L38'>prev</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem 7 ] 8 9 def push x:_elem, in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:result -> result:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 10 local-scope 11 load-inputs 12 result:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- new {(duplex-list _elem): type} 13 *result <- merge x, in, null 14 return-unless in 15 put *in, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, result 16 ] 17 18 def first in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:_elem [ 19 local-scope 20 load-inputs 21 { 22 break-if in 23 zero:&:_elem <- new _elem:type 24 zero-result:_elem <- copy *zero 25 abandon zero 26 return zero-result 27 } 28 result <- get *in, value:offset 29 ] 30 31 def <a href='065duplex_list.mu.html#L31'>next</a> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in [ 32 local-scope 33 load-inputs 34 return-unless in, null 35 result <- get *in, <a href='065duplex_list.mu.html#L31'>next</a>:offset 36 ] 37 38 def <a href='065duplex_list.mu.html#L38'>prev</a> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in [ 39 local-scope 40 load-inputs 41 return-unless in, null 42 result <- get *in, <a href='065duplex_list.mu.html#L38'>prev</a>:offset 43 return result 44 ] 45 46 scenario duplex-list-handling [ 47 run [ 48 local-scope 49 # reserve locations 0-9 to check for missing null check 50 10:num/raw <- copy 34 51 11:num/raw <- copy 35 52 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 53 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 54 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 55 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- copy <a href='064list.mu.html#L6'>list</a> 56 20:num/raw <- first list2 57 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 58 21:num/raw <- first list2 59 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 60 22:num/raw <- first list2 61 30:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> list2 62 31:num/raw <- first 30:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw 63 32:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> 30:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw 64 33:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L38'>prev</a> 30:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw 65 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 66 40:num/raw <- first list2 67 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 68 41:num/raw <- first list2 69 50:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 70 ] 71 memory-should-contain [ 72 0 <- 0 # no modifications to null pointers 73 10 <- 34 74 11 <- 35 75 20 <- 5 # scanning next 76 21 <- 4 77 22 <- 3 78 30 <- 0 # null 79 31 <- 0 # first of null 80 32 <- 0 # next of null 81 33 <- 0 # prev of null 82 40 <- 4 # then start scanning prev 83 41 <- 5 84 50 <- 1 # list back at start 85 ] 86 ] 87 88 def length l:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:num [ 89 local-scope 90 load-inputs 91 result <- copy 0 92 { 93 break-unless l 94 result <- add result, 1 95 l <- <a href='065duplex_list.mu.html#L31'>next</a> l 96 loop 97 } 98 ] 99 100 # insert 'x' after 'in' 101 def insert x:_elem, in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 102 local-scope 103 load-inputs 104 new-node:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- new {(duplex-list _elem): type} 105 *new-node <- put *new-node, value:offset, x 106 # save old next before changing it 107 next-node:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- get *in, <a href='065duplex_list.mu.html#L31'>next</a>:offset 108 *in <- put *in, <a href='065duplex_list.mu.html#L31'>next</a>:offset, new-node 109 *new-node <- put *new-node, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, in 110 *new-node <- put *new-node, <a href='065duplex_list.mu.html#L31'>next</a>:offset, next-node 111 return-unless next-node 112 *next-node <- put *next-node, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, new-node 113 ] 114 115 scenario inserting-into-duplex-list [ 116 local-scope 117 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 118 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 119 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 120 run [ 121 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> # inside list 122 list2 <- insert 6, list2 123 # check structure like before 124 list2 <- copy <a href='064list.mu.html#L6'>list</a> 125 10:num/raw <- first list2 126 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 127 11:num/raw <- first list2 128 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 129 12:num/raw <- first list2 130 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 131 13:num/raw <- first list2 132 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 133 20:num/raw <- first list2 134 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 135 21:num/raw <- first list2 136 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 137 22:num/raw <- first list2 138 30:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 139 ] 140 memory-should-contain [ 141 10 <- 5 # scanning next 142 11 <- 4 143 12 <- 6 # inserted element 144 13 <- 3 145 20 <- 6 # then prev 146 21 <- 4 147 22 <- 5 148 30 <- 1 # list back at start 149 ] 150 ] 151 152 scenario inserting-at-end-of-duplex-list [ 153 local-scope 154 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 155 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 156 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 157 run [ 158 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> # inside list 159 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 # now at end of list 160 list2 <- insert 6, list2 161 # check structure like before 162 list2 <- copy <a href='064list.mu.html#L6'>list</a> 163 10:num/raw <- first list2 164 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 165 11:num/raw <- first list2 166 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 167 12:num/raw <- first list2 168 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 169 13:num/raw <- first list2 170 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 171 20:num/raw <- first list2 172 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 173 21:num/raw <- first list2 174 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 175 22:num/raw <- first list2 176 30:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 177 ] 178 memory-should-contain [ 179 10 <- 5 # scanning next 180 11 <- 4 181 12 <- 3 182 13 <- 6 # inserted element 183 20 <- 3 # then prev 184 21 <- 4 185 22 <- 5 186 30 <- 1 # list back at start 187 ] 188 ] 189 190 scenario inserting-after-start-of-duplex-list [ 191 local-scope 192 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 193 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 194 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 195 run [ 196 <a href='064list.mu.html#L6'>list</a> <- insert 6, <a href='064list.mu.html#L6'>list</a> 197 # check structure like before 198 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- copy <a href='064list.mu.html#L6'>list</a> 199 10:num/raw <- first list2 200 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 201 11:num/raw <- first list2 202 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 203 12:num/raw <- first list2 204 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 205 13:num/raw <- first list2 206 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 207 20:num/raw <- first list2 208 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 209 21:num/raw <- first list2 210 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 211 22:num/raw <- first list2 212 30:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 213 ] 214 memory-should-contain [ 215 10 <- 5 # scanning next 216 11 <- 6 # inserted element 217 12 <- 4 218 13 <- 3 219 20 <- 4 # then prev 220 21 <- 6 221 22 <- 5 222 30 <- 1 # list back at start 223 ] 224 ] 225 226 # remove 'x' from its surrounding list 'in' 227 # 228 # Returns null if and only if list is empty. Beware: in that case any other 229 # pointers to the head are now invalid. 230 def remove x:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in, in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 231 local-scope 232 load-inputs 233 # if 'x' is null, return 234 return-unless x 235 next-node:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- get *x, <a href='065duplex_list.mu.html#L31'>next</a>:offset 236 prev-node:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- get *x, <a href='065duplex_list.mu.html#L38'>prev</a>:offset 237 # null x's pointers 238 *x <- put *x, <a href='065duplex_list.mu.html#L31'>next</a>:offset, null 239 *x <- put *x, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, null 240 # if next-node is not null, set its prev pointer 241 { 242 break-unless next-node 243 *next-node <- put *next-node, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, prev-node 244 } 245 # if prev-node is not null, set its next pointer and return 246 { 247 break-unless prev-node 248 *prev-node <- put *prev-node, <a href='065duplex_list.mu.html#L31'>next</a>:offset, next-node 249 return 250 } 251 # if prev-node is null, then we removed the head node at 'in' 252 # return the new head rather than the old 'in' 253 return next-node 254 ] 255 256 scenario removing-from-duplex-list [ 257 local-scope 258 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 259 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 260 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 261 run [ 262 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> # second element 263 <a href='064list.mu.html#L6'>list</a> <- remove list2, <a href='064list.mu.html#L6'>list</a> 264 10:bool/raw <- equal list2, null 265 # check structure like before 266 list2 <- copy <a href='064list.mu.html#L6'>list</a> 267 11:num/raw <- first list2 268 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 269 12:num/raw <- first list2 270 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> list2 271 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 272 30:num/raw <- first list2 273 40:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 274 ] 275 memory-should-contain [ 276 10 <- 0 # remove returned non-null 277 11 <- 5 # scanning next, skipping deleted element 278 12 <- 3 279 20 <- 0 # no more elements 280 30 <- 5 # prev of final element 281 40 <- 1 # list back at start 282 ] 283 ] 284 285 scenario removing-from-start-of-duplex-list [ 286 local-scope 287 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 288 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 289 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 290 run [ 291 <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> 292 # check structure like before 293 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- copy <a href='064list.mu.html#L6'>list</a> 294 10:num/raw <- first list2 295 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 296 11:num/raw <- first list2 297 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> list2 298 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 299 30:num/raw <- first list2 300 40:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 301 ] 302 memory-should-contain [ 303 10 <- 4 # scanning next, skipping deleted element 304 11 <- 3 305 20 <- 0 # no more elements 306 30 <- 4 # prev of final element 307 40 <- 1 # list back at start 308 ] 309 ] 310 311 scenario removing-from-end-of-duplex-list [ 312 local-scope 313 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 314 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 315 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 316 run [ 317 # delete last element 318 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 319 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 320 <a href='064list.mu.html#L6'>list</a> <- remove list2, <a href='064list.mu.html#L6'>list</a> 321 10:bool/raw <- equal list2, null 322 # check structure like before 323 list2 <- copy <a href='064list.mu.html#L6'>list</a> 324 11:num/raw <- first list2 325 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 326 12:num/raw <- first list2 327 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> list2 328 list2 <- <a href='065duplex_list.mu.html#L38'>prev</a> list2 329 30:num/raw <- first list2 330 40:bool/raw <- equal <a href='064list.mu.html#L6'>list</a>, list2 331 ] 332 memory-should-contain [ 333 10 <- 0 # remove returned non-null 334 11 <- 5 # scanning next, skipping deleted element 335 12 <- 4 336 20 <- 0 # no more elements 337 30 <- 5 # prev of final element 338 40 <- 1 # list back at start 339 ] 340 ] 341 342 scenario removing-from-singleton-duplex-list [ 343 local-scope 344 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 345 run [ 346 <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> 347 1:num/raw <- deaddress <a href='064list.mu.html#L6'>list</a> 348 ] 349 memory-should-contain [ 350 1 <- 0 # back to an empty list 351 ] 352 ] 353 354 def remove x:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in, n:num, in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 355 local-scope 356 load-inputs 357 i:num <- copy 0 358 curr:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- copy x 359 { 360 done?:bool <- greater-or-equal i, n 361 break-if done? 362 break-unless curr 363 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L31'>next</a> curr 364 in <- remove curr, in 365 curr <- copy <a href='065duplex_list.mu.html#L31'>next</a> 366 i <- add i, 1 367 loop 368 } 369 ] 370 371 scenario removing-multiple-from-duplex-list [ 372 local-scope 373 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 3, null 374 <a href='064list.mu.html#L6'>list</a> <- push 4, <a href='064list.mu.html#L6'>list</a> 375 <a href='064list.mu.html#L6'>list</a> <- push 5, <a href='064list.mu.html#L6'>list</a> 376 run [ 377 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> # second element 378 <a href='064list.mu.html#L6'>list</a> <- remove list2, 2, <a href='064list.mu.html#L6'>list</a> 379 stash <a href='064list.mu.html#L6'>list</a> 380 ] 381 trace-should-contain [ 382 app: 5 383 ] 384 ] 385 386 # remove values between 'start' and 'end' (both exclusive). 387 # also clear pointers back out from start/end for hygiene. 388 # set end to 0 to delete everything past start. 389 # can't set start to 0 to delete everything before end, because there's no 390 # clean way to return the new head pointer. 391 def <a href='065duplex_list.mu.html#L391'>remove-between</a> start:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, end:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:start -> start:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 392 local-scope 393 load-inputs 394 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- get *start, <a href='065duplex_list.mu.html#L31'>next</a>:offset 395 nothing-to-delete?:bool <- equal <a href='065duplex_list.mu.html#L31'>next</a>, end 396 return-if nothing-to-delete? 397 assert <a href='065duplex_list.mu.html#L31'>next</a>, [malformed duplex list] 398 # start->next->prev = 0 399 # start->next = end 400 *next <- put *next, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, null 401 *start <- put *start, <a href='065duplex_list.mu.html#L31'>next</a>:offset, end 402 { 403 break-if end 404 stash [spliced:] <a href='065duplex_list.mu.html#L31'>next</a> 405 return 406 } 407 # end->prev->next = 0 408 # end->prev = start 409 <a href='065duplex_list.mu.html#L38'>prev</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- get *end, <a href='065duplex_list.mu.html#L38'>prev</a>:offset 410 assert <a href='065duplex_list.mu.html#L38'>prev</a>, [malformed duplex <a href='064list.mu.html#L6'>list</a> - 2] 411 *prev <- put *prev, <a href='065duplex_list.mu.html#L31'>next</a>:offset, null 412 stash [spliced:] <a href='065duplex_list.mu.html#L31'>next</a> 413 *end <- put *end, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, start 414 ] 415 416 scenario remove-range [ 417 # construct a duplex list with six elements [13, 14, 15, 16, 17, 18] 418 local-scope 419 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 18, null 420 <a href='064list.mu.html#L6'>list</a> <- push 17, <a href='064list.mu.html#L6'>list</a> 421 <a href='064list.mu.html#L6'>list</a> <- push 16, <a href='064list.mu.html#L6'>list</a> 422 <a href='064list.mu.html#L6'>list</a> <- push 15, <a href='064list.mu.html#L6'>list</a> 423 <a href='064list.mu.html#L6'>list</a> <- push 14, <a href='064list.mu.html#L6'>list</a> 424 <a href='064list.mu.html#L6'>list</a> <- push 13, <a href='064list.mu.html#L6'>list</a> 425 run [ 426 # delete 16 onwards 427 # first pointer: to the third element 428 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 429 list2 <- <a href='065duplex_list.mu.html#L31'>next</a> list2 430 list2 <- <a href='065duplex_list.mu.html#L391'>remove-between</a> list2, null 431 # now check the list 432 10:num/raw <- get *list, value:offset 433 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 434 11:num/raw <- get *list, value:offset 435 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 436 12:num/raw <- get *list, value:offset 437 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 438 ] 439 memory-should-contain [ 440 10 <- 13 441 11 <- 14 442 12 <- 15 443 20 <- 0 444 ] 445 trace-should-contain [ 446 app: spliced: 16 <-> 17 <-> 18 447 ] 448 ] 449 450 scenario remove-range-to-final [ 451 local-scope 452 # construct a duplex list with six elements [13, 14, 15, 16, 17, 18] 453 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 18, null 454 <a href='064list.mu.html#L6'>list</a> <- push 17, <a href='064list.mu.html#L6'>list</a> 455 <a href='064list.mu.html#L6'>list</a> <- push 16, <a href='064list.mu.html#L6'>list</a> 456 <a href='064list.mu.html#L6'>list</a> <- push 15, <a href='064list.mu.html#L6'>list</a> 457 <a href='064list.mu.html#L6'>list</a> <- push 14, <a href='064list.mu.html#L6'>list</a> 458 <a href='064list.mu.html#L6'>list</a> <- push 13, <a href='064list.mu.html#L6'>list</a> 459 run [ 460 # delete 15, 16 and 17 461 # start pointer: to the second element 462 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 463 # end pointer: to the last (sixth) element 464 end:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> list2 465 end <- <a href='065duplex_list.mu.html#L31'>next</a> end 466 end <- <a href='065duplex_list.mu.html#L31'>next</a> end 467 end <- <a href='065duplex_list.mu.html#L31'>next</a> end 468 <a href='065duplex_list.mu.html#L391'>remove-between</a> list2, end 469 # now check the list 470 10:num/raw <- get *list, value:offset 471 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 472 11:num/raw <- get *list, value:offset 473 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 474 12:num/raw <- get *list, value:offset 475 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 476 ] 477 memory-should-contain [ 478 10 <- 13 479 11 <- 14 480 12 <- 18 481 20 <- 0 # no more elements 482 ] 483 trace-should-contain [ 484 app: spliced: 15 <-> 16 <-> 17 485 ] 486 ] 487 488 scenario remove-range-to-penultimate [ 489 local-scope 490 # construct a duplex list with six elements [13, 14, 15, 16, 17, 18] 491 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 18, null 492 <a href='064list.mu.html#L6'>list</a> <- push 17, <a href='064list.mu.html#L6'>list</a> 493 <a href='064list.mu.html#L6'>list</a> <- push 16, <a href='064list.mu.html#L6'>list</a> 494 <a href='064list.mu.html#L6'>list</a> <- push 15, <a href='064list.mu.html#L6'>list</a> 495 <a href='064list.mu.html#L6'>list</a> <- push 14, <a href='064list.mu.html#L6'>list</a> 496 <a href='064list.mu.html#L6'>list</a> <- push 13, <a href='064list.mu.html#L6'>list</a> 497 run [ 498 # delete 15 and 16 499 # start pointer: to the second element 500 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 501 # end pointer: to the last (sixth) element 502 end:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> list2 503 end <- <a href='065duplex_list.mu.html#L31'>next</a> end 504 end <- <a href='065duplex_list.mu.html#L31'>next</a> end 505 <a href='065duplex_list.mu.html#L391'>remove-between</a> list2, end 506 # now check the list 507 10:num/raw <- get *list, value:offset 508 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 509 11:num/raw <- get *list, value:offset 510 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 511 12:num/raw <- get *list, value:offset 512 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 513 13:num/raw <- get *list, value:offset 514 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 515 ] 516 memory-should-contain [ 517 10 <- 13 518 11 <- 14 519 12 <- 17 520 13 <- 18 521 20 <- 0 # no more elements 522 ] 523 trace-should-contain [ 524 app: spliced: 15 <-> 16 525 ] 526 ] 527 528 scenario remove-range-empty [ 529 local-scope 530 # construct a duplex list with three elements [13, 14, 15] 531 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 15, null 532 <a href='064list.mu.html#L6'>list</a> <- push 14, <a href='064list.mu.html#L6'>list</a> 533 <a href='064list.mu.html#L6'>list</a> <- push 13, <a href='064list.mu.html#L6'>list</a> 534 run [ 535 # delete between first and second element (i.e. nothing) 536 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 537 <a href='065duplex_list.mu.html#L391'>remove-between</a> <a href='064list.mu.html#L6'>list</a>, list2 538 # now check the list 539 10:num/raw <- get *list, value:offset 540 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 541 11:num/raw <- get *list, value:offset 542 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 543 12:num/raw <- get *list, value:offset 544 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 545 ] 546 # no change 547 memory-should-contain [ 548 10 <- 13 549 11 <- 14 550 12 <- 15 551 20 <- 0 552 ] 553 ] 554 555 scenario remove-range-to-end [ 556 local-scope 557 # construct a duplex list with six elements [13, 14, 15, 16, 17, 18] 558 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 18, null 559 <a href='064list.mu.html#L6'>list</a> <- push 17, <a href='064list.mu.html#L6'>list</a> 560 <a href='064list.mu.html#L6'>list</a> <- push 16, <a href='064list.mu.html#L6'>list</a> 561 <a href='064list.mu.html#L6'>list</a> <- push 15, <a href='064list.mu.html#L6'>list</a> 562 <a href='064list.mu.html#L6'>list</a> <- push 14, <a href='064list.mu.html#L6'>list</a> 563 <a href='064list.mu.html#L6'>list</a> <- push 13, <a href='064list.mu.html#L6'>list</a> 564 run [ 565 # remove the third element and beyond 566 list2:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 567 <a href='065duplex_list.mu.html#L391'>remove-between</a> list2, null 568 # now check the list 569 10:num/raw <- get *list, value:offset 570 <a href='064list.mu.html#L6'>list</a> <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 571 11:num/raw <- get *list, value:offset 572 20:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num/raw <- <a href='065duplex_list.mu.html#L31'>next</a> <a href='064list.mu.html#L6'>list</a> 573 ] 574 memory-should-contain [ 575 10 <- 13 576 11 <- 14 577 20 <- 0 578 ] 579 ] 580 581 # insert list beginning at 'start' after 'in' 582 def <a href='065duplex_list.mu.html#L582'>splice</a> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, start:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 583 local-scope 584 load-inputs 585 return-unless in 586 return-unless start 587 end:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L629'>last</a> start 588 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L31'>next</a> in 589 { 590 break-unless <a href='065duplex_list.mu.html#L31'>next</a> 591 *end <- put *end, <a href='065duplex_list.mu.html#L31'>next</a>:offset, <a href='065duplex_list.mu.html#L31'>next</a> 592 *next <- put *next, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, end 593 } 594 *in <- put *in, <a href='065duplex_list.mu.html#L31'>next</a>:offset, start 595 *start <- put *start, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, in 596 ] 597 598 # insert contents of 'new' after 'in' 599 def insert in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, new:&:@:_elem -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 600 local-scope 601 load-inputs 602 return-unless in 603 return-unless new 604 len:num <- length *new 605 return-unless len 606 curr:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- copy in 607 idx:num <- copy 0 608 { 609 done?:bool <- greater-or-equal idx, len 610 break-if done? 611 c:_elem <- index *new, idx 612 insert c, curr 613 # next iter 614 curr <- <a href='065duplex_list.mu.html#L31'>next</a> curr 615 idx <- add idx, 1 616 loop 617 } 618 ] 619 620 def append in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, new:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem/contained-in:in -> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 621 local-scope 622 load-inputs 623 <a href='065duplex_list.mu.html#L629'>last</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L629'>last</a> in 624 *last <- put *last, <a href='065duplex_list.mu.html#L31'>next</a>:offset, new 625 return-unless new 626 *new <- put *new, <a href='065duplex_list.mu.html#L38'>prev</a>:offset, <a href='065duplex_list.mu.html#L629'>last</a> 627 ] 628 629 def <a href='065duplex_list.mu.html#L629'>last</a> in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 630 local-scope 631 load-inputs 632 result <- copy in 633 { 634 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L31'>next</a> result 635 break-unless <a href='065duplex_list.mu.html#L31'>next</a> 636 result <- copy <a href='065duplex_list.mu.html#L31'>next</a> 637 loop 638 } 639 ] 640 641 # does a duplex list start with a certain sequence of elements? 642 def <a href='065duplex_list.mu.html#L642'>match</a> x:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, y:&:@:_elem -> result:bool [ 643 local-scope 644 load-inputs 645 i:num <- copy 0 646 max:num <- length *y 647 { 648 done?:bool <- greater-or-equal i, max 649 break-if done? 650 expected:_elem <- index *y, i 651 return-unless x, false/no-match 652 curr:_elem <- first x 653 curr-matches?:bool <- equal curr, expected 654 return-unless curr-matches?, false/no-match 655 x <- <a href='065duplex_list.mu.html#L31'>next</a> x 656 i <- add i, 1 657 loop 658 } 659 return true/successful-match 660 ] 661 662 scenario duplex-list-match [ 663 local-scope 664 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:char <- push 97/a, null 665 <a href='064list.mu.html#L6'>list</a> <- push 98/b, <a href='064list.mu.html#L6'>list</a> 666 <a href='064list.mu.html#L6'>list</a> <- push 99/c, <a href='064list.mu.html#L6'>list</a> 667 <a href='064list.mu.html#L6'>list</a> <- push 100/d, <a href='064list.mu.html#L6'>list</a> 668 run [ 669 10:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [] 670 11:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [d] 671 12:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [dc] 672 13:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [dcba] 673 14:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [dd] 674 15:bool/raw <- <a href='065duplex_list.mu.html#L642'>match</a> <a href='064list.mu.html#L6'>list</a>, [dcbax] 675 ] 676 memory-should-contain [ 677 10 <- 1 # matches [] 678 11 <- 1 # matches [d] 679 12 <- 1 # matches [dc] 680 13 <- 1 # matches [dcba] 681 14 <- 0 # does not match [dd] 682 15 <- 0 # does not match [dcbax] 683 ] 684 ] 685 686 # helper for debugging 687 def <a href='065duplex_list.mu.html#L687'>dump-from</a> x:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem [ 688 local-scope 689 load-inputs 690 $print x, [: ] 691 { 692 break-unless x 693 c:_elem <- get *x, value:offset 694 $print c, [ ] 695 x <- <a href='065duplex_list.mu.html#L31'>next</a> x 696 { 697 is-newline?:bool <- equal c, 10/newline 698 break-unless is-newline? 699 $print 10/newline 700 $print x, [: ] 701 } 702 loop 703 } 704 $print 10/newline, [---], 10/newline 705 ] 706 707 scenario stash-duplex-list [ 708 local-scope 709 <a href='064list.mu.html#L6'>list</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- push 1, null 710 <a href='064list.mu.html#L6'>list</a> <- push 2, <a href='064list.mu.html#L6'>list</a> 711 <a href='064list.mu.html#L6'>list</a> <- push 3, <a href='064list.mu.html#L6'>list</a> 712 run [ 713 stash [list:], <a href='064list.mu.html#L6'>list</a> 714 ] 715 trace-should-contain [ 716 app: <a href='064list.mu.html#L6'>list</a>: 3 <-> 2 <-> 1 717 ] 718 ] 719 720 def to-text in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:text [ 721 local-scope 722 load-inputs 723 buf:&:<a href='061text.mu.html#L120'>buffer</a>:char <- <a href='061text.mu.html#L125'>new-buffer</a> 80 724 buf <- to-buffer in, buf 725 result <- <a href='061text.mu.html#L338'>buffer-to-array</a> buf 726 ] 727 728 # variant of 'to-text' which stops printing after a few elements (and so is robust to cycles) 729 def to-text-line in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem -> result:text [ 730 local-scope 731 load-inputs 732 buf:&:<a href='061text.mu.html#L120'>buffer</a>:char <- <a href='061text.mu.html#L125'>new-buffer</a> 80 733 buf <- to-buffer in, buf, 6 # max elements to display 734 result <- <a href='061text.mu.html#L338'>buffer-to-array</a> buf 735 ] 736 737 def to-buffer in:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem, buf:&:<a href='061text.mu.html#L120'>buffer</a>:char -> buf:&:<a href='061text.mu.html#L120'>buffer</a>:char [ 738 local-scope 739 load-inputs 740 { 741 break-if in 742 buf <- append buf, [[]] 743 return 744 } 745 # append in.value to buf 746 val:_elem <- get *in, value:offset 747 buf <- append buf, val 748 # now prepare next 749 <a href='065duplex_list.mu.html#L31'>next</a>:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:_elem <- <a href='065duplex_list.mu.html#L31'>next</a> in 750 nextn:num <- deaddress <a href='065duplex_list.mu.html#L31'>next</a> 751 return-unless <a href='065duplex_list.mu.html#L31'>next</a> 752 buf <- append buf, [ <-> ] 753 # and recurse 754 remaining:num, optional-input-found?:bool <- next-input 755 { 756 break-if optional-input-found? 757 # unlimited recursion 758 buf <- to-buffer <a href='065duplex_list.mu.html#L31'>next</a>, buf 759 return 760 } 761 { 762 break-unless remaining 763 # limited recursion 764 remaining <- subtract remaining, 1 765 buf <- to-buffer <a href='065duplex_list.mu.html#L31'>next</a>, buf, remaining 766 return 767 } 768 # past recursion depth; insert ellipses and stop 769 append buf, [...] 770 ] 771 772 scenario stash-empty-duplex-list [ 773 local-scope 774 x:&:<a href='065duplex_list.mu.html#L3'>duplex-list</a>:num <- copy null 775 run [ 776 stash x 777 ] 778 trace-should-contain [ 779 app: [] 780 ] 781 ] </pre> </body> </html>