1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
<!DOCTYPE html>
<html>
<!--
Copyright 2007 The Closure Library Authors. All Rights Reserved.
Use of this source code is governed by the Apache License, Version 2.0.
See the COPYING file for details.
-->
<!--
-->
<head>
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title>Closure Unit Tests - goog.ui.tree.TypeAhead</title>
<script src="../../base.js"></script>
<script>
goog.require('goog.testing.jsunit');
goog.require('goog.dom');
goog.require('goog.events.KeyCodes');
goog.require('goog.ui.tree.TreeControl');
goog.require('goog.ui.tree.TypeAhead');
</script>
</head>
<body>
<div id='treeContainer' style="width:400px"></div>
<script>
function makeATree() {
var tree = new goog.ui.tree.TreeControl('root');
var testData = ['level1',
[['level2', [['eve', []], ['eve2', []]], []],
['level22', [['eve', []], ['eve3', []]], []]],
[]];
createTreeFromTestData(tree, testData, 3);
tree.createDom();
goog.dom.getElement('treeContainer').appendChild(tree.getElement());
tree.enterDocument();
return tree;
};
function createTreeFromTestData(node, data, maxLevels) {
node.setHtml(data[0]);
if (maxLevels < 0) {
return;
}
var children = data[1];
for (var i = 0; i < children.length; i++) {
var child = children[i];
var childNode = node.getTree().createNode('');
node.add(childNode);
createTreeFromTestData(childNode, child, maxLevels - 1);
}
};
/**
* Test jumpToLabel_ functionality.
*/
function testJumpToLabel() {
var tree = makeATree();
var typeAhead = tree.typeAhead_;
// Test the case when only one matching entry exists.
var handled = typeAhead.jumpToLabel_('level1');
var selectedItem = tree.getSelectedItem();
assertTrue(handled && selectedItem.html_ == 'level1');
// Test the case when more than one matching entry exists.
handled = typeAhead.jumpToLabel_('eve');
selectedItem = tree.getSelectedItem();
assertTrue(handled && selectedItem.html_ == 'eve');
// Test the case when the matching entry is at a deeper level.
handled = typeAhead.jumpToLabel_('eve3');
selectedItem = tree.getSelectedItem();
assertTrue(handled && selectedItem.html_ == 'eve3');
};
/**
* Test jumpTo_ functionality.
*/
function testJumpTo() {
var tree = makeATree();
var typeAhead = tree.typeAhead_;
// Jump to the first matching 'eve', followed by Ctrl+DOWN to jump to
// second matching 'eve'
var handled = typeAhead.jumpToLabel_('eve') &&
typeAhead.jumpTo_(goog.ui.tree.TypeAhead.Offset.DOWN);
var selectedItem = tree.getSelectedItem();
assertTrue(handled && selectedItem.html_ == 'eve');
// Simulate a DOWN key on the tree, now the selection should be on 'eve3'
var e = new Object();
e.keyCode = goog.events.KeyCodes.DOWN;
e.preventDefault = function() {};
handled = tree.handleKeyEvent(e);
selectedItem = tree.getSelectedItem();
assertTrue(handled && selectedItem.html_ == 'eve3');
};
/**
* Test handleTypeAheadChar functionality.
*/
function testHandleTypeAheadChar() {
var tree = makeATree();
var typeAhead = tree.typeAhead_;
var e = new Object();
// Period character('.'): keyCode = 190, charCode = 46
// String.fromCharCode(190) = '3/4' <-- incorrect
// String.fromCharCode(46) = '.' <-- correct
e.keyCode = goog.events.KeyCodes.PERIOD;
e.charCode = 46;
e.preventDefault = function() {};
typeAhead.handleTypeAheadChar(e);
assertEquals('.', typeAhead.buffer_);
// charCode not supplied.
// This is expected to work only for alpha-num characters.
e.keyCode = goog.events.KeyCodes.A;
e.charCode = undefined;
typeAhead.buffer_ = '';
typeAhead.handleTypeAheadChar(e);
assertEquals('a', typeAhead.buffer_);
}
</script>
</body>
</html>
|
