[483] | 1 | define(["dojo/_base/lang"], function(lang){ |
---|
| 2 | |
---|
| 3 | var eq = function(/*Number*/ a, /*Number*/ b){ |
---|
| 4 | // summary: |
---|
| 5 | // compare two FP numbers for equality |
---|
| 6 | return Math.abs(a - b) <= 1e-6 * (Math.abs(a) + Math.abs(b)); // Boolean |
---|
| 7 | }; |
---|
| 8 | |
---|
| 9 | var common = lang.getObject("dojox.charting.scaler.common", true); |
---|
| 10 | |
---|
| 11 | var testedModules = {}; |
---|
| 12 | |
---|
| 13 | return lang.mixin(common, { |
---|
| 14 | doIfLoaded: function(moduleName, ifloaded, ifnotloaded){ |
---|
| 15 | if(testedModules[moduleName] == undefined){ |
---|
| 16 | try{ |
---|
| 17 | testedModules[moduleName] = require(moduleName); |
---|
| 18 | }catch(e){ |
---|
| 19 | testedModules[moduleName] = null; |
---|
| 20 | } |
---|
| 21 | } |
---|
| 22 | if(testedModules[moduleName]){ |
---|
| 23 | return ifloaded(testedModules[moduleName]); |
---|
| 24 | }else{ |
---|
| 25 | return ifnotloaded(); |
---|
| 26 | } |
---|
| 27 | }, |
---|
| 28 | getNumericLabel: function(/*Number*/ number, /*Number*/ precision, /*Object*/ kwArgs){ |
---|
| 29 | var def = ""; |
---|
| 30 | common.doIfLoaded("dojo/number", function(numberLib){ |
---|
| 31 | def = (kwArgs.fixed ? numberLib.format(number, {places : precision < 0 ? -precision : 0}) : |
---|
| 32 | numberLib.format(number)) || ""; |
---|
| 33 | }, function(){ |
---|
| 34 | def = kwArgs.fixed ? number.toFixed(precision < 0 ? -precision : 0) : number.toString(); |
---|
| 35 | }); |
---|
| 36 | if(kwArgs.labelFunc){ |
---|
| 37 | var r = kwArgs.labelFunc(def, number, precision); |
---|
| 38 | if(r){ return r; } |
---|
| 39 | // else fall through to the regular labels search |
---|
| 40 | } |
---|
| 41 | if(kwArgs.labels){ |
---|
| 42 | // classic binary search |
---|
| 43 | // TODO: working only if the array is sorted per value should be better documented or sorted automatically |
---|
| 44 | var l = kwArgs.labels, lo = 0, hi = l.length; |
---|
| 45 | while(lo < hi){ |
---|
| 46 | var mid = Math.floor((lo + hi) / 2), val = l[mid].value; |
---|
| 47 | if(val < number){ |
---|
| 48 | lo = mid + 1; |
---|
| 49 | }else{ |
---|
| 50 | hi = mid; |
---|
| 51 | } |
---|
| 52 | } |
---|
| 53 | // lets take into account FP errors |
---|
| 54 | if(lo < l.length && eq(l[lo].value, number)){ |
---|
| 55 | return l[lo].text; |
---|
| 56 | } |
---|
| 57 | --lo; |
---|
| 58 | if(lo >= 0 && lo < l.length && eq(l[lo].value, number)){ |
---|
| 59 | return l[lo].text; |
---|
| 60 | } |
---|
| 61 | lo += 2; |
---|
| 62 | if(lo < l.length && eq(l[lo].value, number)){ |
---|
| 63 | return l[lo].text; |
---|
| 64 | } |
---|
| 65 | // otherwise we will produce a number |
---|
| 66 | } |
---|
| 67 | return def; |
---|
| 68 | } |
---|
| 69 | }); |
---|
| 70 | }); |
---|