-
Notifications
You must be signed in to change notification settings - Fork 43
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #39 from HL7/feature/LF-1351/method-to-quantity
Implement toQuantity(unit)
- Loading branch information
Showing
11 changed files
with
986 additions
and
457 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| let numberFns = {}; | ||
|
|
||
| // Returns the number of digits in the number after the decimal point, ignoring | ||
| // trailing zeros. | ||
| function decimalPlaces(x) { | ||
| // Based on https://stackoverflow.com/a/9539746/360782 | ||
| // Make sure it is a number and use the builtin number -> string. | ||
| const s = "" + (+x), | ||
| match = /(\d+)(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/.exec(s); | ||
| // NaN or Infinity or integer. | ||
| // We arbitrarily decide that Infinity is integral. | ||
| if (!match) { return 0; } | ||
| // Count the number of digits in the fraction and subtract the | ||
| // exponent to simulate moving the decimal point left by exponent places. | ||
| // 1.234e+2 has 1 fraction digit and '234'.length - 2 == 1 | ||
| // 1.234e-2 has 5 fraction digit and '234'.length - -2 == 5 | ||
| //var wholeNum = match[1]; | ||
| const fraction = match[2], | ||
| exponent = match[3]; | ||
| return Math.max( | ||
| 0, // lower limit. | ||
| (fraction === '0' ? 0 : (fraction || '').length) // fraction length | ||
| - (exponent || 0)); // exponent | ||
| } | ||
|
|
||
| /** | ||
| * Rounds a number to the specified number of decimal places. | ||
| * @param x the decimal number to be rounded | ||
| * @param n the (maximum) number of decimal places to preserve. (The result | ||
| * could contain fewer if the decimal digits in x contain zeros). | ||
| */ | ||
| function roundToDecimalPlaces (x, n) { | ||
| const scale = Math.pow(10, n); | ||
| return Math.round(x*scale)/scale; | ||
| } | ||
|
|
||
| /** | ||
| * The smallest representable number in FHIRPath. | ||
| */ | ||
| const PRECISION_STEP = 1e-8; | ||
|
|
||
| /** | ||
| * Rounds a number to the nearest multiple of PRECISION_STEP. | ||
| */ | ||
| function roundToMaxPrecision(x) { | ||
| return Math.round(x/PRECISION_STEP)*PRECISION_STEP; | ||
| } | ||
|
|
||
| /** | ||
| * Determines numbers equivalence | ||
| * @param {number} actual | ||
| * @param {number} expected | ||
| * @return {boolean} | ||
| */ | ||
| numberFns.isEquivalent = function(actual, expected) { | ||
| if(Number.isInteger(actual) && Number.isInteger(expected)) { | ||
| return actual === expected; | ||
| } | ||
|
|
||
| const prec = Math.min(decimalPlaces(actual), decimalPlaces(expected)); | ||
|
|
||
| if(prec === 0){ | ||
| return Math.round(actual) === Math.round(expected); | ||
| } else { | ||
| // Note: Number.parseFloat(0.00000011).toPrecision(7) === "1.100000e-7" | ||
| // It does # of significant digits, not decimal places. | ||
| return roundToDecimalPlaces(actual, prec) === | ||
| roundToDecimalPlaces(expected, prec); | ||
| } | ||
| }; | ||
|
|
||
| /** | ||
| * Determines numbers equality | ||
| * @param {number} actual | ||
| * @param {number} expected | ||
| * @return {boolean} | ||
| */ | ||
| numberFns.isEqual = function(actual, expected) { | ||
| return roundToMaxPrecision(actual) === roundToMaxPrecision(expected); | ||
| }; | ||
|
|
||
| module.exports = numberFns; |
Oops, something went wrong.