123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448 |
- /*
- * Copyright t lefering, David Given
- *
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program. If not, see <http://www.gnu.org/licenses/>.
- *
- * These are the four essential freedoms with GNU GPL software:
- * 1: freedom to run the program, for any purpose
- * 2: freedom to study how the program works, and change it to make it do what you wish
- * 3: freedom to redistribute copies to help your Free Software friends
- * 4: freedom to distribute copies of your modified versions to your Free Software friends
- * , ,
- * / \
- * ((__-^^-,-^^-__))
- * `-_---' `---_-'
- * `--|o` 'o|--'
- * \ ` /
- * ): :(
- * :o_o:
- * "-"
- */
- /****************************************************************************
- * PRINTF *
- ****************************************************************************/
- /* This is a copy of Ash Searle's public domain sprintf function. See:
- * http://hexmen.com/blog/2007/03/printf-sprintf/
- * ...for more info.
- */
- /**
- * JavaScript printf/sprintf functions.
- *
- * This code is unrestricted: you are free to use it however you like.
- *
- * The functions should work as expected, performing left or right alignment,
- * truncating strings, outputting numbers with a required precision etc.
- *
- * For complex cases, these functions follow the Perl implementations of
- * (s)printf, allowing arguments to be passed out-of-order, and to set the
- * precision or length of the output based on arguments instead of fixed
- * numbers.
- *
- * See http://perldoc.perl.org/functions/sprintf.html for more information.
- *
- * Implemented:
- * - zero and space-padding
- * - right and left-alignment,
- * - base X prefix (binary, octal and hex)
- * - positive number prefix
- * - (minimum) width
- * - precision / truncation / maximum width
- * - out of order arguments
- *
- * Not implemented (yet):
- * - vector flag
- * - size (bytes, words, long-words etc.)
- *
- * Will not implement:
- * - %n or %p (no pass-by-reference in JavaScript)
- *
- * @version 2007.04.27
- * @author Ash Searle
- */
- function sprintf()
- {
- function pad(str, len, chr, leftJustify)
- {
- var padding = (str.length >= len) ? '' : Array(
- 1 + len - str.length >>> 0).join(chr);
- return leftJustify ? str + padding : padding + str;
- }
- function justify(value, prefix, leftJustify, minWidth, zeroPad)
- {
- var diff = minWidth - value.length;
- if (diff > 0)
- {
- if (leftJustify || !zeroPad)
- {
- value = pad(value, minWidth, ' ', leftJustify);
- }
- else
- {
- value = value.slice(0, prefix.length)
- + pad('', diff, '0', true) + value.slice(prefix.length);
- }
- }
- return value;
- }
- function formatBaseX(value, base, prefix, leftJustify, minWidth, precision,
- zeroPad)
- {
- // Note: casts negative numbers to positive ones
- var number = value >>> 0;
- prefix = prefix && number &&
- {
- '2' :'0b',
- '8' :'0',
- '16' :'0x'
- }[base] || '';
- value = prefix + pad(number.toString(base), precision || 0, '0', false);
- return justify(value, prefix, leftJustify, minWidth, zeroPad);
- }
- function formatString(value, leftJustify, minWidth, precision, zeroPad)
- {
- if (precision != null)
- {
- value = value.slice(0, precision);
- }
- return justify(value, '', leftJustify, minWidth, zeroPad);
- }
- var a = arguments, i = 0, format = a[i++];
-
- /* Foul hack to remove simple uses of %l, which aren't supported. */
- format.replace("[^%]%l", "%");
- format.replace("^%l", "%");
-
- return format
- .replace(
- sprintf.regex,
- function(substring, valueIndex, flags, minWidth, _,
- precision, type)
- {
- if (substring == '%%')
- return '%';
- // parse flags
- var leftJustify = false, positivePrefix = '', zeroPad = false, prefixBaseX = false;
- for ( var j = 0; flags && j < flags.length; j++)
- switch (flags.charAt(j))
- {
- case ' ':
- positivePrefix = ' ';
- break;
- case '+':
- positivePrefix = '+';
- break;
- case '-':
- leftJustify = true;
- break;
- case '0':
- zeroPad = true;
- break;
- case '#':
- prefixBaseX = true;
- break;
- }
- // parameters may be null, undefined, empty-string or
- // real valued
- // we want to ignore null, undefined and empty-string
- // values
- if (!minWidth)
- {
- minWidth = 0;
- }
- else if (minWidth == '*')
- {
- minWidth = +a[i++];
- }
- else if (minWidth.charAt(0) == '*')
- {
- minWidth = +a[minWidth.slice(1, -1)];
- }
- else
- {
- minWidth = +minWidth;
- }
- // Note: undocumented perl feature:
- if (minWidth < 0)
- {
- minWidth = -minWidth;
- leftJustify = true;
- }
- if (!isFinite(minWidth))
- {
- throw new Error(
- 'sprintf: (minimum-)width must be finite');
- }
- if (!precision)
- {
- precision = 'fFeE'.indexOf(type) > -1 ? 6
- : (type == 'd') ? 0 : void (0);
- }
- else if (precision == '*')
- {
- precision = +a[i++];
- }
- else if (precision.charAt(0) == '*')
- {
- precision = +a[precision.slice(1, -1)];
- }
- else
- {
- precision = +precision;
- }
- // grab value using valueIndex if required?
- var value = valueIndex ? a[valueIndex.slice(0, -1)]
- : a[i++];
- switch (type)
- {
- case 's':
- return formatString(String(value), leftJustify,
- minWidth, precision, zeroPad);
- case 'c':
- return formatString(
- String.fromCharCode(+value),
- leftJustify, minWidth, precision,
- zeroPad);
- case 'b':
- return formatBaseX(value, 2, prefixBaseX,
- leftJustify, minWidth, precision,
- zeroPad);
- case 'o':
- return formatBaseX(value, 8, prefixBaseX,
- leftJustify, minWidth, precision,
- zeroPad);
- case 'x':
- return formatBaseX(value, 16, prefixBaseX,
- leftJustify, minWidth, precision,
- zeroPad);
- case 'X':
- return formatBaseX(value, 16, prefixBaseX,
- leftJustify, minWidth, precision,
- zeroPad).toUpperCase();
- case 'u':
- return formatBaseX(value, 10, prefixBaseX,
- leftJustify, minWidth, precision,
- zeroPad);
- case 'i':
- case 'd':
- {
- var number = parseInt(+value);
- var prefix = number < 0 ? '-' : positivePrefix;
- value = prefix
- + pad(String(Math.abs(number)),
- precision, '0', false);
- return justify(value, prefix, leftJustify,
- minWidth, zeroPad);
- }
- case 'e':
- case 'E':
- case 'f':
- case 'F':
- case 'g':
- case 'G':
- {
- var number = +value;
- var prefix = number < 0 ? '-' : positivePrefix;
- var method =
- [
- 'toExponential', 'toFixed',
- 'toPrecision'
- ]['efg'.indexOf(type.toLowerCase())];
- var textTransform =
- [
- 'toString', 'toUpperCase'
- ]['eEfFgG'.indexOf(type) % 2];
- value = prefix
- + Math.abs(number)[method](precision);
- return justify(value, prefix, leftJustify,
- minWidth, zeroPad)[textTransform]();
- }
- default:
- return substring;
- }
- });
- }
- sprintf.regex = /%%|%(\d+\$)?([-+#0 ]*)(\*\d+\$|\*|\d+)?(\.(\*\d+\$|\*|\d+))?([scboxXuidfegEG])/g;
- /****************************************************************************
- * STDIO *
- ****************************************************************************/
- var clue_output_buffer = "";
- var __stdout = 0;
- function clue_add_to_output_buffer(s)
- {
- clue_output_buffer += s;
- }
- function clue_flush_output_buffer()
- {
- var strings = clue_output_buffer.split("\n")
- for (var i = 0; i < (strings.length - 1); i++)
- print(strings[i]);
-
- clue_output_buffer = strings[strings.length - 1];
- }
- function _printf(stackpo, stackpd, formatpo, formatpd)
- {
- var format = clue_ptrtostring(formatpo, formatpd);
- var outargs = [format];
-
- var numargs = arguments.length;
- var i = 4;
- while (i < numargs)
- {
- var thisarg = arguments[i];
- i++;
- if (i < (numargs-1))
- {
- var nextarg = arguments[i];
- if (!nextarg || (typeof(nextarg) == "object"))
- {
- // If the next argument is nil or a table, then we must
- // be looking at a register pair representing a pointer.
- thisarg = clue_ptrtostring(thisarg, nextarg);
- i++;
- }
- }
-
- outargs.push(thisarg);
- }
- clue_add_to_output_buffer(sprintf.apply(null, outargs));
- clue_flush_output_buffer();
- return 1
- }
- function _putc(sp, stack, c, fppo, fppd)
- {
- clue_add_to_output_buffer(String.fromCharCode(c));
- if (c == '\n')
- clue_flush_output_buffer();
- }
- function _atoi(sp, stack, po, pd)
- {
- var s = clue_ptrtostring(po, pd);
- return s|0;
- }
- var _atol = _atoi;
- /****************************************************************************
- * STRINGS *
- ****************************************************************************/
- function _strcpy(sp, stack, destpo, destpd, srcpo, srcpd)
- {
- var origdestpo = destpo;
-
- for (;;)
- {
- var c = srcpd[srcpo];
- destpd[destpo] = c;
-
- srcpo++;
- destpo++;
-
- if (!c)
- break;
- }
- return [origdestpo, destpd];
- }
- function _memset(sp, stack, destpo, destpd, c, n)
- {
- for (var offset = 0; offset < (n-1); offset++)
- destpd[destpo + offset] = c;
-
- return [destpo, destpd];
- }
- /****************************************************************************
- * TIME *
- ****************************************************************************/
- function _gettimeofday(sp, stack, tvpo, tvpd, tzpo, tzpd)
- {
- var t = new Date().getTime();
- var secs = (t / 1000) | 0;
- var usecs = (t % 1000) * 1000;
-
- tvpd[tvpo+0] = secs;
- tvpd[tvpo+1] = usecs;
- return 0;
- }
- /****************************************************************************
- * MATHS *
- ****************************************************************************/
- function _sin(sp, stack, n) { return Math.sin(n); }
- function _cos(sp, stack, n) { return Math.cos(n); }
- function _atan(sp, stack, n) { return Math.atan(n); }
- function _pow(sp, stack, x, y) { return Math.pow(x, y); }
- function _log(sp, stack, n) { return Math.log(n); }
- function _exp(sp, stack, n) { return Math.exp(n); }
- function _sqrt(sp, stack, n) { return Math.sqrt(n); }
- /****************************************************************************
- * MEMORY *
- ****************************************************************************/
- function _malloc(sp, stack, size)
- {
- return [0, []];
- }
- function _calloc(sp, stack, size1, size2)
- {
- var d = [];
- for (var i = 0; i < (size1*size2); i++)
- d[i] = 0;
- return [0, d];
- }
- function _free(sp, stack, po, pd)
- {
- }
- function _realloc(sp, stack, po, pd, size)
- {
- return [po, pd];
- }
|