blob: 084d4b076681b513545842271e412d826c0df1fe (
plain)
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
|
// Copyright 2005 The Closure Library Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS-IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
/**
* @fileoverview Object to store the offset from one node to another in a way
* that works on any similar DOM structure regardless of whether it is the same
* actual nodes.
*
*/
goog.provide('goog.dom.NodeOffset');
goog.require('goog.Disposable');
goog.require('goog.dom.TagName');
/**
* Object to store the offset from one node to another in a way that works on
* any similar DOM structure regardless of whether it is the same actual nodes.
* @param {Node} node The node to get the offset for.
* @param {Node} baseNode The node to calculate the offset from.
* @extends {goog.Disposable}
* @constructor
*/
goog.dom.NodeOffset = function(node, baseNode) {
goog.Disposable.call(this);
/**
* A stack of childNode offsets.
* @type {Array.<number>}
* @private
*/
this.offsetStack_ = [];
/**
* A stack of childNode names.
* @type {Array.<string>}
* @private
*/
this.nameStack_ = [];
while (node && node.nodeName != goog.dom.TagName.BODY && node != baseNode) {
// Compute the sibling offset.
var siblingOffset = 0;
var sib = node.previousSibling;
while (sib) {
sib = sib.previousSibling;
++siblingOffset;
}
this.offsetStack_.unshift(siblingOffset);
this.nameStack_.unshift(node.nodeName);
node = node.parentNode;
}
};
goog.inherits(goog.dom.NodeOffset, goog.Disposable);
/**
* @return {string} A string representation of this object.
* @override
*/
goog.dom.NodeOffset.prototype.toString = function() {
var strs = [];
var name;
for (var i = 0; name = this.nameStack_[i]; i++) {
strs.push(this.offsetStack_[i] + ',' + name);
}
return strs.join('\n');
};
/**
* Walk the dom and find the node relative to baseNode. Returns null on
* failure.
* @param {Node} baseNode The node to start walking from. Should be equivalent
* to the node passed in to the constructor, in that it should have the
* same contents.
* @return {Node} The node relative to baseNode, or null on failure.
*/
goog.dom.NodeOffset.prototype.findTargetNode = function(baseNode) {
var name;
var curNode = baseNode;
for (var i = 0; name = this.nameStack_[i]; ++i) {
curNode = curNode.childNodes[this.offsetStack_[i]];
// Sanity check and make sure the element names match.
if (!curNode || curNode.nodeName != name) {
return null;
}
}
return curNode;
};
/** @override */
goog.dom.NodeOffset.prototype.disposeInternal = function() {
delete this.offsetStack_;
delete this.nameStack_;
};
|
