-
Notifications
You must be signed in to change notification settings - Fork 1
/
potentTools-2.2.4.js
12853 lines (11052 loc) · 367 KB
/
potentTools-2.2.4.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
(function webpackUniversalModuleDefinition(root, factory) {
if(typeof exports === 'object' && typeof module === 'object')
module.exports = factory();
else if(typeof define === 'function' && define.amd)
define("potentTools", [], factory);
else if(typeof exports === 'object')
exports["potentTools"] = factory();
else
root["potentTools"] = factory();
})(this, function() {
return /******/ (function(modules) { // webpackBootstrap
/******/ // The module cache
/******/ var installedModules = {};
/******/
/******/ // The require function
/******/ function __webpack_require__(moduleId) {
/******/
/******/ // Check if module is in cache
/******/ if(installedModules[moduleId]) {
/******/ return installedModules[moduleId].exports;
/******/ }
/******/ // Create a new module (and put it into the cache)
/******/ var module = installedModules[moduleId] = {
/******/ i: moduleId,
/******/ l: false,
/******/ exports: {}
/******/ };
/******/
/******/ // Execute the module function
/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
/******/
/******/ // Flag the module as loaded
/******/ module.l = true;
/******/
/******/ // Return the exports of the module
/******/ return module.exports;
/******/ }
/******/
/******/
/******/ // expose the modules object (__webpack_modules__)
/******/ __webpack_require__.m = modules;
/******/
/******/ // expose the module cache
/******/ __webpack_require__.c = installedModules;
/******/
/******/ // identity function for calling harmony imports with the correct context
/******/ __webpack_require__.i = function(value) { return value; };
/******/
/******/ // define getter function for harmony exports
/******/ __webpack_require__.d = function(exports, name, getter) {
/******/ if(!__webpack_require__.o(exports, name)) {
/******/ Object.defineProperty(exports, name, {
/******/ configurable: false,
/******/ enumerable: true,
/******/ get: getter
/******/ });
/******/ }
/******/ };
/******/
/******/ // getDefaultExport function for compatibility with non-harmony modules
/******/ __webpack_require__.n = function(module) {
/******/ var getter = module && module.__esModule ?
/******/ function getDefault() { return module['default']; } :
/******/ function getModuleExports() { return module; };
/******/ __webpack_require__.d(getter, 'a', getter);
/******/ return getter;
/******/ };
/******/
/******/ // Object.prototype.hasOwnProperty.call
/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
/******/
/******/ // __webpack_public_path__
/******/ __webpack_require__.p = "";
/******/
/******/ // Load entry module and return exports
/******/ return __webpack_require__(__webpack_require__.s = 7);
/******/ })
/************************************************************************/
/******/ ([
/* 0 */
/***/ (function(module, exports, __webpack_require__) {
const { splitAttributes } = __webpack_require__(10);
const xPathParser = __webpack_require__(3);
function attributesToXPath(attributes) {
let ret = '';
const processedAttributes = splitAttributes(attributes);
Object.keys(processedAttributes).forEach((i) => {
const attribute = processedAttributes[i];
if (Array.isArray(attribute)) {
// TODO: this still seems wrong as it isn't clear if we're anding or oring.
ret += attribute
.map(
a => `[contains(concat(' ', normalize-space(@${i}), ' '), ' ${a} ')]`
)
.join('');
} else {
ret += `[@${i}='${attribute}']`;
}
});
return ret;
}
function indexToXPath(index, forceOutput = false) {
if ((!index || index === 1) && !forceOutput) return '';
return `[${index}]`;
}
class XPathNode {
constructor(obj) {
this.data = {};
this.data.index = obj.index;
this.data.attributes = Object.assign({}, obj.attributes);
this.data.tag = obj.tag;
this.data.elements = obj.elements; // TODO: copy?
this.meta = Object.assign({}, obj.meta);
}
get index() {
return this.data.index;
}
get attributes() {
return this.data.attributes;
}
get tag() {
return this.data.tag;
}
get elements() {
return this.data.elements;
}
static fromString(row) {
// TODO: maybe the way to do this elegantly is to push it back on the generator code. Instead of allowing fromString, only allow fromDom.
// I think for now, we don't need to worry about it. This method isn't exposed yet and thus doesn't affect any users of the package.
const trialParsed = xPathParser.parse(row).steps;
if (trialParsed.length !== 1) {
throw new Error(
`XPathNode initialized with something that appears to be ${trialParsed.length} XPath nodes. Expected 1.`
);
}
const parsed = trialParsed[0];
function extractAttributesFromSelector(field) {
return field.predicates.reduce(
(accumulator, predicate) => {
let valueMap;
try {
if (predicate.steps) {
valueMap = predicate.steps
.filter(i => i.axis === 'attribute')
.reduce(
(acc, i) => {
return Object.assign({}, acc, { [i.name]: true });
},
{}
);
} else if (predicate.type && predicate.type === '==') {
valueMap = {
[predicate.left.steps[0].name]: predicate.right.value,
};
} else if (predicate.id && predicate.id === 'contains') {
// NOTE: these are weird special cases to handle the only forms we generate.
// a more general solution is welcome.
const key = predicate.args[0].args[1].args[0].steps[0].name;
const value = predicate.args[1].value.trim();
valueMap = { [key]: [value] };
}
// TODO: there's an else case here we should probably error in.
} catch (e) {
throw new Error(
"XPathNode::fromString is only partially implemented. We can't parse this XPath. Submit a pull request!"
);
}
return Object.assign({}, accumulator, valueMap);
},
{}
);
}
function extractIndexFromSelector(selector) {
const indexSelector = /\[([0-9]*)\]/.exec(selector);
if (!indexSelector) return undefined;
return parseInt(indexSelector[1], 10);
}
return new XPathNode({
index: extractIndexFromSelector(row),
attributes: extractAttributesFromSelector(parsed),
tag: /^[a-zA-Z]*/.exec(row)[0],
});
}
toString() {
const indexString = indexToXPath(
this.data.index,
this.meta.hasFollowingSiblings
);
const attributesString = this.data.attributes
? attributesToXPath(this.data.attributes)
: '';
// TODO: how to know if we should drop the attributes string?
return this.tag +
indexString +
(this.meta.hasFollowingSiblings !== false ? attributesString : '');
}
}
module.exports = XPathNode;
/***/ }),
/* 1 */
/***/ (function(module, exports, __webpack_require__) {
module.exports = __webpack_require__(8);
/***/ }),
/* 2 */
/***/ (function(module, exports, __webpack_require__) {
const XPathNode = __webpack_require__(0);
const xPathParser = __webpack_require__(3);
class XPathQuery {
constructor(nodes = []) {
// TODO: support XPathNode construction here.
if (
!Array.isArray(nodes) ||
nodes.filter(i => !(i instanceof XPathNode)).length
) {
throw new Error('Expecting array of XPathNode elements.');
}
this._nodes = nodes;
}
get nodes() {
return this._nodes;
}
get length() {
return this._nodes.length;
}
add(node) {
if (!(node instanceof XPathNode)) {
throw new Error('Expecting XPathNode element.');
}
this._nodes.push(node);
}
static fromString(xPath) {
const parsed = xPathParser.parse(xPath);
const rows = parsed.steps.map(i => i.toXPath());
return new XPathQuery(
rows.map((row) => {
return XPathNode.fromString(row);
})
);
}
toString(relative = false) {
if (!this.nodes || this.nodes.length < 1) return '';
const result = this.nodes.reduce(
(results, node) => {
return [...results, node.toString()];
},
[]
);
const initial = relative ? '//' : '/';
return `${initial}${result.join('/')}`;
}
}
module.exports = XPathQuery;
/***/ }),
/* 3 */
/***/ (function(module, exports, __webpack_require__) {
var require;var require;(function(f){if(true){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.xpath = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return require(o,!0);if(i)return require(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
// Scheme numerical tower in JavaScript. Described in README.
// Copyright (c) 2011 by John Tobey <[email protected]>
/*
File: schemeNumber.js
Exports:
<SchemeNumber>
Depends:
<biginteger.js> for <BigInteger>
*/
// Grab the BigInteger library.
var BigInteger;
if (!this.BigInteger && typeof require !== "undefined")
BigInteger = require("biginteger").BigInteger;
else
BigInteger = this.BigInteger;
if (!BigInteger) {
if (typeof load !== "undefined")
load("biginteger.js");
else if (this.readFile)
eval(this.readFile("biginteger.js"));
else
throw new Error("BigInteger is not defined.");
}
/*
Class: SchemeNumber
A number object as <defined by the Scheme language at
http://www.r6rs.org/>.
Scheme supports *exact* arithmetic and mixing exact with standard
(*inexact*) numbers. Several basic operations, including
addition, subtraction, multiplication, and division, when given
only exact arguments, must return an exact, numerically correct
result.
These operations are allowed to fail due to running out of memory,
but they are not allowed to return approximations the way
ECMAScript operators may, unless given one or more inexact
arguments.
For example, adding exact *1/100* to exact *0* one hundred times
produces exactly *1*, not 1.0000000000000007 as in JavaScript.
Raising exact *2* to the power of exact *1024* returns a 308-digit
integer with complete precision, not *Infinity* as in ECMAScript.
This implementation provides all functions listed in the <R6RS
Scheme specification at http://www.r6rs.org/>, Section 11.7, along
with <eqv?> from Section 11.5. (<eqv?> uses JavaScript's *===* to
compare non-numbers.)
Exact numbers support the standard ECMA Number formatting methods
(toFixed, toExponential, and toPrecision) without a fixed upper
limit to precision.
The schemeNumber.js file exports an object <SchemeNumber>. It
contains a property <fn>, which in turn contains the functions
implementing the numeric types.
The <SchemeNumber> object is in fact a function that converts its
argument to a Scheme number: similar to a constructor, but it may
not always return an object, let alone a unique object.
Parameters:
obj - Object to be converted to a Scheme number.
*obj* may have any of the following
types:
Scheme number - returned unchanged.
String - converted as if by *string->number*.
Native ECMAScript number - treated as an inexact real.
Returns:
A Scheme number.
Exceptions:
If *obj* can not be parsed, <SchemeNumber> will <raise> an
exception with condition type *&assertion*.
See Also:
<fn>, <raise>, <R6RS Chapter 3: Numbers at http://www.r6rs.org/final/html/r6rs/r6rs-Z-H-6.html#node_chap_3>
*/
var SchemeNumber = (function() {
function assert(x) { if (!x) throw new Error("assertion failed"); }
var abs = Math.abs;
var floor = Math.floor;
var ceil = Math.ceil;
var round = Math.round;
var pow = Math.pow;
var sqrt = Math.sqrt;
var atan2 = Math.atan2;
var log = Math.log;
var exp = Math.exp;
var atan = Math.atan;
var cos = Math.cos;
var sin = Math.sin;
var tan = Math.tan;
var LN2 = Math.LN2;
var LN10 = Math.LN10;
var _isFinite = isFinite;
var _isNaN = isNaN;
var _parseInt = parseInt;
var _parseFloat = parseFloat;
function retFalse() { return false; }
function retTrue() { return true; }
function retFirst(a) { return a; }
function retThis() { return this; }
function unimpl() {
throw new Error("BUG: unimplemented");
}
function pureVirtual() {
throw new Error("BUG: Abstract method not overridden");
}
function N() {} N.prototype = new Number(); // Scheme numbers.
function C() {} C.prototype = new N(); // Complex numbers.
function R() {} R.prototype = new C(); // Reals.
function ER() {} ER.prototype = new R(); // Exact reals.
function EQ() {} EQ.prototype = new ER(); // Exact rationals.
function EI() {} EI.prototype = new EQ(); // Exact integers.
// How to split a rectangular literal into real and imaginary components:
var decimalComplex = /^(.*[^a-zA-Z]|)([-+].*)i$/;
var radixComplex = /^(.*)([-+].*)i$/;
var nanInfPattern = /^[-+](nan|inf)\.0$/;
var exponentMarkerPattern = /[eEsSfFdDlL]/;
var decimal10Pattern = /^([0-9]+\.?|[0-9]*\.[0-9]+)([eEsSfFdDlL][-+]?[0-9]+)?$/;
var uintegerPattern = {
2: /^[01]+$/, 8: /^[0-7]+$/, 10: /^[0-9]+$/, 16: /^[0-9a-fA-F]+$/
};
function retZero() { return ZERO; }
function retOne() { return ONE; }
function divisionByExactZero() {
raise("&assertion", "division by exact zero");
}
// Is the Flonum class simply the native Number? In that case we will
// add methods to Number.prototype.
var Flonum;
// Users who wish to optimize the library by stripping support for
// Number.prototype cleanliness may simply replace "toFlonum("
// globally with "(" and change false to true here.
if (false) { // XXX Should expose a way to choose this branch.
// Flonum is Number.
Flonum = Number;
}
else {
// Flonum is a regular class in the hierarchy.
Flonum = function(x) {
this._ = x;
};
}
var toFlonum, isNumber;
var flo = {};
var FLO_FUNCS = [[],
["log", "floor", "ceil", "sqrt", "abs", "atan",
"cos", "sin", "tan", "exp"],
["pow", "atan2"]];
if (Flonum === Number) {
toFlonum = retFirst;
isNumber = function(x) {
return x instanceof Number || typeof x === "number";
};
FLO_FUNCS[1].concat(FLO_FUNCS[2]).forEach(function(name) {
flo[name] = Math[name];
});
}
else {
Flonum.prototype = new R();
(function() {
var inexactZero = new Flonum(0);
toFlonum = function(x) {
//assert(typeof x === "number");
return (x === 0 ? inexactZero : new Flonum(x));
};
})();
isNumber = function(x) {
return x instanceof N;
};
FLO_FUNCS[1].forEach(function(name) {
var math = Math[name];
flo[name] = function(a) {
return toFlonum(math(a));
};
});
FLO_FUNCS[2].forEach(function(name) {
var math = Math[name];
flo[name] = function(a, b) {
return toFlonum(math(a, b));
};
});
["toFixed", "toExponential", "toPrecision"].forEach(function(name) {
var number = Number.prototype[name];
Flonum.prototype[name] = function(a) {
return number.call(this._, a);
};
});
Flonum.prototype.valueOf = function() {
return this._;
};
}
/* Internal class hierarchy:
Number
^
N
^
C <---- Rectangular
|
`-- R <---- Flonum[1]
|
`-- ER <--- EQ <---- EQFraction
|
`-- EI <---- EINative
|
`-- EIBig
[1] In some configurations, the Flonum class actually equals Number
for reasons of efficiency. Logically, Flonum should be a direct
subclass of R. Initialization code populates missing slots in
Flonum.prototype as if that were the case.
The concrete classes are:
Flonum - inexact real as a native number, possibly NaN or infinite.
Rectangular - complex number as real and imaginary parts of same exactness.
EQFraction - exact rational as numerator and denominator in lowest terms.
EINative - exact integer as (wrapped) native number.
EIBig - exact integer as BigInteger.
The abstract C, R, ER, EQ, and EI classes hold information about
the respective number types (complex, real, exact real, exact
rational, and exact integer) and stimulate thought about new
concrete classes.
Possible future classes:
C <-- Polar - possibly exact complex number in polar coordinates;
EQ <-- EQNative - exact rational as native number (power-of-2 denominator);
EQ <-- EQDecimal - exact rational as BigInteger times a power of 10;
R <-- BigFloat - inexact real of non-standard precision.
*/
// SN: private alias for the public SchemeNumber object.
function SN(obj) {
if (obj instanceof N) {
return obj;
}
var ret = obj;
if (typeof ret !== "string") {
if (typeof ret === "number") {
return toFlonum(ret);
}
if (ret instanceof Number) {
return toFlonum(+ret);
}
if (ret == null) {
// XXX Rethink this.
return (ret === null ? INEXACT_ZERO : NAN);
}
ret = ret.valueOf();
if (typeof ret === "number") {
return toFlonum(ret);
}
ret = String(ret);
}
ret = stringToNumber(ret);
if (ret === false) {
raise("&assertion", "not a number", obj);
}
return ret;
}
// For NaturalDocs:
var SchemeNumber = SN;
/*
Property: VERSION
Library version as an array of integers.
For example, *[1,2,4]* corresponds to Version 1.2.4.
*/
SchemeNumber.VERSION = [1,1,4];
var floPow = flo.pow;
var floLog = flo.log;
var floFloor = flo.floor;
var floCeil = flo.ceil;
var floSqrt = flo.sqrt;
var floAtan2 = flo.atan2;
var floAbs = flo.abs;
var floAtan = flo.atan;
var floCos = flo.cos;
var floSin = flo.sin;
var floTan = flo.tan;
var floExp = flo.exp;
var HIERARCHY = {
C: ["Rectangular", "R"],
R: ["Flonum", "ER"],
ER: ["EQ"],
EQ: ["EQFraction", "EI"],
EI: ["EINative", "EIBig"]
};
var CLASSES = {
C:C, R:R, ER:ER, EQ:EQ, EI:EI,
Rectangular:Rectangular, Flonum:Flonum,
EQFraction:EQFraction, EINative:EINative, EIBig:EIBig
};
var DISP = {};
for (var className in CLASSES) {
DISP[className] = {}; // Contents will go into class prototype.
}
//
// Input functions.
//
var PARSE_ERROR = new Object();
// Scheme number syntaxes, e.g. #e1.1@-2d19, 2/3
function stringToNumber(s, radix, exact) {
function lose() {
throw PARSE_ERROR;
}
function setExact(value) {
if (exact !== undefined) lose();
exact = value;
}
function setRadix(value) {
if (radix) lose();
radix = value;
}
function parseUinteger(s, sign) {
if (!uintegerPattern[radix].test(s))
lose();
if (exact === false)
return toFlonum(sign * _parseInt(s, radix));
return parseEI(sign, s, radix);
}
function parseReal(s) {
if (nanInfPattern.test(s)) {
if (exact)
lose();
switch (s) {
case "+inf.0": return INFINITY;
case "-inf.0": return M_INFINITY;
default: return NAN;
}
}
var sign = 1;
switch (s[0]) {
case '-': sign = -1; // fall through
case '+': s = s.substring(1);
}
var slash = s.indexOf('/');
if (slash != -1)
return parseUinteger(s.substring(0, slash), sign)
.SN_divide(parseUinteger(s.substring(slash + 1), 1));
if (radix !== 10)
lose();
var pipe = s.indexOf('|');
if (pipe !== -1) {
// WHOA!!! Explicit mantissa width! Somebody really
// cares about correctness. However, I haven't got all
// day, so execution speed loses.
var afterPipe = s.substring(pipe + 1);
if (!uintegerPattern[10].test(afterPipe))
lose();
s = s.substring(0, pipe);
var precision = _parseInt(afterPipe);
if (precision === 0)
s = "0.0";
else if (precision < 53)
return parseWithWidth(s, precision, exact);
}
// We have only one floating point width.
s = s.replace(exponentMarkerPattern, 'e');
var dot = s.indexOf('.');
var e = s.indexOf('e');
if (dot === -1 && e === -1)
return parseUinteger(s, sign);
if (!decimal10Pattern.test(s))
lose();
if (!exact)
return toFlonum(sign * _parseFloat(s));
var integer = s.substring(0, dot === -1 ? e : dot);
var exponent = 0;
var fraction;
if (e === -1)
fraction = s.substring(dot + 1);
else {
if (dot === -1)
fraction = "";
else
fraction = s.substring(dot + 1, e);
exponent = _parseInt(s.substring(e + 1));
}
return parseDecimal(sign, integer + fraction,
exponent - fraction.length);
}
function parseComplex(s) {
var a = s.indexOf('@');
if (a !== -1) {
var ret = makePolar(parseReal(s.substring(0, a)),
parseReal(s.substring(a + 1)));
if (exact && ret.SN_isInexact())
ret = ret.SN_toExact(); // XXX is this right?
return ret;
}
if (s[s.length - 1] !== "i")
return parseReal(s);
if (s === "i") {
if (exact === false)
return inexactRectangular(INEXACT_ZERO, toFlonum(1));
return I;
}
if (s === "-i") {
if (exact === false)
return inexactRectangular(INEXACT_ZERO, toFlonum(-1));
return M_I;
}
var match = (radix === 10 ? decimalComplex : radixComplex).exec(s);
var x, y;
if (match) {
x = match[1];
y = match[2];
x = (x ? parseReal(x) : (exact === false ? INEXACT_ZERO : ZERO));
y = (y === "+" ? ONE : (y === "-" ? M_ONE : parseReal(y)));
}
else {
// Could be "3i" for example.
x = (exact === false ? INEXACT_ZERO : ZERO);
y = parseReal(s.substring(0, s.length - 1));
}
return makeRectangular(x, y);
}
// Parse a real that had a |p attached.
// See the second half of R6RS Section 4.2.8 and also
// http://www.mail-archive.com/[email protected]/msg01676.html.
function parseWithWidth(s, precision) {
// First, parse it as exact.
var x = stringToNumber(s, radix, true);
if (x === false || !x.SN_isReal())
lose();
if (!x.SN_isZero()) {
var xabs = x.SN_abs();
var shift = precision - floor(xabs.SN_log() / LN2) - 1;
var scale = TWO.SN_expt(toEINative(abs(shift)));
if (shift < 0)
scale = scale.SN_reciprocal();
var shifted = xabs.SN_multiply(scale);
// Correct for log() imprecision.
var denom = TWO.SN_expt(toEINative(precision));
while (shifted.SN_ge(denom)) {
shifted = shifted.SN_divide(TWO);
scale = scale.SN_divide(TWO);
}
for (var twiceShifted = shifted.SN_add(shifted);
twiceShifted.SN_lt(denom);
twiceShifted = shifted.SN_add(shifted)) {
shifted = twiceShifted;
scale = scale.SN_add(scale);
}
// 0.5 <= shifted/denom < 1.
var rounded = shifted.SN_round().SN_divide(scale);
if (x.SN_isNegative())
rounded = rounded.SN_negate();
x = rounded;
}
// Then make it inexact unless there is #e.
if (!exact)
x = x.SN_toInexact();
return x;
}
// Common cases first.
if (!radix || radix == 10) {
if (/^-?[0-9]{1,15}$/.test(s)) {
if (exact === false)
return toFlonum(_parseInt(s));
return toEINative(_parseInt(s));
}
radix = 10;
}
var i = 0;
try {
while (s[i] === "#") {
switch (s[i+1]) {
case 'i': case 'I': setExact(false); break;
case 'e': case 'E': setExact(true ); break;
case 'b': case 'B': setRadix( 2); break;
case 'o': case 'O': setRadix( 8); break;
case 'd': case 'D': setRadix(10); break;
case 'x': case 'X': setRadix(16); break;
default: return false;
}
i += 2;
}
return parseComplex(s.substring(i));
}
catch (e) {
if (e === PARSE_ERROR)
return false;
if (s == undefined)
raise("&assertion", "missing argument");
throw e;
}
}
function makeRectangular(x, y) {
if (x.SN_isExact() && y.SN_isExact())
return exactRectangular(x, y);
return inexactRectangular(x.SN_toInexact(), y.SN_toInexact());
}
function makePolar(r, theta) {
return inexactRectangular(r.SN_multiply(theta.SN_cos()),
r.SN_multiply(theta.SN_sin()));
}
function assertReal(x) {
if (!x.SN_isReal())
raise("&assertion", "not a real number", x);
return x;
}
function toReal(x) {
x = SN(x);
x.SN_isReal() || assertReal(x);
return x;
}
function assertInteger(n) {
n = SN(n);
if (!n.SN_isInteger())
raise("&assertion", "not an integer", n);
return n;
}
function toInteger(n) {
n = SN(n);
n.SN_isInteger() || assertInteger(n);
return n;
}
function assertRational(q) {
if (!q.SN_isRational())
raise("&assertion", "not a rational number", q);
return q;
}
function assertNonNegative(n) {
if (n.SN_isNegative())
raise("&assertion", "negative number", n);
return n;
}
function assertExact(z) {
if (z.SN_isInexact())
raise("&assertion", "inexact number", z);
return z;
}
/*
Property: raise
Function that translates a Scheme exception to ECMAScript.
When a library function encounters a situation where the Scheme
specification requires it to raise an exception with a certain
condition type, the function calls <SchemeNumber.raise>.
Programs may assign a custom function to <SchemeNumber.raise> to
intercept such exceptions.
Parameters:
conditionType - The specified condition, for example, "&assertion".
message - A string describing the error.
irritants... - Zero or more erroneous data arguments.
Returns:
The default <SchemeNumber.raise> function simply throws an
*Error*.
See Also:
<fn>, <SchemeNumber>
*/
SchemeNumber.raise = defaultRaise;
function defaultRaise(conditionType, message, irritant) {
var msg = "SchemeNumber: " + conditionType + ": " + message;
if (arguments.length > 2) {
if (isNumber(irritant))
irritant = irritant.SN_numberToString();
msg += ": " + irritant;
}
throw new Error(msg);
}
function raise() {
var len = arguments.length;
var args = new Array(len);
while (len--)
args[len] = arguments[len];
// Call the exception hook.
SN.raise.apply(SN, args);
// Oops, it returned. Fall back to our known good raiser.
defaultRaise.apply(this, args);
}
/*
Property: maxIntegerDigits
Maximum size of integers created by the <fn.expt(z1, z2)>
function.
To avoid using up all system memory, exact results of a call to
<fn.expt(z1, z2)> are capped at a configurable number of digits,
by default one million. <SchemeNumber.maxIntegerDigits> holds
this limit.
The size limit does *not* currently protect against other means of
creating large exact integers. For example, when passed
"#e1e9999999", the <SchemeNumber> function tries to allocate 10
million digits, regardless of <maxIntegerDigits>.
In a future release, cases such as the preceeding example may be
checked. If there is any possibility of legitimately creating
such large integers, either as number objects or components
thereof, code should increase <maxIntegerDigits>.
Default Value:
- 1000000 (1e6 or 1 million)
*/