about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* yet another typo fixarg@10ksloc.org2006-07-191-2/+2
|
* fixed a typoarg@10ksloc.org2006-07-191-1/+1
|
* floating clients get random (x,y) offsets nowarg@10ksloc.org2006-07-191-0/+7
|
* applied Sanders resize patch, fixed lower bugarg@10ksloc.org2006-07-195-19/+43
|
* changed CFLAGsarg@mmvi2006-07-181-5/+5
|
* firefox instance is different nowarg@mmvi2006-07-181-1/+1
|
* changed occurrences of wmii.de into 10kloc.org in dwm.html, because ↵Anselm R. Garbe2006-07-181-8/+8
| | | | 10kloc.org is already working
* implemened distinguishing float/managed geometries of clients (works quite well)Anselm R. Garbe2006-07-185-78/+105
|
* pop on heretagAnselm R. Garbe2006-07-183-8/+16
|
* added heretag command which allows to tag a client of a foreign tag with ↵Anselm R. Garbe2006-07-186-10/+42
| | | | current tag
* using EXIT_stuff in exit() nowAnselm R. Garbe2006-07-182-8/+7
|
* simplified MakefileAnselm R. Garbe2006-07-172-3/+2
|
* added new stuffAnselm R. Garbe2006-07-171-9/+6
|
* updated htmlAnselm R. Garbe2006-07-171-9/+9
|
* patched dwmAnselm R. Garbe2006-07-173-30/+46
|
* updated READMEAnselm R. Garbe2006-07-171-2/+2
|
* Added tag 0.2 for changeset 0a6472e2203994bc5738d40a340d26f7ec9d6062Anselm R. Garbe2006-07-171-0/+1
|
* updated html 0.2Anselm R. Garbe2006-07-171-1/+1
|
* ordered variables in structs and source files alphabeticallyAnselm R. Garbe2006-07-177-77/+70
|
* slight change to dwm.1Anselm R. Garbe2006-07-171-1/+2
|
* simplified man pageAnselm R. Garbe2006-07-162-36/+29
|
* another XSyncAnselm R. Garbe2006-07-161-0/+1
|
* several additions in mouse handling ;)Anselm R. Garbe2006-07-165-65/+59
|
* fixed XSync handling and finished man pageAnselm R. Garbe2006-07-155-16/+64
|
* changing XFlush into XSyncAnselm R. Garbe2006-07-154-6/+11
|
* sanitized other stuffAnselm R. Garbe2006-07-155-142/+136
|
* proceeded with cleaning up, sorting functions, etcAnselm R. Garbe2006-07-157-543/+532
|
* rearranged several stuffAnselm R. Garbe2006-07-1510-444/+442
|
* sanitized namesAnselm R. Garbe2006-07-147-72/+72
|
* rearrangedAnselm R. Garbe2006-07-149-377/+374
|
* I prefer the tiled/floating indicator on the right sideAnselm R. Garbe2006-07-141-5/+9
|
* bar shows if currently is tiled (Mod1-space) or floating (Mod1-Shift-space) modeAnselm R. Garbe2006-07-142-1/+7
|
* draw bar on exposure ;)Anselm R. Garbe2006-07-143-7/+9
|
* Added tag 0.1 for changeset d31b5ad96b0ba7b5b0a30928fcf000428339a577Anselm R. Garbe2006-07-141-0/+1
|
* prep 0.1 0.1Anselm R. Garbe2006-07-144-9/+11
|
* fixed crash on zoom if only 1 client existsAnselm R. Garbe2006-07-141-3/+9
|
* removed a bunch of lines through swap removalAnselm R. Garbe2006-07-145-28/+11
|
* if stdin writer stops working, dwm consumed much IO load because it still ↵Anselm R. Garbe2006-07-141-3/+7
| | | | tried to select on this fd, fixed
* removed a bottleneckAnselm R. Garbe2006-07-141-6/+8
|
* searching for a better way to discard enter notifiesAnselm R. Garbe2006-07-144-54/+12
|
* focus on view change as wellAnselm R. Garbe2006-07-141-0/+3
|
* small fixAnselm R. Garbe2006-07-141-1/+1
|
* made stdin reader more robustAnselm R. Garbe2006-07-142-9/+22
|
* implemented dwm reading status text from stdin Anselm R. Garbe2006-07-146-25/+58
|
* made barclick to select the specific tagAnselm R. Garbe2006-07-146-4/+36
|
* implemented bar for dwm (I miss status text), I plan that status text is ↵Anselm R. Garbe2006-07-146-31/+95
| | | | read from stdin in dwm
* continued with man pageAnselm R. Garbe2006-07-141-0/+34
|
* continued with man pageAnselm R. Garbe2006-07-144-4/+40
|
* except improvements to the mouse handling this is already nearly feature ↵Anselm R. Garbe2006-07-131-0/+5
| | | | complete
* added mini stuffAnselm R. Garbe2006-07-134-46/+69
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-29 15:46:45 +0000
n> 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 (SIZE(ingredients.at(i)) != SIZE(exemplar)) { result = false; break; } 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:num <- copy 34 2:num <- copy 33 3:bool <- equal 1:num, 2:num ] +mem: location 1 is 34 +mem: location 2 is 33 +mem: storing 0 in location 3 :(scenario equal_2) def main [ 1:num <- copy 34 2:num <- copy 34 3:bool <- equal 1:num, 2:num ] +mem: location 1 is 34 +mem: location 2 is 34 +mem: storing 1 in location 3 :(scenario equal_multiple) def main [ 1:bool <- equal 34, 34, 34 ] +mem: storing 1 in location 1 :(scenario equal_multiple_2) def main [ 1:bool <- equal 34, 34, 35 ] +mem: storing 0 in location 1 :(before "End Primitive Recipe Declarations") NOT_EQUAL, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "not-equal", NOT_EQUAL); :(before "End Primitive Recipe Checks") case NOT_EQUAL: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'equal' needs two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); break; } const reagent& exemplar = inst.ingredients.at(0); if (!types_match(inst.ingredients.at(1), exemplar) && !types_match(exemplar, inst.ingredients.at(1))) { 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 NOT_EQUAL: { vector<double>& exemplar = ingredients.at(0); products.resize(1); if (SIZE(ingredients.at(1)) != SIZE(exemplar)) { products.at(0).push_back(true); break; } bool equal_ingredients = equal(ingredients.at(1).begin(), ingredients.at(1).end(), exemplar.begin()); products.at(0).push_back(!equal_ingredients); break; } :(scenario not_equal) def main [ 1:num <- copy 34 2:num <- copy 33 3:bool <- not-equal 1:num, 2:num ] +mem: location 1 is 34 +mem: location 2 is 33 +mem: storing 1 in location 3 :(scenario not_equal_2) def main [ 1:num <- copy 34 2:num <- copy 34 3:bool <- not-equal 1:num, 2:num ] +mem: location 1 is 34 +mem: location 2 is 34 +mem: storing 0 in location 3 :(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:num <- copy 34 2:num <- copy 33 3:bool <- greater-than 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario greater_than_2) def main [ 1:num <- copy 34 2:num <- copy 34 3:bool <- greater-than 1:num, 2:num ] +mem: storing 0 in location 3 :(scenario greater_than_multiple) def main [ 1:bool <- greater-than 36, 35, 34 ] +mem: storing 1 in location 1 :(scenario greater_than_multiple_2) def main [ 1:bool <- 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:num <- copy 32 2:num <- copy 33 3:bool <- lesser-than 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario lesser_than_2) def main [ 1:num <- copy 34 2:num <- copy 33 3:bool <- lesser-than 1:num, 2:num ] +mem: storing 0 in location 3 :(scenario lesser_than_multiple) def main [ 1:bool <- lesser-than 34, 35, 36 ] +mem: storing 1 in location 1 :(scenario lesser_than_multiple_2) def main [ 1:bool <- 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:num <- copy 34 2:num <- copy 33 3:bool <- greater-or-equal 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario greater_or_equal_2) def main [ 1:num <- copy 34 2:num <- copy 34 3:bool <- greater-or-equal 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario greater_or_equal_3) def main [ 1:num <- copy 34 2:num <- copy 35 3:bool <- greater-or-equal 1:num, 2:num ] +mem: storing 0 in location 3 :(scenario greater_or_equal_multiple) def main [ 1:bool <- greater-or-equal 36, 35, 35 ] +mem: storing 1 in location 1 :(scenario greater_or_equal_multiple_2) def main [ 1:bool <- 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:num <- copy 32 2:num <- copy 33 3:bool <- lesser-or-equal 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario lesser_or_equal_2) def main [ 1:num <- copy 33 2:num <- copy 33 3:bool <- lesser-or-equal 1:num, 2:num ] +mem: storing 1 in location 3 :(scenario lesser_or_equal_3) def main [ 1:num <- copy 34 2:num <- copy 33 3:bool <- lesser-or-equal 1:num, 2:num ] +mem: storing 0 in location 3 :(scenario lesser_or_equal_multiple) def main [ 1:bool <- lesser-or-equal 34, 35, 35 ] +mem: storing 1 in location 1 :(scenario lesser_or_equal_multiple_2) def main [ 1:bool <- 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; }
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-29 15:46:46 +0000