htmlx

README

htmlx

HTML parsing eXtensions, aka Monadic Finder of elements.

Includes handy parsehtml command.

Documentation

Index

• type Finder
  • func FinderFromData(r io.Reader) (Finder, error)
  • func FinderFromNode(h *html.Node) Finder
  • func FinderFromString(s string) (Finder, error)
  • 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) 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) String() string
  • func (f Finder) Write(w io.Writer)
• type FinderStream
  • func (ff FinderStream) Collect() (res []Finder)
  • func (ff FinderStream) Filter(p pred.Predicate) FinderStream
  • func (ff FinderStream) First() Finder
  • func (ff FinderStream) Last() (f Finder)
  • func (ff FinderStream) Select(p pred.Predicate) Finder

Types

type Finder

type Finder struct {
	*html.Node
}

func FinderFromData

func FinderFromData(r io.Reader) (Finder, error)

func FinderFromNode

func FinderFromNode(h *html.Node) Finder

func FinderFromString

func FinderFromString(s string) (Finder, error)

func (Finder) Attr

func (f Finder) Attr() attr.List

func (Finder) Find

func (f Finder) Find(pred pred.Predicate) (r Finder)

Find performs depth-first traversal looking for a node satisfying `pred`. Includes current node in the search. Stops at the first found node and returns it, wrapped in a new Finder.

func (Finder) FindAll

func (f Finder) FindAll(pred pred.Predicate) FinderStream

FindAll performs depth-first traversal like Find, but returns a stream of all found nodes, each wrapped in a Finder. FinderStream is really a readonly channel. Current node is included in the search.

func (Finder) FindPrevSibling

func (f Finder) FindPrevSibling(pred pred.Predicate) (r Finder)

FindPrevSibling performs flat find among node's previous (left) siblings. No recursion. Omits current node, starts from a first such sibling.

func (Finder) FindPrevSiblings

func (f Finder) FindPrevSiblings(pred pred.Predicate) FinderStream

func (Finder) FindSibling

func (f Finder) FindSibling(pred pred.Predicate) (r Finder)

FindSibling performs flat find among node's next (right) siblings. No recursion. Omits current node, starts from a first such sibling.

func (Finder) FindSiblings

func (f Finder) FindSiblings(pred pred.Predicate) FinderStream

func (Finder) FirstChild

func (f Finder) FirstChild() Finder

func (Finder) InnerText

func (f Finder) InnerText() string

func (Finder) IsEmpty

func (f Finder) IsEmpty() bool

func (Finder) LastChild

func (f Finder) LastChild() Finder

func (Finder) NextSibling

func (f Finder) NextSibling() Finder

func (Finder) Parent

func (f Finder) Parent() Finder

func (Finder) PrevSibling

func (f Finder) PrevSibling() Finder

func (Finder) String

func (f Finder) String() string

func (Finder) Write

func (f Finder) Write(w io.Writer)

type FinderStream

type FinderStream <-chan Finder

func (FinderStream) Collect

func (ff FinderStream) Collect() (res []Finder)

func (FinderStream) Filter

func (ff FinderStream) Filter(p pred.Predicate) FinderStream

func (FinderStream) First

func (ff FinderStream) First() Finder

func (FinderStream) Last

func (ff FinderStream) Last() (f Finder)

func (FinderStream) Select

func (ff FinderStream) Select(p pred.Predicate) Finder