2 * Original code by ofk ( kQuery, ksk )
\r
3 * http://d.hatena.ne.jp/ofk/comment/20090106/1231258010
\r
4 * http://d.hatena.ne.jp/ofk/20090111/1231668170
\r
7 * http://standards.mitsue.co.jp/resources/w3c/TR/css3-selectors/#nth-child-pseudo
\r
11 X_Node_Selector__PSEUDO = {
\r
13 'nth-last-child' : 14,
\r
15 'nth-last-of-type' : 16,
\r
29 'last-of-type' : 12,
\r
30 'only-of-type' : 12,
\r
31 'first-of-type' : 13
\r
34 X_Node_Selector__COMBINATOR = {
\r
38 '+' : 3, // 兄弟セレクタ,共通の親を持つ、1番目要素が2番目要素の1つ前にある
\r
39 '~' : 4, // 一般兄弟セレクタ,共通の親を持つ、1番目要素が2番目要素の前 (直前でなくともよい) にある
\r
41 '@' : 6 // XML 用の拡張、属性ノードを辿る http://www.marguerite.jp/Nihongo/WWW/RefDOM/_Attr_interface.html
\r
43 X_Node_Selector__SELECTOR = {
\r
55 X_Node_Selector__OPERATORS = { '==' : 1, '!=': 2, '~=': 3, '^=': 4, '$=': 5, '*=': 6, '|=': 7 }, // '':0 は属性が存在するならtrue
\r
56 // TODO { a : 1, A : 2, _ : 3,,, }
\r
57 X_Node_Selector__ALPHABET = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-0123456789\\',
\r
58 X_Node_Selector__NUMBER = '+-0123456789';
\r
61 * セレクタ文字列の解析、但し一挙に行わず、ひと塊づつ
\r
62 * 結合子 + 単体セレクタ( タグ,*,#,.,[],: )
\r
63 * ' ' 子孫セレクタ, '>' 直下,'+','~' の場合、tagName|* を返す
\r
64 * return [ 今回のパースで解析した終端位置, [ selector, ... ] ] error: return pointer
\r
66 function X_Node_Selector__parse( query, last ){
\r
67 var COMBINATOR = X_Node_Selector__COMBINATOR,
\r
68 SELECTOR = X_Node_Selector__SELECTOR,
\r
69 OPERATORS = X_Node_Selector__OPERATORS,
\r
70 ALPHABET = X_Node_Selector__ALPHABET,
\r
71 NUMBER = X_Node_Selector__NUMBER,
\r
78 chr, chrCode, nameChr, name1st,
\r
79 tmp, escape, quot, start,
\r
80 name, key, value, operator, a, b, not;
\r
83 chr = query.charAt( ++i );
\r
84 chrCode = ALPHABET.indexOf( chr );
\r
85 nameChr = chrCode !== -1;
\r
86 name1st = nameChr && chrCode < 52;
\r
89 name1st ? // tagName
\r
90 ( ( selector = 1 ) && ( phase = 0x2 ) && ( start = i ) ) :
\r
91 !not && ( tmp = COMBINATOR[ chr ] ) ? (
\r
92 ( 1 < tmp && 1 < combinator ) ?
\r
94 ( phase = tmp === 5 ? 0xe : 0x0 ) & ( ( 1 < tmp || combinator < 1 ) && ( combinator = tmp ) ) & ( tmp === 5 && ++i ) ) : // ' ' でない結合子の上書きはエラー
\r
95 ( tmp = SELECTOR[ chr ] ) ? // [
\r
96 ( selector = tmp ) && ( phase = selector === 5 ? 0x4 : 0x1 ) : // 7:[, 0<:
\r
98 ( ( selector = 1 ) && ( name = chr ) && ( phase = 0xe ) && ++i ) :
\r
99 chr !== ' ' && ( phase = 0xf );
\r
100 //console.log( '0x0: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase + ' tmp:' + tmp + ' comb:' + combinator );
\r
104 ( ( start = i ) && ( phase = 0x2 ) ) :
\r
105 chr !== ' ' && ( phase = 0xf );
\r
108 !nameChr && !( escape && ( selector === 2 || selector === 3 ) && ( chr === ':' || chr === '.' ) ) ? // id or class の場合 : . を直前にエスケープした場合に限り使える
\r
109 ( name = query.substring( start, i ) ) && ( phase = selector === 4 && name !== 'not' && chr === '(' ? ( name !== 'lang' && name !== 'contains' ? 0x8 : 0xb ) : 0xe ) :
\r
110 SELECTOR[ chr ] < 4 && ( phase = 0xe );
\r
116 case 0x4 : // start attr filter
\r
118 ( ( phase = 0x5 ) && ( start = i ) ) :
\r
122 case 0x5 : // attr filter key
\r
124 ( ( operator = 1 ) && ( phase = 0x6 ) && ( key || ( key = query.substring( start, i ) ) ) && ( start = i + 1 ) ) :
\r
126 ( !( operator = 0 ) && ( phase = 0xe ) && ( key || ( key = query.substring( start, i ) ) ) && ++i ) :
\r
128 ( key || ( key = query.substring( start, i ) ) ) :
\r
129 ( operator = OPERATORS[ query.substr( i, 2 ) ] ) ?
\r
130 ( ( phase = 0x6 ) && ( key || ( key = query.substring( start, i ) ) ) && ( start = ++i ) ) :
\r
131 !nameChr && ( phase = 0xf );
\r
132 //console.log( name1st + ' ' + chrCode + chr + phase );
\r
135 ( chr === '"' || chr === "'" ) && !escape && !quot ?
\r
136 ( quot = chr ) && ( start = i + 1 ) && ( phase = 0x7 ) :
\r
137 chr !== ' ' && ( start = i ) && ( phase = 0x7 );
\r
140 case 0x7 : // attr filter value
\r
142 !escape && !value && ( value = query.substring( start, i ) ) :
\r
144 ( ( value || ( value = query.substring( start, i ) ) ) && ( phase = 0xe ) && ++i ) :
\r
145 chr === ' ' && !quot && !value && ( value = query.substring( start, i ) );
\r
146 //( chr === '"' || chr === "'" ) && !quot && ( quot = chr ) && ( start = i + 1 );
\r
149 case 0x8 : // 4, 2n, even, odd, -n+4,
\r
150 NUMBER.indexOf( chr ) !== -1 ?
\r
151 ( start = i ) && ( phase = 0x9 ) :
\r
153 ( phase = 0xa ) && ( a = 1 ) && ( start = i + 1 ) :
\r
154 query.substr( i, 4 ) === 'even' ?
\r
155 ( ( a = 2 ) && !( b = 0 ) && ( i += 3 ) ) :
\r
156 query.substr( i, 3 ) === 'odd' ?
\r
157 ( ( a = 2 ) && ( b = 1 ) && ( i += 2 ) ) :
\r
158 chr === ')' && ( phase = a ? 0xe : 0xf ) && ++i;
\r
159 //console.log( '0x8: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase + ' ' + name );
\r
162 tmp = query.substring( start, i );
\r
164 ( phase = 0xa ) && ( start = i + 1 ) && ( a = tmp === '+' ? 1 : tmp === '-' ? -1 : parseFloat( tmp ) ) :
\r
165 chr === ')' && ( phase = 0xe ) && ++i && ( b = parseFloat( tmp ) ) && ( a = 0 );
\r
166 //console.log( '0x9: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase );
\r
169 chr === ')' && ( phase = 0xe ) && ++i && ( b = parseFloat( query.substring( start, i ) ) || 0 );
\r
170 //console.log( '0xa: ' + start + ' ' + i );
\r
174 ( chr === '"' || chr === "'" ) && !escape && !quot &&
\r
175 ( quot = chr ) && ( start = i + 1 ) && ( phase = 0xc );
\r
178 chr === quot && !escape && ( value = query.substring( start, i ) ) && ( phase = 0xd );
\r
181 chr === ')' && ( phase = 0xe ) && ++i;
\r
186 if( phase === 0xf ) return i;
\r
188 //alert( chr + ' ' + phase + ' ' + selector + ' ' + name + ' ' + name1st )
\r
189 if( phase === 0xe ){
\r
190 if( selector === 4 ){// :not
\r
191 if( name === 'not' ){
\r
202 if( name === 'lang' || name === 'contains' ){
\r
203 result = [ not ? 0 : combinator, selector, name, value ];
\r
206 if( a !== a || b !== b ) return i;
\r
207 result = [ not ? 0 : combinator, SELECTOR[ name ] || selector, name, a, b ];
\r
215 [ not ? 0 : combinator, selector, key, operator, value ] :
\r
216 [ not ? 0 : combinator, selector, name.split( '\\' ).join( '' ) ];
\r
221 escape = chr === '\\' && !escape;
\r
223 //if( phase !== 0xe ) return i;
\r
224 if( not && ( tmp = query.substr( i ).indexOf( ')' ) ) === -1 ) return i;
\r
225 return not ? [ i + tmp + 1, [ combinator, 6, result ] ] : [ i, result ];
\r
229 * selector を使って Node, NodeList を取得する
\r
230 * @alias X.Doc.find
\r
232 * @param {string} セレクター文字列
\r
233 * @return {Node|NodeList}
\r
235 X[ 'Doc' ][ 'find' ] = X_shortcutFunction =
\r
237 * selector を使って Node, NodeList を取得する
\r
238 * @alias Node.prototype.find
\r
240 * @param {string} セレクター文字列
\r
241 * @return {Node|NodeList}
\r
243 Node.prototype[ 'find' ] =
\r
245 * selector を使って Node, NodeList を取得する
\r
246 * @alias NodeList.prototype.find
\r
248 * @param {string} セレクター文字列
\r
249 * @return {Node|NodeList}
\r
251 X_NodeList.prototype[ 'find' ] = function ( queryString ){
\r
252 var HTML = X_Node_html,
\r
253 scope = this.constructor === X_NodeList && this.length ? this : [ this.constructor === Node ? this : X_Node_body ],
\r
254 parents = scope, // 探索元の親要素 XNodeList の場合あり
\r
255 // TODO { title : true,,, }
\r
256 noLower = 'title id name class for action archive background cite classid codebase data href longdesc profile src usemap',// + X_Dom_DTD_ATTR_VAL_IS_URI.join( ' ' ),
\r
257 ARY_PUSH = Array.prototype.push,
\r
259 root = X_Node_getRoot( scope[ 0 ] ),
\r
260 isXML = !!X_Node_isXmlDocument( root ),
\r
261 isMulti = 1 < scope.length,// 要素をマージする必要がある
\r
264 isAll, isNot, hasRoot,
\r
267 merge, // 要素がコメントノードで汚染されている場合使う
\r
268 parent, children, j, m,
\r
269 combinator, selector, name, tagName,
\r
270 uid, tmp, xnode, filter, key, op, val, toLower, useName,
\r
271 links, className, attr, flag;
\r
274 if( X_ViewPort_readyState < X_EVENT_XDOM_READY ){
\r
275 alert( 'not ready! use X.ViewPort.listenOnce( X_EVENT_XDOM_READY, callback )' );
\r
281 if( typeof queryString !== 'string' ) return ret;
\r
286 for( ; queryString.length; ){
\r
287 //console.log( 'queryString[' + queryString + ']' );
\r
291 parsed = X_Node_Selector__parse( queryString );
\r
293 if( typeof parsed === 'number' ){
\r
298 queryString = queryString.substr( parsed[ 0 ] );
\r
299 parsed = parsed[ 1 ];
\r
301 //console.log( 'X_Node_Selector__parse ' + parsed );
\r
303 if( parsed === 5 ){
\r
306 xnodes && xnodes.length && ARY_PUSH.apply( ret, xnodes );
\r
314 combinator = parsed[ 0 ];
\r
315 selector = parsed[ 1 ];
\r
316 name = parsed[ 2 ];
\r
317 tagName = selector === 1 ? ( isXML ? name : name.toUpperCase() ) : '*';
\r
318 isAll = tagName === '*';
\r
321 if( !xnodes.length ){
\r
325 if( combinator !== 0 ){
\r
328 //console.log( 'cobinator !== 0 ' + parents.length + ' : ' + xnodes.length );
\r
333 l = parents.length;
\r
335 isMulti = isMulti || 1 < l;
\r
337 //console.log( 'combinator ' + combinator );
\r
339 switch( combinator ){
\r
342 for( ; i < l; ++i ){
\r
343 parent = parents[ i ];
\r
344 if( ( children = parent[ '_xnodes' ] ) && ( m = children.length ) ){
\r
345 for( j = 0; j < m; ++j ){
\r
346 xnode = children[ j ];
\r
347 if( xnode[ '_tag' ] && ( isAll || tagName === xnode[ '_tag' ] ) ) xnodes[ ++n ] = xnode;
\r
354 for( ; i < l; ++i ){
\r
356 xnode = parents[ i ];
\r
357 j = xnode[ 'getOrder' ]() + 1;
\r
358 parent = xnode.parent;
\r
359 if( parent && ( children = parent[ '_xnodes' ] ) && ( m = children.length ) ){
\r
360 for( ; j < m; ++j ){
\r
361 xnode = children[ j ];
\r
362 if( xnode[ '_tag' ] ){
\r
363 if( isAll || tagName === xnode[ '_tag' ] ){
\r
364 xnodes[ ++n ] = xnode;
\r
371 for( xnode = parents[ i ][ 'next' ](); xnode; xnode = xnode[ 'next' ]() ){
\r
372 if( xnode[ '_tag' ] ){
\r
373 if( isAll || tagName === xnode[ '_tag' ] ) xnodes[ ++n ] = xnode;
\r
382 for( ; i < l; ++i ){
\r
383 for( xnode = parents[ i ][ 'next' ](); xnode; xnode = xnode[ 'next' ]() ){
\r
384 if( xnode[ '_tag' ] && ( isAll || tagName === xnode[ '_tag' ] ) ){
\r
385 uid = xnode[ '_uid' ];
\r
386 if( merge[ uid ] ){
\r
389 merge[ uid ] = true;
\r
390 xnodes[ ++n ] = xnode;
\r
397 // case 6 : 属性ノードは実装しない
\r
400 if( combinator === 1 || ( isStart && selector < 7 ) ){
\r
402 if( tagName === 'HTML' ){
\r
403 xnodes[ 0 ] = X_Node_html;
\r
406 if( tagName === 'HEAD' ){
\r
407 xnodes[ 0 ] = X_Node_head;
\r
410 if( tagName === 'BODY' ){
\r
411 xnodes[ 0 ] = X_Node_body;
\r
416 //console.log( l + ' > ' + xnodes.length + ' tag:' + tagName );
\r
418 X_Node_Selector__fetchElements( xnodes, parents, isAll ? '' : tagName, merge );
\r
419 //console.log( l + ' >> ' + xnodes.length + ' tag:' + tagName );
\r
425 //alert( 'pre-selector:' + ( xnodes && xnodes.length ) )
\r
427 switch( selector ){
\r
430 filter = [ 'id', 1, name ]; break;
\r
433 filter = [ 'class', 3 /*'~='*/, name ]; break;
\r
436 if( !( filter = X_Node_Selector__filter[ name ] ) ){
\r
442 filter = [ name, parsed[ 3 ], parsed[ 4 ] ]; break;
\r
446 parsed = parsed[ 2 ];
\r
447 name = parsed[ 2 ];
\r
448 switch( parsed[ 1 ] ) {
\r
450 filter = [ 'tag', 1, isXML ? name : name.toUpperCase() ]; break;
\r
453 filter = [ 'id', 1, name ]; break;
\r
456 filter = [ 'class', 3, name ]; break;
\r
459 if( !( filter = X_Node_Selector__filter[ name ] ) ){
\r
465 filter = [ name, parsed[ 3 ], parsed[ 4 ] ]; break;
\r
470 xnodes = scope; break;
\r
474 xnodes = [ HTML ]; break;
\r
477 if( links = document.links ){
\r
478 for( xnodes = [], i = links.length; i; ){
\r
479 xnodes[ --i ] = Node( links[ i ] );
\r
482 // area[href],a[href]
\r
486 if( filter && xnodes.length ){
\r
495 parsed[ 3 ], parsed[ 4 ]
\r
499 if( typeof filter === 'function' ){
\r
501 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
502 if( ( !!filter( xnode ) ) ^ isNot ) tmp[ ++n ] = xnode;
\r
512 key = X_Node_Attr_renameForTag[ key ] || key;
\r
515 if( !isXML && key === 'class' && op === 3 ){
\r
517 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
518 className = xnode[ '_className' ];
\r
519 if( !!( className && ( _ + className + _ ).indexOf( val ) > -1 ) ^ isNot ) tmp[ ++n ] = xnode;
\r
524 // flag_call = ($.browser.safari && key === 'selected');
\r
525 // getAttributeを使わない
\r
526 useName = X_UA[ 'IE' ] && key !== 'href' && key !== 'src';
\r
527 toLower = !!val && !isXML && noLower.indexOf( key ) === -1; //!noLower.test(key);
\r
528 if( toLower ) val = val.toLowerCase();
\r
529 if( op === 3 ) val = _ + val + _;
\r
531 for( i = 0, n = -1, l = xnodes.length; i < l; ++i ){
\r
532 xnode = xnodes[ i ];
\r
534 key === 'tag' ? xnode[ '_tag' ] :
\r
535 key === 'id' ? xnode[ '_id' ] :
\r
536 key === 'class' ? xnode[ '_className' ] :
\r
537 xnode[ '_attrs' ] && xnode[ '_attrs' ][ key ];
\r
539 // funcAttr( elem, key ) :
\r
541 // elem[ X_Node_Attr_renameForDOM[ key ] || key ] :
\r
542 // elem.getAttribute( key, 2 );
\r
543 flag = !!attr;// && ( !useName || attr !== '' );
\r
545 if( toLower ) attr = attr.toLowerCase();
\r
549 flag = attr === val;
\r
552 flag = attr !== val;
\r
555 flag = ( _ + attr + _ ).indexOf( val ) !== -1;
\r
558 flag = attr.indexOf( val ) === 0;
\r
561 flag = attr.lastIndexOf( val ) + val.length === attr.length;
\r
564 flag = attr.indexOf( val ) !== -1;
\r
567 flag = attr === val || attr.substring( 0, val.length + 1 ) === val + '-';
\r
571 if( !!flag ^ isNot ) tmp[ ++n ] = xnode;
\r
581 //console.log( '//end :' + ( xnodes && xnodes.length ) );
\r
583 //console.log( 'multi:' + ( xnodes && xnodes.length ) );
\r
585 // tree 順に並び替え、同一要素の排除
\r
587 xnodes && xnodes.length && ARY_PUSH.apply( ret, xnodes );
\r
589 if( l < 2 ) return ret[ 0 ] || X_Node_none;
\r
593 for( i = 0, n = -1; i < l; ++i ){
\r
594 //alert( 'multi:' + i )
\r
596 if( !merge[ uid = xnode[ '_uid' ] ] ){
\r
597 merge[ uid ] = true;
\r
598 xnodes[ ++n ] = xnode;
\r
601 xnodes = X_Node_Selector__sortElementOrder( [], xnodes, hasRoot ? [ HTML ] : HTML[ '_xnodes' ] );
\r
604 return xnodes.length === 1 ? xnodes[ 0 ] : new X_NodeList( xnodes );
\r
607 function X_Node_Selector__sortElementOrder( newList, list, xnodes ){
\r
608 var l = xnodes.length,
\r
611 for( ; i < l; ++i ){
\r
612 child = xnodes[ i ];
\r
613 if( !child[ '_tag' ] ) continue;
\r
615 j = list.indexOf( child );
\r
617 newList[ newList.length ] = child;
\r
618 if( list.length === 2 ){
\r
619 newList[ newList.length ] = list[ j === 0 ? 1 : 0 ];
\r
622 list.splice( j, 1 );
\r
625 if( ( _xnodes = child[ '_xnodes' ] ) && X_Node_Selector__sortElementOrder( newList, list, _xnodes ) ){
\r
631 function X_Node_Selector__fetchElements( list, xnodes, tag, merge ){
\r
632 var l = xnodes.length,
\r
634 child, uid, _tag, _xnodes;
\r
635 for( ; i < l; ++i ){
\r
636 child = xnodes[ i ];
\r
637 uid = child[ '_uid' ];
\r
638 _tag = child[ '_tag' ];
\r
639 if( !merge[ uid ] && _tag ){
\r
640 merge[ uid ] = true;
\r
641 ( !tag || tag === _tag ) && ( list[ list.length ] = child );
\r
642 if( ( _xnodes = child[ '_xnodes' ] ) && ( 1 < _xnodes.length || ( _xnodes[ 0 ] && _xnodes[ 0 ][ '_tag' ] ) ) ){
\r
643 X_Node_Selector__fetchElements( list, _xnodes, tag, merge );
\r
649 function X_Node_Selector__fetchElements( list, parent, tag, merge ){
\r
651 var xnodes = parent[ '_xnodes' ],
\r
657 memories = [ memory ],
\r
661 while( memories.length ){
\r
662 memory = memories.pop();
\r
663 xnodes = memory.xnodes;
\r
666 for( ; i < l; ++i ){
\r
667 xnode = xnodes[ i ];
\r
668 uid = xnode[ '_uid' ];
\r
669 if( !merge[ uid ] && xnode[ '_tag' ] ){
\r
670 if( !tag || xnode[ '_tag' ] === tag ) list[ list.length ] = xnode;
\r
672 if( _xnodes = xnode[ '_xnodes' ] ){
\r
673 if( 1 < _xnodes.length || ( _xnodes[ 0 ] && _xnodes[ 0 ][ '_tag' ] ) ){
\r
676 memory.xnodes = xnodes;
\r
677 memories[ memories.length ] = memory;
\r
678 memories[ memories.length ] = {
\r
680 l : _xnodes.length,
\r
683 merge[ uid ] = true;
\r
688 merge[ uid ] = true;
\r
693 function X_Node_Selector__funcSelectorChild( type, flag_all, flags, xnodes ){
\r
695 flag_not = flags.not,
\r
696 i = 0, n = -1, xnode, node,
\r
698 for( ; xnode = xnodes[ i ]; ++i ){
\r
699 tagName = flag_all || xnode[ '_tag' ];
\r
701 if( /* tmp === null && */ type <= 0 ){
\r
702 for( node = xnode[ 'prev' ](); node; node = node[ 'prev' ]() ){
\r
703 if( node[ '_tag' ] && ( flag_all || tagName === node[ '_tag' ] ) ){
\r
709 if( tmp === null && 0 <= type ){
\r
710 for( node = xnode[ 'next' ](); node; node = node[ 'next' ]() ){
\r
711 if( node[ '_tag' ] && ( flag_all || tagName === node[ '_tag' ] ) ){
\r
717 if( tmp === null ) tmp = true;
\r
718 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
722 function X_Node_Selector__funcSelectorNth( pointer, sibling, flag_all, flags, xnodes, a, b ){
\r
725 flag_not = flags.not,
\r
726 i = 0, n = -1, uid,
\r
727 c, xnode, tmp, node, tagName;
\r
728 for( ; xnode = xnodes[ i ]; ++i ){
\r
729 uid = xnode[ '_uid' ];
\r
730 tmp = checked[ uid ];
\r
731 if( tmp === void 0 ){
\r
732 for( c = 0, node = xnode.parent[ pointer ](), tagName = flag_all || xnode[ '_tag' ]; node; node = node[ sibling ]() ){
\r
733 if( node[ '_tag' ] && ( flag_all || tagName === node[ '_tag' ] ) ){
\r
735 checked[ node[ '_uid' ] ] = a === 0 ? c === b : (c - b) % a === 0 && (c - b) / a >= 0;
\r
738 tmp = checked[ uid ];
\r
740 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
744 function X_Node_Selector__funcSelectorProp( prop, flag, flags, xnodes ){
\r
746 flag_not = flag ? flags.not : !flags.not,
\r
747 i = 0, n = -1, xnode;
\r
748 for( ; xnode = xnodes[ i ]; ++i ){
\r
749 if( xnode[ '_attrs' ] && xnode[ '_attrs' ][ prop ] ^ flag_not ) res[ ++n ] = xnode;
\r
754 var X_Node_Selector__filter = {
\r
755 'root' : function(){
\r
756 return X_Node_html;
\r
759 m : function( flags, xnodes ){
\r
761 hash = location.hash.slice( 1 ),
\r
762 flag_not = flags.not,
\r
763 i = 0, n = -1, xnode;
\r
764 for ( ; xnode = xnodes[ i ]; ++i ){
\r
765 if( ( ( xnode[ '_id' ] || xnode[ '_attrs' ] && xnode[ '_attrs' ][ 'name' ] ) === hash ) ^ flag_not ) res[ ++n ] = xnode;
\r
771 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( -1, true, flags, xnodes ); }
\r
774 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 1, true, flags, xnodes ); }
\r
777 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 0, true, flags, xnodes ); }
\r
779 'first-of-type' : {
\r
780 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( -1, false, flags, xnodes ); }
\r
783 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 1, false, flags, xnodes ); }
\r
786 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 0, false, flags, xnodes ); }
\r
789 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'firstChild', 'next', true, flags, xnodes, a, b ); }
\r
791 'nth-last-child' : {
\r
792 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'lastChild', 'prev', true, flags, xnodes, a, b ); }
\r
795 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'firstChild', 'next', false, flags, xnodes, a, b ); }
\r
797 'nth-last-of-type' : {
\r
798 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'lastChild', 'prev', false, flags, xnodes, a, b ); }
\r
801 m : function( flags, xnodes ){
\r
803 flag_not = flags.not,
\r
804 i = 0, n = -1, xnode, tmp, node;
\r
805 for( ; xnode = xnodes[i]; ++i ){
\r
807 for( node = xnode[ 'firstChild' ](); node; node = node[ 'next' ]() ){
\r
808 if( node[ '_tag' ] || node[ '_text' ] ){
\r
813 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
819 m : function( flags, xnodes ){
\r
820 var links = document.links,
\r
822 checked, flag_not, i, link, xnode, n;
\r
823 if( !links ) return res;
\r
825 flag_not = flags.not;
\r
826 for( i = 0; link = links[ i ]; ++i ){
\r
827 checked[ ( Node( link ) )[ '_uid' ] ] = true;
\r
829 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
830 if( checked[ xnode[ '_uid' ] ] ^ flag_not ) res[ ++n ] = xnode;
\r
836 m : function( flags, xnodes, arg ){
\r
838 //reg = new RegExp('^' + arg, 'i'),
\r
839 flag_not = flags.not,
\r
840 i = 0, n = -1, xnode, tmp, lang;
\r
841 arg = arg.toLowerCase();
\r
842 for( ; tmp = xnode = xnodes[ i ]; ++i ){
\r
843 while( tmp && !( lang = tmp[ '_attrs' ] && tmp[ '_attrs' ][ 'lang' ] ) ){
\r
846 //tmp = !!(tmp && reg.test(tmp.getAttribute('lang')));
\r
847 if( ( !!lang && lang.toLowerCase().indexOf( arg ) === 0 ) ^ flag_not ) res[ ++n ] = xnode;
\r
853 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'disabled', false, flags, xnodes ); }
\r
856 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'disabled', true, flags, xnodes ); }
\r
859 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'checked', true, flags, xnodes ); }
\r
862 m : function( flags, xnodes, arg ){
\r
864 flag_not = flags.not,
\r
865 i = 0, n = -1, xnode;
\r
866 for( ; xnode = xnodes[ i ]; ++i ){
\r
867 if ( ( -1 < ( xnode[ 'text' ]() ).indexOf( arg ) ) ^ flag_not ) res[ ++n ] = xnode;
\r