//: 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 (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << 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 << maybe(get(Recipe, r).name) << "'add' yields exactly one product in '" << to_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) << "'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 (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) def main [ 1:number <- add 23, 34 ] +mem: storing 57 in location 1 :(scenario add) def 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) def main [ 1:number <- add 3, 4, 5 ] +mem: storing 12 in location 1 :(scenario add_checks_type) % Hide_errors = true; def 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; def 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 << maybe(get(Recipe, r).name) << "'subtract' has no ingredients\n" << end(); break; } for (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 << 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 << maybe(get(Recipe, r).name) << "'subtract' yields exactly one product in '" << to_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) << "'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 (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) def main [ 1:number <- subtract 5, 2 ] +mem: storing 3 in location 1 :(scenario subtract) def 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) def main [ 1:number <- subtract 6, 3, 2 ] +mem: storing 1 in location 1 :(before "End Primitive Recipe Declarations") MULTIPLY, :(before "End Primitive R

# Compatible with ranger 1.6.0 through 1.7.*
#
# This is a sample plugin that displays "Hello World" in ranger's console after
# it started.

# We are going to extend the hook "ranger.api.hook_ready", so first we need
# to import ranger.api:
import ranger.api

# Save the previously existing hook, because maybe another module already
# extended that hook and we don't want to lose it:
old_hook_ready = ranger.api.hook_ready

# Create a replacement for the hook that...
def hook_ready(fm):
    # ...does the desired action...
    fm.notify("Hello World")
    # ...and calls the saved hook.  If you don't care about the return value,
    # simply return the return value of the previous hook to be safe.
    return old_hook_ready(fm)

# Finally, "monkey patch" the existing hook_ready function with our replacement:
ranger.api.hook_ready = hook_ready

ft 1, 4 ] +mem: storing 16 in location 1 :(scenario shift_left_2) def main [ 1:number <- shift-left 3, 2 ] +mem: storing 12 in location 1 :(scenario shift_left_by_negative) % Hide_errors = true; def main [ 1:number <- shift-left 3, -1 ] +error: main: second ingredient can't be negative in '1:number <- shift-left 3, -1' :(scenario shift_left_ignores_fractional_part) def main [ 1:number <- divide 3, 2 2:number <- shift-left 1:number, 1 ] +mem: storing 2 in location 2 :(before "End Primitive Recipe Declarations") SHIFT_RIGHT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "shift-right", SHIFT_RIGHT); :(before "End Primitive Recipe Checks") case SHIFT_RIGHT: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'shift-right' requires exactly two ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'shift-right' requires number ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'shift-right' yields one product in '" << to_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) << "'shift-right' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case SHIFT_RIGHT: { // ingredients must be integers int a = static_cast(ingredients.at(0).at(0)); int b = static_cast(ingredients.at(1).at(0)); products.resize(1); if (b < 0) { raise << maybe(current_recipe_name()) << "second ingredient can't be negative in '" << to_string(current_instruction()) << "'\n" << end(); products.at(0).push_back(0); break; } products.at(0).push_back(a>>b); break; } :(scenario shift_right_by_zero) def main [ 1:number <- shift-right 1, 0 ] +mem: storing 1 in location 1 :(scenario shift_right_1) def main [ 1:number <- shift-right 1024, 1 ] +mem: storing 512 in location 1 :(scenario shift_right_2) def main [ 1:number <- shift-right 3, 1 ] +mem: storing 1 in location 1 :(scenario shift_right_by_negative) % Hide_errors = true; def main [ 1:number <- shift-right 4, -1 ] +error: main: second ingredient can't be negative in '1:number <- shift-right 4, -1' :(scenario shift_right_ignores_fractional_part) def main [ 1:number <- divide 3, 2 2:number <- shift-right 1:number, 1 ] +mem: storing 0 in location 2 :(before "End Primitive Recipe Declarations") AND_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "and-bits", AND_BITS); :(before "End Primitive Recipe Checks") case AND_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'and-bits' requires exactly two ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'and-bits' requires number ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'and-bits' yields one product in '" << to_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) << "'and-bits' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case AND_BITS: { // ingredients must be integers int a = static_cast(ingredients.at(0).at(0)); int b = static_cast(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a&b); break; } :(scenario and_bits_1) def main [ 1:number <- and-bits 8, 3 ] +mem: storing 0 in location 1 :(scenario and_bits_2) def main [ 1:number <- and-bits 3, 2 ] +mem: storing 2 in location 1 :(scenario and_bits_3) def main [ 1:number <- and-bits 14, 3 ] +mem: storing 2 in location 1 :(scenario and_bits_negative) def main [ 1:number <- and-bits -3, 4 ] +mem: storing 4 in location 1 :(before "End Primitive Recipe Declarations") OR_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "or-bits", OR_BITS); :(before "End Primitive Recipe Checks") case OR_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'or-bits' requires exactly two ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'or-bits' requires number ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'or-bits' yields one product in '" << to_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) << "'or-bits' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case OR_BITS: { // ingredients must be integers int a = static_cast(ingredients.at(0).at(0)); int b = static_cast(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a|b); break; } :(scenario or_bits_1) def main [ 1:number <- or-bits 3, 8 ] +mem: storing 11 in location 1 :(scenario or_bits_2) def main [ 1:number <- or-bits 3, 10 ] +mem: storing 11 in location 1 :(scenario or_bits_3) def main [ 1:number <- or-bits 4, 6 ] +mem: storing 6 in location 1 :(before "End Primitive Recipe Declarations") XOR_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "xor-bits", XOR_BITS); :(before "End Primitive Recipe Checks") case XOR_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'xor-bits' requires exactly two ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'xor-bits' requires number ingredients, but got '" << to_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'xor-bits' yields one product in '" << to_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) << "'xor-bits' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case XOR_BITS: { // ingredients must be integers int a = static_cast(ingredients.at(0).at(0)); int b = static_cast(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a^b); break; } :(scenario xor_bits_1) def main [ 1:number <- xor-bits 3, 8 ] +mem: storing 11 in location 1 :(scenario xor_bits_2) def main [ 1:number <- xor-bits 3, 10 ] +mem: storing 9 in location 1 :(scenario xor_bits_3) def main [ 1:number <- xor-bits 4, 6 ] +mem: storing 2 in location 1 :(before "End Primitive Recipe Declarations") FLIP_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "flip-bits", FLIP_BITS); :(before "End Primitive Recipe Checks") case FLIP_BITS: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'flip-bits' requires exactly one ingredient, but got '" << to_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "'flip-bits' requires a number ingredient, but got '" << to_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'flip-bits' yields one product in '" << to_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) << "'flip-bits' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case FLIP_BITS: { // ingredient must be integer int a = static_cast(ingredients.at(0).at(0)); products.resize(1); products.at(0).push_back(~a); break; } :(scenario flip_bits_zero) def main [ 1:number <- flip-bits 0 ] +mem: storing -1 in location 1 :(scenario flip_bits_negative) def main [ 1:number <- flip-bits -1 ] +mem: storing 0 in location 1 :(scenario flip_bits_1) def main [ 1:number <- flip-bits 3 ] +mem: storing -4 in location 1 :(scenario flip_bits_2) def main [ 1:number <- flip-bits 12 ] +mem: storing -13 in location 1