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
60 // XMLWrapper のために今だけ外部に公開
\r
61 X_NodeSelector_parse = X_Node_Selector__parse;
\r
64 * セレクタ文字列の解析、但し一挙に行わず、ひと塊づつ
\r
65 * 結合子 + 単体セレクタ( タグ,*,#,.,[],: )
\r
66 * ' ' 子孫セレクタ, '>' 直下,'+','~' の場合、tagName|* を返す
\r
67 * return [ 今回のパースで解析した終端位置, [ selector, ... ] ] error: return pointer
\r
69 function X_Node_Selector__parse( query, last ){
\r
70 var COMBINATOR = X_Node_Selector__COMBINATOR,
\r
71 SELECTOR = X_Node_Selector__SELECTOR,
\r
72 OPERATORS = X_Node_Selector__OPERATORS,
\r
73 ALPHABET = X_Node_Selector__ALPHABET,
\r
74 NUMBER = X_Node_Selector__NUMBER,
\r
81 chr, chrCode, nameChr, name1st,
\r
82 tmp, escape, quot, start,
\r
83 name, key, value, operator, a, b, not;
\r
86 chr = query.charAt( ++i );
\r
87 chrCode = ALPHABET.indexOf( chr );
\r
88 nameChr = chrCode !== -1;
\r
89 name1st = nameChr && chrCode < 52;
\r
92 name1st ? // tagName
\r
93 ( ( selector = 1 ) && ( phase = 0x2 ) && ( start = i ) ) :
\r
94 !not && ( tmp = COMBINATOR[ chr ] ) ? (
\r
95 ( 1 < tmp && 1 < combinator ) ?
\r
97 ( phase = tmp === 5 ? 0xe : 0x0 ) & ( ( 1 < tmp || combinator < 1 ) && ( combinator = tmp ) ) & ( tmp === 5 && ++i ) ) : // ' ' でない結合子の上書きはエラー
\r
98 ( tmp = SELECTOR[ chr ] ) ? // [
\r
99 ( selector = tmp ) && ( phase = selector === 5 ? 0x4 : 0x1 ) : // 7:[, 0<:
\r
101 ( ( selector = 1 ) && ( name = chr ) && ( phase = 0xe ) && ++i ) :
\r
102 chr !== ' ' && ( phase = 0xf );
\r
103 //console.log( '0x0: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase + ' tmp:' + tmp + ' comb:' + combinator );
\r
107 ( ( start = i ) && ( phase = 0x2 ) ) :
\r
108 chr !== ' ' && ( phase = 0xf );
\r
111 !nameChr && !( escape && ( selector === 2 || selector === 3 ) && ( chr === ':' || chr === '.' ) ) ? // id or class の場合 : . を直前にエスケープした場合に限り使える
\r
112 ( name = query.substring( start, i ) ) && ( phase = selector === 4 && name !== 'not' && chr === '(' ? ( name !== 'lang' && name !== 'contains' ? 0x8 : 0xb ) : 0xe ) :
\r
113 SELECTOR[ chr ] < 4 && ( phase = 0xe );
\r
119 case 0x4 : // start attr filter
\r
121 ( ( phase = 0x5 ) && ( start = i ) ) :
\r
124 case 0x5 : // attr filter key
\r
126 ( ( operator = 1 ) && ( phase = 0x6 ) && ( key || ( key = query.substring( start, i ) ) ) && ( start = i + 1 ) ) :
\r
128 ( !( operator = 0 ) && ( phase = 0xe ) && ( key || ( key = query.substring( start, i ) ) ) && ++i ) :
\r
130 ( key || ( key = query.substring( start, i ) ) ) :
\r
131 ( operator = OPERATORS[ query.substr( i, 2 ) ] ) ?
\r
132 ( ( phase = 0x6 ) && ( key || ( key = query.substring( start, i ) ) ) && ( start = ++i ) ) :
\r
133 !nameChr && ( phase = 0xf );
\r
134 //console.log( name1st + ' ' + chrCode + chr + phase );
\r
137 ( chr === '"' || chr === "'" ) && !escape && !quot ?
\r
138 ( quot = chr ) && ( start = i + 1 ) && ( phase = 0x7 ) :
\r
139 chr !== ' ' && ( start = i ) && ( phase = 0x7 );
\r
142 case 0x7 : // attr filter value
\r
144 !escape && !value && ( value = query.substring( start, i ) ) :
\r
146 ( ( value || ( value = query.substring( start, i ) ) ) && ( phase = 0xe ) && ++i ) :
\r
147 chr === ' ' && !quot && !value && ( value = query.substring( start, i ) );
\r
148 //( chr === '"' || chr === "'" ) && !quot && ( quot = chr ) && ( start = i + 1 );
\r
151 case 0x8 : // 4, 2n, even, odd, -n+4,
\r
152 NUMBER.indexOf( chr ) !== -1 ?
\r
153 ( start = i ) && ( phase = 0x9 ) :
\r
155 ( phase = 0xa ) && ( a = 1 ) && ( start = i + 1 ) :
\r
156 query.substr( i, 4 ) === 'even' ?
\r
157 ( ( a = 2 ) && !( b = 0 ) && ( i += 3 ) ) :
\r
158 query.substr( i, 3 ) === 'odd' ?
\r
159 ( ( a = 2 ) && ( b = 1 ) && ( i += 2 ) ) :
\r
160 chr === ')' && ( phase = a ? 0xe : 0xf ) && ++i;
\r
161 //console.log( '0x8: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase + ' ' + name );
\r
164 tmp = query.substring( start, i );
\r
166 ( phase = 0xa ) && ( start = i + 1 ) && ( a = tmp === '+' ? 1 : tmp === '-' ? -1 : parseFloat( tmp ) ) :
\r
167 chr === ')' && ( phase = 0xe ) && ++i && ( b = parseFloat( tmp ) ) && ( a = 0 );
\r
168 //console.log( '0x9: ' + name1st + ' ' + chrCode + ' ' + chr + ' ' + phase );
\r
171 chr === ')' && ( phase = 0xe ) && ++i && ( b = parseFloat( query.substring( start, i ) ) || 0 );
\r
172 console.log( '0xa: ' + start + ' ' + i );
\r
176 ( chr === '"' || chr === "'" ) && !escape && !quot &&
\r
177 ( quot = chr ) && ( start = i + 1 ) && ( phase = 0xc );
\r
180 chr === quot && !escape && ( value = query.substring( start, i ) ) && ( phase = 0xd );
\r
183 chr === ')' && ( phase = 0xe ) && ++i;
\r
188 if( phase === 0xf ) return i;
\r
190 //alert( chr + ' ' + phase + ' ' + selector + ' ' + name + ' ' + name1st )
\r
191 if( phase === 0xe ){
\r
192 if( selector === 4 ){// :not
\r
193 if( name === 'not' ){
\r
204 if( name === 'lang' || name === 'contains' ){
\r
205 result = [ not ? 0 : combinator, selector, name, value ];
\r
208 if( a !== a || b !== b ) return i;
\r
209 result = [ not ? 0 : combinator, selector, name, a, b ];
\r
217 [ not ? 0 : combinator, selector, key, operator, value ] :
\r
218 [ not ? 0 : combinator, selector, name.split( '\\' ).join( '' ) ];
\r
223 escape = chr === '\\' && !escape;
\r
225 //if( phase !== 0xe ) return i;
\r
226 if( not && ( tmp = query.substr( i ).indexOf( ')' ) ) === -1 ) return i;
\r
227 return not ? [ i + tmp + 1, [ combinator, 6, result ] ] : [ i, result ];
\r
231 X.Doc.find = X_shortcutFunction = Node.prototype.find = X_NodeList.prototype.find = function ( queryString ){
\r
232 var HTML = X_Node_html,
\r
233 scope = this.constructor === X_NodeList && this.length ? this : [ this.constructor === Node ? this : X_Node_body ],
\r
234 parents = scope, // 探索元の親要素 XNodeList の場合あり
\r
235 // TODO { title : true,,, }
\r
236 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
237 ARY_PUSH = Array.prototype.push,
\r
239 root = X_Node_getRoot( scope[ 0 ] ),
\r
240 isXML = !!X_Node_isXmlDocument( root ),
\r
241 isMulti = 1 < scope.length,// 要素をマージする必要がある
\r
244 isAll, isNot, hasRoot,
\r
247 merge, // 要素がコメントノードで汚染されている場合使う
\r
248 combinator, selector, name, tagName,
\r
249 uid, tmp, xnode, filter, key, op, val, toLower, useName,
\r
250 links, className, attr, flag;
\r
253 if( X_ViewPort_readyState < X.Event.XDOM_READY ){
\r
254 alert( 'not ready! use X.ViewPort.listenOnce( X.Event.XDOM_READY, callback )' );
\r
260 if( typeof queryString !== 'string' ) return ret;
\r
265 for( ; queryString.length; ){
\r
266 //console.log( 'queryString[' + queryString + ']' );
\r
270 parsed = X_Node_Selector__parse( queryString );
\r
272 if( typeof parsed === 'number' ){
\r
277 queryString = queryString.substr( parsed[ 0 ] );
\r
278 parsed = parsed[ 1 ];
\r
280 //console.log( 'X_Node_Selector__parse ' + parsed );
\r
282 if( parsed === 5 ){
\r
285 xnodes && xnodes.length && ARY_PUSH.apply( ret, xnodes );
\r
293 combinator = parsed[ 0 ];
\r
294 selector = parsed[ 1 ];
\r
295 name = parsed[ 2 ];
\r
296 tagName = selector === 1 ? ( isXML ? name : name.toUpperCase() ) : '*';
\r
297 isAll = tagName === '*';
\r
300 if( !xnodes.length ){
\r
304 if( combinator !== 0 ){
\r
307 //console.log( 'cobinator !== 0 ' + parents.length + ' : ' + xnodes.length );
\r
312 l = parents.length;
\r
314 isMulti = isMulti || 1 < l;
\r
316 //console.log( 'combinator ' + combinator );
\r
318 switch( combinator ){
\r
321 for( ; i < l; ++i ){
\r
322 for( xnode = parents[ i ].firstChild(); xnode; xnode = xnode.next() ){
\r
323 if( xnode._tag && ( isAll || tagName === xnode._tag ) ) xnodes[ ++n ] = xnode;
\r
329 for( ; i < l; ++i ){
\r
330 for( xnode = parents[ i ].next(); xnode; xnode = xnode.next() ){
\r
332 if( isAll || tagName === xnode._tag ) xnodes[ ++n ] = xnode;
\r
341 for( ; i < l; ++i ){
\r
342 for( xnode = parents[ i ].next(); xnode; xnode = xnode.next() ){
\r
343 if( xnode._tag && ( isAll || tagName === xnode._tag ) ){
\r
345 if( merge[ uid ] ){
\r
348 merge[ uid ] = true;
\r
349 xnodes[ ++n ] = xnode;
\r
356 // case 6 : 属性ノードは実装しない
\r
359 if( combinator === 1 || ( isStart && selector < 7 ) ){
\r
360 //console.log( l + ' > ' + xnodes.length + ' tag:' + tagName );
\r
361 for( ; i < l; ++i ){
\r
362 xnode = parents[ i ];
\r
363 xnode._xnodes && xnode._xnodes.length && X_Node_Selector__fetchElements( xnodes, xnode, isAll ? null : tagName );
\r
365 //console.log( l + ' >> ' + xnodes.length + ' tag:' + tagName );
\r
371 //alert( 'pre-selector:' + ( xnodes && xnodes.length ) )
\r
373 switch( selector ){
\r
376 filter = [ 'id', 1, name ]; break;
\r
379 filter = [ 'class', 3 /*'~='*/, name ]; break;
\r
382 if( !( filter = X_Node_Selector__filter[ name ] ) ){
\r
388 filter = [ name, parsed[ 3 ], parsed[ 4 ] ]; break;
\r
392 parsed = parsed[ 2 ];
\r
396 xnodes = scope; break;
\r
400 xnodes = [ HTML ]; break;
\r
403 if( links = document.links ){
\r
404 for( xnodes = [], i = links.length; i; ){
\r
405 xnodes[ --i ] = new Node( links[ i ] );
\r
408 // area[href],a[href]
\r
412 if( filter && xnodes.length ){
\r
421 parsed[ 3 ], parsed[ 4 ]
\r
425 if( typeof filter === 'function' ){
\r
427 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
428 if( ( !!filter( xnode ) ) ^ isNot ) tmp[ ++n ] = xnode;
\r
438 key = X_Node_Attr_renameForTag[ key ] || key;
\r
441 if( !isXML && key === 'class' && op === 3 ){
\r
443 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
444 className = xnode._className;
\r
445 if( !!( className && ( _ + className + _ ).indexOf( val ) > -1 ) ^ isNot ) tmp[ ++n ] = xnode;
\r
450 // flag_call = ($.browser.safari && key === 'selected');
\r
451 // getAttributeを使わない
\r
452 useName = X_UA.IE && key !== 'href' && key !== 'src';
\r
453 toLower = !!val && !isXML && noLower.indexOf( key ) === -1; //!noLower.test(key);
\r
454 if( toLower ) val = val.toLowerCase();
\r
455 if( op === 3 ) val = _ + val + _;
\r
457 for( i = 0, n = -1, l = xnodes.length; i < l; ++i ){
\r
458 xnode = xnodes[ i ];
\r
460 key === 'id' ? xnode._id :
\r
461 key === 'class' ? xnode._className :
\r
462 xnode._attrs && xnode._attrs[ key ];
\r
464 // funcAttr( elem, key ) :
\r
466 // elem[ X_Node_Attr_renameForDOM[ key ] || key ] :
\r
467 // elem.getAttribute( key, 2 );
\r
468 flag = attr != null;// && ( !useName || attr !== '' );
\r
470 if( toLower ) attr = attr.toLowerCase();
\r
474 flag = attr === val;
\r
477 flag = attr !== val;
\r
480 flag = ( _ + attr + _ ).indexOf( val ) !== -1;
\r
483 flag = attr.indexOf( val ) === 0;
\r
486 flag = attr.lastIndexOf( val ) + val.length === attr.length;
\r
489 flag = attr.indexOf( val ) !== -1;
\r
492 flag = attr === val || attr.substring( 0, val.length + 1 ) === val + '-';
\r
496 if( !!flag ^ isNot ) tmp[ ++n ] = xnode;
\r
506 //console.log( '//end :' + ( xnodes && xnodes.length ) );
\r
508 //console.log( 'multi:' + ( xnodes && xnodes.length ) );
\r
510 // tree 順に並び替え、同一要素の排除
\r
512 xnodes && xnodes.length && ARY_PUSH.apply( ret, xnodes );
\r
514 if( l < 2 ) return ret[ 0 ] || X_Node_none;
\r
518 for( i = 0, n = -1; i < l; ++i ){
\r
519 //alert( 'multi:' + i )
\r
521 if( !merge[ uid = xnode._uid ] ){
\r
522 merge[ uid ] = true;
\r
523 xnodes[ ++n ] = xnode;
\r
526 X_Node_Selector__sortElementOrder( ret = [], xnodes, hasRoot ? [ HTML ] : HTML._xnodes );
\r
530 return xnodes.length === 1 ? xnodes[ 0 ] : new X_NodeList( xnodes );
\r
533 function X_Node_Selector__sortElementOrder( newList, list, xnodes ){
\r
534 var l = xnodes.length,
\r
537 for( ; i < l; ++i ){
\r
538 child = xnodes[ i ];
\r
539 if( !child._tag ) continue;
\r
540 //console.log( child._tag );
\r
541 if( ( j = list.indexOf( child ) ) !== -1 ){
\r
542 newList[ newList.length ] = child;
\r
543 list.splice( j, 1 );
\r
544 if( list.length === 1 ){
\r
545 newList[ newList.length ] = list[ 0 ];
\r
549 if( list.length === 0 ) return true;
\r
551 if( ( _xnodes = child._xnodes ) && X_Node_Selector__sortElementOrder( newList, list, _xnodes ) ){
\r
557 function X_Node_Selector__fetchElements( list, parent, tag ){
\r
558 var xnodes = parent._xnodes,
\r
562 for( ; i < l; ++i ){
\r
563 child = xnodes[ i ];
\r
565 ( !tag || child._tag === tag ) && ( list[ list.length ] = child );
\r
566 //console.log( parent._tag + ' > ' + child._tag + ' == ' + tag+ ' l:' + list.length );
\r
567 child._xnodes && child._xnodes.length && X_Node_Selector__fetchElements( list, child, tag );
\r
572 function X_Node_Selector__funcSelectorChild( type, flag_all, flags, xnodes ){
\r
574 flag_not = flags.not,
\r
575 i = 0, n = -1, xnode, node,
\r
577 for( ; xnode = xnodes[ i ]; ++i ){
\r
578 tagName = flag_all || xnode._tag;
\r
580 if( /* tmp === null && */ type <= 0 ){
\r
581 for( node = xnode.prev(); node; node = node.prev() ){
\r
582 if( node._tag && ( flag_all || tagName === node._tag ) ){
\r
588 if( tmp === null && 0 <= type ){
\r
589 for( node = xnode.next(); node; node = node.next() ){
\r
590 if( node._tag && ( flag_all || tagName === node._tag ) ){
\r
596 if( tmp === null ) tmp = true;
\r
597 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
601 function X_Node_Selector__funcSelectorNth( pointer, sibling, flag_all, flags, xnodes, a, b ){
\r
602 var _data = funcData,
\r
605 flag_not = flags.not,
\r
606 i = 0, n = -1, uid,
\r
607 c, xnode, tmp, node, tagName;
\r
608 for( ; xnode = xnodes[ i ]; ++i ){
\r
610 tmp = checked[ uid ];
\r
611 if( tmp === void 0 ){
\r
612 for( c = 0, node = xnode.parent[ pointer ](), tagName = flag_all || xnode._tag; node; node = node[ sibling ]() ){
\r
613 if( node._tag && ( flag_all || tagName === node._tag ) ){
\r
615 checked[ node._uid ] = a === 0 ? c === b : (c - b) % a === 0 && (c - b) / a >= 0;
\r
618 tmp = checked[ uid ];
\r
620 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
624 function X_Node_Selector__funcSelectorProp( prop, flag, flags, xnodes ){
\r
626 flag_not = flag ? flags.not : !flags.not,
\r
627 i = 0, n = -1, xnode;
\r
628 for( ; xnode = xnodes[ i ]; ++i ){
\r
629 if( xnode._attrs && xnode._attrs[ prop ] ^ flag_not ) res[ ++n ] = xnode;
\r
634 var X_Node_Selector__filter = {
\r
635 root : function( elem ){
\r
636 return elem === ( elem.ownerDocument || elem.document ).documentElement;
\r
639 m : function( flags, xnodes ){
\r
641 hash = location.hash.slice( 1 ),
\r
642 flag_not = flags.not,
\r
643 i = 0, n = -1, xnode;
\r
644 for ( ; xnode = xnodes[ i ]; ++i ){
\r
645 if( ( ( xnode._id || xnode._attrs && xnode._attrs.name ) === hash ) ^ flag_not ) res[ ++n ] = xnode;
\r
651 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( -1, true, flags, xnodes ); }
\r
654 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 1, true, flags, xnodes ); }
\r
657 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 0, true, flags, xnodes ); }
\r
659 'first-of-type' : {
\r
660 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( -1, false, flags, xnodes ); }
\r
663 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 1, false, flags, xnodes ); }
\r
666 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorChild( 0, false, flags, xnodes ); }
\r
669 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'firstChild', 'next', true, flags, xnodes, a, b ); }
\r
671 'nth-last-child' : {
\r
672 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'lastChild', 'prev', true, flags, xnodes, a, b ); }
\r
675 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'firstChild', 'next', false, flags, xnodes, a, b ); }
\r
677 'nth-last-of-type' : {
\r
678 m : function( flags, xnodes, a, b ){ return X_Node_Selector__funcSelectorNth( 'lastChild', 'prev', false, flags, xnodes, a, b ); }
\r
681 m : function( flags, xnodes ){
\r
683 flag_not = flags.not,
\r
684 i = 0, n = -1, xnode, tmp, node;
\r
685 for( ; xnode = xnodes[i]; ++i ){
\r
687 for( node = xnode.firstChild(); node; node = node.nextSibling() ){
\r
688 if( node._tag || ( !node._tag && node._text ) ){
\r
693 if( tmp ^ flag_not ) res[ ++n ] = xnode;
\r
699 m : function( flags, xnodes ){
\r
700 var links = ( xnodes[ 0 ].ownerDocument || xnodes[ 0 ].document ).links,
\r
703 checked, flag_not, i, link, xnode, n;
\r
704 if( !links ) return res;
\r
706 flag_not = flags.not;
\r
707 for( i = 0; link = links[ i ]; ++i ){
\r
708 checked[ ( new Node( link ) )._uid ] = true;
\r
710 for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){
\r
711 if( checked[ xnode._uid ] ^ flag_not ) res[ ++n ] = xnode;
\r
717 m : function( flags, xnodes, arg ){
\r
719 //reg = new RegExp('^' + arg, 'i'),
\r
720 flag_not = flags.not,
\r
721 i = 0, n = -1, xnode, tmp, lang;
\r
722 arg = arg.toLowerCase();
\r
723 for( ; tmp = xnode = xnodes[ i ]; ++i ){
\r
724 while( tmp && !( lang = tmp._attrs && tmp._attrs[ 'lang' ] ) ){
\r
727 //tmp = !!(tmp && reg.test(tmp.getAttribute('lang')));
\r
728 if( ( !!lang && lang.toLowerCase().indexOf( arg ) === 0 ) ^ flag_not ) res[ ++n ] = xnode;
\r
734 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'disabled', false, flags, xnodes ); }
\r
737 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'disabled', true, flags, xnodes ); }
\r
740 m : function( flags, xnodes ){ return X_Node_Selector__funcSelectorProp( 'checked', true, flags, xnodes ); }
\r
743 m : function( flags, xnodes, arg ){
\r
745 flag_not = flags.not,
\r
746 i = 0, n = -1, xnode;
\r
747 for( ; xnode = xnodes[ i ]; ++i ){
\r
748 if ( ( -1 < ( xnode.text() ).indexOf( arg ) ) ^ flag_not ) res[ ++n ] = xnode;
\r