1V0_20200709_EEPROM_ESP8266_WIFI.ino

/* Trying again with EEPROM... */

/* 1V0 */

/* - Pronounced as the name "Ivo", in honour of my beloved father. */

#define WIFINAME "YOURWIFINAME"
#define WIFIPASSWORD "YOURPASSWORD"
#define WIFIPORT 8023
/* The device connects to a hotspot, and on this hotspot, it attempts to */
/* connect to a port. On this port, you can listen to it - for instance */
/* through netcat, e.g. with "nc -l -p 8023 -k" - netcat acts as server. */
/* This makes it easy to connect it to your mobile phone's hotspot. */

/* This program is an "interpreted high-level quasi-assembler" for Arduino  */
/* and similarly "low-powered" devices. It provides a virtual machine which */
/* should look similar on all devices. Depending on the configuration, it   */
/* will typically be able to use at most about 64K RAM, but may operate in  */
/* full capacity already with about 16KB. It present the user with a        */
/* facility to enter programming steps and a pair of two addresses on which */
/* the entered operation is to be performed. While the reference            */
/* implementation may use strings, in fact, all I/O should be convertible   */
/* to just 12 symbols: numbers 0-9 and two special signs, e.g. * and #,     */
/* which allows the use of the system also on old-fashioned mobile phones:  */
/* all operations and all data should be possible to enter just in this     */
/* simple fashion. The system is conceived to store instructions in EEPROM  */
/* (or flash, for ARM) and data in SRAM, allowing non-volatile storage for  */
/* the laboriously constructed set of instructions.

/* Every instruction operates on two addresses and is expressed in 32 bit;  */
/* two designs thereby appear most sensible:                                */
/* aaaaaa bbbbbbbbbbbbb ccccccccccccc - 6bit instruction + 2x 13bit data    */
/* aaaaaaaa bbbbbbbbbbbb cccccccccccc - 8bit instruction + 2x 12bit data    */
/* Instructions 0-62 have been implemented, leaving instruction 63 reserved */
/* should the need arise to give it a final instruction e.g. for GPIO       */
/* operations and thelike.                                                  */

/* For the ATTINY85, I assume I will have only a handful instructions, <17, */
/* as the poor thing does not have even enough FLASH memory to accomodate   */
/* anything fancier! Thus, the instruction set will be reduced - I am       */
/* presently considering making it NOOP, JUMP, IADR, SADR, SVAL, IVAS,      */
/* PLUS, MINS, MULS, DIVS, POXY, LOXY, COPY, SUMR and OUTP -- where OUTP    */
/* may actually be supplanted by a user function, if so desired. 6bit data  */
/* addresses will be used - which really gives you 64 floats in 256 bytes   */
/* or 64 doubles in 512 bytes, and I do not think its SRAM will allow       */
/* anything further. This condenses instructions to 16bit, i.e. 256 in the  */
/* available EEPROM. Looks like I will have to cut corners for UNO, too.    */

/* The system has two parts: a sort of REPL for interaction with the user   */
/* right after startup, and also offers the facility to launch composed     */
/* sets of instructions to be interpreted in a sort of "virtual machine".   */

/* All operation is geared towards handling floating point values. Nobody   */
/* "in real life" really cares all that much about integers. Already it can */
/* be convincingly used as a sort of "scientific calculator", but this is   */
/* really just a gross oversimplification of the possibilities it offers,   */
/* as entire programs can be composed and run. */

/* All of this really follows the "philosophy of a spreadsheet":            */
/* where a user can solve rather complex problems by immediate intervention */
/* or with few commands, each command being quite complex in itself. This   */
/* is in contrast to the "high art of programming", where a user solves     */
/* arbitrarily complex tasks by chaining simple fragments, each in itself   */
/* quite incapable. The difference is "programming" requires the user to    */
/* undertake a "leap of faith", whereas users might simply need solutions.  */
/* My design idea is that I do not think "variables" are sensible to work   */
/* with, but rather, I am attempting to operate on "data fields". Allowing  */
/* involved operations with floats or more, I can get much faster practical */
/* results than by fiddling with integers variable by variable. Complex     */
/* operations better utilise the chip memory, too, and make "flash" usable  */
/* for things for which otherwise "SRAM" would be needed - and flash it is  */
/* that is plentiful. The functions should allow it to work like a sort of  */
/* "microcontroller spreadsheet" where operations are done on entire fields */
/* of cells. Shortening the needed operations with unfamiliar code should   */
/* also be more "pleasant" for the programmer. Using flash vs. SRAM thus    */
/* it becomes possible to "offload" some computational complexity from SRAM */
/* to "pre-fixated" memory - compared to ancient computers, this is a sort  */
/* of "wiring" rather than "keeping instructions in memory". Personally,    */
/* this let me understand why old computers were CISC: nothing you do is    */
/* very obvious, so whatever you do - better do it with fewer instructions. */
/* This makes an "assembler" more "intelligible" than a long chain of       */
/* cryptic minimal operations, like bit-negations and additions to form a   */
/* subtraction or thelike, which make no immediate sense in a listing.      */

/* I assume people PARTICULARLY hate "looping in a strange language",       */
/* and secondly, "conditions in a strange language". "Range" operations     */
/* seek to ameliorate that. Each "range" should be "padded" by an address   */
/* "below" it and an address "above" it for all range operations to work,   */
/* as these locations can be used to facilitate the range operation.        */

/* I had enough of watching "Arduino projects" take a perfect little        */
/* computer and turn it into a piece of junk, executing just one or two     */
/* "if-then"-s.                                                             */

/* Data Address 0 and Command Address 0 are reserved.                       */
/* A command with address 0 means "immediate execution".                    */

/* The system does not prefer "immediate failure", but tries to             */
/* "tolerate bugs". For complex programs, this is a dangerous design        */
/* decision, as they will still "run", but buggily. - The advantage is to   */
/* make it easy "to run anything at all", so some tolerance is built-in...  */
/* crashes are still possible, though.                                      */

/* A programmed space with jumps to exec0 has a similar effect to a         */
/* "file system" with "different programs". The user decides to which       */
/* executable section to "jump to", and the "returns" let him have more     */
/* than one composition of logical steps on a single computing device.      */

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
// #include <string.h>
#include <EEPROM.h>
#include <ESP8266WiFi.h>


#define NRSIZE 101
/* number buffer */

/* These DATAMEM and EXECMEM hold data and instructions, respectively. */
#define DATAMEM 1801
/* I.e. x4 using 7204 bytes of RAM */
#define EXECMEM 1001
/* I.e. x4 using 4004 bytes of EEPROM, leaving you with 92 bytes or 23 shifts */
/* If any "location 0" lasts you a year or two, you should be good for some */
/* 20 years or so of usage. Yeah, go ahead, I dare you! */

#define INSTRUCTION_BYTE_LENGTH 4
#define ZERO_OFFSET 4
/* This would serve to handle wear of the EEPROM. Should be divisible by 4. */
/* It is here totally useful that I can start instructions way behind instruction #1, e.g. at 11 or so. */
/* This way, they can "stay where they are", even if I have to re-flash and change position 0. */
/* All jumps would have to be updated, of course. */
/* If I then jump to the first instruction, still everything will be executed as it should be, skipping 0s along the way. */

#define TOLERANCE 0.0001
/* #define PI M_PI */
/* Is defined already. */
/* If M_PI is unavailable, make it 3.14159265358979323846 or 355/113 or */
/* simply 3 "for sufficiently large values of 3" */


float datum[DATAMEM];
// unsigned long instruction[EXECMEM];

unsigned long instr = 0;
/* instruction format: */
/* operator, data address 1 (=result), data address 2 */
/* every operator is at a command address. */
int cmdadr = 0;
unsigned int opr = 0;
unsigned int datadr1 = 0;
unsigned int datadr2 = 0;
unsigned long xx;
unsigned long yy;
unsigned long zz;

int pc = 0;
int h = 0; /* beware: h & k are used for "transcendental" instructions ... */
int i = 0;     /* i & j are auxiliary looping variables */
int j = 0;
int k = 0; /* ... so ZERO THEM OUT after non-transcendental usage */
float f = 0.0; /* f & g are auxiliary floating point temporary storage */
double g = 0.0;
char cmnt; /* does NOTHING, serves just as comment facility within terminal */
short tracer = 0;

unsigned int runlimit = 0;
/* If this is 0, run unlimited, else break when it becomes 1. */
/* This is a sort of "safety", to prevent infinite looping. */

/* for handling input of numbers */
char numbufr[NRSIZE];
char asciidigit;
int m;
long p ;
double q;
long returnreadlong = 0;
unsigned long returnreadunsignedlong = 0;
double returnreaddouble = 0.0;

WiFiClient client;


long readlong() {
  for (m = 0; m < NRSIZE; m++) { yield();
    numbufr[m] = 0; /* sanitize the numeric buffer */
  }

  m = 0;
  while (m < NRSIZE) { yield();
    if (client.available()) {
      asciidigit = static_cast<char>(client.read());
      if ((asciidigit != 0) &&
          (asciidigit != '\r') &&
          (asciidigit != '\n') &&
          (asciidigit != '\t') &&
          (asciidigit != ' ')) {
        numbufr[m] = asciidigit;
      } else {
        break;
      }
      m++;
    }
  }

//  returnreadlong = (static_cast<long>(atol(numbufr)));
  sscanf(numbufr, "%ld", &returnreadlong);
  return(returnreadlong);
}

unsigned long readunsignedlong() {
  for (m = 0; m < NRSIZE; m++) { yield();
    numbufr[m] = 0; /* sanitize the numeric buffer */
  }

  m = 0;
  while (m < NRSIZE) { yield();
    if (client.available()) {
      asciidigit = static_cast<char>(client.read());
      if ((asciidigit != 0) &&
          (asciidigit != '\r') &&
          (asciidigit != '\n') &&
          (asciidigit != '\t') &&
          (asciidigit != ' ')) {
        numbufr[m] = asciidigit;
      } else {
        break;
      }
      m++;
    }
  }

  sscanf(numbufr, "%lu", &returnreadunsignedlong);
  return(returnreadunsignedlong);
}

double readdouble() {
  for (m = 0; m < NRSIZE; m++) { yield();
    numbufr[m] = 0; /* sanitize the numeric buffer */
  }

  m = 0;
  while (m < NRSIZE) { yield();
    if (client.available()) {
      asciidigit = static_cast<char>(client.read());
      if ((asciidigit != 0) &&
          (asciidigit != '\r') &&
          (asciidigit != '\n') &&
          (asciidigit != '\t') &&
          (asciidigit != ' ')) {
        numbufr[m] = asciidigit;
      } else {
        break;
      }
      m++;
    }
  }

//  returnreaddouble = (static_cast<double>(atof(numbufr)));
  sscanf(numbufr, "%lf", &returnreaddouble);
  return(returnreaddouble);
}


/* Print the mnemonic - now in a separate function to tak up less space: */
/* NOT IMPLEMENTED INSTRUCTIONS GET AN ASTERISK. */
void printopr() {
    if (opr == 0) {
      client.print(F("NOOP"));
    } else if (opr == 1) {
      client.print(F("JUMP"));
    } else if (opr == 2) {
      client.print(F("IADR"));
    } else if (opr == 3) {
      client.print(F("OUTP"));
    } else if (opr == 4) {
      client.print(F("INPT"));
    } else if (opr == 5) {
      client.print(F("SADR"));
    } else if (opr == 6) {
      client.print(F("SVAL"));
    } else if (opr == 7) {
      client.print(F("IAAS"));
    } else if (opr == 8) {
      client.print(F("IVAS"));
    } else if (opr == 9) {
      client.print(F("PLUS"));
    } else if (opr == 10) {
      client.print(F("MINS"));
    } else if (opr == 11) {
      client.print(F("MULS"));
    } else if (opr == 12) {
      client.print(F("DIVS"));
    } else if (opr == 13) {
      client.print(F("POXY"));
    } else if (opr == 14) {
      client.print(F("LOXY"));
    } else if (opr == 15) {
      client.print(F("IFRA"));
    } else if (opr == 16) {
      client.print(F("REMN"));
    } else if (opr == 17) {
      client.print(F("AMNT"));
    } else if (opr == 18) {
      client.print(F("PERD"));
    } else if (opr == 19) {
      client.print(F("PCNT"));
    } else if (opr == 20) {
      client.print(F("SWAP"));
    } else if (opr == 21) {
      client.print(F("FACT"));
    } else if (opr == 22) {
      client.print(F("COPY"));
    } else if (opr == 23) {
      client.print(F("FRIS"));
    } else if (opr == 24) {
      client.print(F("MNMX"));
    } else if (opr == 25) {
      client.print(F("SORT"));
    } else if (opr == 26) {
      client.print(F("CORS"));
    } else if (opr == 27) {
      client.print(F("TURN"));
    } else if (opr == 28) {
      client.print(F("SUMR"));
    } else if (opr == 29) {
      client.print(F("SUSQ"));
    } else if (opr == 30) {
      client.print(F("IXTH"));
    } else if (opr == 31) {
      client.print(F("ABSR"));
    } else if (opr == 32) {
      client.print(F("SQRT"));
    } else if (opr == 33) {
      client.print(F("SQUA"));
    } else if (opr == 34) {
      client.print(F("CBRT"));
    } else if (opr == 35) {
      client.print(F("CUBE"));
    } else if (opr == 36) {
      client.print(F("LNRN"));
    } else if (opr == 37) {
      client.print(F("EXPR"));
    } else if (opr == 38) {
      client.print(F("RADE"));
    } else if (opr == 39) {
      client.print(F("DERA"));
    } else if (opr == 40) {
      client.print(F("SIND"));
    } else if (opr == 41) {
      client.print(F("COSD"));
    } else if (opr == 42) {
      client.print(F("TAND"));
    } else if (opr == 43) {
      client.print(F("ASND"));
    } else if (opr == 44) {
      client.print(F("ACSD"));
    } else if (opr == 45) {
      client.print(F("ATND"));
    } else if (opr == 46) {
      client.print(F("MSTD"));
    } else if (opr == 47) {
      client.print(F("ZERO"));
    } else if (opr == 48) {
      client.print(F("RAND"));
    } else if (opr == 49) {
      client.print(F("RUND"));
    } else if (opr == 50) {
      client.print(F("CEIL"));
    } else if (opr == 51) {
      client.print(F("TANH"));
    } else if (opr == 52) {
      client.print(F("DTNH"));
    } else if (opr == 53) {
      client.print(F("PLUR"));
    } else if (opr == 54) {
      client.print(F("MINR"));
    } else if (opr == 55) {
      client.print(F("MULR"));
    } else if (opr == 56) {
      client.print(F("DIVR"));
    } else if (opr == 57) {
      client.print(F("PLUN"));
    } else if (opr == 58) {
      client.print(F("MINN"));
    } else if (opr == 59) {
      client.print(F("MULN"));
    } else if (opr == 60) {
      client.print(F("DIVN"));
    } else if (opr == 61) {
      client.print(F("PROB"));
    } else if (opr == 62) {
      client.print(F("STDD"));
    } else if (opr == 63) {
      client.print(F("USER"));
    } else {
      /* Such an "else" MAY come into existence if not ALL possible */
      /* instructions have been implemented, either theoretically, or */
      /* practically - simply due to a lack of flash space. */
      /* NOKO: NO Known Operation, and is skipped like NOOP. */
      client.print(F("NOKO"));
    }
    client.print(F(" "));
}

