-/**\r
+/*\r
* Original code by ofk ( kQuery, ksk )\r
* http://d.hatena.ne.jp/ofk/comment/20090106/1231258010\r
* http://d.hatena.ne.jp/ofk/20090111/1231668170 \r
*/\r
\r
var\r
- X_Node_Selector__PSEUDO = {\r
+ X_Node_Selector__PSEUDO = {\r
'nth-child' : 9,\r
'nth-last-child' : 14,\r
'nth-of-type' : 11,\r
'nth-last-of-type' : 16,\r
- root : 4,\r
- link : 4,\r
- lang : 4,\r
- empty : 5,\r
- target : 6,\r
- invalid : 7,\r
- enabled : 7,\r
- checked : 7,\r
- disabled : 8,\r
- contains : 8,\r
+ 'root' : 4,\r
+ 'link' : 4,\r
+ 'lang' : 4,\r
+ 'empty' : 5,\r
+ 'target' : 6,\r
+ 'invalid' : 7,\r
+ 'enabled' : 7,\r
+ 'checked' : 7,\r
+ 'disabled' : 8,\r
+ 'contains' : 8,\r
'last-child' : 10,\r
'only-child' : 10, \r
'first-child' : 11,\r
'@' : 6 // XML 用の拡張、属性ノードを辿る http://www.marguerite.jp/Nihongo/WWW/RefDOM/_Attr_interface.html\r
},\r
X_Node_Selector__SELECTOR = {\r
- '' : 0, // none\r
- tag : 1,\r
- '#' : 2,\r
- '.' : 3,\r
- ':' : 4,\r
- '[' : 5,\r
- not : 6,\r
- scope : 7,\r
- root : 8,\r
- link : 9\r
+ '' : 0, // none\r
+ 'tag' : 1,\r
+ '#' : 2,\r
+ '.' : 3,\r
+ ':' : 4,\r
+ '[' : 5,\r
+ 'not' : 6,\r
+ 'scope' : 7,\r
+ 'root' : 8,\r
+ 'link' : 9\r
},\r
X_Node_Selector__OPERATORS = { '==' : 1, '!=': 2, '~=': 3, '^=': 4, '$=': 5, '*=': 6, '|=': 7 }, // '':0 は属性が存在するならtrue\r
// TODO { a : 1, A : 2, _ : 3,,, }\r
X_Node_Selector__ALPHABET = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-0123456789\\',\r
X_Node_Selector__NUMBER = '+-0123456789';\r
-\r
-// XMLWrapper のために今だけ外部に公開\r
-X_NodeSelector_parse = X_Node_Selector__parse;\r
\r
/*\r
* セレクタ文字列の解析、但し一挙に行わず、ひと塊づつ\r
chr, chrCode, nameChr, name1st,\r
tmp, escape, quot, start,\r
name, key, value, operator, a, b, not;\r
+\r
query += ' ';\r
while( i < l ){\r
chr = query.charAt( ++i );\r
- chrCode = ALPHABET.indexOf( chr );\r
+ chrCode = ALPHABET.indexOf( chr ); // TODO この関数無くす！\r
nameChr = chrCode !== -1;\r
name1st = nameChr && chrCode < 52;\r
switch( phase ){\r
case 0x4 : // start attr filter\r
name1st ?\r
( ( phase = 0x5 ) && ( start = i ) ) :\r
+ chr !== ' ' &&\r
( phase = 0xf );\r
break;\r
case 0x5 : // attr filter key\r
break;\r
case 0xa :\r
chr === ')' && ( phase = 0xe ) && ++i && ( b = parseFloat( query.substring( start, i ) ) || 0 );\r
- console.log( '0xa: ' + start + ' ' + i );\r
+ //console.log( '0xa: ' + start + ' ' + i );\r
break;\r
// contains, lang\r
case 0xb :\r
break;\r
} else {\r
if( a !== a || b !== b ) return i;\r
- result = [ not ? 0 : combinator, selector, name, a, b ];\r
+ result = [ not ? 0 : combinator, SELECTOR[ name ] || selector, name, a, b ];\r
break; \r
};\r
} else {\r
return not ? [ i + tmp + 1, [ combinator, 6, result ] ] : [ i, result ];\r
};\r
\r
- // セレクター\r
- X[ 'Doc' ][ 'find' ] = X_shortcutFunction = Node.prototype[ 'find' ] = X_NodeList.prototype[ 'find' ] = function ( queryString ){\r
+ /**\r
+ * selector を使って Node, NodeList を取得する\r
+ * @alias X.Doc.find\r
+ * @function\r
+ * @param {string} セレクター文字列\r
+ * @return {Node|NodeList}\r
+ */\r
+ X[ 'Doc' ][ 'find' ] = X_shortcutFunction =\r
+\r
+ /**\r
+ * selector を使って Node, NodeList を取得する\r
+ * @alias NodeList.prototype.find\r
+ * @function\r
+ * @param {string} セレクター文字列\r
+ * @return {Node|NodeList}\r
+ */\r
+ X_NodeList.prototype[ 'find' ] = X_Node_find;\r
+ \r
+ /**\r
+ * selector を使って Node, NodeList を取得する\r
+ * @alias Node.prototype.find\r
+ * @function\r
+ * @param {string} セレクター文字列\r
+ * @return {Node|NodeList}\r
+ */ \r
+ function X_Node_find( queryString ){\r
var HTML = X_Node_html,\r
scope = this.constructor === X_NodeList && this.length ? this : [ this.constructor === Node ? this : X_Node_body ],\r
parents = scope, // 探索元の親要素 XNodeList の場合あり\r
l, i, n, parsed,\r
xnodes, // 一時保存用\r
merge, // 要素がコメントノードで汚染されている場合使う\r
+ parent, children, j, m,\r
combinator, selector, name, tagName,\r
uid, tmp, xnode, filter, key, op, val, toLower, useName,\r
links, className, attr, flag;\r
// > TagName|*\r
case 2 :\r
for( ; i < l; ++i ){\r
- for( xnode = parents[ i ][ 'firstChild' ](); xnode; xnode = xnode[ 'next' ]() ){\r
- if( xnode[ '_tag' ] && ( isAll || tagName === xnode[ '_tag' ] ) ) xnodes[ ++n ] = xnode;\r
- }; \r
+ parent = parents[ i ];\r
+ if( ( children = parent[ '_xnodes' ] ) && ( m = children.length ) ){\r
+ for( j = 0; j < m; ++j ){\r
+ xnode = children[ j ];\r
+ if( xnode[ '_tag' ] && ( isAll || tagName === xnode[ '_tag' ] ) ) xnodes[ ++n ] = xnode;\r
+ };\r
+ }; \r
};\r
break;\r
// + TagName|*\r
case 3 :\r
for( ; i < l; ++i ){\r
+ \r
+ xnode = parents[ i ];\r
+ j = xnode[ 'getOrder' ]() + 1;\r
+ parent = xnode.parent;\r
+ if( parent && ( children = parent[ '_xnodes' ] ) && ( m = children.length ) ){\r
+ for( ; j < m; ++j ){\r
+ xnode = children[ j ];\r
+ if( xnode[ '_tag' ] ){\r
+ if( isAll || tagName === xnode[ '_tag' ] ){\r
+ xnodes[ ++n ] = xnode;\r
+ };\r
+ break;\r
+ };\r
+ };\r
+ };\r
+ /*\r
for( xnode = parents[ i ][ 'next' ](); xnode; xnode = xnode[ 'next' ]() ){\r
if( xnode[ '_tag' ] ){\r
if( isAll || tagName === xnode[ '_tag' ] ) xnodes[ ++n ] = xnode;\r
break;\r
}; \r
- }; \r
+ }; */ \r
};\r
break;\r
// ~ TagName|*\r
\r
// case 6 : 属性ノードは実装しない\r
\r
- default :\r
+ default : \r
if( combinator === 1 || ( isStart && selector < 7 ) ){\r
- //console.log( l + ' > ' + xnodes.length + ' tag:' + tagName );\r
- for( ; i < l; ++i ){\r
- xnode = parents[ i ];\r
- xnode[ '_xnodes' ] && xnode[ '_xnodes' ].length && X_Node_Selector__fetchElements( xnodes, xnode, isAll ? null : tagName );\r
+ if( isStart ){\r
+ if( tagName === 'HTML' ){\r
+ xnodes[ 0 ] = X_Node_html;\r
+ break;\r
+ };\r
+ if( tagName === 'HEAD' ){\r
+ xnodes[ 0 ] = X_Node_head;\r
+ break;\r
+ };\r
+ if( tagName === 'BODY' ){\r
+ xnodes[ 0 ] = X_Node_body;\r
+ break;\r
+ };\r
+ \r
};\r
+ //console.log( l + ' > ' + xnodes.length + ' tag:' + tagName );\r
+ merge = {};\r
+ X_Node_Selector__fetchElements( xnodes, parents, isAll ? '' : tagName, merge );\r
//console.log( l + ' >> ' + xnodes.length + ' tag:' + tagName );\r
};\r
};\r
case 6 :\r
isNot = true;\r
parsed = parsed[ 2 ];\r
- continue;\r
+ name = parsed[ 2 ];\r
+ switch( parsed[ 1 ] ) {\r
+ case 1 :\r
+ filter = [ 'tag', 1, isXML ? name : name.toUpperCase() ]; break;\r
+ // #, ID\r
+ case 2 :\r
+ filter = [ 'id', 1, name ]; break;\r
+ // ., class\r
+ case 3 :\r
+ filter = [ 'class', 3, name ]; break;\r
+ // :, 擬似クラス\r
+ case 4 :\r
+ if( !( filter = X_Node_Selector__filter[ name ] ) ){\r
+ return [];\r
+ };\r
+ break;\r
+ // [] 属性\r
+ case 5 :\r
+ filter = [ name, parsed[ 3 ], parsed[ 4 ] ]; break;\r
+ };\r
+ break;\r
// scope\r
case 7 :\r
xnodes = scope; break;\r
case 9 :\r
if( links = document.links ){\r
for( xnodes = [], i = links.length; i; ){\r
- xnodes[ --i ] = new Node( links[ i ] );\r
+ xnodes[ --i ] = Node( links[ i ] );\r
};\r
} else {\r
// area[href],a[href]\r
for( i = 0, n = -1, l = xnodes.length; i < l; ++i ){\r
xnode = xnodes[ i ];\r
attr =\r
+ key === 'tag' ? xnode[ '_tag' ] :\r
key === 'id' ? xnode[ '_id' ] :\r
key === 'class' ? xnode[ '_className' ] :\r
xnode[ '_attrs' ] && xnode[ '_attrs' ][ key ];\r
//useName ?\r
// elem[ X_Node_Attr_renameForDOM[ key ] || key ] :\r
// elem.getAttribute( key, 2 );\r
- flag = attr != null;// && ( !useName || attr !== '' );\r
+ flag = !!attr;// && ( !useName || attr !== '' );\r
if( flag && op ){\r
if( toLower ) attr = attr.toLowerCase();\r
\r
xnodes[ ++n ] = xnode;\r
};\r
};\r
- X_Node_Selector__sortElementOrder( ret = [], xnodes, hasRoot ? [ HTML ] : HTML[ '_xnodes' ] );\r
- xnodes = ret;\r
+ xnodes = X_Node_Selector__sortElementOrder( [], xnodes, hasRoot ? [ HTML ] : HTML[ '_xnodes' ] );\r
};\r
\r
return xnodes.length === 1 ? xnodes[ 0 ] : new X_NodeList( xnodes );\r
for( ; i < l; ++i ){\r
child = xnodes[ i ];\r
if( !child[ '_tag' ] ) continue;\r
- //console.log( child[ '_tag' ] );\r
- if( ( j = list.indexOf( child ) ) !== -1 ){\r
+\r
+ j = list.indexOf( child );\r
+ if( j !== -1 ){\r
newList[ newList.length ] = child;\r
- list.splice( j, 1 );\r
- if( list.length === 1 ){\r
- newList[ newList.length ] = list[ 0 ];\r
- list.length = 0;\r
- return true;\r
+ if( list.length === 2 ){\r
+ newList[ newList.length ] = list[ j === 0 ? 1 : 0 ];\r
+ return newList;\r
};\r
- if( list.length === 0 ) return true;\r
+ list.splice( j, 1 );\r
};\r
+\r
if( ( _xnodes = child[ '_xnodes' ] ) && X_Node_Selector__sortElementOrder( newList, list, _xnodes ) ){\r
- return true;\r
+ return newList;\r
};\r
};\r
};\r
- \r
- function X_Node_Selector__fetchElements( list, parent, tag ){\r
- var xnodes = parent[ '_xnodes' ],\r
- l = xnodes.length,\r
+\r
+ function X_Node_Selector__fetchElements( list, xnodes, tag, merge ){\r
+ var l = xnodes.length,\r
i = 0,\r
- child;\r
+ child, uid, _tag, _xnodes;\r
for( ; i < l; ++i ){\r
child = xnodes[ i ];\r
- if( child[ '_tag' ] ){\r
- ( !tag || child[ '_tag' ] === tag ) && ( list[ list.length ] = child );\r
- //console.log( parent[ '_tag' ] + ' > ' + child[ '_tag' ] + ' == ' + tag+ ' l:' + list.length );\r
- child[ '_xnodes' ] && child[ '_xnodes' ].length && X_Node_Selector__fetchElements( list, child, tag );\r
+ uid = child[ '_uid' ];\r
+ _tag = child[ '_tag' ];\r
+ if( !merge[ uid ] && _tag ){\r
+ merge[ uid ] = true;\r
+ ( !tag || tag === _tag ) && ( list[ list.length ] = child );\r
+ if( ( _xnodes = child[ '_xnodes' ] ) && ( 1 < _xnodes.length || ( _xnodes[ 0 ] && _xnodes[ 0 ][ '_tag' ] ) ) ){\r
+ X_Node_Selector__fetchElements( list, _xnodes, tag, merge );\r
+ };\r
};\r
};\r
};\r
-\r
+/*\r
+ function X_Node_Selector__fetchElements( list, parent, tag, merge ){\r
+ \r
+ var xnodes = parent[ '_xnodes' ],\r
+ memory = {\r
+ i : 0,\r
+ l : xnodes.length,\r
+ xnodes : xnodes\r
+ }, \r
+ memories = [ memory ],\r
+ i, l, xnode,\r
+ uid, _xnodes;\r
+ \r
+ while( memories.length ){\r
+ memory = memories.pop();\r
+ xnodes = memory.xnodes;\r
+ i = memory.i;\r
+ l = memory.l;\r
+ for( ; i < l; ++i ){\r
+ xnode = xnodes[ i ];\r
+ uid = xnode[ '_uid' ];\r
+ if( !merge[ uid ] && xnode[ '_tag' ] ){\r
+ if( !tag || xnode[ '_tag' ] === tag ) list[ list.length ] = xnode;\r
+ \r
+ if( _xnodes = xnode[ '_xnodes' ] ){\r
+ if( 1 < _xnodes.length || ( _xnodes[ 0 ] && _xnodes[ 0 ][ '_tag' ] ) ){\r
+ memory.i = i + 1;\r
+ memory.l = l;\r
+ memory.xnodes = xnodes;\r
+ memories[ memories.length ] = memory;\r
+ memories[ memories.length ] = {\r
+ i : 0,\r
+ l : _xnodes.length,\r
+ xnodes : _xnodes\r
+ };\r
+ merge[ uid ] = true;\r
+ break;\r
+ };\r
+ };\r
+ };\r
+ merge[ uid ] = true;\r
+ };\r
+ };\r
+ };\r
+ */\r
function X_Node_Selector__funcSelectorChild( type, flag_all, flags, xnodes ){\r
var res = [],\r
flag_not = flags.not,\r
return res;\r
};\r
function X_Node_Selector__funcSelectorNth( pointer, sibling, flag_all, flags, xnodes, a, b ){\r
- var _data = funcData,\r
- res = [],\r
+ var res = [],\r
checked = {},\r
flag_not = flags.not,\r
i = 0, n = -1, uid,\r
};\r
\r
var X_Node_Selector__filter = {\r
- 'root' : function( elem ){\r
- return elem === ( elem.ownerDocument || elem.document ).documentElement;\r
+ 'root' : function(){\r
+ return X_Node_html;\r
},\r
'target' : {\r
m : function( flags, xnodes ){\r
i = 0, n = -1, xnode, tmp, node;\r
for( ; xnode = xnodes[i]; ++i ){\r
tmp = true;\r
- for( node = xnode[ 'firstChild' ](); node; node = node.nextSibling() ){\r
+ for( node = xnode[ 'firstChild' ](); node; node = node[ 'next' ]() ){\r
if( node[ '_tag' ] || node[ '_text' ] ){\r
tmp = false;\r
break;\r
checked = {};\r
flag_not = flags.not;\r
for( i = 0; link = links[ i ]; ++i ){\r
- checked[ ( new Node( link ) )[ '_uid' ] ] = true;\r
+ checked[ ( Node( link ) )[ '_uid' ] ] = true;\r
};\r
for( i = 0, n = -1; xnode = xnodes[ i ]; ++i ){\r
if( checked[ xnode[ '_uid' ] ] ^ flag_not ) res[ ++n ] = xnode;\r
OSDN Git Service
