mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 02:32:25 -05:00 
			
		
		
		
	[chore]: Bump golang.org/x/net from 0.30.0 to 0.31.0 (#3536)
Bumps [golang.org/x/net](https://github.com/golang/net) from 0.30.0 to 0.31.0. - [Commits](https://github.com/golang/net/compare/v0.30.0...v0.31.0) --- updated-dependencies: - dependency-name: golang.org/x/net dependency-type: direct:production update-type: version-update:semver-minor ... Signed-off-by: dependabot[bot] <support@github.com> Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
This commit is contained in:
		
					parent
					
						
							
								29007b1b88
							
						
					
				
			
			
				commit
				
					
						98eef328ea
					
				
			
		
					 59 changed files with 1656 additions and 327 deletions
				
			
		
							
								
								
									
										56
									
								
								vendor/golang.org/x/net/html/iter.go
									
										
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										56
									
								
								vendor/golang.org/x/net/html/iter.go
									
										
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							|  | @ -0,0 +1,56 @@ | |||
| // 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 | ||||
| } | ||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue