The Tor Browser / file diff

     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/addon-sdk/source/test/addons/places/tests/test-places-utils.js	Wed Dec 31 06:09:35 2014 +0100
     1.3 @@ -0,0 +1,78 @@
     1.4 +/* This Source Code Form is subject to the terms of the Mozilla Public
     1.5 + * License, v. 2.0. If a copy of the MPL was not distributed with this
     1.6 + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
     1.7 +'use strict';
     1.8 +
     1.9 +module.metadata = {
    1.10 +  'engines': {
    1.11 +    'Firefox': '*'
    1.12 +  }
    1.13 +};
    1.14 +
    1.15 +const { defer, all } = require('sdk/core/promise');
    1.16 +const { setTimeout } = require('sdk/timers');
    1.17 +const { TreeNode } = require('sdk/places/utils');
    1.18 +
    1.19 +exports['test construct tree'] = function (assert) {
    1.20 +  let tree = TreeNode(1);
    1.21 +  tree.add([2, 3, 4]);
    1.22 +  tree.get(2).add([2.1, 2.2, 2.3]);
    1.23 +  let newTreeNode = TreeNode(4.3);
    1.24 +  newTreeNode.add([4.31, 4.32]);
    1.25 +  tree.get(4).add([4.1, 4.2, newTreeNode]);
    1.26 +
    1.27 +  assert.equal(tree.get(2).value, 2, 'get returns node with correct value');
    1.28 +  assert.equal(tree.get(2.3).value, 2.3, 'get returns node with correct value');
    1.29 +  assert.equal(tree.get(4.32).value, 4.32, 'get returns node even if created from nested node');
    1.30 +  assert.equal(tree.get(4).children.length, 3, 'nodes have correct children length');
    1.31 +  assert.equal(tree.get(3).children.length, 0, 'nodes have correct children length');
    1.32 +
    1.33 +  assert.equal(tree.get(4).get(4.32).value, 4.32, 'node.get descends from itself');
    1.34 +  assert.equal(tree.get(4).get(2), null, 'node.get descends from itself fails if not descendant');
    1.35 +};
    1.36 +
    1.37 +exports['test walk'] = function (assert, done) {
    1.38 +  let resultsAll = [];
    1.39 +  let resultsNode = [];
    1.40 +  let tree = TreeNode(1);
    1.41 +  tree.add([2, 3, 4]);
    1.42 +  tree.get(2).add([2.1, 2.2]);
    1.43 +
    1.44 +  tree.walk(function (node) {
    1.45 +    resultsAll.push(node.value);
    1.46 +  }).then(() => {
    1.47 +    [1, 2, 2.1, 2.2, 3, 4].forEach(num => {
    1.48 +      assert.ok(~resultsAll.indexOf(num), 'function applied to each node from root');
    1.49 +    });
    1.50 +    return tree.get(2).walk(node => resultsNode.push(node.value));
    1.51 +  }).then(() => {
    1.52 +    [2, 2.1, 2.2].forEach(function (num) {
    1.53 +      assert.ok(~resultsNode.indexOf(num), 'function applied to each node from node');
    1.54 +    });
    1.55 +  }).catch(assert.fail).then(done);
    1.56 +};
    1.57 +
    1.58 +exports['test async walk'] = function (assert, done) {
    1.59 +  let resultsAll = [];
    1.60 +  let tree = TreeNode(1);
    1.61 +  tree.add([2, 3, 4]);
    1.62 +  tree.get(2).add([2.1, 2.2]);
    1.63 +
    1.64 +  tree.walk(function (node) {
    1.65 +    let deferred = defer();
    1.66 +    setTimeout(function () {
    1.67 +      resultsAll.push(node.value);
    1.68 +      deferred.resolve(node.value);
    1.69 +    }, node.value === 2 ? 50 : 5);
    1.70 +    return deferred.promise;
    1.71 +  }).then(function () {
    1.72 +    [1, 2, 2.1, 2.2, 3, 4].forEach(function (num) {
    1.73 +      assert.ok(~resultsAll.indexOf(num), 'function applied to each node from root');
    1.74 +    });
    1.75 +    assert.ok(resultsAll.indexOf(2) < resultsAll.indexOf(2.1),
    1.76 +      'child should wait for parent to complete');
    1.77 +    assert.ok(resultsAll.indexOf(2) < resultsAll.indexOf(2.2),
    1.78 +      'child should wait for parent to complete');
    1.79 +    done();
    1.80 +  });
    1.81 +};