Documentation ¶
Index ¶
- type Finder
- func (f Finder) Attr() attr.List
- func (f Finder) Find(pred pred.Predicate) (r Finder)
- func (f Finder) FindAll(pred pred.Predicate) FinderStream
- func (f Finder) FindPrevSibling(pred pred.Predicate) (r Finder)
- func (f Finder) FindPrevSiblings(pred pred.Predicate) FinderStream
- func (f Finder) FindSibling(pred pred.Predicate) (r Finder)
- func (f Finder) FindSiblings(pred pred.Predicate) FinderStream
- func (f Finder) FindWithSiblings(pred pred.Predicate) (FinderStream, bool)
- func (f Finder) FirstChild() Finder
- func (f Finder) InnerText() string
- func (f Finder) IsEmpty() bool
- func (f Finder) LastChild() Finder
- func (f Finder) NextSibling() Finder
- func (f Finder) Parent() Finder
- func (f Finder) PrevSibling() Finder
- func (f Finder) StreamSelf() FinderStream
- func (f Finder) String() string
- func (f Finder) Write(w io.Writer) error
- type FinderStream
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Finder ¶
func FinderFromNode ¶
func FinderFromString ¶
func (Finder) Find ¶
Find performs depth-first traversal looking for the node satisfying given precicate. Includes current node in the search. Stops at the first found node and returns it, wrapped in a new Finder.
func (Finder) FindAll ¶ added in v0.8.0
func (f Finder) FindAll(pred pred.Predicate) FinderStream
FindAll performs depth-first traversal like Find, but returns a stream of all the found nodes satisfying the predicate, each wrapped in a Finder. Current node is included in the search.
func (Finder) FindPrevSibling ¶ added in v0.4.0
FindPrevSibling performs flat find of the first node satistying the predicate among current node's previous (left) siblings. No recursion. Omits current node, starts from a first sibling.
func (Finder) FindPrevSiblings ¶ added in v0.8.0
func (f Finder) FindPrevSiblings(pred pred.Predicate) FinderStream
FindPrevSiblings performs flat find of all the nodes satistying the predicate among current node's previous (left) siblings. No recursion. Omits current node, starts from a first sibling.
func (Finder) FindSibling ¶
FindSibling performs flat find of the first node satistying the predicate among current node's next (right) siblings. No recursion. Omits current node, starts from a first sibling.
func (Finder) FindSiblings ¶ added in v0.8.0
func (f Finder) FindSiblings(pred pred.Predicate) FinderStream
FindSiblings performs flat find of all the nodes satistying the predicate among current node's next (right) siblings. No recursion. Omits current node, starts from a first sibling.
func (Finder) FindWithSiblings ¶ added in v0.10.0
func (f Finder) FindWithSiblings(pred pred.Predicate) (FinderStream, bool)
FindWithSiblings performs depth-first travelsal looking for the first of nodes satisfying given predicate. Then it continues flat find of all the siblings satisfying the predicate. All results are pushed into the returted stream of Finders.
func (Finder) FirstChild ¶
func (Finder) NextSibling ¶
func (Finder) PrevSibling ¶ added in v0.4.0
func (Finder) StreamSelf ¶ added in v0.11.0
func (f Finder) StreamSelf() FinderStream
type FinderStream ¶ added in v0.8.0
type FinderStream <-chan Finder
func (FinderStream) Collect ¶ added in v0.8.0
func (ff FinderStream) Collect() (res []Finder)
func (FinderStream) Filter ¶ added in v0.8.0
func (ff FinderStream) Filter(p pred.Predicate) FinderStream
func (FinderStream) First ¶ added in v0.8.0
func (ff FinderStream) First() Finder
func (FinderStream) Last ¶ added in v0.8.0
func (ff FinderStream) Last() (f Finder)