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
*	3227	Kartik K. Agaram	2016-08-18	1	-1/+4
*	3158	Kartik K. Agaram	2016-07-27	1	-10/+11
*	3116	Kartik K. Agaram	2016-07-20	1	-1/+1
*	3103	Kartik K. Agaram	2016-07-05	1	-24/+20
*	3024	Kartik K. Agaram	2016-05-28	1	-1/+1
*	3023	Kartik K. Agaram	2016-05-28	1	-1/+1
*	2997 - new version of http://akkartik.name/about	Kartik K. Agaram	2016-05-23	1	-3/+3
*	2996	Kartik K. Agaram	2016-05-21	1	-99/+112
*	2868	Kartik K. Agaram	2016-04-25	1	-1/+1
*	2866	Kartik K. Agaram	2016-04-25	1	-14/+18
*	2814	Kartik K. Agaram	2016-03-27	1	-22/+22
*	2813	Kartik K. Agaram	2016-03-27	1	-0/+4
*	2812	Kartik K. Agaram	2016-03-27	1	-14/+22
*	2811	Kartik K. Agaram	2016-03-27	1	-4/+4
*	2724 - document failures of /space:global	Kartik K. Agaram	2016-03-01	1	-3/+5
*	2706 - update html	Kartik K. Agaram	2016-02-25	1	-2/+2
*	2605	Kartik K. Agaram	2016-01-26	1	-10/+10
*	2545	Kartik K. Agaram	2015-12-15	1	-0/+2
*	2611	Kartik K. Agaram	2015-11-29	1	-2/+3
*	2430 - make room for more transforms	Kartik K. Agaram	2015-11-13	1	-18/+18
*	2429	Kartik K. Agaram	2015-11-13	1	-7/+6
*	2423 - describe shape-shifting in html docs	Kartik K. Agaram	2015-11-10	1	-22/+47
*	2300 - remove callcc.mu from docs until it returns	Kartik K. Agaram	2015-10-28	1	-2/+0
*	2177	Kartik K. Agaram	2015-09-07	1	-28/+67
*	2175	Kartik K. Agaram	2015-09-06	1	-2/+0
*	1885	Kartik K. Agaram	2015-07-29	1	-15/+30
*	1818	Kartik K. Agaram	2015-07-18	1	-8/+10
*	1766	Kartik K. Agaram	2015-07-12	1	-4/+6
*	1548	Kartik K. Agaram	2015-06-09	1	-2/+2
*	1484 - tweak utopia	Kartik K. Agaram	2015-05-27	1	-13/+15
*	1473	Kartik K. Agaram	2015-05-26	1	-1/+1
*	1468	Kartik K. Agaram	2015-05-26	1	-3/+3
*	1467	Kartik K. Agaram	2015-05-26	1	-1/+1
*	1466	Kartik K. Agaram	2015-05-26	1	-4/+4
*	1465	Kartik K. Agaram	2015-05-26	1	-5/+24
*	1464	Kartik K. Agaram	2015-05-26	1	-0/+13
*	1463	Kartik K. Agaram	2015-05-26	1	-4/+5
*	1462 - blurbs for example programs	Kartik K. Agaram	2015-05-26	1	-1/+28
*	1461 - descriptions/table of contents for the layers	Kartik K. Agaram	2015-05-26	1	-74/+131
*	1460	Kartik K. Agaram	2015-05-25	1	-1/+8
*	1292	Kartik K. Agaram	2015-05-06	1	-1/+1
*	1289	Kartik K. Agaram	2015-05-06	1	-0/+1
*	1283	Kartik K. Agaram	2015-05-06	1	-5/+5
*	1282	Kartik K. Agaram	2015-05-06	1	-1/+1
*	1281	Kartik K. Agaram	2015-05-06	1	-0/+2
*	1280 - index.html for github page	Kartik K. Agaram	2015-05-06	1	-0/+71

