Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
J
jquery
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
夏彬
jquery
Commits
2977f3df
Commit
2977f3df
authored
Apr 29, 2008
by
Scott González
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fixed line endings.
parent
d822c0c2
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
451 additions
and
451 deletions
+451
-451
selector.js
src/selector.js
+451
-451
No files found.
src/selector.js
View file @
2977f3df
var
chars
=
jQuery
.
browser
.
safari
&&
parseInt
(
jQuery
.
browser
.
version
)
<
417
?
var
chars
=
jQuery
.
browser
.
safari
&&
parseInt
(
jQuery
.
browser
.
version
)
<
417
?
"(?:[
\\
w*_-]|
\\\\
.)"
:
"(?:[
\\
w*_-]|
\\\\
.)"
:
"(?:[
\\
w
\
u0128-
\
uFFFF*_-]|
\\\\
.)"
,
"(?:[
\\
w
\
u0128-
\
uFFFF*_-]|
\\\\
.)"
,
quickChild
=
new
RegExp
(
"^>
\\
s*("
+
chars
+
"+)"
),
quickChild
=
new
RegExp
(
"^>
\\
s*("
+
chars
+
"+)"
),
quickID
=
new
RegExp
(
"^("
+
chars
+
"+)(#)("
+
chars
+
"+)"
),
quickID
=
new
RegExp
(
"^("
+
chars
+
"+)(#)("
+
chars
+
"+)"
),
quickClass
=
new
RegExp
(
"^([#.]?)("
+
chars
+
"*)"
);
quickClass
=
new
RegExp
(
"^([#.]?)("
+
chars
+
"*)"
);
jQuery
.
extend
({
jQuery
.
extend
({
expr
:
{
expr
:
{
""
:
function
(
a
,
i
,
m
){
return
m
[
2
]
==
"*"
||
jQuery
.
nodeName
(
a
,
m
[
2
]);},
""
:
function
(
a
,
i
,
m
){
return
m
[
2
]
==
"*"
||
jQuery
.
nodeName
(
a
,
m
[
2
]);},
"#"
:
function
(
a
,
i
,
m
){
return
a
.
getAttribute
(
"id"
)
==
m
[
2
];},
"#"
:
function
(
a
,
i
,
m
){
return
a
.
getAttribute
(
"id"
)
==
m
[
2
];},
":"
:
{
":"
:
{
// Position Checks
// Position Checks
lt
:
function
(
a
,
i
,
m
){
return
i
<
m
[
3
]
-
0
;},
lt
:
function
(
a
,
i
,
m
){
return
i
<
m
[
3
]
-
0
;},
gt
:
function
(
a
,
i
,
m
){
return
i
>
m
[
3
]
-
0
;},
gt
:
function
(
a
,
i
,
m
){
return
i
>
m
[
3
]
-
0
;},
nth
:
function
(
a
,
i
,
m
){
return
m
[
3
]
-
0
==
i
;},
nth
:
function
(
a
,
i
,
m
){
return
m
[
3
]
-
0
==
i
;},
eq
:
function
(
a
,
i
,
m
){
return
m
[
3
]
-
0
==
i
;},
eq
:
function
(
a
,
i
,
m
){
return
m
[
3
]
-
0
==
i
;},
first
:
function
(
a
,
i
){
return
i
==
0
;},
first
:
function
(
a
,
i
){
return
i
==
0
;},
last
:
function
(
a
,
i
,
m
,
r
){
return
i
==
r
.
length
-
1
;},
last
:
function
(
a
,
i
,
m
,
r
){
return
i
==
r
.
length
-
1
;},
even
:
function
(
a
,
i
){
return
i
%
2
==
0
;},
even
:
function
(
a
,
i
){
return
i
%
2
==
0
;},
odd
:
function
(
a
,
i
){
return
i
%
2
;},
odd
:
function
(
a
,
i
){
return
i
%
2
;},
// Child Checks
// Child Checks
"first-child"
:
function
(
a
){
return
a
.
parentNode
.
getElementsByTagName
(
"*"
)[
0
]
==
a
;},
"first-child"
:
function
(
a
){
return
a
.
parentNode
.
getElementsByTagName
(
"*"
)[
0
]
==
a
;},
"last-child"
:
function
(
a
){
return
jQuery
.
nth
(
a
.
parentNode
.
lastChild
,
1
,
"previousSibling"
)
==
a
;},
"last-child"
:
function
(
a
){
return
jQuery
.
nth
(
a
.
parentNode
.
lastChild
,
1
,
"previousSibling"
)
==
a
;},
"only-child"
:
function
(
a
){
return
!
jQuery
.
nth
(
a
.
parentNode
.
lastChild
,
2
,
"previousSibling"
);},
"only-child"
:
function
(
a
){
return
!
jQuery
.
nth
(
a
.
parentNode
.
lastChild
,
2
,
"previousSibling"
);},
// Parent Checks
// Parent Checks
parent
:
function
(
a
){
return
a
.
firstChild
;},
parent
:
function
(
a
){
return
a
.
firstChild
;},
empty
:
function
(
a
){
return
!
a
.
firstChild
;},
empty
:
function
(
a
){
return
!
a
.
firstChild
;},
// Text Check
// Text Check
contains
:
function
(
a
,
i
,
m
){
return
(
a
.
textContent
||
a
.
innerText
||
jQuery
(
a
).
text
()
||
""
).
indexOf
(
m
[
3
])
>=
0
;},
contains
:
function
(
a
,
i
,
m
){
return
(
a
.
textContent
||
a
.
innerText
||
jQuery
(
a
).
text
()
||
""
).
indexOf
(
m
[
3
])
>=
0
;},
// Visibility
// Visibility
visible
:
function
(
a
){
return
"hidden"
!=
a
.
type
&&
jQuery
.
css
(
a
,
"display"
)
!=
"none"
&&
jQuery
.
css
(
a
,
"visibility"
)
!=
"hidden"
;},
visible
:
function
(
a
){
return
"hidden"
!=
a
.
type
&&
jQuery
.
css
(
a
,
"display"
)
!=
"none"
&&
jQuery
.
css
(
a
,
"visibility"
)
!=
"hidden"
;},
hidden
:
function
(
a
){
return
"hidden"
==
a
.
type
||
jQuery
.
css
(
a
,
"display"
)
==
"none"
||
jQuery
.
css
(
a
,
"visibility"
)
==
"hidden"
;},
hidden
:
function
(
a
){
return
"hidden"
==
a
.
type
||
jQuery
.
css
(
a
,
"display"
)
==
"none"
||
jQuery
.
css
(
a
,
"visibility"
)
==
"hidden"
;},
// Form attributes
// Form attributes
enabled
:
function
(
a
){
return
!
a
.
disabled
;},
enabled
:
function
(
a
){
return
!
a
.
disabled
;},
disabled
:
function
(
a
){
return
a
.
disabled
;},
disabled
:
function
(
a
){
return
a
.
disabled
;},
checked
:
function
(
a
){
return
a
.
checked
;},
checked
:
function
(
a
){
return
a
.
checked
;},
selected
:
function
(
a
){
return
a
.
selected
||
jQuery
.
attr
(
a
,
"selected"
);},
selected
:
function
(
a
){
return
a
.
selected
||
jQuery
.
attr
(
a
,
"selected"
);},
// Form elements
// Form elements
text
:
function
(
a
){
return
"text"
==
a
.
type
;},
text
:
function
(
a
){
return
"text"
==
a
.
type
;},
radio
:
function
(
a
){
return
"radio"
==
a
.
type
;},
radio
:
function
(
a
){
return
"radio"
==
a
.
type
;},
checkbox
:
function
(
a
){
return
"checkbox"
==
a
.
type
;},
checkbox
:
function
(
a
){
return
"checkbox"
==
a
.
type
;},
file
:
function
(
a
){
return
"file"
==
a
.
type
;},
file
:
function
(
a
){
return
"file"
==
a
.
type
;},
password
:
function
(
a
){
return
"password"
==
a
.
type
;},
password
:
function
(
a
){
return
"password"
==
a
.
type
;},
submit
:
function
(
a
){
return
"submit"
==
a
.
type
;},
submit
:
function
(
a
){
return
"submit"
==
a
.
type
;},
image
:
function
(
a
){
return
"image"
==
a
.
type
;},
image
:
function
(
a
){
return
"image"
==
a
.
type
;},
reset
:
function
(
a
){
return
"reset"
==
a
.
type
;},
reset
:
function
(
a
){
return
"reset"
==
a
.
type
;},
button
:
function
(
a
){
return
"button"
==
a
.
type
||
jQuery
.
nodeName
(
a
,
"button"
);},
button
:
function
(
a
){
return
"button"
==
a
.
type
||
jQuery
.
nodeName
(
a
,
"button"
);},
input
:
function
(
a
){
return
/input|select|textarea|button/i
.
test
(
a
.
nodeName
);},
input
:
function
(
a
){
return
/input|select|textarea|button/i
.
test
(
a
.
nodeName
);},
// :has()
// :has()
has
:
function
(
a
,
i
,
m
){
return
jQuery
.
find
(
m
[
3
],
a
).
length
;},
has
:
function
(
a
,
i
,
m
){
return
jQuery
.
find
(
m
[
3
],
a
).
length
;},
// :header
// :header
header
:
function
(
a
){
return
/h
\d
/i
.
test
(
a
.
nodeName
);},
header
:
function
(
a
){
return
/h
\d
/i
.
test
(
a
.
nodeName
);},
// :animated
// :animated
animated
:
function
(
a
){
return
jQuery
.
grep
(
jQuery
.
timers
,
function
(
fn
){
return
a
==
fn
.
elem
;}).
length
;}
animated
:
function
(
a
){
return
jQuery
.
grep
(
jQuery
.
timers
,
function
(
fn
){
return
a
==
fn
.
elem
;}).
length
;}
}
}
},
},
// The regular expressions that power the parsing engine
// The regular expressions that power the parsing engine
parse
:
[
parse
:
[
// Match: [@value='test'], [@foo]
// Match: [@value='test'], [@foo]
/^
(\[)
*@
?([\w
-
]
+
)
*
([
!*$^~=
]
*
)
*
(
'
?
"
?)(
.*
?)\4
*
\]
/
,
/^
(\[)
*@
?([\w
-
]
+
)
*
([
!*$^~=
]
*
)
*
(
'
?
"
?)(
.*
?)\4
*
\]
/
,
// Match: :contains('foo')
// Match: :contains('foo')
/^
(
:
)([\w
-
]
+
)\(
"
?
'
?(
.*
?(\(
.*
?\))?[^
(
]
*
?)
"
?
'
?\)
/
,
/^
(
:
)([\w
-
]
+
)\(
"
?
'
?(
.*
?(\(
.*
?\))?[^
(
]
*
?)
"
?
'
?\)
/
,
// Match: :even, :last-chlid, #id, .class
// Match: :even, :last-chlid, #id, .class
new
RegExp
(
"^([:.#]*)("
+
chars
+
"+)"
)
new
RegExp
(
"^([:.#]*)("
+
chars
+
"+)"
)
],
],
multiFilter
:
function
(
expr
,
elems
,
not
)
{
multiFilter
:
function
(
expr
,
elems
,
not
)
{
var
old
,
cur
=
[];
var
old
,
cur
=
[];
while
(
expr
&&
expr
!=
old
)
{
while
(
expr
&&
expr
!=
old
)
{
old
=
expr
;
old
=
expr
;
var
f
=
jQuery
.
filter
(
expr
,
elems
,
not
);
var
f
=
jQuery
.
filter
(
expr
,
elems
,
not
);
expr
=
f
.
t
.
replace
(
/^
\s
*,
\s
*/
,
""
);
expr
=
f
.
t
.
replace
(
/^
\s
*,
\s
*/
,
""
);
cur
=
not
?
elems
=
f
.
r
:
jQuery
.
merge
(
cur
,
f
.
r
);
cur
=
not
?
elems
=
f
.
r
:
jQuery
.
merge
(
cur
,
f
.
r
);
}
}
return
cur
;
return
cur
;
},
},
find
:
function
(
t
,
context
)
{
find
:
function
(
t
,
context
)
{
// Quickly handle non-string expressions
// Quickly handle non-string expressions
if
(
typeof
t
!=
"string"
)
if
(
typeof
t
!=
"string"
)
return
[
t
];
return
[
t
];
// check to make sure context is a DOM element or a document
// check to make sure context is a DOM element or a document
if
(
context
&&
context
.
nodeType
!=
1
&&
context
.
nodeType
!=
9
)
if
(
context
&&
context
.
nodeType
!=
1
&&
context
.
nodeType
!=
9
)
return
[
];
return
[
];
// Set the correct context (if none is provided)
// Set the correct context (if none is provided)
context
=
context
||
document
;
context
=
context
||
document
;
// Initialize the search
// Initialize the search
var
ret
=
[
context
],
done
=
[],
last
,
nodeName
;
var
ret
=
[
context
],
done
=
[],
last
,
nodeName
;
// Continue while a selector expression exists, and while
// Continue while a selector expression exists, and while
// we're no longer looping upon ourselves
// we're no longer looping upon ourselves
while
(
t
&&
last
!=
t
)
{
while
(
t
&&
last
!=
t
)
{
var
r
=
[];
var
r
=
[];
last
=
t
;
last
=
t
;
t
=
jQuery
.
trim
(
t
);
t
=
jQuery
.
trim
(
t
);
var
foundToken
=
false
;
var
foundToken
=
false
;
// An attempt at speeding up child selectors that
// An attempt at speeding up child selectors that
// point to a specific element tag
// point to a specific element tag
var
re
=
quickChild
;
var
re
=
quickChild
;
var
m
=
re
.
exec
(
t
);
var
m
=
re
.
exec
(
t
);
if
(
m
)
{
if
(
m
)
{
nodeName
=
m
[
1
].
toUpperCase
();
nodeName
=
m
[
1
].
toUpperCase
();
// Perform our own iteration and filter
// Perform our own iteration and filter
for
(
var
i
=
0
;
ret
[
i
];
i
++
)
for
(
var
i
=
0
;
ret
[
i
];
i
++
)
for
(
var
c
=
ret
[
i
].
firstChild
;
c
;
c
=
c
.
nextSibling
)
for
(
var
c
=
ret
[
i
].
firstChild
;
c
;
c
=
c
.
nextSibling
)
if
(
c
.
nodeType
==
1
&&
(
nodeName
==
"*"
||
c
.
nodeName
.
toUpperCase
()
==
nodeName
)
)
if
(
c
.
nodeType
==
1
&&
(
nodeName
==
"*"
||
c
.
nodeName
.
toUpperCase
()
==
nodeName
)
)
r
.
push
(
c
);
r
.
push
(
c
);
ret
=
r
;
ret
=
r
;
t
=
t
.
replace
(
re
,
""
);
t
=
t
.
replace
(
re
,
""
);
if
(
t
.
indexOf
(
" "
)
==
0
)
continue
;
if
(
t
.
indexOf
(
" "
)
==
0
)
continue
;
foundToken
=
true
;
foundToken
=
true
;
}
else
{
}
else
{
re
=
/^
([
>+~
])\s
*
(\w
*
)
/i
;
re
=
/^
([
>+~
])\s
*
(\w
*
)
/i
;
if
(
(
m
=
re
.
exec
(
t
))
!=
null
)
{
if
(
(
m
=
re
.
exec
(
t
))
!=
null
)
{
r
=
[];
r
=
[];
var
merge
=
{};
var
merge
=
{};
nodeName
=
m
[
2
].
toUpperCase
();
nodeName
=
m
[
2
].
toUpperCase
();
m
=
m
[
1
];
m
=
m
[
1
];
for
(
var
j
=
0
,
rl
=
ret
.
length
;
j
<
rl
;
j
++
)
{
for
(
var
j
=
0
,
rl
=
ret
.
length
;
j
<
rl
;
j
++
)
{
var
n
=
m
==
"~"
||
m
==
"+"
?
ret
[
j
].
nextSibling
:
ret
[
j
].
firstChild
;
var
n
=
m
==
"~"
||
m
==
"+"
?
ret
[
j
].
nextSibling
:
ret
[
j
].
firstChild
;
for
(
;
n
;
n
=
n
.
nextSibling
)
for
(
;
n
;
n
=
n
.
nextSibling
)
if
(
n
.
nodeType
==
1
)
{
if
(
n
.
nodeType
==
1
)
{
var
id
=
jQuery
.
data
(
n
);
var
id
=
jQuery
.
data
(
n
);
if
(
m
==
"~"
&&
merge
[
id
]
)
break
;
if
(
m
==
"~"
&&
merge
[
id
]
)
break
;
if
(
!
nodeName
||
n
.
nodeName
.
toUpperCase
()
==
nodeName
)
{
if
(
!
nodeName
||
n
.
nodeName
.
toUpperCase
()
==
nodeName
)
{
if
(
m
==
"~"
)
merge
[
id
]
=
true
;
if
(
m
==
"~"
)
merge
[
id
]
=
true
;
r
.
push
(
n
);
r
.
push
(
n
);
}
}
if
(
m
==
"+"
)
break
;
if
(
m
==
"+"
)
break
;
}
}
}
}
ret
=
r
;
ret
=
r
;
// And remove the token
// And remove the token
t
=
jQuery
.
trim
(
t
.
replace
(
re
,
""
)
);
t
=
jQuery
.
trim
(
t
.
replace
(
re
,
""
)
);
foundToken
=
true
;
foundToken
=
true
;
}
}
}
}
// See if there's still an expression, and that we haven't already
// See if there's still an expression, and that we haven't already
// matched a token
// matched a token
if
(
t
&&
!
foundToken
)
{
if
(
t
&&
!
foundToken
)
{
// Handle multiple expressions
// Handle multiple expressions
if
(
!
t
.
indexOf
(
","
)
)
{
if
(
!
t
.
indexOf
(
","
)
)
{
// Clean the result set
// Clean the result set
if
(
context
==
ret
[
0
]
)
ret
.
shift
();
if
(
context
==
ret
[
0
]
)
ret
.
shift
();
// Merge the result sets
// Merge the result sets
done
=
jQuery
.
merge
(
done
,
ret
);
done
=
jQuery
.
merge
(
done
,
ret
);
// Reset the context
// Reset the context
r
=
ret
=
[
context
];
r
=
ret
=
[
context
];
// Touch up the selector string
// Touch up the selector string
t
=
" "
+
t
.
substr
(
1
,
t
.
length
);
t
=
" "
+
t
.
substr
(
1
,
t
.
length
);
}
else
{
}
else
{
// Optimize for the case nodeName#idName
// Optimize for the case nodeName#idName
var
re2
=
quickID
;
var
re2
=
quickID
;
var
m
=
re2
.
exec
(
t
);
var
m
=
re2
.
exec
(
t
);
// Re-organize the results, so that they're consistent
// Re-organize the results, so that they're consistent
if
(
m
)
{
if
(
m
)
{
m
=
[
0
,
m
[
2
],
m
[
3
],
m
[
1
]
];
m
=
[
0
,
m
[
2
],
m
[
3
],
m
[
1
]
];
}
else
{
}
else
{
// Otherwise, do a traditional filter check for
// Otherwise, do a traditional filter check for
// ID, class, and element selectors
// ID, class, and element selectors
re2
=
quickClass
;
re2
=
quickClass
;
m
=
re2
.
exec
(
t
);
m
=
re2
.
exec
(
t
);
}
}
m
[
2
]
=
m
[
2
].
replace
(
/
\\
/g
,
""
);
m
[
2
]
=
m
[
2
].
replace
(
/
\\
/g
,
""
);
var
elem
=
ret
[
ret
.
length
-
1
];
var
elem
=
ret
[
ret
.
length
-
1
];
// Try to do a global search by ID, where we can
// Try to do a global search by ID, where we can
if
(
m
[
1
]
==
"#"
&&
elem
&&
elem
.
getElementById
&&
!
jQuery
.
isXMLDoc
(
elem
)
)
{
if
(
m
[
1
]
==
"#"
&&
elem
&&
elem
.
getElementById
&&
!
jQuery
.
isXMLDoc
(
elem
)
)
{
// Optimization for HTML document case
// Optimization for HTML document case
var
oid
=
elem
.
getElementById
(
m
[
2
]);
var
oid
=
elem
.
getElementById
(
m
[
2
]);
// Do a quick check for the existence of the actual ID attribute
// Do a quick check for the existence of the actual ID attribute
// to avoid selecting by the name attribute in IE
// to avoid selecting by the name attribute in IE
// also check to insure id is a string to avoid selecting an element with the name of 'id' inside a form
// also check to insure id is a string to avoid selecting an element with the name of 'id' inside a form
if
(
(
jQuery
.
browser
.
msie
||
jQuery
.
browser
.
opera
)
&&
oid
&&
typeof
oid
.
id
==
"string"
&&
oid
.
id
!=
m
[
2
]
)
if
(
(
jQuery
.
browser
.
msie
||
jQuery
.
browser
.
opera
)
&&
oid
&&
typeof
oid
.
id
==
"string"
&&
oid
.
id
!=
m
[
2
]
)
oid
=
jQuery
(
'[@id="'
+
m
[
2
]
+
'"]'
,
elem
)[
0
];
oid
=
jQuery
(
'[@id="'
+
m
[
2
]
+
'"]'
,
elem
)[
0
];
// Do a quick check for node name (where applicable) so
// Do a quick check for node name (where applicable) so
// that div#foo searches will be really fast
// that div#foo searches will be really fast
ret
=
r
=
oid
&&
(
!
m
[
3
]
||
jQuery
.
nodeName
(
oid
,
m
[
3
]))
?
[
oid
]
:
[];
ret
=
r
=
oid
&&
(
!
m
[
3
]
||
jQuery
.
nodeName
(
oid
,
m
[
3
]))
?
[
oid
]
:
[];
}
else
{
}
else
{
// We need to find all descendant elements
// We need to find all descendant elements
for
(
var
i
=
0
;
ret
[
i
];
i
++
)
{
for
(
var
i
=
0
;
ret
[
i
];
i
++
)
{
// Grab the tag name being searched for
// Grab the tag name being searched for
var
tag
=
m
[
1
]
==
"#"
&&
m
[
3
]
?
m
[
3
]
:
m
[
1
]
!=
""
||
m
[
0
]
==
""
?
"*"
:
m
[
2
];
var
tag
=
m
[
1
]
==
"#"
&&
m
[
3
]
?
m
[
3
]
:
m
[
1
]
!=
""
||
m
[
0
]
==
""
?
"*"
:
m
[
2
];
// Handle IE7 being really dumb about <object>s
// Handle IE7 being really dumb about <object>s
if
(
tag
==
"*"
&&
ret
[
i
].
nodeName
.
toLowerCase
()
==
"object"
)
if
(
tag
==
"*"
&&
ret
[
i
].
nodeName
.
toLowerCase
()
==
"object"
)
tag
=
"param"
;
tag
=
"param"
;
r
=
jQuery
.
merge
(
r
,
ret
[
i
].
getElementsByTagName
(
tag
));
r
=
jQuery
.
merge
(
r
,
ret
[
i
].
getElementsByTagName
(
tag
));
}
}
// It's faster to filter by class and be done with it
// It's faster to filter by class and be done with it
if
(
m
[
1
]
==
"."
)
if
(
m
[
1
]
==
"."
)
r
=
jQuery
.
classFilter
(
r
,
m
[
2
]
);
r
=
jQuery
.
classFilter
(
r
,
m
[
2
]
);
// Same with ID filtering
// Same with ID filtering
if
(
m
[
1
]
==
"#"
)
{
if
(
m
[
1
]
==
"#"
)
{
var
tmp
=
[];
var
tmp
=
[];
// Try to find the element with the ID
// Try to find the element with the ID
for
(
var
i
=
0
;
r
[
i
];
i
++
)
for
(
var
i
=
0
;
r
[
i
];
i
++
)
if
(
r
[
i
].
getAttribute
(
"id"
)
==
m
[
2
]
)
{
if
(
r
[
i
].
getAttribute
(
"id"
)
==
m
[
2
]
)
{
tmp
=
[
r
[
i
]
];
tmp
=
[
r
[
i
]
];
break
;
break
;
}
}
r
=
tmp
;
r
=
tmp
;
}
}
ret
=
r
;
ret
=
r
;
}
}
t
=
t
.
replace
(
re2
,
""
);
t
=
t
.
replace
(
re2
,
""
);
}
}
}
}
// If a selector string still exists
// If a selector string still exists
if
(
t
)
{
if
(
t
)
{
// Attempt to filter it
// Attempt to filter it
var
val
=
jQuery
.
filter
(
t
,
r
);
var
val
=
jQuery
.
filter
(
t
,
r
);
ret
=
r
=
val
.
r
;
ret
=
r
=
val
.
r
;
t
=
jQuery
.
trim
(
val
.
t
);
t
=
jQuery
.
trim
(
val
.
t
);
}
}
}
}
// An error occurred with the selector;
// An error occurred with the selector;
// just return an empty set instead
// just return an empty set instead
if
(
t
)
if
(
t
)
ret
=
[];
ret
=
[];
// Remove the root context
// Remove the root context
if
(
ret
&&
context
==
ret
[
0
]
)
if
(
ret
&&
context
==
ret
[
0
]
)
ret
.
shift
();
ret
.
shift
();
// And combine the results
// And combine the results
done
=
jQuery
.
merge
(
done
,
ret
);
done
=
jQuery
.
merge
(
done
,
ret
);
return
done
;
return
done
;
},
},
classFilter
:
function
(
r
,
m
,
not
){
classFilter
:
function
(
r
,
m
,
not
){
m
=
" "
+
m
+
" "
;
m
=
" "
+
m
+
" "
;
var
tmp
=
[];
var
tmp
=
[];
for
(
var
i
=
0
;
r
[
i
];
i
++
)
{
for
(
var
i
=
0
;
r
[
i
];
i
++
)
{
var
pass
=
(
" "
+
r
[
i
].
className
+
" "
).
indexOf
(
m
)
>=
0
;
var
pass
=
(
" "
+
r
[
i
].
className
+
" "
).
indexOf
(
m
)
>=
0
;
if
(
!
not
&&
pass
||
not
&&
!
pass
)
if
(
!
not
&&
pass
||
not
&&
!
pass
)
tmp
.
push
(
r
[
i
]
);
tmp
.
push
(
r
[
i
]
);
}
}
return
tmp
;
return
tmp
;
},
},
filter
:
function
(
t
,
r
,
not
)
{
filter
:
function
(
t
,
r
,
not
)
{
var
last
;
var
last
;
// Look for common filter expressions
// Look for common filter expressions
while
(
t
&&
t
!=
last
)
{
while
(
t
&&
t
!=
last
)
{
last
=
t
;
last
=
t
;
var
p
=
jQuery
.
parse
,
m
;
var
p
=
jQuery
.
parse
,
m
;
for
(
var
i
=
0
;
p
[
i
];
i
++
)
{
for
(
var
i
=
0
;
p
[
i
];
i
++
)
{
m
=
p
[
i
].
exec
(
t
);
m
=
p
[
i
].
exec
(
t
);
if
(
m
)
{
if
(
m
)
{
// Remove what we just matched
// Remove what we just matched
t
=
t
.
substring
(
m
[
0
].
length
);
t
=
t
.
substring
(
m
[
0
].
length
);
m
[
2
]
=
m
[
2
].
replace
(
/
\\
/g
,
""
);
m
[
2
]
=
m
[
2
].
replace
(
/
\\
/g
,
""
);
break
;
break
;
}
}
}
}
if
(
!
m
)
if
(
!
m
)
break
;
break
;
// :not() is a special case that can be optimized by
// :not() is a special case that can be optimized by
// keeping it out of the expression list
// keeping it out of the expression list
if
(
m
[
1
]
==
":"
&&
m
[
2
]
==
"not"
)
if
(
m
[
1
]
==
":"
&&
m
[
2
]
==
"not"
)
// optimize if only one selector found (most common case)
// optimize if only one selector found (most common case)
r
=
isSimple
.
test
(
m
[
3
]
)
?
r
=
isSimple
.
test
(
m
[
3
]
)
?
jQuery
.
filter
(
m
[
3
],
r
,
true
).
r
:
jQuery
.
filter
(
m
[
3
],
r
,
true
).
r
:
jQuery
(
r
).
not
(
m
[
3
]
);
jQuery
(
r
).
not
(
m
[
3
]
);
// We can get a big speed boost by filtering by class here
// We can get a big speed boost by filtering by class here
else
if
(
m
[
1
]
==
"."
)
else
if
(
m
[
1
]
==
"."
)
r
=
jQuery
.
classFilter
(
r
,
m
[
2
],
not
);
r
=
jQuery
.
classFilter
(
r
,
m
[
2
],
not
);
else
if
(
m
[
1
]
==
"["
)
{
else
if
(
m
[
1
]
==
"["
)
{
var
type
=
m
[
3
];
var
type
=
m
[
3
];
// special case, filter by exact name
// special case, filter by exact name
if
(
!
not
&&
m
[
2
]
==
'name'
&&
type
==
'='
)
if
(
!
not
&&
m
[
2
]
==
'name'
&&
type
==
'='
)
r
=
jQuery
.
grep
(
document
.
getElementsByName
(
m
[
5
]),
function
(
elem
){
r
=
jQuery
.
grep
(
document
.
getElementsByName
(
m
[
5
]),
function
(
elem
){
return
jQuery
.
inArray
(
elem
,
r
)
!=
-
1
;
return
jQuery
.
inArray
(
elem
,
r
)
!=
-
1
;
});
});
else
{
else
{
for
(
var
i
=
0
,
rl
=
r
.
length
,
tmp
=
[];
i
<
rl
;
i
++
)
{
for
(
var
i
=
0
,
rl
=
r
.
length
,
tmp
=
[];
i
<
rl
;
i
++
)
{
var
a
=
r
[
i
],
z
=
a
[
jQuery
.
props
[
m
[
2
]]
||
m
[
2
]
];
var
a
=
r
[
i
],
z
=
a
[
jQuery
.
props
[
m
[
2
]]
||
m
[
2
]
];
if
(
z
==
null
||
/href|src|selected/
.
test
(
m
[
2
])
)
if
(
z
==
null
||
/href|src|selected/
.
test
(
m
[
2
])
)
z
=
jQuery
.
attr
(
a
,
m
[
2
])
||
''
;
z
=
jQuery
.
attr
(
a
,
m
[
2
])
||
''
;
if
(
(
type
==
""
&&
!!
z
||
if
(
(
type
==
""
&&
!!
z
||
type
==
"="
&&
z
==
m
[
5
]
||
type
==
"="
&&
z
==
m
[
5
]
||
type
==
"!="
&&
z
!=
m
[
5
]
||
type
==
"!="
&&
z
!=
m
[
5
]
||
type
==
"^="
&&
z
&&
!
z
.
indexOf
(
m
[
5
])
||
type
==
"^="
&&
z
&&
!
z
.
indexOf
(
m
[
5
])
||
type
==
"$="
&&
z
.
substr
(
z
.
length
-
m
[
5
].
length
)
==
m
[
5
]
||
type
==
"$="
&&
z
.
substr
(
z
.
length
-
m
[
5
].
length
)
==
m
[
5
]
||
(
type
==
"*="
||
type
==
"~="
)
&&
z
.
indexOf
(
m
[
5
])
>=
0
)
^
not
)
(
type
==
"*="
||
type
==
"~="
)
&&
z
.
indexOf
(
m
[
5
])
>=
0
)
^
not
)
tmp
.
push
(
a
);
tmp
.
push
(
a
);
}
}
r
=
tmp
;
r
=
tmp
;
}
}
// We can get a speed boost by handling nth-child here
// We can get a speed boost by handling nth-child here
}
else
if
(
m
[
1
]
==
":"
&&
m
[
2
]
==
"nth-child"
)
{
}
else
if
(
m
[
1
]
==
":"
&&
m
[
2
]
==
"nth-child"
)
{
var
merge
=
{},
tmp
=
[],
var
merge
=
{},
tmp
=
[],
// parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'
// parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'
test
=
/
(
-
?)(\d
*
)
n
((?:\+
|-
)?\d
*
)
/
.
exec
(
test
=
/
(
-
?)(\d
*
)
n
((?:\+
|-
)?\d
*
)
/
.
exec
(
m
[
3
]
==
"even"
&&
"2n"
||
m
[
3
]
==
"odd"
&&
"2n+1"
||
m
[
3
]
==
"even"
&&
"2n"
||
m
[
3
]
==
"odd"
&&
"2n+1"
||
!
/
\D
/
.
test
(
m
[
3
])
&&
"0n+"
+
m
[
3
]
||
m
[
3
]),
!
/
\D
/
.
test
(
m
[
3
])
&&
"0n+"
+
m
[
3
]
||
m
[
3
]),
// calculate the numbers (first)n+(last) including if they are negative
// calculate the numbers (first)n+(last) including if they are negative
first
=
(
test
[
1
]
+
(
test
[
2
]
||
1
))
-
0
,
last
=
test
[
3
]
-
0
;
first
=
(
test
[
1
]
+
(
test
[
2
]
||
1
))
-
0
,
last
=
test
[
3
]
-
0
;
// loop through all the elements left in the jQuery object
// loop through all the elements left in the jQuery object
for
(
var
i
=
0
,
rl
=
r
.
length
;
i
<
rl
;
i
++
)
{
for
(
var
i
=
0
,
rl
=
r
.
length
;
i
<
rl
;
i
++
)
{
var
node
=
r
[
i
],
parentNode
=
node
.
parentNode
,
id
=
jQuery
.
data
(
parentNode
);
var
node
=
r
[
i
],
parentNode
=
node
.
parentNode
,
id
=
jQuery
.
data
(
parentNode
);
if
(
!
merge
[
id
]
)
{
if
(
!
merge
[
id
]
)
{
var
c
=
1
;
var
c
=
1
;
for
(
var
n
=
parentNode
.
firstChild
;
n
;
n
=
n
.
nextSibling
)
for
(
var
n
=
parentNode
.
firstChild
;
n
;
n
=
n
.
nextSibling
)
if
(
n
.
nodeType
==
1
)
if
(
n
.
nodeType
==
1
)
n
.
nodeIndex
=
c
++
;
n
.
nodeIndex
=
c
++
;
merge
[
id
]
=
true
;
merge
[
id
]
=
true
;
}
}
var
add
=
false
;
var
add
=
false
;
if
(
first
==
0
)
{
if
(
first
==
0
)
{
if
(
node
.
nodeIndex
==
last
)
if
(
node
.
nodeIndex
==
last
)
add
=
true
;
add
=
true
;
}
else
if
(
(
node
.
nodeIndex
-
last
)
%
first
==
0
&&
(
node
.
nodeIndex
-
last
)
/
first
>=
0
)
}
else
if
(
(
node
.
nodeIndex
-
last
)
%
first
==
0
&&
(
node
.
nodeIndex
-
last
)
/
first
>=
0
)
add
=
true
;
add
=
true
;
if
(
add
^
not
)
if
(
add
^
not
)
tmp
.
push
(
node
);
tmp
.
push
(
node
);
}
}
r
=
tmp
;
r
=
tmp
;
// Otherwise, find the expression to execute
// Otherwise, find the expression to execute
}
else
{
}
else
{
var
fn
=
jQuery
.
expr
[
m
[
1
]
];
var
fn
=
jQuery
.
expr
[
m
[
1
]
];
if
(
typeof
fn
==
"object"
)
if
(
typeof
fn
==
"object"
)
fn
=
fn
[
m
[
2
]
];
fn
=
fn
[
m
[
2
]
];
if
(
typeof
fn
==
"string"
)
if
(
typeof
fn
==
"string"
)
fn
=
eval
(
"false||function(a,i){return "
+
fn
+
";}"
);
fn
=
eval
(
"false||function(a,i){return "
+
fn
+
";}"
);
// Execute it against the current filter
// Execute it against the current filter
r
=
jQuery
.
grep
(
r
,
function
(
elem
,
i
){
r
=
jQuery
.
grep
(
r
,
function
(
elem
,
i
){
return
fn
(
elem
,
i
,
m
,
r
);
return
fn
(
elem
,
i
,
m
,
r
);
},
not
);
},
not
);
}
}
}
}
// Return an array of filtered elements (r)
// Return an array of filtered elements (r)
// and the modified expression string (t)
// and the modified expression string (t)
return
{
r
:
r
,
t
:
t
};
return
{
r
:
r
,
t
:
t
};
},
},
dir
:
function
(
elem
,
dir
){
dir
:
function
(
elem
,
dir
){
var
matched
=
[];
var
matched
=
[];
var
cur
=
elem
[
dir
];
var
cur
=
elem
[
dir
];
while
(
cur
&&
cur
!=
document
)
{
while
(
cur
&&
cur
!=
document
)
{
if
(
cur
.
nodeType
==
1
)
if
(
cur
.
nodeType
==
1
)
matched
.
push
(
cur
);
matched
.
push
(
cur
);
cur
=
cur
[
dir
];
cur
=
cur
[
dir
];
}
}
return
matched
;
return
matched
;
},
},
nth
:
function
(
cur
,
result
,
dir
,
elem
){
nth
:
function
(
cur
,
result
,
dir
,
elem
){
result
=
result
||
1
;
result
=
result
||
1
;
var
num
=
0
;
var
num
=
0
;
for
(
;
cur
;
cur
=
cur
[
dir
]
)
for
(
;
cur
;
cur
=
cur
[
dir
]
)
if
(
cur
.
nodeType
==
1
&&
++
num
==
result
)
if
(
cur
.
nodeType
==
1
&&
++
num
==
result
)
break
;
break
;
return
cur
;
return
cur
;
},
},
sibling
:
function
(
n
,
elem
)
{
sibling
:
function
(
n
,
elem
)
{
var
r
=
[];
var
r
=
[];
for
(
;
n
;
n
=
n
.
nextSibling
)
{
for
(
;
n
;
n
=
n
.
nextSibling
)
{
if
(
n
.
nodeType
==
1
&&
(
!
elem
||
n
!=
elem
)
)
if
(
n
.
nodeType
==
1
&&
(
!
elem
||
n
!=
elem
)
)
r
.
push
(
n
);
r
.
push
(
n
);
}
}
return
r
;
return
r
;
}
}
});
});
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment