Function testOrdering

test/jasmine/tests/scatter_test.js:793–830

(i)

        }

        function testOrdering(i) {
            return function() {
                var name = cases[indices[i]].name;
                var hasFills = name.indexOf('fill') !== -1;
                var hasLines = name.indexOf('lines') !== -1;
                var hasMarkers = name.indexOf('markers') !== -1;
                var tracei, prefix;

            // construct the expected ordering based on case name
                var selectorArray = [];
                for(tracei = 0; tracei < 3; tracei++) {
                    prefix = '.xy .trace:nth-child(' + (tracei + 1) + ') ';

                // two fills are attached to the first trace, one to the second
                    if(hasFills) {
                        if(tracei === 0) {
                            selectorArray.push(
                            prefix + 'g:first-child>.js-fill',
                            prefix + 'g:last-child>.js-fill');
                        } else if(tracei === 1) selectorArray.push(prefix + 'g:last-child>.js-fill');
                    }
                    if(hasLines) selectorArray.push(prefix + '.js-line');
                    if(hasMarkers) selectorArray.push(prefix + '.point');
                }

            // ordering in the legend
                for(tracei = 0; tracei < 3; tracei++) {
                    prefix = '.legend .traces:nth-child(' + (tracei + 1) + ') ';
                    if(hasFills) selectorArray.push(prefix + '.js-fill');
                    if(hasLines) selectorArray.push(prefix + '.js-line');
                    if(hasMarkers) selectorArray.push(prefix + '.scatterpts');
                }

                var msg = i ? ('from ' + cases[indices[i - 1]].name + ' to ') : 'from default to ';
                msg += name;
                assertMultiNodeOrder(selectorArray, msg);
            };
        }

        for(i = 0; i < indices.length; i++) {
            p = p.then(setMode(i)).then(testOrdering(i));