void setup() {

EEPROM.begin(4096);

WiFi.begin(WIFINAME, WIFIPASSWORD);
 
while (WiFi.status() != WL_CONNECTED) {
  delay(2000);
}
delay(1000);
int flg = 0;
if  (!client.connect(WiFi.gatewayIP(), WIFIPORT)) { return;  } else { flg = 1;}

while ((cmnt = client.read()) != '\n' && cmnt != EOF ) { yield(); } /* Press Enter to start */
// client.print(F("\r\n"));; // Sometimes it prints something BEFORE it is ready -
                  // let it be at least something irrelevant.

/* Initialise commands to zero, which is no-op */

/*
for (i=0; i<EXECMEM; i++) { yield();
  // EEPROM.put((INSTRUCTION_BYTE_LENGTH * (i - 0)) + ZERO_OFFSET, 0); // DEACTIVATED
  // EEPROM IS BETTER CLEARED EXPLICITLY.
}
// EEPROM.commit();
*/


/* Make data zero: */
for (i=0; i<DATAMEM; i++) { yield();
  datum[i] = 0.0;
  yield();
}

while (1) {
/* the highest level general loop which oscillates between command mode */
/* and general run mode */

yield();

client.print(F("INIT"));
client.print(F("\r\n"));
/* HELP TEXT */

/* ------------------------ SETUP AND MAINTENANCE ------------------------ */
/* Read in instruction orders: */
/* - positive addresses: program for later execution; */
/* - zero-command-address: immediate execution according to operators; */
/* - specific negative addresses: specific immediate actions, not covered */
/*   by the usual operators. */
/* This is a kind of REPL or user command interface prior to actually */
/* "running" any sort of longer program. Here, the user still has more */
/* immediate influence over the machine. */

runlimit = 5 * EXECMEM; /* set it with -9, 0 means infinite. */
/* It is better to have a "fool-proof" default than 0. */
/* This is particularly useful on systems where you cannot save your */
/* instructions - such as your desktop computer - and do not wish to lose */
/* everything just because the machine went into an infinite loop. */

while (1) {
yield();
pc = 0; /* safety: nuke the program counter and the immediate instruction */
EEPROM.put(ZERO_OFFSET, (long) 0);
// EEPROM.commit();

/* Arduino: flush here any read-cache before reading instructions. */

/* First, get the command address - to determine is it +, 0 or - .*/
/* From there it will depend what action is to be undertaken. */
client.print(F("CMD ADR  : "));
cmdadr = readlong();
/* atof and atoi due to lack of scanf */

/* COMMAND SELECTION IN REPL MODE */
/* Positive or zero - give the details of the instruction to be executed. */
if (cmdadr >= 0) {
  /* GIVE INSTRUCTION */

  client.print(F("OPERATION: "));
  opr = readlong();
  client.print(F("DATA ADR1: "));
  datadr1 = readlong();
  client.print(F("DATA ADR2: "));
  datadr2 = readlong();
/* COMMENT OUT, IF DESIRED, FROM HERE ...: */
  /* "Eat" the return from the last data address. */
  
  cmnt = 0;
  /* The comment is optional - just press Enter if you do not want it. */
  client.print(F("CMNT: ")); /* A comment is not saved, merely printed to the */
  while (cmnt != '\n') {   /* I/O dialogue. This itself may be useful. */
    while (!client.available()) { yield(); }
    cmnt = client.read();
    client.print(cmnt);

    if (cmnt == '#') { /* CANCEL */
      opr = 0;
      datadr1 = 0;
      datadr2 = 0;
      client.print(F("CANCELLED# "));
      /* break */ /* no, not immediately, let the user explain why! */
    }
  }
//  client.print(F("\r\n"));;
/* ... TO HERE. */

  if ((datadr1 >= DATAMEM) || (datadr2 >= DATAMEM) ||
     (datadr1 < 0) || (datadr1 < 0) || (cmdadr >= EXECMEM)) {
    client.print(F("CORR RANGE. DATA 0 ... "));
    client.print((DATAMEM - 1));
    client.print(F(", INSTR 0 ... "));
    client.print((EXECMEM - 1));
    client.print(F("\r\n"));;
  }
  /* only positive data addresses - and 0 - are allowed: */
  datadr1 = abs(datadr1);
  datadr2 = abs(datadr2);

  /* force everything to be within range: */
  if (cmdadr >= EXECMEM) {
    cmdadr = EXECMEM - 1;
  }
  if (datadr1 >= DATAMEM) {
    datadr1 = DATAMEM - 1;
  }
  if (datadr2 >= DATAMEM) {
    datadr2 = DATAMEM - 1;
  }

  /* Having read the instruction, compose it and save it. */
  
  /* BIT SHIFTING DOES NOT WORK! I.e. it works IN THEORY, but in practice, it */
  /* needs larger numbers - and then somehow the sketch explodes in size. */
  /* instr = (opr << 26) | (datadr1 << 13) | datadr2; /* 63:26:13,or 255:24:12 */
  /* So instead, just multiply: */
  /* instr = ((unsigned long) (67108864 * opr)) + ((unsigned long) (8192 * datadr1)) + ((unsigned long) datadr2); */
  xx = opr & 63;
  yy = datadr1 & 8191;
  zz = datadr2 & 8191;
  instr = (xx << 26) | (yy << 13) | zz;
  
  EEPROM.put((INSTRUCTION_BYTE_LENGTH * (cmdadr - 0)) + ZERO_OFFSET, instr);
  // EEPROM.commit();

  /* Show again the user what was ordered, remind of possible correction. */
  /* First, print the address and the instruction. */
  /* Correction will only be possible if it is not for immediate execution. */
  if (cmdadr < 1000) { client.print(F("0")); } /* "leading zeroes" */
  if (cmdadr < 100) { client.print(F("0")); }
  if (cmdadr < 10) { client.print(F("0")); }
  client.print(cmdadr);
  client.print(F(" "));
  opr = (instr >> 26) & 63; //-----------------------------------------------------------------------------------------------------------------
  printopr();

  /* Then, print the data addresses and the numbers these point to, and, */
  /* finally, the POSSIBLE numbers in turn these point to. */
  /* If no data has been entered "batch wise" manually, these will */
  /* all be zero. But if data has been entered manually, this may help the */
  /* user to keep track whether the program is being setup as is supposed. */
  /* Obviously, particularly each third number will often be meaningless, */
  /* unless the specific instruction really relates that far */
  if (datadr1 < 1000) { client.print(F("0")); } /* "leading zeroes" */
  if (datadr1 < 100) { client.print(F("0")); }
  if (datadr1 < 10) { client.print(F("0")); }
  datadr1 = (instr >> 13) & 8191; //-------------------------------------------------------------------------------------------------------------
  client.print(datadr1);
  client.print(F(">"));
  client.print(static_cast<double>(datum[datadr1]), 8); 
  /* scientific, big E, sign */
  /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

  if ((datum[datadr1] > -1 * DATAMEM) && (datum[datadr1] < DATAMEM)) {
    j = abs(round(datum[datadr1]));
    client.print(F(">"));
    client.print(static_cast<double>(datum[j]), 8); 
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
  }
  client.print(F(" "));

  if (datadr2 < 1000) { client.print(F("0")); } /* "leading zeroes" */
  if (datadr2 < 100) { client.print(F("0")); }
  if (datadr2 < 10) { client.print(F("0")); }
  datadr2 = instr & 8191; // -------------------------------------------------------------------------------------------------------------------
  client.print(datadr2);
  client.print(F(">"));
  client.print(static_cast<double>(datum[datadr2]), 8); 
  /* scientific, big E, sign */
  /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

  if ((datum[datadr2] > -1 * DATAMEM) && (datum[datadr2] < DATAMEM)) {
    j = abs(round(datum[datadr2]));
    client.print(F(">"));
    client.print(static_cast<double>(datum[j]), 8); 
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
  }
  client.print(F("\r\n"));;

if (cmdadr == 0) {
    break; /* Go execute the command and return, unless it is a jump: */
           /* a jump does not necessarily return, unless the execution */
           /* either reaches the end of the instruction space - */
           /* which it totally may without encountering any error, */
           /* given that 0 is "no operation" and the memory is filled */
           /* with it at the beginning - or the execution encounters */
           /* a jump back to command address 0. Such jumps may indeed */
           /* be used to "partition" the execution space into */
           /* "different programs" if desired, which are separated from */
           /* each other by "forced returns". In the immediate interpreter, */
           /* the user may then decide which "entry point" to jump to */
           /* in order to trigger execution at the desired section. */
  }

} else if (cmdadr == -1) {
  /* LIST INSTRUCTION RANGE */
  /* Give an output of the entered instructions between two addresses, */
  /* these addresses considered inclusive. Like "LIST" in BASIC, */
  /* to "let you see what you did" or "what you are about to run". */

  client.print(F("LIST INSTRUCTIONS"));
  client.print(F("\r\n"));
  client.print(F("1ST CMD ADR: "));
  datadr1 = readlong();
  /* atof and atoi due to lack of scanf */
  client.print(F("2ND CMD ADR: "));

  datadr2 = readlong();
  /* atof and atoi due to lack of scanf */

  /* To save to time, if the listing is undesired, the user may */
  /* terminate this by giving any negative address. */
  if ((datadr1 < 0) || (datadr2 < 0)) { break; } /* fast eject */

  /* If both addresses are 0, this is a shorthand for "print everything" */
  if ((datadr1 == 0) && (datadr2 == 0)) {
    datadr1 = 1;
    datadr2 = EXECMEM - 1;
  } else if (datadr2 == 0) {
    /* A zero in the second address means "simply print one instruction" */
    datadr2 = datadr1;
  }

  /* Normalise ranges: always print low to high */
  if (datadr2 < datadr1) {
    k = datadr2;
    datadr2 = datadr1;
    datadr1 = k;
  }

  h = datadr1;
  k = datadr2;
  if (h < 1) { h = 1;}
  /* Don't print the "immediate execution" address. */
  /* This should remind the user that this address is special, */
  /* and that it should not be relied on for program execution. */

  /* Moreover, help the user if an out-of-range-address has been given. */
  if (k >= EXECMEM) { k = EXECMEM - 1; }

  client.print(F("INSTRUCTIONS:"));
  client.print(F("\r\n"));
  for (i = h; i <= k; i++) { yield();
    EEPROM.get((INSTRUCTION_BYTE_LENGTH * (i - 0)) + ZERO_OFFSET, instr);
    xx = (instr >> 26) & 63; /* 4095:255:24:12 or 8191:63:26:13 */
    yy = (instr >> 13) & 8191;
    zz = instr & 8191;
    opr = xx;
    datadr1 = yy;
    datadr2 = zz;

    if (i < 1000) { client.print(F("0")); } /* "leading zeroes" */
    if (i < 100) { client.print(F("0")); }
    if (i < 10) { client.print(F("0")); }
    client.print(i);
    client.print(F(" "));
    if (opr < 10) { client.print(F("0")); }
    client.print(opr);
    client.print(F("="));
    printopr();

    if (datadr1 < 1000) { client.print(F("0")); } /* "leading zeroes". */
    if (datadr1 < 100) { client.print(F("0")); }
    if (datadr1 < 10) { client.print(F("0")); }
    client.print(datadr1);
    client.print(F(">"));
    client.print(static_cast<double>(datum[datadr1]), 8); 
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

    if ((datum[datadr1] > -1 * DATAMEM) && (datum[datadr1] < DATAMEM)) {
      j = abs(round(datum[datadr1]));
      client.print(F(">"));
      client.print(static_cast<double>(datum[j]), 8); 
      /* scientific, big E, sign */
      /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
    }
    client.print(F(" "));

    if (datadr2 < 1000) { client.print(F("0")); } /* "leading zeroes" */
    if (datadr2 < 100) { client.print(F("0")); }
    if (datadr2 < 10) { client.print(F("0")); }
    client.print(datadr2);
    client.print(F(">"));
    client.print(static_cast<double>(datum[datadr2]), 8); 
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

    if ((datum[datadr2] > -1 * DATAMEM) && (datum[datadr2] < DATAMEM)) {
      j = abs(round(datum[datadr2]));
      client.print(F(">"));
      client.print(static_cast<double>(datum[j]), 8); 
      /* scientific, big E, sign */
      /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
    }
    client.print(F("\r\n"));;

    client.print(F("DECIMAL REPRESENTATION: "));
    client.print(instr);
    client.print(F("\r\n"));

  } /* End of the instruction print. */

  /* Always zero out h & k, they have a special meaning otherwise: */
  /* they signal that datadr1 and datadr2 should be replaced by them */
  /* in the next instruction. */
  h = 0;
  k = 0;

  j = 0;
  i = 0;

} else if (cmdadr == -2) {
  /* LIST DATA RANGE */
  /* Same as above, just this time, for data, not instructions. */
  /* Listing data is simpler, just the numbers are given */
  /* - without the pointer interpretation attempted above. */

  client.print(F("LIST DATA"));
  client.print(F("\r\n"));
  client.print(F("1ST ADR: "));
  datadr1 = readlong();
  client.print(F("2ND ADR: "));
  datadr2 = readlong();
  if ((datadr1 < 0) || (datadr2 < 0)) { break; } /* fast eject */

  if ((datadr1 == 0) && (datadr2 == 0)) {
    /* print EVERYTHING */
    datadr1 = 1;
    datadr2 = DATAMEM - 1;
  } else if (datadr2 == 0) {
    datadr2 = datadr1;
  }

  /* Normalise ranges: low to high */
  if (datadr2 < datadr1) {
    k = datadr2;
    datadr2 = datadr1;
    datadr1 = k;
  }

  h = datadr1;
  k = datadr2;
  if (h < 1) { h = 1;} /* Do not print datum[0], it is reserved. */
  if (h >= DATAMEM - 5) { h = DATAMEM - 6; } /* correct maximum range */
  if (k >= DATAMEM - 5) { k = DATAMEM - 6; } /* correct maximum range */

  client.print(F("DATA:"));
  client.print(F("\r\n"));
  for (i = h; i <= k; i = i + 2) { /* Print as many as the terminal allows. */
    if (i < 1000) { client.print(F("0")); } /* "leading zeroes" */
    if (i < 100) { client.print(F("0")); }
    if (i < 10) { client.print(F("0")); }
    client.print(i);
    client.print(F(" "));
    client.print(static_cast<double>(datum[i]), 8); 
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
    client.print(F(" "));
    client.print(static_cast<double>(datum[i+1]), 8);
    client.print(F("\r\n"));
  }

  /* As always, zero out h & k, to not trigger data address replacement */
  /* in the next instruction. */
  h = 0;
  k = 0;
  i = 0;

} else if (cmdadr == -3) {
  /* ENTER INSTRUCTIONS AS NUMBERS, UNTIL YOU SUBMIT A NEGATIVE INSTRUCTION */

  /* It may happen, e.g. due to a print-out, that you already KNOW what */
  /* decimal numbers the entire instructions will have, and that you */
  /* want to enter them quickly. This is possible by this interaction. */
  /* A negative instruction is impossible and terminates this interaction. */
  /* In other words, this range is "flexible" - enter as many as you wish. */
  /* The flexibility may be needed in case you want to enter a few 0s */
  /* - i.e. "no operation". */

  client.print(F("ENTER FULL INSTRUCTIONS AS DECIMALS, 67108863 TO END"));
  client.print(F("\r\n"));
  client.print(F("START ADR: "));
  cmdadr = readlong(); /* From here upwards you enter instructions. */
  if (cmdadr < 0) { break; } /* fast eject */
  while (cmdadr < EXECMEM) {
    yield();
    if (pc < 1000) { client.print(F("0")); } /* "Leading zeroes. */
    if (pc < 100) { client.print(F("0")); }
    if (pc < 10) { client.print(F("0")); }
    client.print(cmdadr);
    client.print(": INSTRUCTION: ");
    instr = readunsignedlong();

    if (instr == 67108863) { /* eject at NOP 8191 8191 */
      break;
    } else {
      EEPROM.put((INSTRUCTION_BYTE_LENGTH * (cmdadr - 0)) + ZERO_OFFSET, instr);
      // EEPROM.commit();
    }
    cmdadr++;
  }

} else if (cmdadr == -4) {
  /* ENTER DATA AS FLOATS WITHIN A PRE-SPECIFIED RANGE */
  /* Same as above, just this time, you enter data. */
  /* What is different: obviously, negative numbers are totally allowed. */
  /* So this time, the range is not flexible, but determined by two limits. */

  client.print(F("ENTER DATA FLOATS"));
  client.print(F("\r\n"));
  client.print(F("1ST ADR: "));
  datadr1 = readlong();
  client.print(F("2ND ADR: "));
  datadr2 = readlong();
  if ((datadr1 < 0) || (datadr2 < 0) || (datadr2 < datadr1)) { break; }
  /* fast eject - and ONLY here; below, you are expected to give data */

  while (datadr1 <= datadr2) {
    yield();
    if (datadr1 < 1000) { client.print(F("0")); } /* "Formatting with leading zeroes". */
    if (datadr1 < 100) { client.print(F("0")); }
    if (datadr1 < 10) { client.print(F("0")); }
    client.print(datadr1);
    client.print(F(": DATUM: "));

    f = readdouble();
    client.print(static_cast<double>(f), 8); 
    client.print(F("\r\n"));;
    client.flush();
    
    datum[datadr1] = f;
    datadr1++;
  }

} else if (cmdadr == -5) {
  /* CLEAR INSTRUCTION RANGE */
  /* Simply erase to zero an entire section of program space, i.e. to */
  /* "no operation". */

  client.print(F("CLEAR INSTRUCTION RANGE"));
  client.print(F("\r\n"));
  client.print(F("1ST CMD ADR: "));
  datadr1 = readlong();
  client.print(F("2ND CMD ADR: "));
  datadr2 = readlong();
  if ((datadr1 < 0) || (datadr2 < 0)) { break; } /* fast eject */

  if ((datadr1 == 0) && (datadr2 == 0)) {
    /* clear EVERYTHING */
    datadr1 = 1;
    datadr2 = DATAMEM - 1;
  } else if (datadr2 == 0) {
    datadr2 = datadr1; /* clear one single instruction */
  }

  /* Normalise ranges: low to high */
  if (datadr2 < datadr1) {
    k = datadr2;
    datadr2 = datadr1;
    datadr1 = k;
  }

  h = datadr1;
  k = datadr2;
  if (h < 1) { h = 1;} /* Do not clear address 0, it is reserved. */
  if (k >= EXECMEM) { k = EXECMEM - 1; } /* out-of-range-correction */

  instr = 0; /* Just to make sure it "understands" the size as 32bit. */
  for (i = h; i <= k; i++) { yield();
    EEPROM.put((INSTRUCTION_BYTE_LENGTH * (i - 0)) + ZERO_OFFSET, instr);
    // EEPROM.commit();
  }
  client.print(F("INSTRUCTIONS CLEARED"));
  client.print(F("\r\n"));

  h = 0;
  k = 0;
  i = 0;

} else if (cmdadr == -6) {
  /* CLEAR DATA RANGE */
  /* Same idea as above, just clear data (set to 0.0), not instructions. */

  client.print(F("CLEAR DATA RANGE"));
  client.print(F("\r\n"));
  client.print(F("1ST ADR: "));
  datadr1 = readlong();
  client.print(F("2ND ADR: "));
  datadr2 = readlong();
  if ((datadr1 < 0) || (datadr2 < 0)) { break; } /* fast eject */

  if ((datadr1 == 0) && (datadr2 == 0)) {
    /* clear EVERYTHING */
    datadr1 = 1;
    datadr2 = DATAMEM - 1;
  } else if (datadr2 == 0) {
    datadr2 = datadr1; /* i.e. clear only one datum */
  }

  /* Normalise ranges: low to high */
  if (datadr2 < datadr1) {
    k = datadr2;
    datadr2 = datadr1;
    datadr1 = k;
  }

  h = datadr1;
  k = datadr2;
  if (h < 1) { h = 1;}
  if (k >= DATAMEM) { k = DATAMEM - 1; }

  for (i = h; i <= k; i++) { yield();
    datum[i] = 0.0;
  }
  client.print(F("DATA CLEARED"));
  client.print(F("\r\n"));

  h = 0;
  k = 0;
  i = 0;

} else if (cmdadr == -7) {
  /* TRACING: show - or do not - which command is executed, */
  /* as the program runs. */
  client.print(F("TRACE ON"));
  client.print(F("\r\n"));
  tracer = 1;
} else if (cmdadr == -8) {
  client.print(F("TRACE OFF"));
  client.print(F("\r\n"));
  tracer = 0;
} else if (cmdadr == -9) {
  client.print(F("SET RUNLIMIT, UP TO 32767, 0=INFINITE, TERMINATING WHEN 1: "));
  runlimit = readlong();
} else if (cmdadr == -10) {
  /* OMITTED, NOT SENSIBLE - YOU CANNOT "EXIT" TO ANYWHERE. */

} /* end of command selection */

} /* end of setup and maintenance */







/* DEBUG */
/*

xx = (instr >> 26) & 63;
yy = (instr >> 13) & 8191;
zz = instr & 8191;

client.print("Mid-air: instr=");
client.print(instr);
client.print(" EEPROMLONG[0]=");
EEPROM.get(ZERO_OFFSET, p);
client.print(p);
client.print(" xx=");
client.print(xx);
client.print(" yy=");
client.print(yy);
client.print(" zz=");
client.print(zz);
client.print(" oprBefore=");
client.print(opr);
client.print(" d1Before=");
client.print(datadr1);
client.print(" d2Before=");
client.print(datadr2);
client.print(F("\r\n"));;


opr = xx;
datadr1 = yy;
datadr2 = zz;
*/







/* EEPROM committed in mid-air - balance between "wear" and "safety" */
EEPROM.commit();


/* ----------------------- COMMAND EXECUTION PHASE ----------------------- */
/* All sails are set and you are now in the hands of Fate. The REPL has */
/* been exited, and whatever the Program Counter pc encounters is what */
/* shall be executed. If you enter into an infinite loop - tough luck! */
/* Actually, due to runlimit it should be not so bad now, either... */

/* As described, all commands are defined by an opcode operating on two */
/* addresses, whereby the first one also, generally, bears the result and */
/* is, roughly speaking, "more important". Often, the second address may be */
/* set to 0 as a short hand to signify that it does not matter. */


while (pc < EXECMEM) {
  yield();
  if (runlimit == 1) {
    client.print(F("RUN EXHAUSTED PC="));
    client.print(pc);
    client.print(F("STOPPED"));
    client.print(F("\r\n"));;
    break; /* ejection if the runlimit is over, pc printed for re-entry */
  } else if (runlimit > 1) {
    runlimit--;
    if (((runlimit - 1) % 100) == 0) {
      client.print(F("RUNLIMIT = "));
      client.print(runlimit);
      client.print(F("\r\n"));;

      /* Give an indication of progress without annoying too often. */
    }
  } /* and do nothing if runlimit is 0. */

  /* Arduino: some sort of interruption due to reading the serial port */
  /* here would be desirable, for instance when reading "***".*/
  /* Either *** or ### are desirable, as they are similar to +++ */
  /* in modems, and moreover, are likely available on a mobile phone - */
  /* should this system ever be ported to a Java midlet. */
  /* .... Not necessary any more, since I implemented the run limit. */

  /* safety: erase the reserved datum[0]. */
  /* Do NOT erase here instruction[0], or you will prevent all execution: */
  /* whatever was there to be executed, would be annihilated! */
  datum[0] = 0.0; /* Useful for unconditional jumps. */

  if (pc < 0) {
    pc = 0;
  }

  EEPROM.get((INSTRUCTION_BYTE_LENGTH * (pc - 0)) + ZERO_OFFSET, instr);

  /* 63 operations possible, on 8191 places of data for each address; 26,13 */
  /* or: 255 operations, on 4095 data places for each address; 24,12 */
  xx = (instr >> 26) & 63;
  yy = (instr >> 13) & 8191;
  zz = instr & 8191;

  opr = xx;
  datadr1 = yy;
  datadr2 = zz;

  /* Is an instruction modifier active? If yes, change each dataddr. */
  /* This is due to IADR, indirect addressing, see below opcode 2. */
  if ((h > 0) && (k > 0)) {
    datadr1 = h;
    datadr2 = k;
    h = 0;
    k = 0;
  }

  /* DUBUG */ /*
  client.print("h=");
  client.print(h);
  client.print(" k=");
  client.print(k);
  client.print(" opr=");
  client.print(opr);
  client.print(" d1=");
  client.print(datadr1);
  client.print(" d2=");
  client.print(datadr2);
  client.print(" pc=");
  client.print(pc);
  client.print(F("\r\n"));; */

  /* TRACE EXECUTION OF EACH PRESENT INSTRUCTION */
  /* This is actually rather similar to "LIST INSTRUCTION RANGE", */
  /* only now, not a "range" is listed, but each instruction as it is */
  /* readied for execution. The tracer must be set for this to happen, */
  /* as it will likely impact speed - particularly on Arduino, this may */
  /* involve printing delays to a terminal - and will generate A LOT */
  /* of output. */
  if (tracer != 0) {
  /* Arduino should get delays here, due to printing. */

    if (pc < 1000) { client.print(F("0")); } /* "Leading zeroes. */
    if (pc < 100) { client.print(F("0")); }
    if (pc < 10) { client.print(F("0")); }
    client.print(pc);
    client.print(F(" "));
    // if (cmdadr < 100) { client.print(F("0")); } /* if >99 instr. */
    if (cmdadr < 10) { client.print(F("0")); }
    client.print(opr);
    client.print(F("="));
    printopr();


    if (datadr1 < 1000) { client.print(F("0")); } /* "leading zeroes" */
    if (datadr1 < 100) { client.print(F("0")); }
    if (datadr1 < 10) { client.print(F("0")); }
    client.print(datadr1);
    client.print(F(">"));
    client.print(static_cast<double>(datum[datadr1]), 8);
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

    if ((datum[datadr1] > -1 * DATAMEM) && (datum[datadr1] < DATAMEM)) {
      j = abs(round(datum[datadr1]));
      client.print(F(">"));
      client.print(static_cast<double>(datum[j]), 8); 
      /* scientific, big E, sign */
      /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
    }
    client.print(F(" "));

    if (datadr2 < 1000) { client.print(F("0")); } /* "leading zeroes" */
    if (datadr2 < 100) { client.print(F("0")); }
    if (datadr2 < 10) { client.print(F("0")); }
    client.print(datadr2);
    client.print(F(">"));

    client.print(static_cast<double>(datum[datadr2]), 8);
    /* scientific, big E, sign */
    /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */

    if ((datum[datadr2] > -1 * DATAMEM) && (datum[datadr2] < DATAMEM)) {
      j = abs(round(datum[datadr2]));
      client.print(F(">"));
      client.print(static_cast<double>(datum[j]), 8); 
      /* scientific, big E, sign */
      /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
    }
    client.print(F("\r\n"));;


    i = 0;
  } /* end of instruction tracing */

  /* ---------- DECODE ---------- */
  /* Quite simply: "do different things depending on what operation (opr) */
  /* is presently indicated by the program counter (pc). */
  /* There are two instructions which deal with program CONTROL, and */
  /* all other instructions deal with reading, writing and storing values */
  /* as well as with mathematical operations, which are indeed the focus. */
  /* The one is to jump if at a certain address the value is (close to) */
  /* zero or negative - and this is the ONLY branch instruction, and thus */
  /* loops are to be implemented by "jumping backwards" and "reducing the */
  /* addressed value" - and the other instruction sets datadr1 and datadr2 */
  /* to be overwritten by certain values upon the next instruction; this */
  /* should allow rather flexible programming. - This section "DECODE" it */
  /* is where you may really adjust this whole system to your taste: */
  /* shuffle opr-values, reduce or extend or modify the instructions, etc. */

  /* WHATEVER IS NOT MATCHED: NO OPERATION [NOP] / RESERVED */
  /* This particularly applies to "Operation 0", so all starts with 1. */

/* DEBUG */
/*   client.print("Entering decoder.");
     client.print(F("\r\n")); */

  if (opr == 0) {
  /* NOOP -- NO OPERATION: Do nothing. */
  /* Any non-implemented opcode will work as NOP. */
  /* This is also nice if you want to temporarily de-activate certain code. */

  } else if (opr == 1) {
  /* JUMP */
  /* JUMP IF THE FIRST ADR CONTAINS (NEARLY) ZERO OR A NEGATIVE NUMBER*/
  /* "Nearly" zero, because these are floats and repeated float operations */
  /* may render the results imprecise. */
  /* This can very neatly be translated into a high language's IF & WHILE. */
  /* Anyway, welcome to "spaghetti programming". You will use this sole */
  /* condition until you learn to LOVE IT! */

    if (datum[datadr1] <= TOLERANCE) {
      /* pc = abs(round(datum[datadr2])); */ /* However, such a default is */
      /* NOT a good idea, actually: with a default COMPUTED GOTO, you */
      /* normally straight GOTO HELL, and have NO adequate way to trace it. */
      /* Instead, let the default be OBVIOUS: */

      pc = datadr2; 
      /* On purpose NOT "computed", but IADR still allows it. */
      /* BEWARE: the program counter adjustment below needed to be RESET, */
      /* otherwise it was sending you ONE AFTER your desired jump address! */
    } else { pc++; } /* without this, it gets stuck! */
    /* This pc adjustment above makes jumps NOT return to immediate mode: */
    /* pc is set to, essentially, an integer indicated by the float value */
    /* at an address. But a return to immediate mode is only possible if */
    /* pc stays 0. This is why a jump can serve as an "entry" to exection. */

  } else if (opr == 2) {
  /* IADR -- INDIRECT ADRING: */
  /* SUBSTITUTE datadr1 AND datadr2 IN THE NEXT INSTRUCTION BY h AND k. */
  /* Whatever the next operation is, datum[datadr1] shall give */
  /* the next datadr1, and datum[datadr2] shall give the next datadr2. */
  /* This shall serve for a rather powerful "indirect addressing" */
  /* whenever such is needed, in a flexible manner. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    /* Thereby, h & k are "charged" and will trigger a modification of */
    /* the next instruction, substituting its addresses one time. */
    /* You can obviously cancel this with a NOP. */

    /* Make sure the addresses are within the allowed address range. */
    if (h < 1) {
      h = 1;
    }

    if (k < 1) {
      k = 1;
    }

    if (h >= DATAMEM) {
      h = DATAMEM - 1;
    }

    if (k >= DATAMEM) {
      k = DATAMEM - 1;
    }

  /* ----------- FROM NOW ON FOLLOW COMMANDS FOR SETTING VALUES ----------- */
  } else if (opr == 3) {
  /* OUTP -- write 0 for OUTPUT if you have a numeric display. */
  /* This instruction will print all data in a range, unless the second */
  /* address is seither the same as the first address or 0, indicating */
  /* that only the first address is to be printed. */

    client.print(F("DATA RANGE "));
    client.print(datadr1);
    client.print(F(" TO "));
    client.print(datadr2);
    client.print(F("\r\n"));;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
      f = datum[datadr1];
      client.print(F("OUTPUT: ADR="));
      if (datadr1 < 1000) { client.print(F("0")); } /* "leading zeroes" */
      if (datadr1 < 100) { client.print(F("0")); }
      if (datadr1 < 10) { client.print(F("0")); }
      client.print(datadr1);
      client.print(F(" DATUM="));
        client.print(static_cast<double>(f), 8);
      /* scientific, big E, sign */
      /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
      client.print(F("\r\n"));;

    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        f = datum[i];
        client.print(F("OUTPUT: ADR="));
        if (i < 1000) { client.print(F("0")); } /* "leading zeroes" */
        if (i < 100) { client.print(F("0")); }
        if (i < 10) { client.print(F("0")); }
        client.print(i);
        client.print(F(" DATUM="));
        client.print(static_cast<double>(f), 8);
        /* scientific, big E, sign */
        /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
        client.print(F("\r\n"));;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        f = datum[i];
        client.print(F("OUTPUT: ADR="));
        if (i < 1000) { client.print(F("0")); } /* "leading zeroes" */
        if (i < 100) { client.print(F("0")); }
        if (i < 10) { client.print(F("0")); }
        client.print(i);
        client.print(F(" DATUM="));
        client.print(static_cast<double>(f), 8);
        /* scientific, big E, sign */
        /* 4: E, not e, 1: plus or space, 2: of these plus and not space. */
        client.print(F("\r\n"));;
      }
    }

  } else if (opr == 4) {
  /* INPT -- write 1 for INPUT if you have a numeric display. */
  /* This instruction will read a range of numbers, unless */
  /* the second address is the same as the first address or 0, */
  /* indicating that only a single number is to be read. */

    client.print(F("DATA INPUT INTO RANGE "));
    client.print(datadr1);
    client.print(F(" TO "));
    client.print(datadr2);
    client.print(F("\r\n"));;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
      client.print(F("INPUT:  ADR="));
      client.print(datadr1);
      client.print(F(" DATUM="));

      f = readdouble();
      client.print(static_cast<double>(f), 8);
      client.print(F("\r\n"));;
      client.flush();
      
      datum[datadr1] = f;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        client.print(F("INPUT:  ADR="));
        client.print(i);
        client.print(F(" DATUM="));
        
        f = readdouble();
        client.print(static_cast<double>(f), 8);
        client.print(F("\r\n"));;
        client.flush();
        
        datum[i] = f;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        client.print(F("INPUT:  ADR="));
        client.print(i);
        client.print(F(" DATUM="));
        
        f = readdouble();
        client.print(static_cast<double>(f), 8);
        client.print(F("\r\n"));;
        client.flush();
        
        datum[i] = f;
      }
    }

  } else if (opr == 5) {
  /* SADR -- SET ADR AS VALUE: */
  /* This can also used to let an address be treated as a value in some */
  /* future instruction - IADR (opcode 2) can help reversing the process. */
    /* DEBUG */ /*
    client.print("Entered SADR");
    client.print(F("\r\n"));
    client.flush(); */

    datum[datadr1] = 0.0 + datadr2;
    /* obviously, if datadr2 == datadr1, this will make an address */
    /* "hold itself" */

  } else if (opr == 6) {
  /* SVAL -- SET VALUE: This is the "normal 'equal'" in other languages. */
  /* Did not call it EQUL or thelike, to help visually differentiate */
  /* values and addresses. */
    datum[datadr1] = datum[datadr2];

  } else if (opr == 7) {
  /* HOW IxAS WORKS: */
  /* datadr1 contains an address X, i.e. it points to it; */
  /* X is at first expressed as a float to be converted to an integer. */
  /* datum[X] shall either be set to an address or a value that is defined */
  /* in datadr2, i.e. datadr2 itself or the datum at datadr2, respectively. */
  /* In other words, datum[datum[datadr1]] = datadr2, from now on */
  /* Indirect Address Assignment or IAAS, or Indirect Value Assignemnt */
  /* IVAS signifying datum[datum[datadr1]] = datum[datadr2]. These may look */
  /* pretty strange, but they appeared practical for certain loops. */ 

  /* IAAS */
    i = abs(round(datum[datadr1]));
    datum[i] = 0.0 + datadr2;

  } else if (opr == 8) {
  /* IVAS -- see above. */

    i = abs(round(datum[datadr1]));
    datum[i] = datum[datadr2];

  /* ---- FROM NOW ON FOLLOW COMMANDS FOR SINGLE NUMERIC MANIPULATION ----- */
  } else if (opr == 9) {
  /* PLUS -- PLUS FOR SINGLE NUMBERS, NOT RANGE. */

    datum[datadr1] = datum[datadr1] + datum[datadr2];

  } else if (opr == 10) {
  /* MINS -- MINUS FOR SINGLE NUMBERS, NOT RANGE. */

    datum[datadr1] = datum[datadr1] - datum[datadr2];

  } else if (opr == 11) {
  /* MULS -- MULTIPLY SINGLE NUMBERS, NOT RANGE. */

    datum[datadr1] = datum[datadr1] * datum[datadr2];

  } else if (opr == 12) {
  /* DIVS -- DIVIDE SINGLE NUMBERS, NOT RANGE. */
  /* In case of a division by 0, there shall be no hysteria. Just give 0. */
  /* This makes loops much easier than "having to look out for the */
  /* mathematical booby-trap" all the time. Here this is done GENERALLY. */

    if (fabs(datum[datadr2]) != 0.0) {
      datum[datadr1] = datum[datadr1] / datum[datadr2];
    } else {
      datum[datadr1] = 0.0;
    }

  } else if (opr == 13) {
  /* POXY -- Power Of X: Y, that is, X ^ Y, BASED ON |X| WITH SIGN EX POST. */
  /* This is a rather powerful instruction, because 1/Y is the Yth root */
  /* (so Y = 0.5 is a square root, Y= 0.3333 is a cube root, and so on),
  /* Y = -1 sets X to 1/X, and so forth. - All this operates on the */
  /* ABSOLUTE VALUE OF X, and preserving the sign, to prevent imaginary */
  /* number results. Unfortunately, this has the funny effect that -3^2=-9. */

    /* A ^ B =  E ^ (B * ln(A)), but that is not even necessary due to pow. */
    if (datum[datadr1] == 0.0) {
      datum[datadr1] = 0.0;
      /* Wanton value because it is undefined for negative exponents */
      /* and for positive exponents, 0^whatever=0. */
    } else if (datum[datadr1] < 0.0) {
      datum[datadr1] = -1.0 * pow(fabs(datum[datadr1]), datum[datadr2]);
    } else {
      datum[datadr1] = pow(datum[datadr1], datum[datadr2]);
    }

  } else if (opr == 14) {
  /* LOXY -- LogY X, i.e. of X to the base of Y. X needs not be an integer. */
  /* This is based on the effect of loga (b) = ln (b) / ln (a), */
  /* b is in datadr1, a is in datadr2, and both are forced to be positive. */
  /* If any of the two numbers is 0.0, the result is set to be 0.0, too. */
    if ((abs (datum[datadr1]) != 0) && (abs (datum[datadr2]) != 0)) {
      datum[datadr1] = log(fabs(datum[datadr1])) / log(fabs(datum[datadr2]));
    } else {
      datum[datadr1] = 0.0;
    }

  } else if (opr == 15) {
  /* IFRA -- Integral and Fractional part of a number stored in datadr1. */
    datum[datadr2] = modf(datum[datadr1], &g); /* the fractional part */
    datum[datadr1] = g; /* the integral part */
    /* If you set datadr2 to be 0, you will thus turn a float to an int. */

  } else if (opr == 16) {
  /* REMN -- Remainer of the division between datum[datadr1] and */
  /* datum[datadr2], whereby 0 is assumed in case of division by 0. */

    if (fabs(datum[datadr2]) != 0.0) {
      datum[datadr1] = fmod(datum[datadr1], datum[datadr2]);
    } else {
      datum[datadr1] = 0.0;
    }

  } else if (opr == 17) {
  /* NEXT THREE INSTRUCTIONS: PERCENT CALCULATIONS OVER TIME. */
  /* Each instruction is named for what is SOUGHT: */
  /* amount, period or percentage, assuming that */
  /* amount = (1 + (percentage / 100)) ^ period. */

  /* AMNT -- Find the amount, whereby */
  /* datadr1 contains the periods */
  /* datadr2 contains the percent (not as, say, 0.25, but as 25). */

    f = datum[datadr1];
    g = datum[datadr2];
    g = pow(1 + (g / 100), f);
    datum[datadr1] = g;
    /* you overwrite the period, but keep the percent untouched */
    f = 0.0;
    g = 0.0;

  } else if (opr == 18) {
  /* PERD -- Find the period, whereby */
  /* datadr1 contains the final amount */
  /* datadr2 contains the percent. */

    f = datum[datadr1];
    g = datum[datadr2];
    g = (1 + (g / 100));
    g = log(g);
    f = log(f);
    g = f / g;
    datum[datadr1] = g;
    /* you overwrite the final amount, but keep the percent untouched */
    f = 0.0;
    g = 0.0;

  } else if (opr == 19) {
  /* PCNT -- Find the percent, whereby */
  /* datadr1 contains the final amount */
  /* datadr2 contains the period */

    f = datum[datadr1];
    g = datum[datadr2];
    g = 1/g;
    g = 100 * (pow(f, g) - 1);
    datum[datadr1] = g;
    /* you overwrite the final amount, but keep the period untouched */
    f = 0.0;
    g = 0.0;

  } else if (opr == 20) {
  /* SWAP -- Swap two numbers. While trivial, it is annoying to novices. */
  /* Mentally, you have to consider a third number or an idiotic trick, */
  /* none of which is beneficial to "not getting interrupted" and focusing. */
  /* So there is now an extra instruction for that. */

    f = datum[datadr2];
    datum[datadr2] = datum[datadr1];
    datum[datadr1] = f;

  } else if (opr == 21) {
  /* FACT -- Factorial of the SECOND number, i.e. of datum[datadr2]. */
  /* The factorial of the second number ends up in the FIRST location. */
  /* This is not a "self-modifying-data" command, because the factorial */
  /* easily gets out of range, in which case the program gives zero. */
  /* Force numbers to be positive. */

    j = abs(round(datum[datadr2]));
    if (j < 2) {
      datum[datadr1] = 1.0;
    } else if (j > 34) {
      datum[datadr1] = 0.0; /* signalling you messed it up */
    } else {
      f = 1.0;
      for (i = 1; i <= j; i++) { yield();
        f = f * i;
      }
      datum[datadr1] = f;
    }

  /* ---- FROM NOW ON FOLLOW COMMANDS FOR NUMERIC RANGE MANIPULATION ------ */
  /* Many of these actually have single-number application facilities, too. */

  } else if (opr == 22) {
  /* COPY -- COPY ADR RANGE: */
  /* Copy INTO the range between datadr1 and datadr2, both inclusive, */
  /* the other range whose beginning and ending addresses are indicated */
  /* upon call within the address datadr1 and the address datadr2. */
  /* Clearly, this overwrites, too, the addresses originally stored in */
  /* datadr1 and datadr2 at the call of the instruction. */
  /* If the ranges are of unequal length, copy revolvingly or partially. */
  /* Normally, first the low address, then the high addresses should be */
  /* given - otherwise, assume a reversal of the range is desired. */

  /* val is the source, adr is the destination - and will be OVERWRITTEN. */
  /* Hence parameters can be placed under the destination-range */

  /* adr1(val1) (low) adr2(val2) (high) is the "default" */

    /* Determine the SOURCE range h & k that shall be copied into */
    /* datadr1 and datadr2. (You CAN operate here with h & k, because IADR */
    /* would have taken effect ALREADY, should it have been issued. */
    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));

    /* Keep them within the allowed range. */
    if (h >= DATAMEM) {
      h = DATAMEM - 1;
    }
    if (k >= DATAMEM) {
      k = DATAMEM - 1;
    }

    j = h;
    if (datadr2 == datadr1) {
      /* Then only one number is to be copied. */
      datum[datadr1] = datum[h];
      /* i.e. datum[datadr1] = datum[datum[datadr1]] */
    } else if (h == k) { /* then fill: */
      /* You can use this to initialise a range to a value. */
      f = datum[h];
      if (datadr2 > datadr1) {
        for (i = datadr1; i <= datadr2; i++) { yield();
          datum[i] = f;
        }
      } else {
        for (i = datadr2; i <= datadr1; i++) { yield();
          datum[i] = f;
        }
      }
    } else if ((datadr2 > datadr1) && (k > h)) {
      /* The "normal" case - make it revolving instead of "cutting" it. */
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[j];
        j++;
        if (j > k) {
          j = h;
        }
      }
    } else if ((datadr2 < datadr1) && (k < h))  {
      /* The countdown case - here, the revolutions may fill differently. */
      for (i = datadr1; i >= datadr2; i--) {
        datum[i] = datum[j];
        j--;
        if (j < k) {
          j = h;
        }
      }
    } else if ((datadr2 < datadr1) && (k > h)) {
      /* this and the next will "reverse" a range of equal size */
      /* they really only differ in how they would handle revolutions */
      for (i = datadr1; i >= datadr2; i--) {
        datum[i] = datum[j];
        j++;
        if (j > k) {
          j = h;
        }
      }
    } else if ((datadr2 > datadr1) && (k < h)) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[j];
        j--;
        if (j < k) {
          j = h;
        }
      }

    }
    h = 0;
    k = 0;

  } else if (opr == 23) {
  /* FRIS -- FILL RANGE FROM INITIAL-VALUE BY STEP */
  /* This is like looping a[n + 1] = a[n] + x.*/
  /* datadr1 and datadr2 describe the range to be filled, */
  /* datadr1 holds the initial value and datadr2 holds the step. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
      /* Do nothing - datadr1 has the init value, done!  */
    } else if (datadr1 < datadr2) {
      f = datum[datadr2];
      for (i = datadr1 + 1; i <= datadr2; i++) { yield();
      /* datadr1 + 1 as datadr1 already contains the initial value */
        datum[i] = datum[i - 1] + f;
      }
    } else if (datadr1 > datadr2) { /* then do a count-down */
      f = datum[datadr2];
      for (i = datadr1 - 1; i >= datadr2; i--) {
        datum[i] = datum[i + 1] - f;
      }
    }
    /* Giving a step-value of zero, this of course will just copy */
    /* the initial value onto an entire range. An initial value of zero */
    /* and a step of zero can be thus used to erase a memory section. */

  } else if (opr == 24) {
  /* MNMX -- "Minimax", determine the minimum and the maximum value in a */
  /* range. Again adr1(adrA) adr2(adrB), where adr1 & adr2 contain */
  /* the addresses of the range, signified by adrA and adrB, and afterwards */
  /* adr1 and adr2 contain minimum and maximum numbers of said range. */
  /* This variant takes sign into account - make the range positive if you */
  /* actually care about the largest and smallest absolute values. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    f = datum[h];
    g = datum[h]; /* Not a mistake - you start with the SAME number. */
    if (h < k) {
      for (i = h + 1; i <= k; i++) { yield(); /* after the first number */
        if (f < datum[i]) {
          f = datum[i];
        }
        if (g > datum[i]) {
          g = datum[i];
        }
      }
    } else if (h > k) {
      for (i = k; i < h; i++) { yield(); /* before the last number */
        if (f < datum[i]) {
          f = datum[i];
        }
        if (g > datum[i]) {
          g = datum[i];
        }
      }
    }
    datum[datadr1] = f; /* maximum */
    datum[datadr2] = g; /* minimum */

    h = 0;
    k = 0;

  } else if (opr == 25) {
  /* SORT -- SORT RANGE */
  /* This is pretty naive and sacrifices run time to save memory. */
  /* Basically, each time when numbers are "unsorted", swap them, */
  /* and run through the whole array until no more swaps are done. */
  /* If nothing is left to swap - then necessarily all must be in order. */
  /* I am retaining this function despite the more interesting "coupled */
  /* sort" below, because it is simply quite easy to use. */

    if (datadr1 == datadr2) {
    /* Do nothing at all. */
    } else if (datadr2 == (datadr1 + 1)) {
      /* If only two numbers are given - either swap once, or not at all. */
      if (datum[datadr1] > datum[datadr2]) {
        /* The next three operations are the swap. */
        f = datum[datadr2];
        datum[datadr2] = datum[datadr1];
        datum[datadr1] = f;
      }
    } else if (datadr1 == (datadr2 + 1)) {
      if (datum[datadr1] < datum[datadr2]) {
        f = datum[datadr2];
        datum[datadr2] = datum[datadr1];
        datum[datadr1] = f;
      }
    } else if (datadr2 > datadr1) {
      k = 1; /* flag: Do we have to sort? k = 1 means "yes". */
      while (k == 1) {
        yield();
        k = 0; /* Try to say you are done, and see is this contradicted. */
        for (i = datadr1; i < datadr2; i++) { yield();
          if (datum[i] > datum[i + 1]) {
            /* Then swap, so the lower address contains the lower value. */
            f = datum[i + 1];
            datum[i + 1] = datum[i];
            datum[i] = f;
            k = 1; /* Still work to do - contradicting k = 0 above. */
          }
        }
      }
    } else if (datadr2 < datadr1) {
      k = 1; /* flag: Do we have to sort? */
      while (k == 1) {
        yield();
        k = 0; /* Try to say you are done. */
        for (i = datadr2; i < datadr1; i++) { yield();
          if (datum[i] < datum[i + 1]) {
            f = datum[i + 1];
            datum[i + 1] = datum[i];
            datum[i] = f;
            k = 1; /* Still work to do. */
          }
        }
      }
    }

  } else if (opr == 26) {
  /* CORS - COUPLED RANGE SORTING: The first range, starting from */
  /* datadr1 + 1 and continuing to datum[datadr1], both inclusive, */
  /* determines how datadr2 + 1 till datum[datadr2] is sorted. */
  /* datadr1 is used as the "sorting index" for datadr2. */
  /* This is very much like the general sorting routine. */
  /* What this is for: to sort something "according to" something else. */
  /* This should help solve "best"-value-tasks. */
  /* If datadr2 is determined to be 0, then CORS really works like SORT, */
  /* sorting the first range datum[datadr1 + 1] ... datum[datum[datadr1]]. */

     h = abs(round(datum[datadr1])); /* Only datum[datadr1] deterines range. */
    /* k is used for flagging only, and not for range determination, and */
    /* instead it is assumed that the range in datadr2 is of the same */
    /* nature as the range signified by datadr1; in other words, */
    /* datum[datadr2] is simply ignored. This is not a disadvantage - this */
    /* way, a range can be secondarily sorted that begins at datum[1]. */

    if ((datadr1 == h) || (datadr1 == h + 1) || (datadr1 == h - 1)) {
    /* DO NOTHING AT ALL 0 or 1 element "range" is not to be "sorted". */
    } else if (datadr1 == h - 2) {

      if (datum[datadr1 + 1] > datum[datadr1 + 2]) {
        f = datum[datadr1 + 2];
        datum[datadr1 + 2] = datum[datadr1 + 1];
        datum[datadr1 + 1] = f;
        /* Do the same thing in the other range */
        if (datadr2 != 0) {
          f = datum[datadr2 + 2];
          datum[datadr2 + 2] = datum[datadr2 + 1];
          datum[datadr2 + 1] = f;
        }
      }

    } else if (datadr1 == h + 2) {

      if (datum[datadr1 - 2] > datum[datadr1 - 1]) {
        f = datum[datadr1 - 2];
        datum[datadr1 - 2] = datum[datadr1 - 1];
        datum[datadr1 - 1] = f;
        /* Do the same thing in the other range */
        if (datadr2 != 0) {
          f = datum[datadr2 + 2];
          datum[datadr2 + 2] = datum[datadr2 + 1];
          datum[datadr2 + 1] = f;
        }
      }

    } else if (datadr1 + 1 < h) {
      k = 1; /* flag: do we have to sort */
      while (k == 1) {
        yield();
        k = 0; /* try to say you are done */
        for (i = datadr1 + 1; i < h; i++) { yield();
          if (datum[i] > datum[i + 1]) {
            f = datum[i + 1];
            datum[i + 1] = datum[i];
            datum[i] = f;
            k = 1; /* still work to do */
            if (datadr2 != 0) {
              j = i - datadr1; /* determine how the offset from datadr1 ... */
              j = j + datadr2; /* ... and apply it to datadr2 ... */
             /* ... using it to do the same thing in the other range */
              f = datum[j + 1];
              datum[j + 1] = datum[j];
              datum[j] = f;
            }
          }
        }
      }
    } else if (datadr1 + 1 > h) {
      k = 1; /* flag: do we have to sort */
      while (k == 1) {
        yield();
        k = 0; /* try to say you are done */
        for (i = h + 1; i < datadr1; i++) { yield();
          if (datum[i] < datum[i + 1]) {
            f = datum[i + 1];
            datum[i + 1] = datum[i];
            datum[i] = f;
            k = 1; /* still work to do */
            if (datadr2 != 0) {
              j = i - datadr1; /* determine how the offset from datadr1 ... */
              j = j + datadr2; /* ... and apply it to datadr2 ... */
             /* ... using it to do the same thing in the other range */
              f = datum[j + 1];
              datum[j + 1] = datum[j];
              datum[j] = f;
            }
          }
        }
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 27) {
  /* TURN -- TURN A RANGE UPSIDE DOWN. */
  /* If in the range the numbers were 1.0 3.0 -3.8 2.1, make them be */
  /* instead 2.1 -3.8 3.0 1.0. The range is assumed between datadr1 and */
  /* datadr2, both inclusive. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        /* do nothing */
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= (datadr1 + ((datadr2 - datadr1) / 2)); i++) { yield();
        f = datum[i];
        datum[i] = datum[datadr2 - (i - datadr1)];
        datum[datadr2 - (i - datadr1)] = f;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= (datadr2 + ((datadr1 - datadr2) / 2)); i++) { yield();
        f = datum[i];
        datum[i] = datum[datadr1 - (i - datadr2)];
        datum[datadr1 - (i - datadr2)] = f;
      }
    }

  } else if (opr == 28) {
  /* SUMR -- SUM OF ADR RANGE - RESULT ALWAYS IN FIRST ADR. */
  /* Sum up the range signified by datum[datum[datadr1]] and */
  /* datum[datum[datadr2]], and place the result into datum[datadr1]. */
    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == k) || (k == 0)) { /* nothing to sum up if only one number */
        datum[datadr1] = datum[h];
    } else if (h < k) {
      datum[datadr1] = 0.0;
      for (i = h; i <= k; i++) { yield();
        datum[datadr1] = datum[datadr1] + datum[i];
      }
    } else if (h > k) {
      datum[datadr1] = 0.0;
      for (i = k; i <= h; i++) { yield();
        datum[datadr1] = datum[datadr1] + datum[i];
      }
    }
    h = 0;
    k = 0;

  } else if (opr == 29) {
  /* SUSQ -- SUM OF SQUARES AND SQUARE ROOTED SUM OF SQUARES */
  /* For vectors, statistics,... The range ADRES are held in */
  /* datadr1 and datadr2, i.e. this is again indirect, and after execution, */
  /* datadr1 has the sum of squares and datadr2 has the square root of it. */
  /* Only anything to do if the addresses really are in a RANGE: */
    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == k) || (k == 0)) {
        datum[datadr1] = fabs(datum[h]); /* sqrt(x^2) = abs(x) */
    } else if (h < k) {
      datum[datadr1] = 0.0;
      for (i = h; i <= k; i++) { yield();
        datum[datadr1] = datum[datadr1] + (datum[i] * datum[i]);
      }
    } else if (h > k) {
      datum[datadr1] = 0.0;
      for (i = k; i <= h; i++) { yield();
        datum[datadr1] = datum[datadr1] + (datum[i] * datum[i]);
      }
    }
      datum[datadr2] = sqrt(datum[datadr1]);
    h = 0;
    k = 0;

  } else if (opr == 30) {
  /* The next commands focus on a SINGLE range - and often have */
  /* meaning even if used on a single number, by setting datadr2 to */
  /* the same value as datadr1 or to zero (which is shorthand for that). */
  /* This is in contrast to actual range-range-commands, which */
  /* operate on TWO ranges, not on ONE range. */

  /* IXTH -- turn each X into 1/Xth in a range. X=0 gives 0, as always.  */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. */
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        if (datum[datadr1] != 0.0) {
          datum[datadr1] = 1.0/datum[datadr1];
        } else {
          datum[datadr1] = 0.0;
        }
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        if (datum[i] != 0.0) {
          datum[i] = 1.0/datum[i];
        } else {
          datum[i] = 0.0;
        }
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        if (datum[i] != 0.0) {
          datum[i] = 1.0/datum[i];
        } else {
          datum[i] = 0.0;
        }
      }
    }

  } else if (opr == 31) {
  /* ABSR -- ABSOLUTE VALUE OF RANGE. */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = fabs(datum[datadr1]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = fabs(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = fabs(datum[i]);
      }
    }

  } else if (opr == 32) {
  /* SQRT -- SQUARE ROOT ABSOLUTES IN RANGE */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = sqrt(fabs(datum[datadr1]));
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = sqrt(fabs(datum[i]));
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = sqrt(fabs(datum[i]));
      }
    }

  } else if (opr == 33) {
  /* SQUA -- SQUARE RANGE */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * datum[datadr1];
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * datum[i];
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * datum[i];
      }
    }

  } else if (opr == 34) {
  /* CBRT -- CUBE ROOT IN RANGE */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    f = 1.0/3.0;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = pow(datum[datadr1], f);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = pow(datum[i], f);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = pow(datum[i], f);
      }
    }

  } else if (opr == 35) {
  /* CUBE RANGE */
  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * datum[datadr1] * datum[datadr1];
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * datum[i] * datum[i];
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * datum[i] * datum[i];
      }
    }

  } else if (opr == 36) {
  /* LNRN -- NATURAL LOGARITHM OF RANGE. */
  /* The numbers are forced into being positive, and a logarithm of zero */
  /* gives zero. */

  /* You can obtain any logarithm or power you like using formulae such as */
  /* A ^ B =  X ^ (B * logX (A)) as well as logA (B) = logX (B) / logX (A). */
  /* Obviously, that ominous "X" can also be "e". */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        if (datum[datadr1] != 0.0) {
          datum[datadr1] = log(fabs(datum[datadr1]));
        } else {
          datum[datadr1] = 0.0;
        }
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        if (datum[i] != 0.0) {
          datum[i] = log(fabs(datum[i]));
        } else {
          datum[i] = 0.0;
        }
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        if (datum[i] != 0.0) {
          datum[i] = log(fabs(datum[i]));
        } else {
          datum[i] = 0.0;
        }
      }
    }

  } else if (opr == 37) {
  /* EXPR -- e^X of range. */

  /* You can obtain any logarithm or power you like using formulae such as */
  /* A ^ B =  X ^ (B * logX (A)) as well as logA (B) = logX (B) / logX (A). */
  /* Obviously, that ominous "X" can also be "e". See above. */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = exp(datum[datadr1]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = exp(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = exp(datum[i]);
      }
    }

  } else if (opr == 38) {
  /* Now follow a few trigonometric functions. It my experience, */
  /* in the vast majority of cases when you are dealing with */
  /* trigonometric functions, practically you are dealing with degrees, */
  /* not radian. Hence, these functions are all oriented to degrees. */
  /* If, for any reason, a conversion between radian and degrees becomes */
  /* necessary, this function and the next one will take care of it. */

  /* RADE -- CONVERT RANGE FROM RADIANS TO DEGREES */
  /* degrees = radians * 180 / pi ... radians = degrees * pi / 180 */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * 180 / PI;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * 180 / PI;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * 180 / PI;
      }
    }

  } else if (opr == 39) {
  /* DERA -- CONVERT RANGE FROM DEGREES TO RADIANS */
  /* degrees = radians * 180 / pi ... radians = degrees * pi / 180 */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * PI / 180;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * PI / 180;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * PI / 180;
      }
    }

  } else if (opr == 40) {
  /* SIND -- Sinus of degrees in a range. */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * PI / 180;
        datum[datadr1] = sin(datum[datadr1]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * PI / 180;
        datum[i] = sin(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * PI / 180;
        datum[i] = sin(datum[i]);
      }
    }

  } else if (opr == 41) {
  /* COSD -- Cosinus of degrees in a range.  */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = datum[datadr1] * PI / 180;
        datum[datadr1] = cos(datum[datadr1]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = datum[i] * PI / 180;
        datum[i] = cos(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = datum[i] * PI / 180;
        datum[i] = cos(datum[i]);
      }
    }

  } else if (opr == 42) {
  /* TAND -- Tangens of degrees in a range.  */
  /* The cotangens you find simply by turning this to 1/X. */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
      datum[datadr1] = datum[datadr1] * PI / 180;
      if (cos(datum[datadr1]) != 0.0) {
        datum[datadr1] = sin(datum[datadr1])/cos(datum[datadr1]);
      } else {
        datum[datadr1] = 0.0;
      }
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        if (cos(datum[i]) != 0.0) {
          datum[i] = datum[i] * PI / 180;
          datum[i] = sin(datum[i])/cos(datum[i]);
        } else {
          datum[i] = 0.0;
        }
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        if (cos(datum[i]) != 0.0) {
          datum[i] = datum[i] * PI / 180;
          datum[i] = sin(datum[i])/cos(datum[i]);
        } else {
          datum[i] = 0.0;
        }
      }
    }

  } else if (opr == 43) {
  /* ASND -- Arcussinus of a range, giving degrees.  */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = asin(datum[datadr1]) * 180.0 / PI;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = asin(datum[i]) * 180.0 / PI;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = asin(datum[i]) * 180.0 / PI;
      }
    }

  } else if (opr == 44) {
  /* ACSD -- Arcuscosinus of a range, giving degrees. */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = acos(datum[datadr1]) * 180.0 / PI;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = acos(datum[i]) * 180.0 / PI;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = acos(datum[i]) * 180.0 / PI;
      }
    }

  } else if (opr == 45) {
  /* ATND -- Arcustangens of a range, giving degrees. */

  /* The range is signified by datadr1 and datadr2, and if these are equal, */
  /* or if datadr2 is zero, then just perform that operation on the first */
  /* number, i.e. on datum[datadr1]. Same principle as above. */

    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[datadr1] = atan(datum[datadr1]) * 180.0 / PI;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = atan(datum[i]) * 180.0 / PI;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = atan(datum[i]) * 180.0 / PI;
      }
    }

  } else if (opr == 46) {
  /* MSTD -- MEAN AND STANDARD DEVIATION ON A SAMPLE. */
  /* I.e. this is WITH "Bessel's correction" for the standard deviation. */
  /* A statistical function. datadr1 and datadr2 indicate a range, */
  /* datum[datum[datadr1]] till datum[datum[datadr2]]. After application, */
  /* the mean of the range is contained in datadr1 and the standard */
  /* deviation in datadr2. A Gaussian distribution is assumed. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    j = abs(h - k); /* how many cells minus 1*/

    if ((h == k) || (k == 0)) { /* "very funny" - no range */
      datum[datadr1] = datum[h];
    } else if (h < k) {
      datum[datadr1] = 0.0;
      for (i = h; i <= k; i++) {
        datum[datadr1] = datum[datadr1] + datum[i];
      }
    } else if (h > k) {
      datum[datadr1] = 0.0;
      for (i = k; i <= h; i++) {
        datum[datadr1] = datum[datadr1] + datum[i];
      }
    }

    datum[datadr1] = datum[datadr1]/(j + 1);

    if (datadr2 != datadr1) {
      if ((h == k) || (k == 0)) { /* "very funny" - no range */
        datum[datadr2] = 0;
        /* No standard deviation can be given. */
      } else if (h < k) {
        datum[datadr2] = 0.0;
        for (i = h; i <= k; i++) {
          datum[datadr2] = datum[datadr2]
            + ((datum[i] - datum[datadr1]) * (datum[i] - datum[datadr1]));
        }
      } else if (h > k) {
        datum[datadr2] = 0.0;
        for (i = k; i <= h; i++) {
          datum[datadr2] = datum[datadr2]
            + ((datum[i] - datum[datadr1]) * (datum[i] - datum[datadr1]));
        }
      }

      datum[datadr2] = sqrt(datum[datadr2]/j);
    }
    h = 0;
    k = 0;

  } else if (opr == 47) {
  /* ZERO -- ZERO OUT A DATA RANGE. */
  /* While there are numerous ways to do it, this will be the most obvious */
  /* choice for the user. - As there is no provision for changing */
  /* instructions in a running program, there is no corresponding memory */
  /* clearance for instructions; this must be done manually at the REPL. */

  /* NOTE THE SHORTHAND OF 0 0 TO CLEAR ALL MEMORY. This may be useful in */
  /* order to clear residual values or begin a calculation anew, e.g. */
  /* asking the user for input. */

    if ((datadr1 == 0) && (datadr2 == 0)) {
    /* If BOTH numbers are zero, not just datadr2 but also datadr1, */
    /* then see this as shorthand for "CLEAR ALL MEMORY". */
      for (i = 1 ; i < DATAMEM ; i++) { yield();
        datum[i] = 0.0;
      }
    } else if ((datadr1 == datadr2) || (datadr2 == 0)) {
    /* If JUST datadr2 is 0, see it as shorthand to just clear datadr1. */
        datum[datadr1] = 0.0;
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield(); 
        datum[i] = 0.0;
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield(); 
        datum[i] = 0.0;
      }
    }

  } else if (opr == 48) {
  /* RAND -- GENERATE RANDOM NUMBERS. */
  /* Whereby datadr1 contains the minimum allowed number and datadr2 */
  /* contains the maximum allowed number of the range. The numbers are then */
  /* generated within that range, eventually also overwriting the minimum */
  /* and the maximum values with random numbers within the desired limits. */

    srand(datum[1]); /* datum 1 should variate a lot... instruction[0] may */
    /* variate a lot, too , but I chose datum 1 to avoid special treatment. */
    /* Not to mention, perhaps sometimes you WANT TO generate THE SAME */
    /* random numbers, if only to demonstrate they are not that "random"! */
    f = datum[datadr1]; /* MIN */
    g = datum[datadr2]; /* MAX */
    i = datadr1;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[i] = (rand() / (float) RAND_MAX) * f;
        /* i.e. if there is no "range", one random number between 0 and f. */
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = f + (rand() / (float) RAND_MAX) * (g - f);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = f + (rand() / (float) RAND_MAX) * (g - f);
      }
    }

  } else if (opr == 49) {
  /* RUND -- ROUND RANGE. */

  /* This and the following two functions attempt to turn floats into */
  /* integers. Again, they can be applied to a single number or a range. */

    i = datadr1;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[i] = round(datum[i]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = round(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = round(datum[i]);
      }
    }

  } else if (opr == 50) {
  /* CEIL -- CEILING RANGE */

    i = datadr1;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[i] = ceil(datum[i]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = ceil(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = ceil(datum[i]);
      }
    }

  } else if (opr == 51) {
  /* TANH -- TANH OF RANGE */
  /* tanh(x) = (e^x - e^(-x)) / (e^x + e^(-x)) */
  /* Just in case anybody does anything logistic or wants a neural network */
  /* to be programmed dynamically - this is a famous activation function. */

    i = datadr1;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[i] = tanh(datum[i]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = tanh(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = tanh(datum[i]);
      }
    }

  } else if (opr == 52) {
  /* DTNH -- DERIVATIVE OF TANH */
  /* derivtanh(x) = 1 - tanh(x) * tanh(x) */
  /* This is usually used in conjunction with the above. */

    i = datadr1;
    if ((datadr1 == datadr2) || (datadr2 == 0)) {
        datum[i] = 1.0 - tanh(datum[i]) * tanh(datum[i]);
    } else if (datadr1 < datadr2) {
      for (i = datadr1; i <= datadr2; i++) { yield();
        datum[i] = 1.0 - tanh(datum[i]) * tanh(datum[i]);
      }
    } else if (datadr1 > datadr2) {
      for (i = datadr2; i <= datadr1; i++) { yield();
        datum[i] = 1.0 - tanh(datum[i]) * tanh(datum[i]);
      }
    }

  /* ---- FROM NOW ON FOLLOW RANGE-WITH-RANGE-OPERATIONS ------------------ */
  } else if (opr == 53) {
  /* RANGE-RANGE-COMMANDS (AND RANGE-NUMBER-COMMANDS): */

  /* Essentially, with ranges, do something for each corresponding position */
  /* in two ranges, and end when the shorter range has finished. - A number */
  /* to range application means to modify each position in a range by said */
  /* number in the manner specified by the respective operator. */

  /* The first address will be one BEFORE or the one AFTER the range, and */
  /* it will contain the pointer to the end (or beginning) of the */
  /* respective range. That is: A[-1] --> An ; B[-1] --> Bn. */
  /* The result will be in the first range. */
  /* To keep things simple, if the second address is NOT */
  /* higher or equal to the first address, simply DO NOTHING. */

  /* I was totally unsure shouldn't I use datum[0] as "accumulator" here, */
  /* but it would make tracing errors more difficult, as datum[0] would get */
  /* all the time overwritten. But e.g. supplying the two addresses and */
  /* have datum[0] supply the length would be totally feasible, */
  /* as an alternative - just then avoid "nuking" it with 0 all the time. */
  /* However, this would NOT make it easier for the targeted user base, */
  /* and "ease of use by the user" is a design priority: without this */
  /* permanent overwriting, the "accumulator" of each range may be printed */
  /* to see actually where you may have messed up, not as with datum[0]. */
  /* For the user, the advice is to leave at least one number BELOW and */
  /* at least one number ABOVE each interesting range unused, so as to */
  /* be able to use range commands (both top-down and bottom-up). */

  /* datum[datadr1 + 1] is the range begin */
  /* datum[h] is the range end; for k & datadr2, respectively */
  /* So each material range actually begins NOT at datadr1 and datadr2, but */
  /* at one address HIGHER than them. */

  /* PLUR -- ADD TWO RANGES. */
  /* If they are not of equal length, the operation will stop with the end */
  /* of the shorter range. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == datadr1) || (k == datadr2)) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if ((h > datadr1) && (k > datadr2)) {
      j = datadr2 + 1;
      for (i = datadr1 + 1; ((i <= h) && (j <= k)); i++) { yield();
        datum[i] = datum[i] + datum[j];
        j++;
      }
    } else if ((h < datadr1) && (k < datadr2)) {
      /* still, datadr have the ADRES and cannot be used themselves */
      j = datadr2 - 1;
      for (i = datadr1 - 1; ((i >= h) && (j >= k)); i--) {
        datum[i] = datum[i] + datum[j];
        j--;
      }
    } else if ((h > datadr1) && (k < datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 - 1;
      for (i = datadr1 + 1; ((i <= h) && (j >= k)); i++) { yield();
        datum[i] = datum[i] + datum[j];
        j--;
      }
    } else if ((h < datadr1) && (k > datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 + 1;
      for (i = datadr1 - 1; ((i >= h) && (j <= k)); i--) {
        datum[i] = datum[i] + datum[j];
        j++;
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 54) {
  /* MINR -- SUBTRACT A RANGE FROM A RANGE */
  /* If they are not of equal length, the operation will stop with the end */
  /* of the shorter range. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == datadr1) || (k == datadr2)) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if ((h > datadr1) && (k > datadr2)) {
      j = datadr2 + 1;
      for (i = datadr1 + 1; ((i <= h) && (j <= k)); i++) { yield();
        datum[i] = datum[i] - datum[j];
        j++;
      }
    } else if ((h < datadr1) && (k < datadr2)) {
      /* still, datadr have the ADRES and cannot be used themselves */
      j = datadr2 - 1;
      for (i = datadr1 - 1; ((i >= h) && (j >= k)); i--) {
        datum[i] = datum[i] - datum[j];
        j--;
      }
    } else if ((h > datadr1) && (k < datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 - 1;
      for (i = datadr1 + 1; ((i <= h) && (j >= k)); i++) { yield();
        datum[i] = datum[i] - datum[j];
        j--;
      }
    } else if ((h < datadr1) && (k > datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 + 1;
      for (i = datadr1 - 1; ((i >= h) && (j <= k)); i--) {
        datum[i] = datum[i] - datum[j];
        j++;
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 55) {
  /* MULR -- MULTIPLY A RANGE WITH A RANGE */
  /* If they are not of equal length, the operation will stop with the end */
  /* of the shorter range. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == datadr1) || (k == datadr2)) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if ((h > datadr1) && (k > datadr2)) {
      j = datadr2 + 1;
      for (i = datadr1 + 1; ((i <= h) && (j <= k)); i++) { yield();
        datum[i] = datum[i] * datum[j];
        j++;
      }
    } else if ((h < datadr1) && (k < datadr2)) {
      /* still, datadr have the ADRES and cannot be used themselves */
      j = datadr2 - 1;
      for (i = datadr1 - 1; ((i >= h) && (j >= k)); i--) {
        datum[i] = datum[i] * datum[j];
        j--;
      }
    } else if ((h > datadr1) && (k < datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 - 1;
      for (i = datadr1 + 1; ((i <= h) && (j >= k)); i++) { yield();
        datum[i] = datum[i] * datum[j];
        j--;
      }
    } else if ((h < datadr1) && (k > datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 + 1;
      for (i = datadr1 - 1; ((i >= h) && (j <= k)); i--) {
        datum[i] = datum[i] * datum[j];
        j++;
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 56) {
  /* DIVR -- DIVIDE A RANGE BY A RANGE */
  /* If they are not of equal length, the operation will stop with the end */
  /* of the shorter range. A division by 0 nullifies the dividend, */
  /* as before on single-number-operations. */

    h = abs(round(datum[datadr1]));
    k = abs(round(datum[datadr2]));
    if ((h == datadr1) || (k == datadr2)) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if ((h > datadr1) && (k > datadr2)) {
      j = datadr2 + 1;
      for (i = datadr1 + 1; ((i <= h) && (j <= k)); i++) { yield();
        if (datum[j] != 0.0) {
          datum[i] = datum[i] / datum[j];
        } else {
          datum[i] = 0.0;
        }
        j++;
      }
    } else if ((h < datadr1) && (k < datadr2)) {
      /* still, datadr have the ADRES and cannot be used themselves */
      j = datadr2 - 1;
      for (i = datadr1 - 1; ((i >= h) && (j >= k)); i--) {
        if (datum[j] != 0.0) {
          datum[i] = datum[i] / datum[j];
        } else {
          datum[i] = 0.0;
        }
        j--;
      }
    } else if ((h > datadr1) && (k < datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 - 1;
      for (i = datadr1 + 1; ((i <= h) && (j >= k)); i++) { yield();
        if (datum[j] != 0.0) {
          datum[i] = datum[i] / datum[j];
        } else {
          datum[i] = 0.0;
        }
        j--;
      }
    } else if ((h < datadr1) && (k > datadr2)) {
      /* the mixed modes give you a "reversed array" operation */
      j = datadr2 + 1;
      for (i = datadr1 - 1; ((i >= h) && (j <= k)); i--) {
        if (datum[j] != 0.0) {
          datum[i] = datum[i] / datum[j];
        } else {
          datum[i] = 0.0;
        }
        j++;
      }
    }

    h = 0;
    k = 0;

  /* ---- FROM NOW ON FOLLOW RANGE-WITH-SINGLE-NUMBER-OPERATIONS ---------- */
  } else if (opr == 57) {
  /* PLUN -- ADD A NUMBER TO A RANGE. */

    h = abs(round(datum[datadr1]));
    if (h == datadr1) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if (h > datadr1) {
      for (i = datadr1 + 1; i <= h; i++) { yield();
        datum[i] = datum[i] + datum[datadr2];
      }
    } else if (h < datadr1) {
      for (i = datadr1 - 1; i >= h; i--) {
        datum[i] = datum[i] + datum[datadr2];
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 58) {
  /* MINN -- SUBTRACT A NUMBER FROM A RANGE. */

    h = abs(round(datum[datadr1]));
    if (h == datadr1) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if (h > datadr1) {
      for (i = datadr1 + 1; i <= h; i++) { yield();
        datum[i] = datum[i] - datum[datadr2];
      }
    } else if (h < datadr1) {
      for (i = datadr1 - 1; i >= h; i--) {
        datum[i] = datum[i] - datum[datadr2];
      }
    }

    h = 0;
    k = 0;

  } else if (opr == 59) {
  /* MULN -- MULTIPLY A RANGE WITH A NUMBER. */

    h = abs(round(datum[datadr1]));
    if (h == datadr1) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if (h > datadr1) {
      for (i = datadr1 + 1; i <= h; i++) { yield();
        datum[i] = datum[i] * datum[datadr2];
      }
    } else if (h < datadr1) {
      for (i = datadr1 - 1; i >= h; i--) {
        datum[i] = datum[i] * datum[datadr2];
      }
    }

    h = 0;
    k = 0;


  } else if (opr == 60) {
  /* DIVN -- DIVIDE A RANGE BY A NUMBER. */
  /* A division by 0 nullifies the dividend, */
  /* as before on single-number-operations. */

    h = abs(round(datum[datadr1]));
    if (h == datadr1) {
      /* then simply do nothing, there is exactly NO range to operate on. */
    } else if (h > datadr1) {
      if (datum[datadr2] != 0.0) {
        for (i = datadr1 + 1; i <= h; i++) { yield();
          datum[i] = datum[i] / datum[datadr2];
        }
      } else {
        for (i = datadr1 + 1; i <= h; i++) { yield();
          datum[i] = 0.0;
        }
      }
    } else if (h < datadr1) {
      if (datum[datadr2] != 0.0) {
        for (i = datadr1 - 1; i >= h; i--) {
          datum[i] = datum[i] / datum[datadr2];
        }
      } else {
        for (i = datadr1 - 1; i >= h; i--) {
          datum[i] = 0.0;
        }
      }
    }

    h = 0;
    k = 0;

  /* ---- FROM NOW ON FOLLOW LOOK-UP TABLES FOR STATISTICAL PURPOSES ------ */
  /* The question to include them or not may be, trivially, flash space. */
  /* PHI Z LOOKUP TABLES - WORKING BOTH WAYS */
  /* FIRST KISS: ROUND TO NEAREST VALUE, DO NOT INTERPOLATE. */
  } else if (opr == 61) {

  /* PROB */
  /* FOR A GIVEN STANDARD DEVIATION DISTANCE, FIND THE PROBABILITY COVERED. */
  /* You have a range defined by datadr1 and datadr2, */
  /* containing the deviations. */
  /* After calling the function, you have the same range filled with the */
  /* probabilities covered at each respective deviation. */

    if (datadr2 == 0) { datadr2 = datadr1; }

    /* normalise addresses */
    if (datadr1 > datadr2) { i = datadr2; datadr2 = datadr1; datadr1 = i; }

    
    for (i = datadr1; i <= datadr2; i++) { yield();
      k = 32000; /* way more than greatest possible difference */
      h = 0; /* prepare below-0-flag */
      f = datum[i];
      if (f < 0.0) {h = 1;} /* flag adjustment */
      f = fabs(f); /* make the deviation positive */
  
      if (f > 3.90) { datum[i] = 1.0; }
      else {
        datum[i] = f;
        g = 0.00; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5000; }
        g = 0.01; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5040; }
        g = 0.02; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5080; }
        g = 0.03; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5120; }
        g = 0.04; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5160; }
        g = 0.05; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5199; }
        g = 0.06; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5239; }
        g = 0.07; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5279; }
        g = 0.08; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5319; }
        g = 0.09; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5359; }
        g = 0.10; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5398; }
        g = 0.11; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5438; }
        g = 0.12; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5478; }
        g = 0.13; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5517; }
        g = 0.14; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5557; }
        g = 0.15; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5596; }
        g = 0.16; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5636; }
        g = 0.17; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5675; }
        g = 0.18; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5714; }
        g = 0.19; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5753; }
        g = 0.20; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5793; }
        g = 0.21; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5832; }
        g = 0.22; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5871; }
        g = 0.23; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5910; }
        g = 0.24; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5948; }
        g = 0.25; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.5987; }
        g = 0.26; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6026; }
        g = 0.27; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6064; }
        g = 0.28; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6103; }
        g = 0.29; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6141; }
        g = 0.30; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6179; }
        g = 0.31; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6217; }
        g = 0.32; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6255; }
        g = 0.33; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6293; }
        g = 0.34; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6331; }
        g = 0.35; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6368; }
        g = 0.36; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6406; }
        g = 0.37; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6443; }
        g = 0.38; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6480; }
        g = 0.39; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6517; }
        g = 0.40; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6554; }
        g = 0.41; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6591; }
        g = 0.42; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6628; }
        g = 0.43; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6664; }
        g = 0.44; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6700; }
        g = 0.45; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6736; }
        g = 0.46; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6772; }
        g = 0.47; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6808; }
        g = 0.48; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6844; }
        g = 0.49; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6879; }
        g = 0.50; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6915; }
        g = 0.51; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6950; }
        g = 0.52; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.6985; }
        g = 0.53; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7019; }
        g = 0.54; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7054; }
        g = 0.55; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7088; }
        g = 0.56; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7123; }
        g = 0.57; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7157; }
        g = 0.58; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7190; }
        g = 0.59; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7224; }
        g = 0.60; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7257; }
        g = 0.61; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7291; }
        g = 0.62; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7324; }
        g = 0.63; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7357; }
        g = 0.64; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7389; }
        g = 0.65; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7422; }
        g = 0.66; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7454; }
        g = 0.67; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7486; }
        g = 0.68; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7517; }
        g = 0.69; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7549; }
        g = 0.70; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7580; }
        g = 0.71; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7611; }
        g = 0.72; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7642; }
        g = 0.73; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7673; }
        g = 0.74; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7704; }
        g = 0.75; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7734; }
        g = 0.76; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7764; }
        g = 0.77; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7794; }
        g = 0.78; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7823; }
        g = 0.79; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7852; }
        g = 0.80; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7881; }
        g = 0.81; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7910; }
        g = 0.82; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7939; }
        g = 0.83; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7967; }
        g = 0.84; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.7995; }
        g = 0.85; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8023; }
        g = 0.86; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8051; }
        g = 0.87; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8078; }
        g = 0.88; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8106; }
        g = 0.89; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8133; }
        g = 0.90; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8159; }
        g = 0.91; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8186; }
        g = 0.92; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8212; }
        g = 0.93; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8238; }
        g = 0.94; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8264; }
        g = 0.95; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8289; }
        g = 0.96; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8315; }
        g = 0.97; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8340; }
        g = 0.98; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8365; }
        g = 0.99; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8389; }
        g = 1.00; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8413; }
        g = 1.01; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8438; }
        g = 1.02; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8461; }
        g = 1.03; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8485; }
        g = 1.04; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8508; }
        g = 1.05; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8531; }
        g = 1.06; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8554; }
        g = 1.07; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8577; }
        g = 1.08; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8599; }
        g = 1.09; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8621; }
        g = 1.10; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8643; }
        g = 1.11; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8665; }
        g = 1.12; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8686; }
        g = 1.13; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8708; }
        g = 1.14; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8729; }
        g = 1.15; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8749; }
        g = 1.16; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8770; }
        g = 1.17; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8790; }
        g = 1.18; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8810; }
        g = 1.19; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8830; }
        g = 1.20; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8849; }
        g = 1.21; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8869; }
        g = 1.22; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8888; }
        g = 1.23; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8907; }
        g = 1.24; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8925; }
        g = 1.25; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8944; }
        g = 1.26; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8962; }
        g = 1.27; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8980; }
        g = 1.28; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.8997; }
        g = 1.29; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9015; }
        g = 1.30; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9032; }
        g = 1.31; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9049; }
        g = 1.32; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9066; }
        g = 1.33; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9082; }
        g = 1.34; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9099; }
        g = 1.35; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9115; }
        g = 1.36; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9131; }
        g = 1.37; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9147; }
        g = 1.38; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9162; }
        g = 1.39; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9177; }
        g = 1.40; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9192; }
        g = 1.41; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9207; }
        g = 1.42; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9222; }
        g = 1.43; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9236; }
        g = 1.44; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9251; }
        g = 1.45; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9265; }
        g = 1.46; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9279; }
        g = 1.47; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9292; }
        g = 1.48; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9306; }
        g = 1.49; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9319; }
        g = 1.50; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9332; }
        g = 1.51; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9345; }
        g = 1.52; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9357; }
        g = 1.53; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9370; }
        g = 1.54; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9382; }
        g = 1.55; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9394; }
        g = 1.56; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9406; }
        g = 1.57; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9418; }
        g = 1.58; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9429; }
        g = 1.59; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9441; }
        g = 1.60; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9452; }
        g = 1.61; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9463; }
        g = 1.62; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9474; }
        g = 1.63; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9484; }
        g = 1.64; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9495; }
        g = 1.65; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9505; }
        g = 1.66; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9515; }
        g = 1.67; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9525; }
        g = 1.68; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9535; }
        g = 1.69; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9545; }
        g = 1.70; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9554; }
        g = 1.71; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9564; }
        g = 1.72; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9573; }
        g = 1.73; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9582; }
        g = 1.74; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9591; }
        g = 1.75; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9599; }
        g = 1.76; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9608; }
        g = 1.77; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9616; }
        g = 1.78; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9625; }
        g = 1.79; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9633; }
        g = 1.80; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9641; }
        g = 1.81; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9649; }
        g = 1.82; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9656; }
        g = 1.83; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9664; }
        g = 1.84; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9671; }
        g = 1.85; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9678; }
        g = 1.86; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9686; }
        g = 1.87; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9693; }
        g = 1.88; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9699; }
        g = 1.89; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9706; }
        g = 1.90; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9713; }
        g = 1.91; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9719; }
        g = 1.92; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9726; }
        g = 1.93; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9732; }
        g = 1.94; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9738; }
        g = 1.95; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9744; }
        g = 1.96; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9750; }
        g = 1.97; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9756; }
        g = 1.98; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9761; }
        g = 1.99; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9767; }
        g = 2.00; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9772; }
        g = 2.01; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9778; }
        g = 2.02; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9783; }
        g = 2.03; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9788; }
        g = 2.04; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9793; }
        g = 2.05; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9798; }
        g = 2.06; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9803; }
        g = 2.07; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9808; }
        g = 2.08; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9812; }
        g = 2.09; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9817; }
        g = 2.10; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9821; }
        g = 2.11; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9826; }
        g = 2.12; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9830; }
        g = 2.13; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9834; }
        g = 2.14; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9838; }
        g = 2.15; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9842; }
        g = 2.16; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9846; }
        g = 2.17; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9850; }
        g = 2.18; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9854; }
        g = 2.19; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9857; }
        g = 2.20; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9861; }
        g = 2.21; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9864; }
        g = 2.22; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9868; }
        g = 2.23; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9871; }
        g = 2.24; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9875; }
        g = 2.25; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9878; }
        g = 2.26; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9881; }
        g = 2.27; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9884; }
        g = 2.28; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9887; }
        g = 2.29; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9890; }
        g = 2.30; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9893; }
        g = 2.31; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9896; }
        g = 2.32; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9898; }
        g = 2.33; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9901; }
        g = 2.34; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9904; }
        g = 2.35; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9906; }
        g = 2.36; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9909; }
        g = 2.37; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9911; }
        g = 2.38; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9913; }
        g = 2.39; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9916; }
        g = 2.40; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9918; }
        g = 2.41; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9920; }
        g = 2.42; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9922; }
        g = 2.43; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9925; }
        g = 2.44; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9927; }
        g = 2.45; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9929; }
        g = 2.46; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9931; }
        g = 2.47; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9932; }
        g = 2.48; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9934; }
        g = 2.49; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9936; }
        g = 2.50; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9938; }
        g = 2.51; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9940; }
        g = 2.52; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9941; }
        g = 2.53; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9943; }
        g = 2.54; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9945; }
        g = 2.55; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9946; }
        g = 2.56; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9948; }
        g = 2.57; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9949; }
        g = 2.58; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9951; }
        g = 2.59; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9952; }
        g = 2.60; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9953; }
        g = 2.61; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9955; }
        g = 2.62; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9956; }
        g = 2.63; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9957; }
        g = 2.64; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9959; }
        g = 2.65; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9960; }
        g = 2.66; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9961; }
        g = 2.67; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9962; }
        g = 2.68; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9963; }
        g = 2.69; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9964; }
        g = 2.70; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9965; }
        g = 2.71; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9966; }
        g = 2.72; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9967; }
        g = 2.73; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9968; }
        g = 2.74; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9969; }
        g = 2.75; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9970; }
        g = 2.76; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9971; }
        g = 2.77; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9972; }
        g = 2.78; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9973; }
        g = 2.79; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9974; }
        g = 2.80; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9974; }
        g = 2.81; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9975; }
        g = 2.82; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9976; }
        g = 2.83; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9977; }
        g = 2.84; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9977; }
        g = 2.85; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9978; }
        g = 2.86; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9979; }
        g = 2.87; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9979; }
        g = 2.88; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9980; }
        g = 2.89; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9981; }
        g = 2.90; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9981; }
        g = 2.91; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9982; }
        g = 2.92; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9982; }
        g = 2.93; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9983; }
        g = 2.94; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9984; }
        g = 2.95; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9984; }
        g = 2.96; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9985; }
        g = 2.97; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9985; }
        g = 2.98; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9986; }
        g = 2.99; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9986; }
        g = 3.00; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9987; }
        g = 3.01; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9987; }
        g = 3.02; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9987; }
        g = 3.03; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9988; }
        g = 3.04; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9988; }
        g = 3.05; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9989; }
        g = 3.06; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9989; }
        g = 3.07; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9989; }
        g = 3.08; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9990; }
        g = 3.09; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9990; }
        g = 3.10; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9990; }
        g = 3.11; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9991; }
        g = 3.12; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9991; }
        g = 3.13; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9991; }
        g = 3.14; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9992; }
        g = 3.15; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9992; }
        g = 3.16; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9992; }
        g = 3.17; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9992; }
        g = 3.18; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9993; }
        g = 3.19; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9993; }
        g = 3.20; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9993; }
        g = 3.21; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9993; }
        g = 3.22; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9994; }
        g = 3.23; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9994; }
        g = 3.24; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9994; }
        g = 3.25; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9994; }
        g = 3.26; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9994; }
        g = 3.27; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.28; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.29; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.30; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.31; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.32; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9995; }
        g = 3.33; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.34; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.35; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.36; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.37; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.38; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9996; }
        g = 3.39; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.40; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.41; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.42; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.43; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.44; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.45; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.46; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9997; }
        g = 3.47; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.48; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.49; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.50; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.51; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.52; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.53; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.54; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.55; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.56; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.57; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.58; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.59; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.60; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.61; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9998; }
        g = 3.62; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.63; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.64; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.65; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.66; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.67; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.68; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.69; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.70; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.71; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.72; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.73; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.74; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.75; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.76; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.77; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.78; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.79; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.80; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.81; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.82; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.83; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.84; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.85; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.86; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.87; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.88; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.89; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 0.9999; }
        g = 3.90; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.91; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.92; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.93; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.94; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.95; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.96; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.97; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.98; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
        g = 3.99; if (fabs(g - datum[i]) * 1000 < k)
        { k = 1000 * fabs(g - datum[i]);
         f = 1.0000; }
  
        datum[i] = f;
      }
  
      k = 0;
  
      if (h == 1) {
        /* reverse the probability adjustment */
        h = 0;
        datum[i] = 1.0 - datum[i];
      }

    }

    h = 0;
    k = 0;

  } else if (opr == 62) {

  /* STDD */
  /* FOR A GIVEN COVERED PROBABILITY, FIND THE STANDARD DEVIATION DISTANCE.*/
  /* You have a range defined by datadr1 and datadr2, */
  /* containing the deviations. */
  /* After calling the function, you have the same range filled with the */
  /* probabilities covered at each respective deviation. */

    if (datadr2 == 0) { datadr2 = datadr1; }

    /* normalise addresses */
    if (datadr1 > datadr2) { i = datadr2; datadr2 = datadr1; datadr1 = i; }

    
    for (i = datadr1; i <= datadr2; i++) { yield();
      k = 32000; /* way more than greatest possible difference */
      h = 0; /* prepare below-0.5-flag */
      f = datum[i];
      f = fabs(f); /* probability is necessarily positive */
  
      if (f < 0.5) {f = 0.5 + fabs(f - 0.5); h = 1;}
      /* flag probability adjustment */
  
      if (f > 1.0) { datum[i] = 3.9; }
      else {
        datum[i] = f;
        g = 0.5000; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.00; }
        g = 0.5040; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.01; }
        g = 0.5080; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.02; }
        g = 0.5120; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.03; }
        g = 0.5160; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.04; }
        g = 0.5199; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.05; }
        g = 0.5239; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.06; }
        g = 0.5279; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.07; }
        g = 0.5319; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.08; }
        g = 0.5359; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.09; }
        g = 0.5398; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.10; }
        g = 0.5438; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.11; }
        g = 0.5478; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.12; }
        g = 0.5517; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.13; }
        g = 0.5557; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.14; }
        g = 0.5596; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.15; }
        g = 0.5636; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.16; }
        g = 0.5675; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.17; }
        g = 0.5714; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.18; }
        g = 0.5753; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.19; }
        g = 0.5793; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.20; }
        g = 0.5832; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.21; }
        g = 0.5871; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.22; }
        g = 0.5910; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.23; }
        g = 0.5948; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.24; }
        g = 0.5987; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.25; }
        g = 0.6026; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.26; }
        g = 0.6064; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.27; }
        g = 0.6103; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.28; }
        g = 0.6141; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.29; }
        g = 0.6179; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.30; }
        g = 0.6217; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.31; }
        g = 0.6255; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.32; }
        g = 0.6293; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.33; }
        g = 0.6331; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.34; }
        g = 0.6368; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.35; }
        g = 0.6406; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.36; }
        g = 0.6443; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.37; }
        g = 0.6480; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.38; }
        g = 0.6517; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.39; }
        g = 0.6554; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.40; }
        g = 0.6591; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.41; }
        g = 0.6628; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.42; }
        g = 0.6664; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.43; }
        g = 0.6700; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.44; }
        g = 0.6736; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.45; }
        g = 0.6772; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.46; }
        g = 0.6808; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.47; }
        g = 0.6844; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.48; }
        g = 0.6879; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.49; }
        g = 0.6915; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.50; }
        g = 0.6950; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.51; }
        g = 0.6985; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.52; }
        g = 0.7019; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.53; }
        g = 0.7054; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.54; }
        g = 0.7088; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.55; }
        g = 0.7123; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.56; }
        g = 0.7157; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.57; }
        g = 0.7190; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.58; }
        g = 0.7224; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.59; }
        g = 0.7257; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.60; }
        g = 0.7291; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.61; }
        g = 0.7324; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.62; }
        g = 0.7357; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.63; }
        g = 0.7389; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.64; }
        g = 0.7422; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.65; }
        g = 0.7454; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.66; }
        g = 0.7486; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.67; }
        g = 0.7517; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.68; }
        g = 0.7549; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.69; }
        g = 0.7580; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.70; }
        g = 0.7611; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.71; }
        g = 0.7642; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.72; }
        g = 0.7673; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.73; }
        g = 0.7704; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.74; }
        g = 0.7734; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.75; }
        g = 0.7764; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.76; }
        g = 0.7794; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.77; }
        g = 0.7823; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.78; }
        g = 0.7852; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.79; }
        g = 0.7881; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.80; }
        g = 0.7910; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.81; }
        g = 0.7939; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.82; }
        g = 0.7967; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.83; }
        g = 0.7995; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.84; }
        g = 0.8023; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.85; }
        g = 0.8051; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.86; }
        g = 0.8078; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.87; }
        g = 0.8106; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.88; }
        g = 0.8133; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.89; }
        g = 0.8159; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.90; }
        g = 0.8186; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.91; }
        g = 0.8212; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.92; }
        g = 0.8238; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.93; }
        g = 0.8264; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.94; }
        g = 0.8289; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.95; }
        g = 0.8315; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.96; }
        g = 0.8340; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.97; }
        g = 0.8365; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.98; }
        g = 0.8389; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 0.99; }
        g = 0.8413; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.00; }
        g = 0.8438; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.01; }
        g = 0.8461; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.02; }
        g = 0.8485; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.03; }
        g = 0.8508; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.04; }
        g = 0.8531; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.05; }
        g = 0.8554; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.06; }
        g = 0.8577; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.07; }
        g = 0.8599; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.08; }
        g = 0.8621; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.09; }
        g = 0.8643; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.10; }
        g = 0.8665; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.11; }
        g = 0.8686; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.12; }
        g = 0.8708; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.13; }
        g = 0.8729; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.14; }
        g = 0.8749; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.15; }
        g = 0.8770; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.16; }
        g = 0.8790; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.17; }
        g = 0.8810; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.18; }
        g = 0.8830; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.19; }
        g = 0.8849; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.20; }
        g = 0.8869; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.21; }
        g = 0.8888; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.22; }
        g = 0.8907; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.23; }
        g = 0.8925; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.24; }
        g = 0.8944; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.25; }
        g = 0.8962; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.26; }
        g = 0.8980; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.27; }
        g = 0.8997; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.28; }
        g = 0.9015; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.29; }
        g = 0.9032; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.30; }
        g = 0.9049; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.31; }
        g = 0.9066; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.32; }
        g = 0.9082; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.33; }
        g = 0.9099; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.34; }
        g = 0.9115; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.35; }
        g = 0.9131; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.36; }
        g = 0.9147; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.37; }
        g = 0.9162; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.38; }
        g = 0.9177; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.39; }
        g = 0.9192; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.40; }
        g = 0.9207; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.41; }
        g = 0.9222; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.42; }
        g = 0.9236; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.43; }
        g = 0.9251; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.44; }
        g = 0.9265; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.45; }
        g = 0.9279; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.46; }
        g = 0.9292; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.47; }
        g = 0.9306; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.48; }
        g = 0.9319; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.49; }
        g = 0.9332; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.50; }
        g = 0.9345; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.51; }
        g = 0.9357; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.52; }
        g = 0.9370; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.53; }
        g = 0.9382; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.54; }
        g = 0.9394; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.55; }
        g = 0.9406; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.56; }
        g = 0.9418; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.57; }
        g = 0.9429; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.58; }
        g = 0.9441; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.59; }
        g = 0.9452; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.60; }
        g = 0.9463; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.61; }
        g = 0.9474; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.62; }
        g = 0.9484; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.63; }
        g = 0.9495; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.64; }
        g = 0.9505; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.65; }
        g = 0.9515; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.66; }
        g = 0.9525; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.67; }
        g = 0.9535; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.68; }
        g = 0.9545; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.69; }
        g = 0.9554; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.70; }
        g = 0.9564; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.71; }
        g = 0.9573; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.72; }
        g = 0.9582; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.73; }
        g = 0.9591; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.74; }
        g = 0.9599; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.75; }
        g = 0.9608; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.76; }
        g = 0.9616; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.77; }
        g = 0.9625; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.78; }
        g = 0.9633; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.79; }
        g = 0.9641; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.80; }
        g = 0.9649; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.81; }
        g = 0.9656; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.82; }
        g = 0.9664; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.83; }
        g = 0.9671; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.84; }
        g = 0.9678; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.85; }
        g = 0.9686; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.86; }
        g = 0.9693; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.87; }
        g = 0.9699; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.88; }
        g = 0.9706; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.89; }
        g = 0.9713; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.90; }
        g = 0.9719; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.91; }
        g = 0.9726; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.92; }
        g = 0.9732; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.93; }
        g = 0.9738; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.94; }
        g = 0.9744; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.95; }
        g = 0.9750; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.96; }
        g = 0.9756; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.97; }
        g = 0.9761; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.98; }
        g = 0.9767; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 1.99; }
        g = 0.9772; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.00; }
        g = 0.9778; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.01; }
        g = 0.9783; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.02; }
        g = 0.9788; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.03; }
        g = 0.9793; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.04; }
        g = 0.9798; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.05; }
        g = 0.9803; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.06; }
        g = 0.9808; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.07; }
        g = 0.9812; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.08; }
        g = 0.9817; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.09; }
        g = 0.9821; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.10; }
        g = 0.9826; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.11; }
        g = 0.9830; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.12; }
        g = 0.9834; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.13; }
        g = 0.9838; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.14; }
        g = 0.9842; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.15; }
        g = 0.9846; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.16; }
        g = 0.9850; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.17; }
        g = 0.9854; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.18; }
        g = 0.9857; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.19; }
        g = 0.9861; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.20; }
        g = 0.9864; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.21; }
        g = 0.9868; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.22; }
        g = 0.9871; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.23; }
        g = 0.9875; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.24; }
        g = 0.9878; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.25; }
        g = 0.9881; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.26; }
        g = 0.9884; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.27; }
        g = 0.9887; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.28; }
        g = 0.9890; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.29; }
        g = 0.9893; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.30; }
        g = 0.9896; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.31; }
        g = 0.9898; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.32; }
        g = 0.9901; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.33; }
        g = 0.9904; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.34; }
        g = 0.9906; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.35; }
        g = 0.9909; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.36; }
        g = 0.9911; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.37; }
        g = 0.9913; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.38; }
        g = 0.9916; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.39; }
        g = 0.9918; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.40; }
        g = 0.9920; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.41; }
        g = 0.9922; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.42; }
        g = 0.9925; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.43; }
        g = 0.9927; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.44; }
        g = 0.9929; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.45; }
        g = 0.9931; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.46; }
        g = 0.9932; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.47; }
        g = 0.9934; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.48; }
        g = 0.9936; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.49; }
        g = 0.9938; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.50; }
        g = 0.9940; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.51; }
        g = 0.9941; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.52; }
        g = 0.9943; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.53; }
        g = 0.9945; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.54; }
        g = 0.9946; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.55; }
        g = 0.9948; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.56; }
        g = 0.9949; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.57; }
        g = 0.9951; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.58; }
        g = 0.9952; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.59; }
        g = 0.9953; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.60; }
        g = 0.9955; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.61; }
        g = 0.9956; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.62; }
        g = 0.9957; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.63; }
        g = 0.9959; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.64; }
        g = 0.9960; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.65; }
        g = 0.9961; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.66; }
        g = 0.9962; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.67; }
        g = 0.9963; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.68; }
        g = 0.9964; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.69; }
        g = 0.9965; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.70; }
        g = 0.9966; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.71; }
        g = 0.9967; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.72; }
        g = 0.9968; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.73; }
        g = 0.9969; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.74; }
        g = 0.9970; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.75; }
        g = 0.9971; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.76; }
        g = 0.9972; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.77; }
        g = 0.9973; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.78; }
        g = 0.9974; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.79; }
        g = 0.9975; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.81; }
        g = 0.9976; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.82; }
        g = 0.9977; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.83; }
        g = 0.9978; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.85; }
        g = 0.9979; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.86; }
        g = 0.9980; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.88; }
        g = 0.9981; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.89; }
        g = 0.9982; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.91; }
        g = 0.9983; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.93; }
        g = 0.9984; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.94; }
        g = 0.9985; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.96; }
        g = 0.9986; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 2.98; }
        g = 0.9987; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.00; }
        g = 0.9988; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.03; }
        g = 0.9989; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.05; }
        g = 0.9990; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.08; }
        g = 0.9991; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.11; }
        g = 0.9992; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.14; }
        g = 0.9993; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.18; }
        g = 0.9994; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.22; }
        g = 0.9995; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.27; }
        g = 0.9996; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.33; }
        g = 0.9997; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.39; }
        g = 0.9998; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.47; }
        g = 0.9999; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.62; }
        g = 1.0000; if (fabs(g - datum[i]) * 10000 < k)
        { k = 10000 * fabs(g - datum[i]);
         f = 3.90; }
  
        datum[i] = f;
      }
  
      k = 0;
  
      if (h == 1) {
        /* reverse the probability adjustment */
        h = 0;
        datum[i] = -1.0 * datum[i];
      }
    }

    h = 0;
    k = 0;

  /* ---- LAST COMMAND OF THE SIX-BIT-RANGE IS RESERVED FOR THE USER ------ */
  } else if (opr == 63) {
    /* USER -- RESERVED, perhaps for GPIO */
  }

  /* ------- END DECODING ------- */

  /* Advance to the next instruction UNLESS it was an */
  /* immediate instruction - in such a case, simply return to the REPL. */
  if (opr != 1) {
    if (pc > 0) {
      pc++;
    } else if (pc == 0) {
    /* do not increase pc=0: just execute immediately and return */
    /* you can even "mix" automatic and immediate mode and return or JUMP, */
    /* whereby a jump will change pc and then go on - your entry point is */
    /* thus freely selectable. A program can be set for automatic execution */
    /* perhaps by writing in instruction[0] a jump to the entry point, but */
    /* herein this is not (yet) implemented; the REPL seems a better start. */
      break;
    }
  }

} /* end execution phase */

} /* end highest level general loop */

} /* end void-setup of Arduino */

void loop() {}

/*
sizeof void :        1 byte
sizeof bool :        1 byte
sizeof char :        1 byte
sizeof byte :        1 byte
sizeof uint8_t :     1 byte

sizeof short :       2 byte
sizeof uint16_t :    2 byte

sizeof word :        4 byte
sizeof int :         4 byte
sizeof long :        4 byte
sizeof float :       4 byte
sizeof uint32_t :    4 byte

sizeof double :      8 byte
sizeof long long :   8 byte
sizeof uint64_t :    8 byte
*/