<!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 - 022arithmetic.cc</title> <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v1"> <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'> //: Arithmetic primitives :(before "End Primitive Recipe Declarations") ADD, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "add", ADD); :(before "End Primitive Recipe Checks") case ADD: { // primary goal of these checks is to forbid address arithmetic for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'add' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'add' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'add' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case ADD: { double result = 0; for (long long int i = 0; i < SIZE(ingredients); ++i) { result += ingredients.at(i).at(0); } products.resize(1); products.at(0).push_back(result); break; } :(scenario add_literal) recipe main [ 1:number <- add 23, 34 ] +mem: storing 57 in location 1 :(scenario add) recipe main [ 1:number <- copy 23 2:number <- copy 34 3:number <- add 1:number, 2:number ] +mem: storing 57 in location 3 :(scenario add_multiple) recipe main [ 1:number <- add 3, 4, 5 ] +mem: storing 12 in location 1 :(scenario add_checks_type) % Hide_errors = true; recipe main [ 1:number <- add 2:boolean, 1 ] +error: main: 'add' requires number ingredients, but got 2:boolean :(scenario add_checks_return_type) % Hide_errors = true; recipe main [ 1:address:number <- add 2, 2 ] +error: main: 'add' should yield a number, but got 1:address:number :(before "End Primitive Recipe Declarations") SUBTRACT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "subtract", SUBTRACT); :(before "End Primitive Recipe Checks") case SUBTRACT: { if (inst.ingredients.empty()) { raise_error << maybe(get(Recipe, r).name) << "'subtract' has no ingredients\n" << end(); break; } for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (is_raw(inst.ingredients.at(i))) continue; // permit address offset computations in tests if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'subtract' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'subtract' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'subtract' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case SUBTRACT: { double result = ingredients.at(0).at(0); for (long long int i = 1; i < SIZE(ingredients); ++i) result -= ingredients.at(i).at(0); products.resize(1); products.at(0).push_back(result); break; } :(code) bool is_raw(const reagent& r) { return has_property(r, "raw"); } :(scenario subtract_literal) recipe main [ 1:number <- subtract 5, 2 ] +mem: storing 3 in location 1 :(scenario subtract) recipe main [ 1:number <- copy 23 2:number <- copy 34 3:number <- subtract 1:number, 2:number ] +mem: storing -11 in location 3 :(scenario subtract_multiple) recipe main [ 1:number <- subtract 6, 3, 2 ] +mem: storing 1 in location 1 :(before "End Primitive Recipe Declarations") MULTIPLY, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "multiply", MULTIPLY); :(before "End Primitive Recipe Checks") case MULTIPLY: { for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'multiply' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'multiply' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'multiply' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case MULTIPLY: { double result = 1; for (long long int i = 0; i < SIZE(ingredients); ++i) { result *= ingredients.at(i).at(0); } products.resize(1); products.at(0).push_back(result); break; } :(scenario multiply_literal) recipe main [ 1:number <- multiply 2, 3 ] +mem: storing 6 in location 1 :(scenario multiply) recipe main [ 1:number <- copy 4 2:number <- copy 6 3:number <- multiply 1:number, 2:number ] +mem: storing 24 in location 3 :(scenario multiply_multiple) recipe main [ 1:number <- multiply 2, 3, 4 ] +mem: storing 24 in location 1 :(before "End Primitive Recipe Declarations") DIVIDE, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "divide", DIVIDE); :(before "End Primitive Recipe Checks") case DIVIDE: { if (inst.ingredients.empty()) { raise_error << maybe(get(Recipe, r).name) << "'divide' has no ingredients\n" << end(); break; } for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'divide' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'divide' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'divide' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case DIVIDE: { double result = ingredients.at(0).at(0); for (long long int i = 1; i < SIZE(ingredients); ++i) result /= ingredients.at(i).at(0); products.resize(1); products.at(0).push_back(result); break; } :(scenario divide_literal) recipe main [ 1:number <- divide 8, 2 ] +mem: storing 4 in location 1 :(scenario divide) recipe main [ 1:number <- copy 27 2:number <- copy 3 3:number <- divide 1:number, 2:number ] +mem: storing 9 in location 3 :(scenario divide_multiple) recipe main [ 1:number <- divide 12, 3, 2 ] +mem: storing 2 in location 1 //: Integer division :(before "End Primitive Recipe Declarations") DIVIDE_WITH_REMAINDER, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "divide-with-remainder", DIVIDE_WITH_REMAINDER); :(before "End Primitive Recipe Checks") case DIVIDE_WITH_REMAINDER: { if (SIZE(inst.ingredients) != 2) { raise_error << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires exactly two ingredients, but got '" << inst.to_string() << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise_error << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires number ingredients, but got '" << inst.to_string() << "'\n" << end(); break; } if (SIZE(inst.products) > 2) { raise_error << maybe(get(Recipe, r).name) << "'divide-with-remainder' yields two products in '" << inst.to_string() << "'\n" << end(); break; } for (long long int i = 0; i < SIZE(inst.products); ++i) { if (!is_dummy(inst.products.at(i)) && !is_mu_number(inst.products.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'divide-with-remainder' should yield a number, but got " << inst.products.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } break; } :(before "End Primitive Recipe Implementations") case DIVIDE_WITH_REMAINDER: { products.resize(2); long long int a = static_cast<long long int>(ingredients.at(0).at(0)); long long int b = static_cast<long long int>(ingredients.at(1).at(0)); if (b == 0) { raise_error << maybe(current_recipe_name()) << "divide by zero in '" << current_instruction().to_string() << "'\n" << end(); products.resize(2); products.at(0).push_back(0); products.at(1).push_back(0); break; } long long int quotient = a / b; long long int remainder = a % b; // very large integers will lose precision products.at(0).push_back(quotient); products.at(1).push_back(remainder); break; } :(scenario divide_with_remainder_literal) recipe main [ 1:number, 2:number <- divide-with-remainder 9, 2 ] +mem: storing 4 in location 1 +mem: storing 1 in location 2 :(scenario divide_with_remainder) recipe main [ 1:number <- copy 27 2:number <- copy 11 3:number, 4:number <- divide-with-remainder 1:number, 2:number ] +mem: storing 2 in location 3 +mem: storing 5 in location 4 :(scenario divide_with_decimal_point) recipe main [ 1:number <- divide 5, 2 ] +mem: storing 2.5 in location 1 :(scenario divide_by_zero) recipe main [ 1:number <- divide 4, 0 ] +mem: storing inf in location 1 :(scenario divide_by_zero_2) % Hide_errors = true; recipe main [ 1:number <- divide-with-remainder 4, 0 ] # integer division can't return floating-point infinity +error: main: divide by zero in '1:number <- divide-with-remainder 4, 0' </pre> </body> </html>