Skip to content

added support for -n+A for :nth-child #158

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
mdrokz wants to merge 4 commits into
base: master
Choose a base branch
from
Open

added support for -n+A for :nth-child #158

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
8bef3ef
added support for -n+A for :nth-child
mdrokz Aug 14, 2021
0a20559
comments
mdrokz Aug 15, 2021
7ffc057
modified regex to allow numbers over 9 :nth-child
mdrokz Aug 15, 2021
f807067
Support wildcard element selector
mdrokz Aug 15, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 15 additions & 3 deletions selector.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -85,7 +85,7 @@ func (s CSSSelector) Match(node *html.Node) bool {
if node.Type != html.ElementNode {
return false
}
if s.Tag != "" {
if s.Tag != "" && s.Tag != "*" {
if s.Tag != node.DataAtom.String() {
return false
}
Expand Down Expand Up @@ -510,12 +510,13 @@ func parseNthPseudo(cmd string) (PseudoClass, error) {
oddOrEven = 0
}
if oddOrEven > -1 {
fmt.Println("bruh it stopped")
return func(n *html.Node) bool {
return n.Type == html.ElementNode && countNth(n)%2 == oddOrEven
}, nil
}
// Check against '3n+4' pattern
r := regexp.MustCompile(`([0-9]+)n[ ]?\+[ ]?([0-9])`)
r := regexp.MustCompile(`([0-9]+)n[ ]?\+[ ]?([1-9][0-9]{0,2}|1000)$`)
subMatch := r.FindAllStringSubmatch(number, -1)
if len(subMatch) == 1 && len(subMatch[0]) == 3 {
cycle, _ := strconv.Atoi(subMatch[0][1])
Expand All @@ -524,8 +525,19 @@ func parseNthPseudo(cmd string) (PseudoClass, error) {
return n.Type == html.ElementNode && countNth(n)%cycle == offset
}, nil
}

// check against '-n+2' pattern
r = regexp.MustCompile(`^-n[ ]?\+[ ]?([1-9][0-9]{0,2}|1000)$`)
subMatch = r.FindAllStringSubmatch(number, -1)
if len(subMatch) == 1 && len(subMatch[0]) == 2 {
offset, _ := strconv.Atoi(subMatch[0][1])
return func(n *html.Node) bool {
return n.Type == html.ElementNode && countNth(n) <= offset
}, nil
}

// check against 'n+2' pattern
r = regexp.MustCompile(`n[ ]?\+[ ]?([0-9])`)
r = regexp.MustCompile(`^n[ ]?\+[ ]?([1-9][0-9]{0,2}|1000)$`)
subMatch = r.FindAllStringSubmatch(number, -1)
if len(subMatch) == 1 && len(subMatch[0]) == 2 {
offset, _ := strconv.Atoi(subMatch[0][1])
Expand Down