Diffstat (limited to 'frontend/gamma/js/Clipperz/YUI/DomQuery.js') (more/less context) (ignore whitespace changes)
-rw-r--r-- | frontend/gamma/js/Clipperz/YUI/DomQuery.js | 15 |
1 files changed, 6 insertions, 9 deletions
diff --git a/frontend/gamma/js/Clipperz/YUI/DomQuery.js b/frontend/gamma/js/Clipperz/YUI/DomQuery.js index 4a143ab..76d0fae 100644 --- a/frontend/gamma/js/Clipperz/YUI/DomQuery.js +++ b/frontend/gamma/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 | if (typeof(Clipperz) == 'undefined') { Clipperz = {}; } | 26 | if (typeof(Clipperz) == 'undefined') { Clipperz = {}; } |
30 | if (typeof(Clipperz.YUI) == 'undefined') { Clipperz.YUI = {}; } | 27 | if (typeof(Clipperz.YUI) == 'undefined') { Clipperz.YUI = {}; } |
31 | 28 | ||
32 | 29 | ||
33 | /* | 30 | /* |
34 | * yui-ext 0.40 | 31 | * yui-ext 0.40 |
35 | * Copyright(c) 2006, Jack Slocum. | 32 | * Copyright(c) 2006, Jack Slocum. |
36 | */ | 33 | */ |
37 | 34 | ||
38 | /** | 35 | /** |
39 | * @class Clipperz.YUI.DomQuery | 36 | * @class Clipperz.YUI.DomQuery |
40 | * Provides high performance selector/xpath processing by compiling queries into reusable functions. | 37 | * Provides high performance selector/xpath processing by compiling queries into reusable functions. |
41 | * New pseudo classes and matchers can be plugged. It works on HTML and XML documents (if a content node is passed in). | 38 | * New pseudo classes and matchers can be plugged. It works on HTML and XML documents (if a content node is passed in). |
42 | * @singleton | 39 | * @singleton |
43 | */ | 40 | */ |
44 | Clipperz.YUI.DomQuery = function(){ | 41 | Clipperz.YUI.DomQuery = function(){ |
45 | var cache = {}, simpleCache = {}, valueCache = {}; | 42 | var cache = {}, simpleCache = {}, valueCache = {}; |
46 | var nonSpace = /\S/; | 43 | var nonSpace = /\S/; |
47 | var trimRe = /^\s*(.*?)\s*$/; | 44 | var trimRe = /^\s*(.*?)\s*$/; |
48 | var tplRe = /\{(\d+)\}/g; | 45 | var tplRe = /\{(\d+)\}/g; |
49 | var modeRe = /^(\s?[\/>]\s?|\s|$)/; | 46 | var modeRe = /^(\s?[\/>]\s?|\s|$)/; |
50 | var clsRes = {}; | 47 | var clsRes = {}; |
51 | 48 | ||
52 | function child(p, index){ | 49 | function child(p, index){ |
53 | var i = 0; | 50 | var i = 0; |
54 | var n = p.firstChild; | 51 | var n = p.firstChild; |
55 | while(n){ | 52 | while(n){ |
56 | if(n.nodeType == 1){ | 53 | if(n.nodeType == 1){ |
57 | i++; | 54 | i++; |
58 | if(i == index){ | 55 | if(i == index){ |
59 | return n; | 56 | return n; |
60 | } | 57 | } |
61 | } | 58 | } |
62 | n = n.nextSibling; | 59 | n = n.nextSibling; |
63 | } | 60 | } |
64 | return null; | 61 | return null; |
65 | }; | 62 | }; |
66 | 63 | ||
67 | function next(d){ | 64 | function next(d){ |
68 | var n = d.nextSibling; | 65 | var n = d.nextSibling; |
69 | while(n && n.nodeType != 1){ | 66 | while(n && n.nodeType != 1){ |
70 | n = n.nextSibling; | 67 | n = n.nextSibling; |
71 | } | 68 | } |
72 | return n; | 69 | return n; |
73 | }; | 70 | }; |
74 | 71 | ||
75 | function prev(d){ | 72 | function prev(d){ |
76 | var n = d.previousSibling; | 73 | var n = d.previousSibling; |
77 | while(n && n.nodeType != 1){ | 74 | while(n && n.nodeType != 1){ |
78 | n = n.previousSibling; | 75 | n = n.previousSibling; |
79 | } | 76 | } |
80 | return n; | 77 | return n; |
81 | }; | 78 | }; |
82 | 79 | ||
83 | function clean(d){ | 80 | function clean(d){ |
84 | var n = d.firstChild, ni = -1; | 81 | var n = d.firstChild, ni = -1; |
85 | while(n){ | 82 | while(n){ |
86 | var nx = n.nextSibling; | 83 | var nx = n.nextSibling; |
87 | if(n.nodeType == 3 && !nonSpace.test(n.nodeValue)){ | 84 | if(n.nodeType == 3 && !nonSpace.test(n.nodeValue)){ |
88 | d.removeChild(n); | 85 | d.removeChild(n); |
89 | }else{ | 86 | }else{ |
90 | n.nodeIndex = ++ni; | 87 | n.nodeIndex = ++ni; |
91 | } | 88 | } |
92 | n = nx; | 89 | n = nx; |
93 | } | 90 | } |
94 | return this; | 91 | return this; |
95 | }; | 92 | }; |
96 | 93 | ||
97 | function byClassName(c, a, v){ | 94 | function byClassName(c, a, v){ |
98 | if(!v){ | 95 | if(!v){ |
99 | return c; | 96 | return c; |
100 | } | 97 | } |
101 | var re = clsRes[v]; | 98 | var re = clsRes[v]; |
102 | if(!re){ | 99 | if(!re){ |
103 | re = new RegExp('(?:^|\\s)(?:' + v + ')(?:\\s|$)'); | 100 | re = new RegExp('(?:^|\\s)(?:' + v + ')(?:\\s|$)'); |
104 | clsRes[v] = re; | 101 | clsRes[v] = re; |
105 | } | 102 | } |
106 | var r = []; | 103 | var r = []; |
107 | for(var i = 0, ci; ci = c[i]; i++){ | 104 | for(var i = 0, ci; ci = c[i]; i++){ |
108 | if(re.test(ci.className)){ | 105 | if(re.test(ci.className)){ |
109 | r[r.length] = ci; | 106 | r[r.length] = ci; |
110 | } | 107 | } |
111 | } | 108 | } |
112 | return r; | 109 | return r; |
113 | }; | 110 | }; |
114 | 111 | ||
115 | function convert(c){ | 112 | function convert(c){ |
116 | if(c.slice){ | 113 | if(c.slice){ |
117 | return c; | 114 | return c; |
118 | } | 115 | } |
119 | var r = []; | 116 | var r = []; |
120 | for(var i = 0, l = c.length; i < l; i++){ | 117 | for(var i = 0, l = c.length; i < l; i++){ |