suckless/dwm - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Expand)	Author	Age	Files	Lines
*	implemented regexp matching for rules	arg@10ksloc.org	2006-07-19	4	-32/+40
*	applied Jukka's patch with s/ModKeyMask/MODKEY/g	arg@10ksloc.org	2006-07-19	4	-24/+25
*	removed TODO, because dwm is nearly finished	arg@10ksloc.org	2006-07-19	1	-1/+0
*	reapplied my default keybindings	arg@10ksloc.org	2006-07-19	1	-1/+10
*	alternate dwm.png	arg@10ksloc.org	2006-07-19	1	-0/+0
*	Added tag 0.3 for changeset 7e66082e5092fb0bccd18a3695a0bec52c80fdb2	arg@10ksloc.org	2006-07-19	1	-0/+1
*	some changes in the html page 0.3	arg@10ksloc.org	2006-07-19	1	-2/+2
*	prepared 0.3	arg@10ksloc.org	2006-07-19	1	-10/+1
*	fixed the bug mentioned by Sander	arg@10ksloc.org	2006-07-19	1	-3/+7
*	refactored Sanders code somewhat	arg@10ksloc.org	2006-07-19	3	-15/+8
*	implemented fallback for too many clients in stacked mode	arg@10ksloc.org	2006-07-19	2	-3/+10
*	and another fix...	arg@10ksloc.org	2006-07-19	1	-1/+1
*	yet another typo fix	arg@10ksloc.org	2006-07-19	1	-2/+2
*	fixed a typo	arg@10ksloc.org	2006-07-19	1	-1/+1
*	floating clients get random (x,y) offsets now	arg@10ksloc.org	2006-07-19	1	-0/+7
*	applied Sanders resize patch, fixed lower bug	arg@10ksloc.org	2006-07-19	5	-19/+43
*	changed CFLAGs	arg@mmvi	2006-07-18	1	-5/+5
*	firefox instance is different now	arg@mmvi	2006-07-18	1	-1/+1
*	changed occurrences of wmii.de into 10kloc.org in dwm.html, because 10kloc.or...	Anselm R. Garbe	2006-07-18	1	-8/+8
*	implemened distinguishing float/managed geometries of clients (works quite well)	Anselm R. Garbe	2006-07-18	5	-78/+105
*	pop on heretag	Anselm R. Garbe	2006-07-18	3	-8/+16
*	added heretag command which allows to tag a client of a foreign tag with curr...	Anselm R. Garbe	2006-07-18	6	-10/+42
*	using EXIT_stuff in exit() now	Anselm R. Garbe	2006-07-18	2	-8/+7
*	simplified Makefile	Anselm R. Garbe	2006-07-17	2	-3/+2
*	added new stuff	Anselm R. Garbe	2006-07-17	1	-9/+6
*	updated html	Anselm R. Garbe	2006-07-17	1	-9/+9
*	patched dwm	Anselm R. Garbe	2006-07-17	3	-30/+46
*	updated README	Anselm R. Garbe	2006-07-17	1	-2/+2
*	Added tag 0.2 for changeset 0a6472e2203994bc5738d40a340d26f7ec9d6062	Anselm R. Garbe	2006-07-17	1	-0/+1
*	updated html 0.2	Anselm R. Garbe	2006-07-17	1	-1/+1
*	ordered variables in structs and source files alphabetically	Anselm R. Garbe	2006-07-17	7	-77/+70
*	slight change to dwm.1	Anselm R. Garbe	2006-07-17	1	-1/+2
*	simplified man page	Anselm R. Garbe	2006-07-16	2	-36/+29
*	another XSync	Anselm R. Garbe	2006-07-16	1	-0/+1
*	several additions in mouse handling ;)	Anselm R. Garbe	2006-07-16	5	-65/+59
*	fixed XSync handling and finished man page	Anselm R. Garbe	2006-07-15	5	-16/+64
*	changing XFlush into XSync	Anselm R. Garbe	2006-07-15	4	-6/+11
*	sanitized other stuff	Anselm R. Garbe	2006-07-15	5	-142/+136
*	proceeded with cleaning up, sorting functions, etc	Anselm R. Garbe	2006-07-15	7	-543/+532
*	rearranged several stuff	Anselm R. Garbe	2006-07-15	10	-444/+442
*	sanitized names	Anselm R. Garbe	2006-07-14	7	-72/+72
*	rearranged	Anselm R. Garbe	2006-07-14	9	-377/+374
*	I prefer the tiled/floating indicator on the right side	Anselm R. Garbe	2006-07-14	1	-5/+9
*	bar shows if currently is tiled (Mod1-space) or floating (Mod1-Shift-space) mode	Anselm R. Garbe	2006-07-14	2	-1/+7
*	draw bar on exposure ;)	Anselm R. Garbe	2006-07-14	3	-7/+9
*	Added tag 0.1 for changeset d31b5ad96b0ba7b5b0a30928fcf000428339a577	Anselm R. Garbe	2006-07-14	1	-0/+1
*	prep 0.1 0.1	Anselm R. Garbe	2006-07-14	4	-9/+11
*	fixed crash on zoom if only 1 client exists	Anselm R. Garbe	2006-07-14	1	-3/+9
*	removed a bunch of lines through swap removal	Anselm R. Garbe	2006-07-14	5	-28/+11
*	if stdin writer stops working, dwm consumed much IO load because it still tri...	Anselm R. Garbe	2006-07-14	1	-3/+7

