1 # A list links up multiple objects together to make them easier to manage.
  2 #
  3 # The objects must be of the same type. If you want to store multiple types in
  4 # a single list, use an exclusive-container.
  5 
  6 container list:_elem [
  7   value:_elem
  8   next:&:list:_elem
  9 ]
 10 
 11 def push x:_elem, l:&:list:_elem -> result:&:list:_elem/contained-in:l [
 12   local-scope
 13   load-ingredients
 14   result <- new {(list _elem): type}
 15   *result <- merge x, l
 16 ]
 17 
 18 def first in:&:list:_elem -> result:_elem [
 19   local-scope
 20   load-ingredients
 21   result <- get *in, value:offset
 22 ]
 23 
 24 def rest in:&:list:_elem -> result:&:list:_elem/contained-in:in [
 25   local-scope
 26   load-ingredients
 27   result <- get *in, next:offset
 28 ]
 29 
 30 scenario list-handling [
 31   run [
 32   ¦ local-scope
 33   ¦ x:&:list:num <- push 3, 
<html>
	<head>
		<title>dwm - dynamic window manager</title>
		<meta name="author" content="Anselm R. Garbe">
		<meta name="generator" content="ed">
		<meta name="copyright" content="(C)opyright 2006 by Anselm R. Garbe">
		<style type="text/css">
			body {
				color: #000000;
				font-family: sans-serif;
			}
		</style>
	</head>
	<body>
		<center>
			<img src="logo.png"/><br />
			<h3>dynamic window manager</h3>
		<center>
		<h2>Description</h3>
		<p>
		dwm is a dynamic window manager for X11.
		</p>
		<h2>Differences to wmii</h2	
		<p>
		In contrast to wmii, dwm is only a window manager, and nothing else.
		Hence, it is much smaller, faster and simpler. dwm does
		<b>not</b> include following features wmii provides:
		</p>
		<ul>
			<li>9P support</li>
			<li>status bar</li>
			<li>menu</li>
			<li>editable tagbars</li>
			<li>shell-based config/control file</li>
			<li>small tools (selection printer, mouse warper)</li>
		</ul>
		<p>
		dwm is only a single binary, it's source code is intended to never
		exceed 2000 SLOC.
		</p>
		<p>
		dwm is customized through editing its source code, that makes it
		extremely fast and secure - it does not process any input data which
		hasn't been known at compile time, except window title names.
		</p>
		<p>
		dwm is based on tagging and dynamic window management (however simpler
		than wmii or larswm).
		</p>
		<p>
		dwm don't distinguishes between layers, there is no floating or managed
		layer. Wether the clients of currently selected tag are managed or not
		managed, you can re-arrange all clients on the fly. Popup- and
		fixed-size windows are treated unmanaged. 
		</p>
		<p>
		dwm uses 1-pixel borders to provide the maximum of screen real
		estate to clients. Small titlebars are only drawn in front of unfocused
		clients.
		</p>
		<p>
		garbeam <b>don't</b> wants any feedback to dwm. If you ask for support,
		feature requests or if you report bugs, they will be <b>ignored</b>
		with a high chance. dwm is only intended to fit garbeam's needs,
		however you are free to download and distribute/relicense it, with the
		conditions of the <a href="http://wmii.de/cgi-bin/hgwebdir.cgi/dwm?f=f10eb1139362;file=LICENSE;style=raw">MIT/X Consortium license</a>.
		</p>
		<h2>Development</h2>
		<p>
		dwm is actively developed in parallel to wmii. You can <a href="http://wmii.de/cgi-bin/hgwebdir.cgi/dwm">browse</a> its source code repository or get a copy using <a href="http://www.selenic.com/mercurial/">Mercurial</a> with following command:
		</p>
		<p>
		<em>hg clone http://wmii.de/cgi-bin/hgwebdir.cgi/dwm</em>
		</p>
		<p>--Anselm</p>
	</body>
</html>
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2025-07-22 13:34:12 +0000
='064list.mu.html#L24'>rest 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:&:list:_elem/contained-in:in, in:&:list:_elem -> in:&:list:_elem [ 157 local-scope 158 load-ingredients 159 # if 'x' is null, return 160 return-unless x 161 next-node:&:list:_elem <- rest x 162 # clear next pointer of 'x' 163 *x <- put *x, next:offset, 0 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:&:list:_elem <- copy in 169 curr:&:list:_elem <- rest prev-node 170 { 171 ¦ return-unless curr 172 ¦ found?:bool <- equal curr, x 173 ¦ break-if found? 174 ¦ prev-node <- copy curr 175 ¦ curr <- rest curr 176 } 177 # set its next pointer to skip 'x' 178 *prev-node <- put *prev-node, next:offset, next-node 179 ] 180 181 scenario removing-from-list [ 182 local-scope 183 list:&:list:num <- push 3, 0 184 list <- push 4, list 185 list <- push 5, list 186 run [ 187 ¦ list2:&:list:num <- rest list # second element 188 ¦ list <- remove list2, list 189 ¦ 10:bool/raw <- equal list2, 0 190 ¦ # check structure like before 191 ¦ list2 <- copy list 192 ¦ 11:num/raw <- first list2 193 ¦ list2 <- rest list2 194 ¦ 12:num/raw <- first list2 195 ¦ 20:&:list:num/raw <- rest 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 list:&:list:num <- push 3, 0 208 list <- push 4, list 209 list <- push 5, list 210 run [ 211 ¦ list <- remove list, list 212 ¦ # check structure like before 213 ¦ list2:&:list:num <- copy list 214 ¦ 10:num/raw <- first list2 215 ¦ list2 <- rest list2 216 ¦ 11:num/raw <- first list2 217 ¦ 20:&:list:num/raw <- rest 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 list:&:list:num <- push 3, 0 229 list <- push 4, list 230 list <- push 5, list 231 run [ 232 ¦ # delete last element 233 ¦ list2:&:list:num <- rest list 234 ¦ list2 <- rest list2 235 ¦ list <- remove list2, list 236 ¦ 10:bool/raw <- equal list2, 0 237 ¦ # check structure like before 238 ¦ list2 <- copy list 239 ¦ 11:num/raw <- first list2 240 ¦ list2 <- rest list2 241 ¦ 12:num/raw <- first list2 242 ¦ 20:&:list:num/raw <- rest 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 list:&:list:num <- push 3, 0 255 run [ 256 ¦ list <- remove list, list 257 ¦ 1:num/raw <- copy list 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 list:&:list:_elem temp:&:list:_elem/contained-in:result -> result:&:list:_elem [ 267 local-scope 268 load-ingredients 269 return-unless list, temp 270 object:_elem <- first, list 271 list <- rest list 272 temp <- push object, temp 273 result <- reverse list, temp 274 ] 275 276 scenario reverse-list [ 277 local-scope 278 list:&:list:num <- push 1, 0 279 list <- push 2, list 280 list <- push 3, list 281 run [ 282 ¦ stash [list:], list 283 ¦ list <- reverse list 284 ¦ stash [reversed:], list 285 ] 286 trace-should-contain [ 287 ¦ app: list: 3 -> 2 -> 1 288 ¦ app: reversed: 1 -> 2 -> 3 289 ] 290 ] 291 292 scenario stash-list [ 293 local-scope 294 list:&:list:num <- push 1, 0 295 list <- push 2, list 296 list <- push 3, list 297 run [ 298 ¦ stash [list:], list 299 ] 300 trace-should-contain [ 301 ¦ app: list: 3 -> 2 -> 1 302 ] 303 ] 304 305 def to-text in:&:list:_elem -> result:text [ 306 local-scope 307 load-ingredients 308 buf:&:buffer:char <- new-buffer 80 309 buf <- to-buffer in, buf 310 result <- buffer-to-array 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:&:list:_elem -> result:text [ 315 local-scope 316 load-ingredients 317 buf:&:buffer:char <- new-buffer 80 318 buf <- to-buffer in, buf, 6 # max elements to display 319 result <- buffer-to-array buf 320 ] 321 322 def to-buffer in:&:list:_elem, buf:&:buffer:char -> buf:&:buffer:char [ 323 local-scope 324 load-ingredients 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 next:&:list:_elem <- rest in 335 nextn:num <- copy next 336 return-unless next 337 buf <- append buf, [ -> ] 338 # and recurse 339 remaining:num, optional-ingredient-found?:bool <- next-ingredient 340 { 341 ¦ break-if optional-ingredient-found? 342 ¦ # unlimited recursion 343 ¦ buf <- to-buffer next, buf 344 ¦ return 345 } 346 { 347 ¦ break-unless remaining 348 ¦ # limited recursion 349 ¦ remaining <- subtract remaining, 1 350 ¦ buf <- to-buffer next, 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:&:list:num <- copy 0 360 run [ 361 ¦ stash x 362 ] 363 trace-should-contain [ 364 ¦ app: [] 365 ] 366 ]