| 1 |
// Copyright 2008 The Closure Library Authors. All Rights Reserved. |
| 2 |
// |
| 3 |
// Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 |
// you may not use this file except in compliance with the License. |
| 5 |
// You may obtain a copy of the License at |
| 6 |
// |
| 7 |
// http://www.apache.org/licenses/LICENSE-2.0 |
| 8 |
// |
| 9 |
// Unless required by applicable law or agreed to in writing, software |
| 10 |
// distributed under the License is distributed on an "AS-IS" BASIS, |
| 11 |
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 |
// See the License for the specific language governing permissions and |
| 13 |
// limitations under the License. |
| 14 |
|
| 15 |
goog.provide('goog.ui.tree.TreeControlTest'); |
| 16 |
goog.setTestOnly('goog.ui.tree.TreeControlTest'); |
| 17 |
|
| 18 |
goog.require('goog.dom'); |
| 19 |
goog.require('goog.testing.jsunit'); |
| 20 |
goog.require('goog.ui.tree.TreeControl'); |
| 21 |
function makeATree() { |
| 22 |
var tree = new goog.ui.tree.TreeControl('root'); |
| 23 |
var testData = [ |
| 24 |
'A', |
| 25 |
[['AA', [['AAA', []], ['AAB', []]]], ['AB', [['ABA', []], ['ABB', []]]]] |
| 26 |
]; |
| 27 |
|
| 28 |
createTreeFromTestData(tree, testData, 3); |
| 29 |
tree.render(goog.dom.getElement('treeContainer')); |
| 30 |
return tree; |
| 31 |
} |
| 32 |
|
| 33 |
function createTreeFromTestData(node, data, maxLevels) { |
| 34 |
node.setText(data[0]); |
| 35 |
if (maxLevels < 0) { |
| 36 |
return; |
| 37 |
} |
| 38 |
|
| 39 |
var children = data[1]; |
| 40 |
for (var i = 0; i < children.length; i++) { |
| 41 |
var child = children[i]; |
| 42 |
var childNode = node.getTree().createNode(''); |
| 43 |
node.add(childNode); |
| 44 |
createTreeFromTestData(childNode, child, maxLevels - 1); |
| 45 |
} |
| 46 |
} |
| 47 |
|
| 48 |
|
| 49 |
/** |
| 50 |
* Test moving a node to a greater depth. |
| 51 |
*/ |
| 52 |
function testIndent() { |
| 53 |
var tree = makeATree(); |
| 54 |
tree.expandAll(); |
| 55 |
|
| 56 |
var node = tree.getChildren()[0].getChildren()[0]; |
| 57 |
assertEquals('AAA', node.getHtml()); |
| 58 |
assertNotNull(node.getElement()); |
| 59 |
assertEquals('19px', node.getRowElement().style.paddingLeft); |
| 60 |
|
| 61 |
assertEquals(2, node.getDepth()); |
| 62 |
|
| 63 |
var newParent = node.getNextSibling(); |
| 64 |
assertEquals('AAB', newParent.getHtml()); |
| 65 |
assertEquals(2, newParent.getDepth()); |
| 66 |
|
| 67 |
newParent.add(node); |
| 68 |
|
| 69 |
assertEquals(newParent, node.getParent()); |
| 70 |
assertEquals(node, newParent.getChildren()[0]); |
| 71 |
assertEquals(3, node.getDepth()); |
| 72 |
assertEquals('38px', node.getRowElement().style.paddingLeft); |
| 73 |
} |
| 74 |
|
| 75 |
|
| 76 |
/** |
| 77 |
* Test moving a node to a lesser depth. |
| 78 |
*/ |
| 79 |
function testOutdent() { |
| 80 |
var tree = makeATree(); |
| 81 |
tree.expandAll(); |
| 82 |
|
| 83 |
var node = tree.getChildren()[0].getChildren()[0]; |
| 84 |
assertEquals('AAA', node.getHtml()); |
| 85 |
assertNotNull(node.getElement()); |
| 86 |
assertEquals('19px', node.getRowElement().style.paddingLeft); |
| 87 |
|
| 88 |
assertEquals(2, node.getDepth()); |
| 89 |
|
| 90 |
var newParent = tree; |
| 91 |
assertEquals('A', newParent.getHtml()); |
| 92 |
assertEquals(0, newParent.getDepth()); |
| 93 |
|
| 94 |
newParent.add(node); |
| 95 |
|
| 96 |
assertEquals(newParent, node.getParent()); |
| 97 |
assertEquals(node, newParent.getChildren()[2]); |
| 98 |
assertEquals(1, node.getDepth()); |
| 99 |
assertEquals('0px', node.getRowElement().style.paddingLeft); |
| 100 |
} |