<!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 - 025compare.cc</title> <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="cpp"> <meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy="> <meta name="colorscheme" content="minimal"> <style type="text/css">  </style> <script type='text/javascript'>  </script> </head> <body> <pre id='vimCodeElement'> //: Comparison primitives :(before "End Primitive Recipe Declarations") EQUAL, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "equal", EQUAL); :(before "End Primitive Recipe Checks") case EQUAL: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } const reagent& exemplar = inst.ingredients.at(0); for (int i = /*skip exemplar*/1; i < SIZE(inst.ingredients); ++i) { if (!types_match(inst.ingredients.at(i), exemplar) && !types_match(exemplar, inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'equal' expects ingredients to be all of the same type, but got '" << to_original_string(inst) << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case EQUAL: { vector<double>& exemplar = ingredients.at(0); bool result = true; for (int i = /*skip exemplar*/1; i < SIZE(ingredients); ++i) { if (!equal(ingredients.at(i).begin(), ingredients.at(i).end(), exemplar.begin())) { result = false; break; } } products.resize(1); products.at(0).push_back(result); break; } :(scenario equal) def main [ 1:number <- copy 34 2:number <- copy 33 3:boolean <- equal 1:number, 2:number ] +mem: location 1 is 34 +mem: location 2 is 33 +mem: storing 0 in location 3 :(scenario equal_2) def main [ 1:number <- copy 34 2:number <- copy 34 3:boolean <- equal 1:number, 2:number ] +mem: location 1 is 34 +mem: location 2 is 34 +mem: storing 1 in location 3 :(scenario equal_multiple) def main [ 1:boolean <- equal 34, 34, 34 ] +mem: storing 1 in location 1 :(scenario equal_multiple_2) def main [ 1:boolean <- equal 34, 34, 35 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") GREATER_THAN, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "greater-than", GREATER_THAN); :(before "End Primitive Recipe Checks") case GREATER_THAN: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'greater-than' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'greater-than' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'greater-than' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'greater-than' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case GREATER_THAN: { bool result = true; for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i-1).at(0) <= ingredients.at(i).at(0)) { result = false; } } products.resize(1); products.at(0).push_back(result); break; } :(scenario greater_than) def main [ 1:number <- copy 34 2:number <- copy 33 3:boolean <- greater-than 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario greater_than_2) def main [ 1:number <- copy 34 2:number <- copy 34 3:boolean <- greater-than 1:number, 2:number ] +mem: storing 0 in location 3 :(scenario greater_than_multiple) def main [ 1:boolean <- greater-than 36, 35, 34 ] +mem: storing 1 in location 1 :(scenario greater_than_multiple_2) def main [ 1:boolean <- greater-than 36, 35, 35 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") LESSER_THAN, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "lesser-than", LESSER_THAN); :(before "End Primitive Recipe Checks") case LESSER_THAN: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'lesser-than' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'lesser-than' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'lesser-than' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'lesser-than' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case LESSER_THAN: { bool result = true; for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i-1).at(0) >= ingredients.at(i).at(0)) { result = false; } } products.resize(1); products.at(0).push_back(result); break; } :(scenario lesser_than) def main [ 1:number <- copy 32 2:number <- copy 33 3:boolean <- lesser-than 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario lesser_than_2) def main [ 1:number <- copy 34 2:number <- copy 33 3:boolean <- lesser-than 1:number, 2:number ] +mem: storing 0 in location 3 :(scenario lesser_than_multiple) def main [ 1:boolean <- lesser-than 34, 35, 36 ] +mem: storing 1 in location 1 :(scenario lesser_than_multiple_2) def main [ 1:boolean <- lesser-than 34, 35, 35 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") GREATER_OR_EQUAL, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "greater-or-equal", GREATER_OR_EQUAL); :(before "End Primitive Recipe Checks") case GREATER_OR_EQUAL: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case GREATER_OR_EQUAL: { bool result = true; for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i-1).at(0) < ingredients.at(i).at(0)) { result = false; } } products.resize(1); products.at(0).push_back(result); break; } :(scenario greater_or_equal) def main [ 1:number <- copy 34 2:number <- copy 33 3:boolean <- greater-or-equal 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario greater_or_equal_2) def main [ 1:number <- copy 34 2:number <- copy 34 3:boolean <- greater-or-equal 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario greater_or_equal_3) def main [ 1:number <- copy 34 2:number <- copy 35 3:boolean <- greater-or-equal 1:number, 2:number ] +mem: storing 0 in location 3 :(scenario greater_or_equal_multiple) def main [ 1:boolean <- greater-or-equal 36, 35, 35 ] +mem: storing 1 in location 1 :(scenario greater_or_equal_multiple_2) def main [ 1:boolean <- greater-or-equal 36, 35, 36 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") LESSER_OR_EQUAL, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "lesser-or-equal", LESSER_OR_EQUAL); :(before "End Primitive Recipe Checks") case LESSER_OR_EQUAL: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'lesser-or-equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'lesser-or-equal' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'greater-or-equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case LESSER_OR_EQUAL: { bool result = true; for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i-1).at(0) > ingredients.at(i).at(0)) { result = false; } } products.resize(1); products.at(0).push_back(result); break; } :(scenario lesser_or_equal) def main [ 1:number <- copy 32 2:number <- copy 33 3:boolean <- lesser-or-equal 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario lesser_or_equal_2) def main [ 1:number <- copy 33 2:number <- copy 33 3:boolean <- lesser-or-equal 1:number, 2:number ] +mem: storing 1 in location 3 :(scenario lesser_or_equal_3) def main [ 1:number <- copy 34 2:number <- copy 33 3:boolean <- lesser-or-equal 1:number, 2:number ] +mem: storing 0 in location 3 :(scenario lesser_or_equal_multiple) def main [ 1:boolean <- lesser-or-equal 34, 35, 35 ] +mem: storing 1 in location 1 :(scenario lesser_or_equal_multiple_2) def main [ 1:boolean <- lesser-or-equal 34, 35, 34 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") MAX, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "max", MAX); :(before "End Primitive Recipe Checks") case MAX: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'max' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'max' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'max' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'max' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case MAX: { int result = ingredients.at(0).at(0); for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i).at(0) > result) { result = ingredients.at(i).at(0); } } products.resize(1); products.at(0).push_back(result); break; } :(before "End Primitive Recipe Declarations") MIN, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "min", MIN); :(before "End Primitive Recipe Checks") case MIN: { if (SIZE(inst.ingredients) <= 1) { raise << maybe(get(Recipe, r).name) << "'min' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'min' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'min' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "'min' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case MIN: { int result = ingredients.at(0).at(0); for (int i = /**/1; i < SIZE(ingredients); ++i) { if (ingredients.at(i).at(0) < result) { result = ingredients.at(i).at(0); } } products.resize(1); products.at(0).push_back(result); break; } </pre> </body> </html>