X-Git-Url: https://adrianiainlam.tk/git/?a=blobdiff_plain;ds=sidebyside;f=auto_tests%2Ftests%2Fcallback.js;h=a26b7e7b085f8e496f2dea2c16c60f2027f5c928;hb=a937d03183e33deea11a8d020cb1265c266e7f41;hp=9643da50caa56af079103c35b4d65d1143da0508;hpb=857a693198b506e516a541848491a0c160953b8e;p=dygraphs.git diff --git a/auto_tests/tests/callback.js b/auto_tests/tests/callback.js index 9643da5..a26b7e7 100644 --- a/auto_tests/tests/callback.js +++ b/auto_tests/tests/callback.js @@ -1,4 +1,4 @@ -/** +/** * @fileoverview Test cases for the callbacks. * * @author uemit.seren@gmail.com (Ümit Seren) @@ -15,47 +15,143 @@ CallbackTestCase.prototype.setUp = function() { CallbackTestCase.prototype.tearDown = function() { }; - - var data = "X,a\,b,c\n" + + +var data = "X,a\,b,c\n" + "10,-1,1,2\n" + "11,0,3,1\n" + "12,1,4,2\n" + "13,0,2,3\n"; - - - /** - * This tests that when the function idxToRow_ returns the proper row and the onHiglightCallback - * is properly called when the first series is hidden (setVisibility = false) - * - */ - CallbackTestCase.prototype.testHighlightCallbackIsCalled = function() { - var h_row; - var h_pts; - - var highlightCallback = function(e, x, pts, row) { - h_row = row; - h_pts = pts; - }; - - - - var graph = document.getElementById("graph"); - var g = new Dygraph(graph, data, - { - width: 100, - height : 100, - visibility: [false, true, true], - highlightCallback : highlightCallback - }); - - DygraphOps.dispatchMouseMove(g, 13, 10); - - //check correct row is returned - assertEquals(3, h_row); - //check there are only two points (because first series is hidden) - assertEquals(2, h_pts.length); - }; + +/** + * This tests that when the function idxToRow_ returns the proper row and the onHiglightCallback + * is properly called when the first series is hidden (setVisibility = false) + * + */ +CallbackTestCase.prototype.testHighlightCallbackIsCalled = function() { + var h_row; + var h_pts; + + var highlightCallback = function(e, x, pts, row) { + h_row = row; + h_pts = pts; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, data, + { + width: 100, + height: 100, + visibility: [false, true, true], + highlightCallback: highlightCallback + }); + + DygraphOps.dispatchMouseMove(g, 13, 10); + + //check correct row is returned + assertEquals(3, h_row); + //check there are only two points (because first series is hidden) + assertEquals(2, h_pts.length); +}; + + +/** + * Test that drawPointCallback isn't called when drawPoints is false + */ +CallbackTestCase.prototype.testDrawPointCallback_disabled = function() { + var called = false; + + var callback = function() { + called = true; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, data, { + drawPointCallback : callback, + }); + + assertFalse(called); +}; + +/** + * Test that drawPointCallback is called when drawPoints is true + */ +CallbackTestCase.prototype.testDrawPointCallback_enabled = function() { + var called = false; + + var callback = function() { + called = true; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, data, { + drawPoints : true, + drawPointCallback : callback + }); + + assertTrue(called); +}; + +/** + * Test that drawPointCallback is called when drawPoints is true + */ +CallbackTestCase.prototype.testDrawPointCallback_pointSize = function() { + var pointSize = 0; + var count = 0; + + var callback = function(g, seriesName, canvasContext, cx, cy, color, pointSizeParam) { + pointSize = pointSizeParam; + count++; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, data, { + drawPoints : true, + drawPointCallback : callback + }); + + assertEquals(1.5, pointSize); + assertEquals(12, count); // one call per data point. + + var g = new Dygraph(graph, data, { + drawPoints : true, + drawPointCallback : callback, + pointSize : 8 + }); + + assertEquals(8, pointSize); +}; + +/** + * This tests that when the function idxToRow_ returns the proper row and the onHiglightCallback + * is properly called when the first series is hidden (setVisibility = false) + * + */ +CallbackTestCase.prototype.testDrawHighlightPointCallbackIsCalled = function() { + var called = false; + + var drawHighlightPointCallback = function() { + called = true; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, data, + { + width: 100, + height : 100, + drawHighlightPointCallback : drawHighlightPointCallback + }); + + assertFalse(called); + DygraphOps.dispatchMouseMove(g, 13, 10); + assertTrue(called); +}; + +/** + * Test the closest-series highlighting methods for normal and stacked modes. + * Also pass in line widths for plain and highlighted lines for easier visual + * confirmation that the highlighted line is drawn on top of the others. + */ var runClosestTest = function(isStacked, widthNormal, widthHighlighted) { var h_row; var h_pts; @@ -65,14 +161,13 @@ var runClosestTest = function(isStacked, widthNormal, widthHighlighted) { var g = new Dygraph(graph, data, { width: 600, - height : 400, + height: 400, visibility: [false, true, true], stackedGraph: isStacked, strokeWidth: widthNormal, strokeBorderWidth: 2, highlightCircleSize: widthNormal * 2, - highlightSeriesBackgroundFade: 0.7, - highlightSeriesAnimate: true, + highlightSeriesBackgroundAlpha: 0.3, highlightSeriesOpts: { strokeWidth: widthHighlighted, @@ -149,6 +244,7 @@ CallbackTestCase.prototype.testClosestPointCallbackCss1 = function() { "div.dygraph-legend > span.highlight { border: 1px solid grey; }\n"; this.styleSheet.innerHTML = css; runClosestTest(false, 2, 4); + this.styleSheet.innerHTML = ''; } /** @@ -159,5 +255,55 @@ CallbackTestCase.prototype.testClosestPointCallbackCss2 = function() { "div.dygraph-legend > span.highlight { display: inline; }\n"; this.styleSheet.innerHTML = css; runClosestTest(false, 10, 15); + this.styleSheet.innerHTML = ''; // TODO(klausw): verify that the highlighted line is drawn on top? } + +/** + * This tests that closest point searches work for data containing NaNs. + * + * It's intended to catch a regression where a NaN Y value confuses the + * closest-point algorithm, treating it as closer as any previous point. + */ +CallbackTestCase.prototype.testNaNData = function() { + var dataNaN = [ + [10, -1, 1, 2], + [11, 0, 3, 1], + [12, 1, 4, NaN], + [13, 0, 2, 3], + [14, -1, 1, 4]]; + + var h_row; + var h_pts; + + var highlightCallback = function(e, x, pts, row) { + h_row = row; + h_pts = pts; + }; + + var graph = document.getElementById("graph"); + var g = new Dygraph(graph, dataNaN, + { + width: 600, + height: 400, + labels: ['x', 'a', 'b', 'c'], + visibility: [false, true, true], + highlightCallback: highlightCallback + }); + + DygraphOps.dispatchMouseMove(g, 10.1, 0.9); + //check correct row is returned + assertEquals(0, h_row); + + // Explicitly test closest point algorithms + var dom = g.toDomCoords(10.1, 0.9); + assertEquals(0, g.findClosestRow(dom[0])); + + var res = g.findClosestPoint(dom[0], dom[1]); + assertEquals(0, res.row); + assertEquals('b', res.seriesName); + + res = g.findStackedPoint(dom[0], dom[1]); + assertEquals(0, res.row); + assertEquals('c', res.seriesName); +};