Diffstat (limited to 'frontend/beta/js/Clipperz/YUI/DomQuery.js') (more/less context) (ignore whitespace changes)
-rw-r--r-- | frontend/beta/js/Clipperz/YUI/DomQuery.js | 15 |
1 files changed, 6 insertions, 9 deletions
diff --git a/frontend/beta/js/Clipperz/YUI/DomQuery.js b/frontend/beta/js/Clipperz/YUI/DomQuery.js index 84aac08..4ad4193 100644 --- a/frontend/beta/js/Clipperz/YUI/DomQuery.js +++ b/frontend/beta/js/Clipperz/YUI/DomQuery.js | |||
@@ -1,120 +1,117 @@ | |||
1 | /* | 1 | /* |
2 | 2 | ||
3 | Copyright 2008-2011 Clipperz Srl | 3 | Copyright 2008-2011 Clipperz Srl |
4 | 4 | ||
5 | This file is part of Clipperz's Javascript Crypto Library. | 5 | This file is part of Clipperz Community Edition. |
6 | Javascript Crypto Library provides web developers with an extensive | 6 | Clipperz Community Edition is an online password manager. |
7 | and efficient set of cryptographic functions. The library aims to | ||
8 | obtain maximum execution speed while preserving modularity and | ||
9 | reusability. | ||
10 | For further information about its features and functionalities please | 7 | For further information about its features and functionalities please |
11 | refer to http://www.clipperz.com | 8 | refer to http://www.clipperz.com. |
12 | 9 | ||
13 | * Javascript Crypto Library is free software: you can redistribute | 10 | * Clipperz Community Edition is free software: you can redistribute |
14 | it and/or modify it under the terms of the GNU Affero General Public | 11 | it and/or modify it under the terms of the GNU Affero General Public |
15 | License as published by the Free Software Foundation, either version | 12 | License as published by the Free Software Foundation, either version |
16 | 3 of the License, or (at your option) any later version. | 13 | 3 of the License, or (at your option) any later version. |
17 | 14 | ||
18 | * Javascript Crypto Library is distributed in the hope that it will | 15 | * Clipperz Community Edition is distributed in the hope that it will |
19 | be useful, but WITHOUT ANY WARRANTY; without even the implied | 16 | be useful, but WITHOUT ANY WARRANTY; without even the implied |
20 | warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. | 17 | warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. |
21 | See the GNU Affero General Public License for more details. | 18 | See the GNU Affero General Public License for more details. |
22 | 19 | ||
23 | * You should have received a copy of the GNU Affero General Public | 20 | * You should have received a copy of the GNU Affero General Public |
24 | License along with Javascript Crypto Library. If not, see | 21 | License along with Clipperz Community Edition. If not, see |
25 | <http://www.gnu.org/licenses/>. | 22 | <http://www.gnu.org/licenses/>. |
26 | 23 | ||
27 | */ | 24 | */ |
28 | 25 | ||
29 | /* | 26 | /* |
30 | * yui-ext 0.40 | 27 | * yui-ext 0.40 |
31 | * Copyright(c) 2006, Jack Slocum. | 28 | * Copyright(c) 2006, Jack Slocum. |
32 | */ | 29 | */ |
33 | 30 | ||
34 | /** | 31 | /** |
35 | * @class Ext.DomQuery | 32 | * @class Ext.DomQuery |
36 | * Provides high performance selector/xpath processing by compiling queries into reusable functions. | 33 | * Provides high performance selector/xpath processing by compiling queries into reusable functions. |
37 | * New pseudo classes and matchers can be plugged. It works on HTML and XML documents (if a content node is passed in). | 34 | * New pseudo classes and matchers can be plugged. It works on HTML and XML documents (if a content node is passed in). |
38 | * @singleton | 35 | * @singleton |
39 | */ | 36 | */ |
40 | Ext.DomQuery = function(){ | 37 | Ext.DomQuery = function(){ |
41 | var cache = {}, simpleCache = {}, valueCache = {}; | 38 | var cache = {}, simpleCache = {}, valueCache = {}; |
42 | var nonSpace = /\S/; | 39 | var nonSpace = /\S/; |
43 | var trimRe = /^\s*(.*?)\s*$/; | 40 | var trimRe = /^\s*(.*?)\s*$/; |
44 | var tplRe = /\{(\d+)\}/g; | 41 | var tplRe = /\{(\d+)\}/g; |
45 | var modeRe = /^(\s?[\/>]\s?|\s|$)/; | 42 | var modeRe = /^(\s?[\/>]\s?|\s|$)/; |
46 | var clsRes = {}; | 43 | var clsRes = {}; |
47 | 44 | ||
48 | function child(p, index){ | 45 | function child(p, index){ |
49 | var i = 0; | 46 | var i = 0; |
50 | var n = p.firstChild; | 47 | var n = p.firstChild; |
51 | while(n){ | 48 | while(n){ |
52 | if(n.nodeType == 1){ | 49 | if(n.nodeType == 1){ |
53 | i++; | 50 | i++; |
54 | if(i == index){ | 51 | if(i == index){ |
55 | return n; | 52 | return n; |
56 | } | 53 | } |
57 | } | 54 | } |
58 | n = n.nextSibling; | 55 | n = n.nextSibling; |
59 | } | 56 | } |
60 | return null; | 57 | return null; |
61 | }; | 58 | }; |
62 | 59 | ||
63 | function next(d){ | 60 | function next(d){ |
64 | var n = d.nextSibling; | 61 | var n = d.nextSibling; |
65 | while(n && n.nodeType != 1){ | 62 | while(n && n.nodeType != 1){ |
66 | n = n.nextSibling; | 63 | n = n.nextSibling; |
67 | } | 64 | } |
68 | return n; | 65 | return n; |
69 | }; | 66 | }; |
70 | 67 | ||
71 | function prev(d){ | 68 | function prev(d){ |
72 | var n = d.previousSibling; | 69 | var n = d.previousSibling; |
73 | while(n && n.nodeType != 1){ | 70 | while(n && n.nodeType != 1){ |
74 | n = n.previousSibling; | 71 | n = n.previousSibling; |
75 | } | 72 | } |
76 | return n; | 73 | return n; |
77 | }; | 74 | }; |
78 | 75 | ||
79 | function clean(d){ | 76 | function clean(d){ |
80 | var n = d.firstChild, ni = -1; | 77 | var n = d.firstChild, ni = -1; |
81 | while(n){ | 78 | while(n){ |
82 | var nx = n.nextSibling; | 79 | var nx = n.nextSibling; |
83 | if(n.nodeType == 3 && !nonSpace.test(n.nodeValue)){ | 80 | if(n.nodeType == 3 && !nonSpace.test(n.nodeValue)){ |
84 | d.removeChild(n); | 81 | d.removeChild(n); |
85 | }else{ | 82 | }else{ |
86 | n.nodeIndex = ++ni; | 83 | n.nodeIndex = ++ni; |
87 | } | 84 | } |
88 | n = nx; | 85 | n = nx; |
89 | } | 86 | } |
90 | return this; | 87 | return this; |
91 | }; | 88 | }; |
92 | 89 | ||
93 | function byClassName(c, a, v){ | 90 | function byClassName(c, a, v){ |
94 | if(!v){ | 91 | if(!v){ |
95 | return c; | 92 | return c; |
96 | } | 93 | } |
97 | var re = clsRes[v]; | 94 | var re = clsRes[v]; |
98 | if(!re){ | 95 | if(!re){ |
99 | re = new RegExp('(?:^|\\s)(?:' + v + ')(?:\\s|$)'); | 96 | re = new RegExp('(?:^|\\s)(?:' + v + ')(?:\\s|$)'); |
100 | clsRes[v] = re; | 97 | clsRes[v] = re; |
101 | } | 98 | } |
102 | var r = []; | 99 | var r = []; |
103 | for(var i = 0, ci; ci = c[i]; i++){ | 100 | for(var i = 0, ci; ci = c[i]; i++){ |
104 | if(re.test(ci.className)){ | 101 | if(re.test(ci.className)){ |
105 | r[r.length] = ci; | 102 | r[r.length] = ci; |
106 | } | 103 | } |
107 | } | 104 | } |
108 | return r; | 105 | return r; |
109 | }; | 106 | }; |
110 | 107 | ||
111 | function convert(c){ | 108 | function convert(c){ |
112 | if(c.slice){ | 109 | if(c.slice){ |
113 | return c; | 110 | return c; |
114 | } | 111 | } |
115 | var r = []; | 112 | var r = []; |
116 | for(var i = 0, l = c.length; i < l; i++){ | 113 | for(var i = 0, l = c.length; i < l; i++){ |
117 | r[r.length] = c[i]; | 114 | r[r.length] = c[i]; |
118 | } | 115 | } |
119 | return r; | 116 | return r; |
120 | }; | 117 | }; |