summaryrefslogtreecommitdiff
path: root/vendor/golang.org/x/net/html/iter.go
diff options
context:
space:
mode:
authorLibravatar Terin Stock <terinjokes@gmail.com>2025-03-09 17:47:56 +0100
committerLibravatar Terin Stock <terinjokes@gmail.com>2025-03-10 01:59:49 +0100
commit3ac1ee16f377d31a0fb80c8dae28b6239ac4229e (patch)
treef61faa581feaaeaba2542b9f2b8234a590684413 /vendor/golang.org/x/net/html/iter.go
parent[chore] update URLs to forked source (diff)
downloadgotosocial-3ac1ee16f377d31a0fb80c8dae28b6239ac4229e.tar.xz
[chore] remove vendor
Diffstat (limited to 'vendor/golang.org/x/net/html/iter.go')
-rw-r--r--vendor/golang.org/x/net/html/iter.go56
1 files changed, 0 insertions, 56 deletions
diff --git a/vendor/golang.org/x/net/html/iter.go b/vendor/golang.org/x/net/html/iter.go
deleted file mode 100644
index 54be8fd30..000000000
--- a/vendor/golang.org/x/net/html/iter.go
+++ /dev/null
@@ -1,56 +0,0 @@
-// Copyright 2024 The Go Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style
-// license that can be found in the LICENSE file.
-
-//go:build go1.23
-
-package html
-
-import "iter"
-
-// Ancestors returns an iterator over the ancestors of n, starting with n.Parent.
-//
-// Mutating a Node or its parents while iterating may have unexpected results.
-func (n *Node) Ancestors() iter.Seq[*Node] {
- _ = n.Parent // eager nil check
-
- return func(yield func(*Node) bool) {
- for p := n.Parent; p != nil && yield(p); p = p.Parent {
- }
- }
-}
-
-// ChildNodes returns an iterator over the immediate children of n,
-// starting with n.FirstChild.
-//
-// Mutating a Node or its children while iterating may have unexpected results.
-func (n *Node) ChildNodes() iter.Seq[*Node] {
- _ = n.FirstChild // eager nil check
-
- return func(yield func(*Node) bool) {
- for c := n.FirstChild; c != nil && yield(c); c = c.NextSibling {
- }
- }
-
-}
-
-// Descendants returns an iterator over all nodes recursively beneath
-// n, excluding n itself. Nodes are visited in depth-first preorder.
-//
-// Mutating a Node or its descendants while iterating may have unexpected results.
-func (n *Node) Descendants() iter.Seq[*Node] {
- _ = n.FirstChild // eager nil check
-
- return func(yield func(*Node) bool) {
- n.descendants(yield)
- }
-}
-
-func (n *Node) descendants(yield func(*Node) bool) bool {
- for c := range n.ChildNodes() {
- if !yield(c) || !c.descendants(yield) {
- return false
- }
- }
- return true
-}