pax_global_header00006660000000000000000000000064143741673260014527gustar00rootroot0000000000000052 comment=39fb6d4dc47a07e5782494b6defc89a194b1f906 goquery-1.8.1/000077500000000000000000000000001437416732600132315ustar00rootroot00000000000000goquery-1.8.1/.gitattributes000066400000000000000000000000351437416732600161220ustar00rootroot00000000000000testdata/* linguist-vendored goquery-1.8.1/.github/000077500000000000000000000000001437416732600145715ustar00rootroot00000000000000goquery-1.8.1/.github/FUNDING.yml000066400000000000000000000000731437416732600164060ustar00rootroot00000000000000github: [mna] custom: ["https://www.buymeacoffee.com/mna"] goquery-1.8.1/.github/dependabot.yml000066400000000000000000000002151437416732600174170ustar00rootroot00000000000000version: 2 updates: # Maintain dependencies for Go - package-ecosystem: "gomod" directory: "/" schedule: interval: "daily" goquery-1.8.1/.github/workflows/000077500000000000000000000000001437416732600166265ustar00rootroot00000000000000goquery-1.8.1/.github/workflows/test.yml000066400000000000000000000007711437416732600203350ustar00rootroot00000000000000name: test on: [push, pull_request] env: GOPROXY: https://proxy.golang.org,direct jobs: test: strategy: matrix: go-version: [1.19.x, 1.20.x] os: [ubuntu-latest, macos-latest, windows-latest] runs-on: ${{ matrix.os }} steps: - name: Install Go uses: actions/setup-go@v3 with: go-version: ${{ matrix.go-version }} - name: Checkout code uses: actions/checkout@v3 - name: Test run: go test ./... -v -cover goquery-1.8.1/.gitignore000066400000000000000000000002271437416732600152220ustar00rootroot00000000000000# editor temporary files *.sublime-* .DS_Store *.swp #*.*# tags # direnv config .env* # test binaries *.test # coverage and profilte outputs *.out goquery-1.8.1/LICENSE000066400000000000000000000027231437416732600142420ustar00rootroot00000000000000Copyright (c) 2012-2021, Martin Angers & Contributors All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. goquery-1.8.1/README.md000066400000000000000000000341621437416732600145160ustar00rootroot00000000000000# goquery - a little like that j-thing, only in Go [![Build Status](https://github.com/PuerkitoBio/goquery/actions/workflows/test.yml/badge.svg?branch=master)](https://github.com/PuerkitoBio/goquery/actions) [![Go Reference](https://pkg.go.dev/badge/github.com/PuerkitoBio/goquery.svg)](https://pkg.go.dev/github.com/PuerkitoBio/goquery) [![Sourcegraph Badge](https://sourcegraph.com/github.com/PuerkitoBio/goquery/-/badge.svg)](https://sourcegraph.com/github.com/PuerkitoBio/goquery?badge) goquery brings a syntax and a set of features similar to [jQuery][] to the [Go language][go]. It is based on Go's [net/html package][html] and the CSS Selector library [cascadia][]. Since the net/html parser returns nodes, and not a full-featured DOM tree, jQuery's stateful manipulation functions (like height(), css(), detach()) have been left off. Also, because the net/html parser requires UTF-8 encoding, so does goquery: it is the caller's responsibility to ensure that the source document provides UTF-8 encoded HTML. See the [wiki][] for various options to do this. Syntax-wise, it is as close as possible to jQuery, with the same function names when possible, and that warm and fuzzy chainable interface. jQuery being the ultra-popular library that it is, I felt that writing a similar HTML-manipulating library was better to follow its API than to start anew (in the same spirit as Go's `fmt` package), even though some of its methods are less than intuitive (looking at you, [index()][index]...). ## Table of Contents * [Installation](#installation) * [Changelog](#changelog) * [API](#api) * [Examples](#examples) * [Related Projects](#related-projects) * [Support](#support) * [License](#license) ## Installation Please note that because of the net/html dependency, goquery requires Go1.1+ and is tested on Go1.7+. $ go get github.com/PuerkitoBio/goquery (optional) To run unit tests: $ cd $GOPATH/src/github.com/PuerkitoBio/goquery $ go test (optional) To run benchmarks (warning: it runs for a few minutes): $ cd $GOPATH/src/github.com/PuerkitoBio/goquery $ go test -bench=".*" ## Changelog **Note that goquery's API is now stable, and will not break.** * **2023-02-18 (v1.8.1)** : Update `go.mod` dependencies, update CI workflow. * **2021-10-25 (v1.8.0)** : Add `Render` function to render a `Selection` to an `io.Writer` (thanks [@anthonygedeon](https://github.com/anthonygedeon)). * **2021-07-11 (v1.7.1)** : Update go.mod dependencies and add dependabot config (thanks [@jauderho](https://github.com/jauderho)). * **2021-06-14 (v1.7.0)** : Add `Single` and `SingleMatcher` functions to optimize first-match selection (thanks [@gdollardollar](https://github.com/gdollardollar)). * **2021-01-11 (v1.6.1)** : Fix panic when calling `{Prepend,Append,Set}Html` on a `Selection` that contains non-Element nodes. * **2020-10-08 (v1.6.0)** : Parse html in context of the container node for all functions that deal with html strings (`AfterHtml`, `AppendHtml`, etc.). Thanks to [@thiemok][thiemok] and [@davidjwilkins][djw] for their work on this. * **2020-02-04 (v1.5.1)** : Update module dependencies. * **2018-11-15 (v1.5.0)** : Go module support (thanks @Zaba505). * **2018-06-07 (v1.4.1)** : Add `NewDocumentFromReader` examples. * **2018-03-24 (v1.4.0)** : Deprecate `NewDocument(url)` and `NewDocumentFromResponse(response)`. * **2018-01-28 (v1.3.0)** : Add `ToEnd` constant to `Slice` until the end of the selection (thanks to @davidjwilkins for raising the issue). * **2018-01-11 (v1.2.0)** : Add `AddBack*` and deprecate `AndSelf` (thanks to @davidjwilkins). * **2017-02-12 (v1.1.0)** : Add `SetHtml` and `SetText` (thanks to @glebtv). * **2016-12-29 (v1.0.2)** : Optimize allocations for `Selection.Text` (thanks to @radovskyb). * **2016-08-28 (v1.0.1)** : Optimize performance for large documents. * **2016-07-27 (v1.0.0)** : Tag version 1.0.0. * **2016-06-15** : Invalid selector strings internally compile to a `Matcher` implementation that never matches any node (instead of a panic). So for example, `doc.Find("~")` returns an empty `*Selection` object. * **2016-02-02** : Add `NodeName` utility function similar to the DOM's `nodeName` property. It returns the tag name of the first element in a selection, and other relevant values of non-element nodes (see [doc][] for details). Add `OuterHtml` utility function similar to the DOM's `outerHTML` property (named `OuterHtml` in small caps for consistency with the existing `Html` method on the `Selection`). * **2015-04-20** : Add `AttrOr` helper method to return the attribute's value or a default value if absent. Thanks to [piotrkowalczuk][piotr]. * **2015-02-04** : Add more manipulation functions - Prepend* - thanks again to [Andrew Stone][thatguystone]. * **2014-11-28** : Add more manipulation functions - ReplaceWith*, Wrap* and Unwrap - thanks again to [Andrew Stone][thatguystone]. * **2014-11-07** : Add manipulation functions (thanks to [Andrew Stone][thatguystone]) and `*Matcher` functions, that receive compiled cascadia selectors instead of selector strings, thus avoiding potential panics thrown by goquery via `cascadia.MustCompile` calls. This results in better performance (selectors can be compiled once and reused) and more idiomatic error handling (you can handle cascadia's compilation errors, instead of recovering from panics, which had been bugging me for a long time). Note that the actual type expected is a `Matcher` interface, that `cascadia.Selector` implements. Other matcher implementations could be used. * **2014-11-06** : Change import paths of net/html to golang.org/x/net/html (see https://groups.google.com/forum/#!topic/golang-nuts/eD8dh3T9yyA). Make sure to update your code to use the new import path too when you call goquery with `html.Node`s. * **v0.3.2** : Add `NewDocumentFromReader()` (thanks jweir) which allows creating a goquery document from an io.Reader. * **v0.3.1** : Add `NewDocumentFromResponse()` (thanks assassingj) which allows creating a goquery document from an http response. * **v0.3.0** : Add `EachWithBreak()` which allows to break out of an `Each()` loop by returning false. This function was added instead of changing the existing `Each()` to avoid breaking compatibility. * **v0.2.1** : Make go-getable, now that [go.net/html is Go1.0-compatible][gonet] (thanks to @matrixik for pointing this out). * **v0.2.0** : Add support for negative indices in Slice(). **BREAKING CHANGE** `Document.Root` is removed, `Document` is now a `Selection` itself (a selection of one, the root element, just like `Document.Root` was before). Add jQuery's Closest() method. * **v0.1.1** : Add benchmarks to use as baseline for refactorings, refactor Next...() and Prev...() methods to use the new html package's linked list features (Next/PrevSibling, FirstChild). Good performance boost (40+% in some cases). * **v0.1.0** : Initial release. ## API goquery exposes two structs, `Document` and `Selection`, and the `Matcher` interface. Unlike jQuery, which is loaded as part of a DOM document, and thus acts on its containing document, goquery doesn't know which HTML document to act upon. So it needs to be told, and that's what the `Document` type is for. It holds the root document node as the initial Selection value to manipulate. jQuery often has many variants for the same function (no argument, a selector string argument, a jQuery object argument, a DOM element argument, ...). Instead of exposing the same features in goquery as a single method with variadic empty interface arguments, statically-typed signatures are used following this naming convention: * When the jQuery equivalent can be called with no argument, it has the same name as jQuery for the no argument signature (e.g.: `Prev()`), and the version with a selector string argument is called `XxxFiltered()` (e.g.: `PrevFiltered()`) * When the jQuery equivalent **requires** one argument, the same name as jQuery is used for the selector string version (e.g.: `Is()`) * The signatures accepting a jQuery object as argument are defined in goquery as `XxxSelection()` and take a `*Selection` object as argument (e.g.: `FilterSelection()`) * The signatures accepting a DOM element as argument in jQuery are defined in goquery as `XxxNodes()` and take a variadic argument of type `*html.Node` (e.g.: `FilterNodes()`) * The signatures accepting a function as argument in jQuery are defined in goquery as `XxxFunction()` and take a function as argument (e.g.: `FilterFunction()`) * The goquery methods that can be called with a selector string have a corresponding version that take a `Matcher` interface and are defined as `XxxMatcher()` (e.g.: `IsMatcher()`) Utility functions that are not in jQuery but are useful in Go are implemented as functions (that take a `*Selection` as parameter), to avoid a potential naming clash on the `*Selection`'s methods (reserved for jQuery-equivalent behaviour). The complete [package reference documentation can be found here][doc]. Please note that Cascadia's selectors do not necessarily match all supported selectors of jQuery (Sizzle). See the [cascadia project][cascadia] for details. Invalid selector strings compile to a `Matcher` that fails to match any node. Behaviour of the various functions that take a selector string as argument follows from that fact, e.g. (where `~` is an invalid selector string): * `Find("~")` returns an empty selection because the selector string doesn't match anything. * `Add("~")` returns a new selection that holds the same nodes as the original selection, because it didn't add any node (selector string didn't match anything). * `ParentsFiltered("~")` returns an empty selection because the selector string doesn't match anything. * `ParentsUntil("~")` returns all parents of the selection because the selector string didn't match any element to stop before the top element. ## Examples See some tips and tricks in the [wiki][]. Adapted from example_test.go: ```Go package main import ( "fmt" "log" "net/http" "github.com/PuerkitoBio/goquery" ) func ExampleScrape() { // Request the HTML page. res, err := http.Get("http://metalsucks.net") if err != nil { log.Fatal(err) } defer res.Body.Close() if res.StatusCode != 200 { log.Fatalf("status code error: %d %s", res.StatusCode, res.Status) } // Load the HTML document doc, err := goquery.NewDocumentFromReader(res.Body) if err != nil { log.Fatal(err) } // Find the review items doc.Find(".left-content article .post-title").Each(func(i int, s *goquery.Selection) { // For each item found, get the title title := s.Find("a").Text() fmt.Printf("Review %d: %s\n", i, title) }) } func main() { ExampleScrape() } ``` ## Related Projects - [Goq][goq], an HTML deserialization and scraping library based on goquery and struct tags. - [andybalholm/cascadia][cascadia], the CSS selector library used by goquery. - [suntong/cascadia][cascadiacli], a command-line interface to the cascadia CSS selector library, useful to test selectors. - [gocolly/colly](https://github.com/gocolly/colly), a lightning fast and elegant Scraping Framework - [gnulnx/goperf](https://github.com/gnulnx/goperf), a website performance test tool that also fetches static assets. - [MontFerret/ferret](https://github.com/MontFerret/ferret), declarative web scraping. - [tacusci/berrycms](https://github.com/tacusci/berrycms), a modern simple to use CMS with easy to write plugins - [Dataflow kit](https://github.com/slotix/dataflowkit), Web Scraping framework for Gophers. - [Geziyor](https://github.com/geziyor/geziyor), a fast web crawling & scraping framework for Go. Supports JS rendering. - [Pagser](https://github.com/foolin/pagser), a simple, easy, extensible, configurable HTML parser to struct based on goquery and struct tags. - [stitcherd](https://github.com/vhodges/stitcherd), A server for doing server side includes using css selectors and DOM updates. - [goskyr](https://github.com/jakopako/goskyr), an easily configurable command-line scraper written in Go. - [goGetJS](https://github.com/davemolk/goGetJS), a tool for extracting, searching, and saving JavaScript files (with optional headless browser). ## Support There are a number of ways you can support the project: * Use it, star it, build something with it, spread the word! - If you do build something open-source or otherwise publicly-visible, let me know so I can add it to the [Related Projects](#related-projects) section! * Raise issues to improve the project (note: doc typos and clarifications are issues too!) - Please search existing issues before opening a new one - it may have already been adressed. * Pull requests: please discuss new code in an issue first, unless the fix is really trivial. - Make sure new code is tested. - Be mindful of existing code - PRs that break existing code have a high probability of being declined, unless it fixes a serious issue. * Sponsor the developer - See the Github Sponsor button at the top of the repo on github - or via BuyMeACoffee.com, below Buy Me A Coffee ## License The [BSD 3-Clause license][bsd], the same as the [Go language][golic]. Cascadia's license is [here][caslic]. [jquery]: http://jquery.com/ [go]: http://golang.org/ [cascadia]: https://github.com/andybalholm/cascadia [cascadiacli]: https://github.com/suntong/cascadia [bsd]: http://opensource.org/licenses/BSD-3-Clause [golic]: http://golang.org/LICENSE [caslic]: https://github.com/andybalholm/cascadia/blob/master/LICENSE [doc]: https://pkg.go.dev/github.com/PuerkitoBio/goquery [index]: http://api.jquery.com/index/ [gonet]: https://github.com/golang/net/ [html]: https://pkg.go.dev/golang.org/x/net/html [wiki]: https://github.com/PuerkitoBio/goquery/wiki/Tips-and-tricks [thatguystone]: https://github.com/thatguystone [piotr]: https://github.com/piotrkowalczuk [goq]: https://github.com/andrewstuart/goq [thiemok]: https://github.com/thiemok [djw]: https://github.com/davidjwilkins goquery-1.8.1/array.go000066400000000000000000000074111437416732600147010ustar00rootroot00000000000000package goquery import ( "golang.org/x/net/html" ) const ( maxUint = ^uint(0) maxInt = int(maxUint >> 1) // ToEnd is a special index value that can be used as end index in a call // to Slice so that all elements are selected until the end of the Selection. // It is equivalent to passing (*Selection).Length(). ToEnd = maxInt ) // First reduces the set of matched elements to the first in the set. // It returns a new Selection object, and an empty Selection object if the // the selection is empty. func (s *Selection) First() *Selection { return s.Eq(0) } // Last reduces the set of matched elements to the last in the set. // It returns a new Selection object, and an empty Selection object if // the selection is empty. func (s *Selection) Last() *Selection { return s.Eq(-1) } // Eq reduces the set of matched elements to the one at the specified index. // If a negative index is given, it counts backwards starting at the end of the // set. It returns a new Selection object, and an empty Selection object if the // index is invalid. func (s *Selection) Eq(index int) *Selection { if index < 0 { index += len(s.Nodes) } if index >= len(s.Nodes) || index < 0 { return newEmptySelection(s.document) } return s.Slice(index, index+1) } // Slice reduces the set of matched elements to a subset specified by a range // of indices. The start index is 0-based and indicates the index of the first // element to select. The end index is 0-based and indicates the index at which // the elements stop being selected (the end index is not selected). // // The indices may be negative, in which case they represent an offset from the // end of the selection. // // The special value ToEnd may be specified as end index, in which case all elements // until the end are selected. This works both for a positive and negative start // index. func (s *Selection) Slice(start, end int) *Selection { if start < 0 { start += len(s.Nodes) } if end == ToEnd { end = len(s.Nodes) } else if end < 0 { end += len(s.Nodes) } return pushStack(s, s.Nodes[start:end]) } // Get retrieves the underlying node at the specified index. // Get without parameter is not implemented, since the node array is available // on the Selection object. func (s *Selection) Get(index int) *html.Node { if index < 0 { index += len(s.Nodes) // Negative index gets from the end } return s.Nodes[index] } // Index returns the position of the first element within the Selection object // relative to its sibling elements. func (s *Selection) Index() int { if len(s.Nodes) > 0 { return newSingleSelection(s.Nodes[0], s.document).PrevAll().Length() } return -1 } // IndexSelector returns the position of the first element within the // Selection object relative to the elements matched by the selector, or -1 if // not found. func (s *Selection) IndexSelector(selector string) int { if len(s.Nodes) > 0 { sel := s.document.Find(selector) return indexInSlice(sel.Nodes, s.Nodes[0]) } return -1 } // IndexMatcher returns the position of the first element within the // Selection object relative to the elements matched by the matcher, or -1 if // not found. func (s *Selection) IndexMatcher(m Matcher) int { if len(s.Nodes) > 0 { sel := s.document.FindMatcher(m) return indexInSlice(sel.Nodes, s.Nodes[0]) } return -1 } // IndexOfNode returns the position of the specified node within the Selection // object, or -1 if not found. func (s *Selection) IndexOfNode(node *html.Node) int { return indexInSlice(s.Nodes, node) } // IndexOfSelection returns the position of the first node in the specified // Selection object within this Selection object, or -1 if not found. func (s *Selection) IndexOfSelection(sel *Selection) int { if sel != nil && len(sel.Nodes) > 0 { return indexInSlice(s.Nodes, sel.Nodes[0]) } return -1 } goquery-1.8.1/array_test.go000066400000000000000000000124401437416732600157360ustar00rootroot00000000000000package goquery import ( "testing" ) func TestFirst(t *testing.T) { sel := Doc().Find(".pvk-content").First() assertLength(t, sel.Nodes, 1) } func TestFirstEmpty(t *testing.T) { sel := Doc().Find(".pvk-zzcontentzz").First() assertLength(t, sel.Nodes, 0) } func TestFirstInvalid(t *testing.T) { sel := Doc().Find("").First() assertLength(t, sel.Nodes, 0) } func TestFirstRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.First().End() assertEqual(t, sel, sel2) } func TestLast(t *testing.T) { sel := Doc().Find(".pvk-content").Last() assertLength(t, sel.Nodes, 1) // Should contain Footer foot := Doc().Find(".footer") if !sel.Contains(foot.Nodes[0]) { t.Error("Last .pvk-content should contain .footer.") } } func TestLastEmpty(t *testing.T) { sel := Doc().Find(".pvk-zzcontentzz").Last() assertLength(t, sel.Nodes, 0) } func TestLastInvalid(t *testing.T) { sel := Doc().Find("").Last() assertLength(t, sel.Nodes, 0) } func TestLastRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Last().End() assertEqual(t, sel, sel2) } func TestEq(t *testing.T) { sel := Doc().Find(".pvk-content").Eq(1) assertLength(t, sel.Nodes, 1) } func TestEqNegative(t *testing.T) { sel := Doc().Find(".pvk-content").Eq(-1) assertLength(t, sel.Nodes, 1) // Should contain Footer foot := Doc().Find(".footer") if !sel.Contains(foot.Nodes[0]) { t.Error("Index -1 of .pvk-content should contain .footer.") } } func TestEqEmpty(t *testing.T) { sel := Doc().Find("something_random_that_does_not_exists").Eq(0) assertLength(t, sel.Nodes, 0) } func TestEqInvalid(t *testing.T) { sel := Doc().Find("").Eq(0) assertLength(t, sel.Nodes, 0) } func TestEqInvalidPositive(t *testing.T) { sel := Doc().Find(".pvk-content").Eq(3) assertLength(t, sel.Nodes, 0) } func TestEqInvalidNegative(t *testing.T) { sel := Doc().Find(".pvk-content").Eq(-4) assertLength(t, sel.Nodes, 0) } func TestEqRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Eq(1).End() assertEqual(t, sel, sel2) } func TestSlice(t *testing.T) { sel := Doc().Find(".pvk-content").Slice(0, 2) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#pc1", "#pc2") } func TestSliceToEnd(t *testing.T) { sel := Doc().Find(".pvk-content").Slice(1, ToEnd) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel.Eq(0), "#pc2") if _, ok := sel.Eq(1).Attr("id"); ok { t.Error("Want no attribute ID, got one") } } func TestSliceEmpty(t *testing.T) { defer assertPanic(t) Doc().Find("x").Slice(0, 2) } func TestSliceInvalid(t *testing.T) { defer assertPanic(t) Doc().Find("").Slice(0, 2) } func TestSliceInvalidToEnd(t *testing.T) { defer assertPanic(t) Doc().Find("").Slice(2, ToEnd) } func TestSliceOutOfBounds(t *testing.T) { defer assertPanic(t) Doc().Find(".pvk-content").Slice(2, 12) } func TestNegativeSliceStart(t *testing.T) { sel := Doc().Find(".container-fluid").Slice(-2, 3) assertLength(t, sel.Nodes, 1) assertSelectionIs(t, sel.Eq(0), "#cf3") } func TestNegativeSliceEnd(t *testing.T) { sel := Doc().Find(".container-fluid").Slice(1, -1) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel.Eq(0), "#cf2") assertSelectionIs(t, sel.Eq(1), "#cf3") } func TestNegativeSliceBoth(t *testing.T) { sel := Doc().Find(".container-fluid").Slice(-3, -1) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel.Eq(0), "#cf2") assertSelectionIs(t, sel.Eq(1), "#cf3") } func TestNegativeSliceToEnd(t *testing.T) { sel := Doc().Find(".container-fluid").Slice(-3, ToEnd) assertLength(t, sel.Nodes, 3) assertSelectionIs(t, sel, "#cf2", "#cf3", "#cf4") } func TestNegativeSliceOutOfBounds(t *testing.T) { defer assertPanic(t) Doc().Find(".container-fluid").Slice(-12, -7) } func TestSliceRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Slice(0, 2).End() assertEqual(t, sel, sel2) } func TestGet(t *testing.T) { sel := Doc().Find(".pvk-content") node := sel.Get(1) if sel.Nodes[1] != node { t.Errorf("Expected node %v to be %v.", node, sel.Nodes[1]) } } func TestGetNegative(t *testing.T) { sel := Doc().Find(".pvk-content") node := sel.Get(-3) if sel.Nodes[0] != node { t.Errorf("Expected node %v to be %v.", node, sel.Nodes[0]) } } func TestGetInvalid(t *testing.T) { defer assertPanic(t) sel := Doc().Find(".pvk-content") sel.Get(129) } func TestIndex(t *testing.T) { sel := Doc().Find(".pvk-content") if i := sel.Index(); i != 1 { t.Errorf("Expected index of 1, got %v.", i) } } func TestIndexSelector(t *testing.T) { sel := Doc().Find(".hero-unit") if i := sel.IndexSelector("div"); i != 4 { t.Errorf("Expected index of 4, got %v.", i) } } func TestIndexSelectorInvalid(t *testing.T) { sel := Doc().Find(".hero-unit") if i := sel.IndexSelector(""); i != -1 { t.Errorf("Expected index of -1, got %v.", i) } } func TestIndexOfNode(t *testing.T) { sel := Doc().Find("div.pvk-gutter") if i := sel.IndexOfNode(sel.Nodes[1]); i != 1 { t.Errorf("Expected index of 1, got %v.", i) } } func TestIndexOfNilNode(t *testing.T) { sel := Doc().Find("div.pvk-gutter") if i := sel.IndexOfNode(nil); i != -1 { t.Errorf("Expected index of -1, got %v.", i) } } func TestIndexOfSelection(t *testing.T) { sel := Doc().Find("div") sel2 := Doc().Find(".hero-unit") if i := sel.IndexOfSelection(sel2); i != 4 { t.Errorf("Expected index of 4, got %v.", i) } } goquery-1.8.1/bench/000077500000000000000000000000001437416732600143105ustar00rootroot00000000000000goquery-1.8.1/bench/v0.1.0000066400000000000000000000441701437416732600150630ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 92.9 ns/op BenchmarkLast 20000000 91.6 ns/op BenchmarkEq 20000000 90.6 ns/op BenchmarkSlice 20000000 86.7 ns/op BenchmarkGet 1000000000 2.14 ns/op BenchmarkIndex 500000 5308 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 50000 54962 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 11.4 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 12.1 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 5000 327144 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 50000 52945 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 205 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 203 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2639 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 50000 30182 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 50000 34855 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 66052 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 69721 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 66077 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 20000 80021 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 66256 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 20000 79568 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 569441 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 230585 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 231470 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.65 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 9558 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 16809 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkAttr 50000000 37.5 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 100000 18583 ns/op BenchmarkLength 2000000000 0.80 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 666 ns/op BenchmarkIs 50000 34328 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 50000 32423 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2707 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 66976 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 66740 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 701722 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.9 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 50000 55444 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 10000 127984 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 355944 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 355596 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 500000 5656 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 200000 9007 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 1000000 1237 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 5613 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 47026 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 51438 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 91820 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 95156 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 10000 134383 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 235456 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 235936 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 50000 32451 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 50000 30570 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 50000 30729 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 10000 106704 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 10000 115592 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 50000 54449 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 50000 58503 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 20000 77698 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 20000 85034 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 50000 56458 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 50000 60163 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 50000 47679 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 50000 51563 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 10000 213998 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 10000 140720 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 20000 90702 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 5000 456039 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 10000 167944 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 20000 82059 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 10000 150883 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 10000 146578 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 10000 148284 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 10000 154303 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 10000 149062 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 10000 150584 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 ok github.com/PuerkitoBio/goquery 188.326s goquery-1.8.1/bench/v0.1.1000066400000000000000000000443271437416732600150700ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 96.2 ns/op BenchmarkLast 20000000 95.8 ns/op BenchmarkEq 20000000 94.4 ns/op BenchmarkSlice 20000000 89.9 ns/op BenchmarkGet 1000000000 2.31 ns/op BenchmarkIndex 1000000 1911 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 50000 56034 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 11.8 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 12.1 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 5000 336823 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 50000 54709 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 209 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 202 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2634 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 50000 31049 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 50000 35167 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 68974 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 74760 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 68670 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 20000 81357 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 68388 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 20000 82108 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 582934 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 241602 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 243612 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.14 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 9848 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 17569 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkAttr 50000000 37.6 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 100000 19345 ns/op BenchmarkLength 2000000000 0.80 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 688 ns/op BenchmarkIs 50000 35061 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 50000 32789 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2816 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 68272 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 68107 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 709386 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 12.4 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 50000 56342 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 10000 131878 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 374240 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 374447 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 200000 9721 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 200000 12909 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 1000000 1869 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 5941 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 46223 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 51452 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 93967 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 97617 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 10000 138898 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 247817 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 246055 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 50000 33201 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 50000 31486 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 50000 31754 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 20000 94749 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 10000 103926 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 50000 33782 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 50000 37108 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 64769 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 71050 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 50000 33908 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 50000 37353 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 50000 31056 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 50000 34286 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 10000 202553 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 20000 98693 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 50000 45532 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 5000 454378 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 10000 123594 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 50000 37509 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 10000 109317 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 10000 105959 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 10000 107132 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 10000 114474 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 10000 107592 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 10000 107495 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 ok github.com/PuerkitoBio/goquery 187.652s goquery-1.8.1/bench/v0.1.1-v0.2.1-go1.1rc1.svg000066400000000000000000000525451437416732600177420ustar00rootroot00000000000000 +0.10% BenchmarkFirst -0.10% BenchmarkLast +2.86% BenchmarkEq +2.67% BenchmarkSlice -10.82% BenchmarkGet -44.06% BenchmarkIndex -52.26% BenchmarkIndexSelector -9.32% BenchmarkIndexOfNode -2.48% BenchmarkIndexOfSelection -34.96% BenchmarkMetalReviewExample -59.16% BenchmarkAdd +0.00% BenchmarkAddSelection +3.47% BenchmarkAddNodes -2.51% BenchmarkAndSelf -13.96% BenchmarkFilter -14.53% BenchmarkNot -3.81% BenchmarkFilterFunction -2.83% BenchmarkNotFunction -4.63% BenchmarkFilterNodes -2.32% BenchmarkNotNodes -4.23% BenchmarkFilterSelection -3.31% BenchmarkNotSelection -33.69% BenchmarkHas -4.53% BenchmarkHasNodes -5.30% BenchmarkHasSelection +11.35% BenchmarkEnd -3.33% BenchmarkEach -9.16% BenchmarkMap -19.15% BenchmarkAttr -3.24% BenchmarkText -61.25% BenchmarkLength -11.92% BenchmarkHtml -16.46% BenchmarkIs -27.31% BenchmarkIsPositional -13.49% BenchmarkIsFunction -1.71% BenchmarkIsSelection -3.03% BenchmarkIsNodes -20.30% BenchmarkHasClass -11.29% BenchmarkContains -50.88% BenchmarkFind -45.28% BenchmarkFindWithinSelection +22.95% BenchmarkFindSelection +22.68% BenchmarkFindNodes -65.08% BenchmarkContents -59.77% BenchmarkContentsFiltered -64.31% BenchmarkChildren -39.56% BenchmarkChildrenFiltered -6.61% BenchmarkParent -10.92% BenchmarkParentFiltered -1.72% BenchmarkParents -2.37% BenchmarkParentsFiltered -47.60% BenchmarkParentsUntil -36.39% BenchmarkParentsUntilSelection -35.99% BenchmarkParentsUntilNodes -48.84% BenchmarkParentsFilteredUntil -32.75% BenchmarkParentsFilteredUntilSelection -33.12% BenchmarkParentsFilteredUntilNodes -29.78% BenchmarkSiblings -30.89% BenchmarkSiblingsFiltered -68.19% BenchmarkNext -66.59% BenchmarkNextFiltered -31.08% BenchmarkNextAll -30.03% BenchmarkNextAllFiltered -68.32% BenchmarkPrev -66.65% BenchmarkPrevFiltered -43.33% BenchmarkPrevAll -43.24% BenchmarkPrevAllFiltered -54.27% BenchmarkNextUntil -37.90% BenchmarkNextUntilSelection -43.21% BenchmarkNextUntilNodes -49.33% BenchmarkPrevUntil -37.02% BenchmarkPrevUntilSelection -44.59% BenchmarkPrevUntilNodes -57.79% BenchmarkNextFilteredUntil -36.61% BenchmarkNextFilteredUntilSelection -37.81% BenchmarkNextFilteredUntilNodes -59.21% BenchmarkPrevFilteredUntil -36.20% BenchmarkPrevFilteredUntilSelection -36.05% BenchmarkPrevFilteredUntilNodes goquery-1.8.1/bench/v0.2.0000066400000000000000000000462101437416732600150610ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 94.3 ns/op BenchmarkLast 20000000 94.7 ns/op BenchmarkEq 20000000 93.7 ns/op BenchmarkSlice 20000000 89.9 ns/op BenchmarkGet 1000000000 2.72 ns/op BenchmarkIndex 1000000 1834 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 50000 53958 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 10.1 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 10.9 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 5000 326712 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 50000 51776 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 196 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 191 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2495 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 50000 30974 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 50000 35322 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 65644 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 69245 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 64824 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 20000 76247 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 66154 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 20000 76336 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 569495 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 227059 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 227167 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 3.99 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 9354 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 16557 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkAttr 50000000 36.4 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 100000 18473 ns/op BenchmarkLength 2000000000 0.76 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 666 ns/op BenchmarkIs 50000 35174 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 50000 31814 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2754 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 66260 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 64682 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 672953 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.3 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 50000 53780 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 10000 125963 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 357318 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 357587 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 200000 9135 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 200000 12383 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 1000000 1809 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 5814 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 44810 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 48795 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 89102 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 93953 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 10000 130783 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 231797 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 233761 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 50000 31360 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 50000 30272 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 50000 30327 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 20000 89862 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 20000 97948 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 50000 31975 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 50000 34887 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 60734 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 67428 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 50000 32399 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 50000 34944 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 29360 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 50000 32291 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 10000 191890 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 20000 92054 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 50000 43401 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 5000 433383 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 10000 116423 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 50000 35338 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 10000 104686 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 20000 99485 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 20000 99452 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 10000 112640 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 10000 103702 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 10000 103277 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 6530 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 1000000 1135 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 1000000 1133 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 192.541s goquery-1.8.1/bench/v0.2.0-v0.2.1-go1.1rc1.svg000066400000000000000000000541161437416732600177360ustar00rootroot00000000000000 +2.12% BenchmarkFirst +1.06% BenchmarkLast +3.63% BenchmarkEq +2.67% BenchmarkSlice -24.26% BenchmarkGet -41.71% BenchmarkIndex -50.42% BenchmarkIndexSelector +5.94% BenchmarkIndexOfNode +8.26% BenchmarkIndexOfSelection -32.94% BenchmarkMetalReviewExample -56.84% BenchmarkAdd +6.63% BenchmarkAddSelection +9.42% BenchmarkAddNodes +2.93% BenchmarkAndSelf -13.75% BenchmarkFilter -14.90% BenchmarkNot +1.07% BenchmarkFilterFunction +4.91% BenchmarkNotFunction +1.03% BenchmarkFilterNodes +4.22% BenchmarkNotNodes -1.00% BenchmarkFilterSelection +4.00% BenchmarkNotSelection -32.12% BenchmarkHas +1.59% BenchmarkHasNodes +1.56% BenchmarkHasSelection +15.54% BenchmarkEnd +1.77% BenchmarkEach -3.61% BenchmarkMap -16.48% BenchmarkAttr +1.33% BenchmarkText -59.21% BenchmarkLength -9.01% BenchmarkHtml -16.73% BenchmarkIs -25.08% BenchmarkIsPositional -11.55% BenchmarkIsFunction +1.28% BenchmarkIsSelection +2.10% BenchmarkIsNodes -15.99% BenchmarkHasClass -2.65% BenchmarkContains -48.54% BenchmarkFind -42.71% BenchmarkFindWithinSelection +28.77% BenchmarkFindSelection +28.47% BenchmarkFindNodes -62.84% BenchmarkContents -58.06% BenchmarkContentsFiltered -63.13% BenchmarkChildren -38.24% BenchmarkChildrenFiltered -3.66% BenchmarkParent -6.06% BenchmarkParentFiltered +3.64% BenchmarkParents +1.44% BenchmarkParentsFiltered -44.35% BenchmarkParentsUntil -31.99% BenchmarkParentsUntilSelection -32.62% BenchmarkParentsUntilNodes -45.83% BenchmarkParentsFilteredUntil -30.05% BenchmarkParentsFilteredUntilSelection -29.97% BenchmarkParentsFilteredUntilNodes -25.96% BenchmarkSiblings -26.67% BenchmarkSiblingsFiltered -66.40% BenchmarkNext -64.46% BenchmarkNextFiltered -26.50% BenchmarkNextAll -26.27% BenchmarkNextAllFiltered -66.84% BenchmarkPrev -64.35% BenchmarkPrevFiltered -40.05% BenchmarkPrevAll -39.74% BenchmarkPrevAllFiltered -51.73% BenchmarkNextUntil -33.42% BenchmarkNextUntilSelection -40.42% BenchmarkNextUntilNodes -46.87% BenchmarkPrevUntil -33.14% BenchmarkPrevUntilSelection -41.19% BenchmarkPrevUntilNodes -55.92% BenchmarkNextFilteredUntil -32.49% BenchmarkNextFilteredUntilSelection -33.00% BenchmarkNextFilteredUntilNodes -58.54% BenchmarkPrevFilteredUntil -33.80% BenchmarkPrevFilteredUntilSelection -33.44% BenchmarkPrevFilteredUntilNodes -24.82% BenchmarkClosest -34.45% BenchmarkClosestSelection -35.30% BenchmarkClosestNodes goquery-1.8.1/bench/v0.2.1-go1.1rc1000066400000000000000000000472501437416732600163200ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 96.3 ns/op BenchmarkLast 20000000 95.7 ns/op BenchmarkEq 20000000 97.1 ns/op BenchmarkSlice 20000000 92.3 ns/op BenchmarkGet 1000000000 2.06 ns/op BenchmarkIndex 1000000 1069 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 100000 26750 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 10.7 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 11.8 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 10000 219078 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 100000 22345 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 209 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 209 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2568 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 100000 26715 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 50000 30058 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 66346 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 72646 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 65493 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 20000 79466 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 65494 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 20000 79387 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 386571 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 230664 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 230705 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.61 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 9520 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 15960 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkAttr 50000000 30.4 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 100000 18718 ns/op BenchmarkLength 2000000000 0.31 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 606 ns/op BenchmarkIs 100000 29289 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 100000 23834 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2436 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 67106 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 66042 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 565347 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.0 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 100000 27677 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 50000 72162 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 460124 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 459390 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 500000 3395 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 500000 5193 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 5000000 667 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 3591 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 43168 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 45836 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 92348 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 95306 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 50000 72782 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 157639 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 157510 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 100000 16987 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 100000 21174 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 100000 21238 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 50000 66536 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 50000 71822 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 200000 10745 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 200000 12399 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 44640 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 49713 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 200000 10743 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 200000 12456 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 17600 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 100000 19460 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 20000 92630 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 50000 61285 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 100000 25859 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 10000 230236 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 20000 77837 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 100000 20784 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 50000 46147 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 50000 67164 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 50000 66628 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 50000 46697 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 50000 68646 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 50000 68745 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 4909 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 5000000 744 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 5000000 733 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 220.793s goquery-1.8.1/bench/v0.3.0000066400000000000000000000476171437416732600150760ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 95.5 ns/op BenchmarkLast 20000000 94.9 ns/op BenchmarkEq 20000000 95.7 ns/op BenchmarkSlice 20000000 91.7 ns/op BenchmarkGet 1000000000 2.05 ns/op BenchmarkIndex 1000000 1079 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 100000 26972 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 10.8 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 11.7 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 10000 213800 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 100000 21811 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 205 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 202 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2467 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 100000 25643 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 100000 29566 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 66894 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 72183 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 65516 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 20000 78880 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 65232 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 20000 78813 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 388834 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 228552 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 228365 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.62 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 9548 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 15900 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkEachWithBreak 1000000 1650 ns/op --- BENCH: BenchmarkEachWithBreak bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 BenchmarkAttr 50000000 30.5 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 100000 18873 ns/op BenchmarkLength 2000000000 0.31 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 616 ns/op BenchmarkIs 100000 29499 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 100000 23733 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2404 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 65376 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 65322 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 558933 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.1 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 100000 27841 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 50000 72096 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 457349 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 459324 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 500000 3435 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 500000 5241 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 5000000 667 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 3639 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 44867 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 46476 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 92559 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 96142 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 50000 73931 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 159820 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 158811 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 100000 17203 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 100000 21358 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 100000 21338 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 50000 66463 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 50000 72503 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 200000 10881 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 200000 12588 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 45075 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 50455 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 200000 10933 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 200000 12579 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 17751 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 100000 19702 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 20000 93586 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 50000 61155 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 100000 25805 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 10000 232225 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 20000 78316 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 100000 20657 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 50000 46567 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 50000 67227 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 50000 66995 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 50000 47361 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 50000 68802 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 50000 68928 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 4922 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 5000000 738 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 5000000 737 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 224.003s goquery-1.8.1/bench/v0.3.2-go1.2000066400000000000000000000477301437416732600157200ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 88.4 ns/op BenchmarkLast 20000000 88.2 ns/op BenchmarkEq 20000000 87.4 ns/op BenchmarkSlice 20000000 84.9 ns/op BenchmarkGet 2000000000 1.99 ns/op BenchmarkIndex 2000000 906 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 100000 22276 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 200000000 9.72 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 10.4 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 10000 199277 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 100000 18277 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 200 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 189 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2569 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 100000 25195 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 100000 29003 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 60690 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 66008 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 59723 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 50000 72698 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 59598 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 50000 72526 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 367076 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 219710 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 219105 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.58 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 8615 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 200000 14271 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkEachWithBreak 1000000 1497 ns/op --- BENCH: BenchmarkEachWithBreak bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 BenchmarkAttr 50000000 30.9 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 200000 13729 ns/op BenchmarkLength 2000000000 0.31 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 537 ns/op BenchmarkIs 100000 28904 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 100000 23556 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2195 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 60100 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 59962 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 388679 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.0 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 100000 22779 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 50000 62033 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 446918 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 441753 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 1000000 2807 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 500000 4477 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 5000000 548 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 3304 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 38248 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 40677 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 83043 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 85391 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 50000 65118 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 144028 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 146713 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 100000 15113 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 100000 18881 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 100000 18926 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 50000 63221 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 50000 69028 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 200000 9133 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 200000 10601 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 43089 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 47867 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 200000 9104 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 200000 10579 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 15185 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 100000 17108 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 20000 81087 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 50000 55831 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 100000 23130 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 10000 204673 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 50000 70965 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 100000 18591 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 50000 42004 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 50000 61953 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 50000 62124 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 50000 42861 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 50000 62451 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 50000 62631 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 4684 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 5000000 622 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 5000000 617 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 218.724s goquery-1.8.1/bench/v0.3.2-go1.2-take2000066400000000000000000000476601437416732600167260ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 88.3 ns/op BenchmarkLast 20000000 88.9 ns/op BenchmarkEq 20000000 86.7 ns/op BenchmarkSlice 20000000 84.1 ns/op BenchmarkGet 2000000000 1.99 ns/op BenchmarkIndex 2000000 907 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 200000 13052 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 10.5 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 11.6 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 10000 189556 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 200000 13714 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 200 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 186 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2532 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 100000 25199 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 100000 29162 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 60733 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 66124 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 59489 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 50000 73623 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 60053 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 50000 73477 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 364859 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 226980 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 220471 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.64 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 8811 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 100000 15365 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkEachWithBreak 1000000 1559 ns/op --- BENCH: BenchmarkEachWithBreak bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 BenchmarkAttr 50000000 31.7 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 200000 13901 ns/op BenchmarkLength 2000000000 0.31 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 541 ns/op BenchmarkIs 100000 29435 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 100000 22938 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2185 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 60607 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 61599 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 395436 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.0 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 200000 13788 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 50000 54253 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 438879 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 437225 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 1000000 2844 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 500000 4528 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 5000000 552 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 3345 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 39482 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 42113 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 84136 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 86041 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 50000 65844 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 146903 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 146638 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 100000 16413 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 100000 20366 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 100000 18800 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 50000 63443 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 50000 69250 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 200000 9193 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 200000 10767 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 42829 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 48174 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 200000 9114 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 200000 11114 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 16387 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 100000 18322 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 20000 83828 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 50000 58822 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 100000 23173 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 10000 219407 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 20000 76033 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 100000 19417 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 50000 44648 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 50000 62751 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 50000 62035 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 50000 43331 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 50000 64767 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 50000 67808 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 4870 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 5000000 656 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 5000000 663 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 218.007s goquery-1.8.1/bench/v0.3.2-go1.2rc1000066400000000000000000000476601437416732600163300ustar00rootroot00000000000000PASS BenchmarkFirst 20000000 91.0 ns/op BenchmarkLast 20000000 90.5 ns/op BenchmarkEq 20000000 90.2 ns/op BenchmarkSlice 20000000 88.0 ns/op BenchmarkGet 1000000000 2.04 ns/op BenchmarkIndex 2000000 935 ns/op --- BENCH: BenchmarkIndex bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 bench_array_test.go:73: Index=3 BenchmarkIndexSelector 100000 23613 ns/op --- BENCH: BenchmarkIndexSelector bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 bench_array_test.go:85: IndexSelector=4 BenchmarkIndexOfNode 100000000 10.2 ns/op --- BENCH: BenchmarkIndexOfNode bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 bench_array_test.go:99: IndexOfNode=2 BenchmarkIndexOfSelection 100000000 11.0 ns/op --- BENCH: BenchmarkIndexOfSelection bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 bench_array_test.go:111: IndexOfSelection=2 BenchmarkMetalReviewExample 10000 213843 ns/op --- BENCH: BenchmarkMetalReviewExample bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). bench_example_test.go:41: MetalReviewExample=10 bench_example_test.go:40: Review 0: Midnight - Complete and Total Hell (8.5). Review 1: Over Your Threshold - Facticity (6.0). Review 2: Nuclear Death Terror - Chaos Reigns (7.5). Review 3: Evoken - Atra Mors (9.5). ... [output truncated] BenchmarkAdd 100000 18671 ns/op --- BENCH: BenchmarkAdd bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 bench_expand_test.go:20: Add=43 BenchmarkAddSelection 10000000 204 ns/op --- BENCH: BenchmarkAddSelection bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 bench_expand_test.go:37: AddSelection=43 BenchmarkAddNodes 10000000 195 ns/op --- BENCH: BenchmarkAddNodes bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 bench_expand_test.go:55: AddNodes=43 BenchmarkAndSelf 1000000 2611 ns/op --- BENCH: BenchmarkAndSelf bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 bench_expand_test.go:71: AndSelf=44 BenchmarkFilter 100000 27571 ns/op --- BENCH: BenchmarkFilter bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 bench_filter_test.go:20: Filter=13 BenchmarkNot 50000 32006 ns/op --- BENCH: BenchmarkNot bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 bench_filter_test.go:36: Not=371 BenchmarkFilterFunction 50000 61388 ns/op --- BENCH: BenchmarkFilterFunction bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 bench_filter_test.go:55: FilterFunction=112 BenchmarkNotFunction 50000 66702 ns/op --- BENCH: BenchmarkNotFunction bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 bench_filter_test.go:74: NotFunction=261 BenchmarkFilterNodes 50000 59699 ns/op --- BENCH: BenchmarkFilterNodes bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 bench_filter_test.go:92: FilterNodes=2 BenchmarkNotNodes 50000 73248 ns/op --- BENCH: BenchmarkNotNodes bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 bench_filter_test.go:110: NotNodes=360 BenchmarkFilterSelection 50000 59242 ns/op --- BENCH: BenchmarkFilterSelection bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 bench_filter_test.go:127: FilterSelection=2 BenchmarkNotSelection 50000 73211 ns/op --- BENCH: BenchmarkNotSelection bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 bench_filter_test.go:144: NotSelection=360 BenchmarkHas 5000 395087 ns/op --- BENCH: BenchmarkHas bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 bench_filter_test.go:160: Has=13 BenchmarkHasNodes 10000 215849 ns/op --- BENCH: BenchmarkHasNodes bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 bench_filter_test.go:178: HasNodes=15 BenchmarkHasSelection 10000 215612 ns/op --- BENCH: BenchmarkHasSelection bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 bench_filter_test.go:195: HasSelection=15 BenchmarkEnd 500000000 4.59 ns/op --- BENCH: BenchmarkEnd bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 bench_filter_test.go:211: End=373 BenchmarkEach 200000 8588 ns/op --- BENCH: BenchmarkEach bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 bench_iteration_test.go:22: Each=59 BenchmarkMap 200000 14444 ns/op --- BENCH: BenchmarkMap bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 bench_iteration_test.go:41: Map=59 BenchmarkEachWithBreak 1000000 1490 ns/op --- BENCH: BenchmarkEachWithBreak bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 bench_iteration_test.go:61: Each=10 BenchmarkAttr 50000000 30.9 ns/op --- BENCH: BenchmarkAttr bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading bench_property_test.go:16: Attr=firstHeading BenchmarkText 200000 14017 ns/op BenchmarkLength 2000000000 0.31 ns/op --- BENCH: BenchmarkLength bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 bench_property_test.go:37: Length=14 BenchmarkHtml 5000000 577 ns/op BenchmarkIs 50000 31936 ns/op --- BENCH: BenchmarkIs bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true bench_query_test.go:16: Is=true BenchmarkIsPositional 100000 23372 ns/op --- BENCH: BenchmarkIsPositional bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true bench_query_test.go:28: IsPositional=true BenchmarkIsFunction 1000000 2170 ns/op --- BENCH: BenchmarkIsFunction bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true bench_query_test.go:43: IsFunction=true BenchmarkIsSelection 50000 59814 ns/op --- BENCH: BenchmarkIsSelection bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true bench_query_test.go:56: IsSelection=true BenchmarkIsNodes 50000 59629 ns/op --- BENCH: BenchmarkIsNodes bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true bench_query_test.go:70: IsNodes=true BenchmarkHasClass 5000 384894 ns/op --- BENCH: BenchmarkHasClass bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true bench_query_test.go:82: HasClass=true BenchmarkContains 100000000 11.4 ns/op --- BENCH: BenchmarkContains bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true bench_query_test.go:96: Contains=true BenchmarkFind 100000 23545 ns/op --- BENCH: BenchmarkFind bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 bench_traversal_test.go:18: Find=41 BenchmarkFindWithinSelection 50000 63775 ns/op --- BENCH: BenchmarkFindWithinSelection bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 bench_traversal_test.go:34: FindWithinSelection=39 BenchmarkFindSelection 5000 441958 ns/op --- BENCH: BenchmarkFindSelection bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 bench_traversal_test.go:51: FindSelection=73 BenchmarkFindNodes 5000 437717 ns/op --- BENCH: BenchmarkFindNodes bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 bench_traversal_test.go:69: FindNodes=73 BenchmarkContents 1000000 2799 ns/op --- BENCH: BenchmarkContents bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 bench_traversal_test.go:85: Contents=16 BenchmarkContentsFiltered 500000 4489 ns/op --- BENCH: BenchmarkContentsFiltered bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 bench_traversal_test.go:101: ContentsFiltered=1 BenchmarkChildren 5000000 546 ns/op --- BENCH: BenchmarkChildren bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 bench_traversal_test.go:117: Children=2 BenchmarkChildrenFiltered 500000 3472 ns/op --- BENCH: BenchmarkChildrenFiltered bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 bench_traversal_test.go:133: ChildrenFiltered=2 BenchmarkParent 50000 39067 ns/op --- BENCH: BenchmarkParent bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 bench_traversal_test.go:149: Parent=55 BenchmarkParentFiltered 50000 41450 ns/op --- BENCH: BenchmarkParentFiltered bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 bench_traversal_test.go:165: ParentFiltered=4 BenchmarkParents 20000 84864 ns/op --- BENCH: BenchmarkParents bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 bench_traversal_test.go:181: Parents=73 BenchmarkParentsFiltered 20000 87823 ns/op --- BENCH: BenchmarkParentsFiltered bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 bench_traversal_test.go:197: ParentsFiltered=18 BenchmarkParentsUntil 50000 65986 ns/op --- BENCH: BenchmarkParentsUntil bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 bench_traversal_test.go:213: ParentsUntil=52 BenchmarkParentsUntilSelection 10000 149798 ns/op --- BENCH: BenchmarkParentsUntilSelection bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 bench_traversal_test.go:230: ParentsUntilSelection=70 BenchmarkParentsUntilNodes 10000 148144 ns/op --- BENCH: BenchmarkParentsUntilNodes bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 bench_traversal_test.go:248: ParentsUntilNodes=70 BenchmarkParentsFilteredUntil 100000 15579 ns/op --- BENCH: BenchmarkParentsFilteredUntil bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 bench_traversal_test.go:264: ParentsFilteredUntil=2 BenchmarkParentsFilteredUntilSelection 100000 19094 ns/op --- BENCH: BenchmarkParentsFilteredUntilSelection bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 bench_traversal_test.go:281: ParentsFilteredUntilSelection=2 BenchmarkParentsFilteredUntilNodes 100000 19037 ns/op --- BENCH: BenchmarkParentsFilteredUntilNodes bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 bench_traversal_test.go:299: ParentsFilteredUntilNodes=2 BenchmarkSiblings 50000 63891 ns/op --- BENCH: BenchmarkSiblings bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 bench_traversal_test.go:315: Siblings=293 BenchmarkSiblingsFiltered 50000 70424 ns/op --- BENCH: BenchmarkSiblingsFiltered bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 bench_traversal_test.go:331: SiblingsFiltered=46 BenchmarkNext 200000 9350 ns/op --- BENCH: BenchmarkNext bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 bench_traversal_test.go:347: Next=49 BenchmarkNextFiltered 200000 10929 ns/op --- BENCH: BenchmarkNextFiltered bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 bench_traversal_test.go:363: NextFiltered=6 BenchmarkNextAll 50000 43398 ns/op --- BENCH: BenchmarkNextAll bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 bench_traversal_test.go:379: NextAll=234 BenchmarkNextAllFiltered 50000 48519 ns/op --- BENCH: BenchmarkNextAllFiltered bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 bench_traversal_test.go:395: NextAllFiltered=33 BenchmarkPrev 200000 9181 ns/op --- BENCH: BenchmarkPrev bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 bench_traversal_test.go:411: Prev=49 BenchmarkPrevFiltered 200000 10811 ns/op --- BENCH: BenchmarkPrevFiltered bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 bench_traversal_test.go:429: PrevFiltered=7 BenchmarkPrevAll 100000 15589 ns/op --- BENCH: BenchmarkPrevAll bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 bench_traversal_test.go:445: PrevAll=78 BenchmarkPrevAllFiltered 100000 17341 ns/op --- BENCH: BenchmarkPrevAllFiltered bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 bench_traversal_test.go:461: PrevAllFiltered=6 BenchmarkNextUntil 20000 80663 ns/op --- BENCH: BenchmarkNextUntil bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 bench_traversal_test.go:477: NextUntil=84 BenchmarkNextUntilSelection 50000 56496 ns/op --- BENCH: BenchmarkNextUntilSelection bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 bench_traversal_test.go:494: NextUntilSelection=42 BenchmarkNextUntilNodes 100000 23729 ns/op --- BENCH: BenchmarkNextUntilNodes bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 bench_traversal_test.go:512: NextUntilNodes=12 BenchmarkPrevUntil 10000 208267 ns/op --- BENCH: BenchmarkPrevUntil bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 bench_traversal_test.go:528: PrevUntil=238 BenchmarkPrevUntilSelection 50000 72119 ns/op --- BENCH: BenchmarkPrevUntilSelection bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 bench_traversal_test.go:545: PrevUntilSelection=49 BenchmarkPrevUntilNodes 100000 18549 ns/op --- BENCH: BenchmarkPrevUntilNodes bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 bench_traversal_test.go:563: PrevUntilNodes=11 BenchmarkNextFilteredUntil 50000 42339 ns/op --- BENCH: BenchmarkNextFilteredUntil bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 bench_traversal_test.go:579: NextFilteredUntil=22 BenchmarkNextFilteredUntilSelection 50000 61916 ns/op --- BENCH: BenchmarkNextFilteredUntilSelection bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 bench_traversal_test.go:596: NextFilteredUntilSelection=22 BenchmarkNextFilteredUntilNodes 50000 62139 ns/op --- BENCH: BenchmarkNextFilteredUntilNodes bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 bench_traversal_test.go:614: NextFilteredUntilNodes=22 BenchmarkPrevFilteredUntil 50000 43409 ns/op --- BENCH: BenchmarkPrevFilteredUntil bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 bench_traversal_test.go:630: PrevFilteredUntil=20 BenchmarkPrevFilteredUntilSelection 50000 63768 ns/op --- BENCH: BenchmarkPrevFilteredUntilSelection bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 bench_traversal_test.go:647: PrevFilteredUntilSelection=20 BenchmarkPrevFilteredUntilNodes 50000 63543 ns/op --- BENCH: BenchmarkPrevFilteredUntilNodes bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 bench_traversal_test.go:665: PrevFilteredUntilNodes=20 BenchmarkClosest 500000 5110 ns/op --- BENCH: BenchmarkClosest bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 bench_traversal_test.go:681: Closest=2 BenchmarkClosestSelection 5000000 629 ns/op --- BENCH: BenchmarkClosestSelection bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 bench_traversal_test.go:698: ClosestSelection=2 BenchmarkClosestNodes 5000000 627 ns/op --- BENCH: BenchmarkClosestNodes bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 bench_traversal_test.go:715: ClosestNodes=2 ok github.com/PuerkitoBio/goquery 215.785s goquery-1.8.1/bench/v1.0.0-go1.7000066400000000000000000000206771437416732600157220ustar00rootroot00000000000000BenchmarkFirst-4 30000000 50.7 ns/op 48 B/op 1 allocs/op BenchmarkLast-4 30000000 50.9 ns/op 48 B/op 1 allocs/op BenchmarkEq-4 30000000 55.7 ns/op 48 B/op 1 allocs/op BenchmarkSlice-4 500000000 3.45 ns/op 0 B/op 0 allocs/op BenchmarkGet-4 2000000000 1.68 ns/op 0 B/op 0 allocs/op BenchmarkIndex-4 3000000 541 ns/op 248 B/op 10 allocs/op BenchmarkIndexSelector-4 200000 10749 ns/op 2464 B/op 17 allocs/op BenchmarkIndexOfNode-4 200000000 6.47 ns/op 0 B/op 0 allocs/op BenchmarkIndexOfSelection-4 200000000 7.27 ns/op 0 B/op 0 allocs/op BenchmarkMetalReviewExample-4 10000 138426 ns/op 12240 B/op 319 allocs/op BenchmarkAdd-4 200000 10192 ns/op 208 B/op 9 allocs/op BenchmarkAddSelection-4 10000000 158 ns/op 48 B/op 1 allocs/op BenchmarkAddNodes-4 10000000 156 ns/op 48 B/op 1 allocs/op BenchmarkAndSelf-4 1000000 1588 ns/op 1008 B/op 5 allocs/op BenchmarkFilter-4 100000 20427 ns/op 360 B/op 8 allocs/op BenchmarkNot-4 100000 23508 ns/op 136 B/op 5 allocs/op BenchmarkFilterFunction-4 50000 34178 ns/op 22976 B/op 755 allocs/op BenchmarkNotFunction-4 50000 38173 ns/op 29120 B/op 757 allocs/op BenchmarkFilterNodes-4 50000 34001 ns/op 20960 B/op 749 allocs/op BenchmarkNotNodes-4 30000 40344 ns/op 29120 B/op 757 allocs/op BenchmarkFilterSelection-4 50000 33308 ns/op 20960 B/op 749 allocs/op BenchmarkNotSelection-4 30000 40748 ns/op 29120 B/op 757 allocs/op BenchmarkHas-4 5000 263346 ns/op 1816 B/op 48 allocs/op BenchmarkHasNodes-4 10000 160840 ns/op 21184 B/op 752 allocs/op BenchmarkHasSelection-4 10000 165410 ns/op 21184 B/op 752 allocs/op BenchmarkEnd-4 2000000000 1.01 ns/op 0 B/op 0 allocs/op BenchmarkEach-4 300000 4664 ns/op 3304 B/op 118 allocs/op BenchmarkMap-4 200000 8286 ns/op 5572 B/op 184 allocs/op BenchmarkEachWithBreak-4 2000000 806 ns/op 560 B/op 20 allocs/op BenchmarkAttr-4 100000000 21.6 ns/op 0 B/op 0 allocs/op BenchmarkText-4 200000 8909 ns/op 7536 B/op 110 allocs/op BenchmarkLength-4 2000000000 0.34 ns/op 0 B/op 0 allocs/op BenchmarkHtml-4 3000000 422 ns/op 120 B/op 2 allocs/op BenchmarkIs-4 100000 22615 ns/op 88 B/op 4 allocs/op BenchmarkIsPositional-4 50000 26655 ns/op 1112 B/op 10 allocs/op BenchmarkIsFunction-4 1000000 1208 ns/op 784 B/op 28 allocs/op BenchmarkIsSelection-4 50000 33497 ns/op 20960 B/op 749 allocs/op BenchmarkIsNodes-4 50000 33572 ns/op 20960 B/op 749 allocs/op BenchmarkHasClass-4 10000 232802 ns/op 14944 B/op 976 allocs/op BenchmarkContains-4 200000000 7.33 ns/op 0 B/op 0 allocs/op BenchmarkFind-4 200000 10715 ns/op 2464 B/op 17 allocs/op BenchmarkFindWithinSelection-4 50000 35878 ns/op 2176 B/op 78 allocs/op BenchmarkFindSelection-4 10000 194356 ns/op 2672 B/op 82 allocs/op BenchmarkFindNodes-4 10000 195510 ns/op 2672 B/op 82 allocs/op BenchmarkContents-4 1000000 2252 ns/op 864 B/op 34 allocs/op BenchmarkContentsFiltered-4 500000 3015 ns/op 1016 B/op 39 allocs/op BenchmarkChildren-4 5000000 364 ns/op 152 B/op 7 allocs/op BenchmarkChildrenFiltered-4 1000000 2212 ns/op 352 B/op 15 allocs/op BenchmarkParent-4 50000 24643 ns/op 4048 B/op 381 allocs/op BenchmarkParentFiltered-4 50000 25967 ns/op 4248 B/op 388 allocs/op BenchmarkParents-4 30000 50000 ns/op 27776 B/op 830 allocs/op BenchmarkParentsFiltered-4 30000 53107 ns/op 28360 B/op 838 allocs/op BenchmarkParentsUntil-4 100000 22423 ns/op 10352 B/op 353 allocs/op BenchmarkParentsUntilSelection-4 20000 86925 ns/op 51144 B/op 1516 allocs/op BenchmarkParentsUntilNodes-4 20000 87597 ns/op 51144 B/op 1516 allocs/op BenchmarkParentsFilteredUntil-4 300000 5568 ns/op 2232 B/op 86 allocs/op BenchmarkParentsFilteredUntilSelection-4 200000 10966 ns/op 5440 B/op 190 allocs/op BenchmarkParentsFilteredUntilNodes-4 200000 10919 ns/op 5440 B/op 190 allocs/op BenchmarkSiblings-4 30000 46018 ns/op 15400 B/op 204 allocs/op BenchmarkSiblingsFiltered-4 30000 50566 ns/op 16496 B/op 213 allocs/op BenchmarkNext-4 200000 7921 ns/op 3216 B/op 112 allocs/op BenchmarkNextFiltered-4 200000 8804 ns/op 3416 B/op 118 allocs/op BenchmarkNextAll-4 50000 31098 ns/op 9912 B/op 138 allocs/op BenchmarkNextAllFiltered-4 50000 34677 ns/op 11008 B/op 147 allocs/op BenchmarkPrev-4 200000 7920 ns/op 3216 B/op 112 allocs/op BenchmarkPrevFiltered-4 200000 8913 ns/op 3416 B/op 118 allocs/op BenchmarkPrevAll-4 200000 10845 ns/op 4376 B/op 113 allocs/op BenchmarkPrevAllFiltered-4 100000 12030 ns/op 4576 B/op 119 allocs/op BenchmarkNextUntil-4 100000 19193 ns/op 5760 B/op 260 allocs/op BenchmarkNextUntilSelection-4 50000 34829 ns/op 18480 B/op 542 allocs/op BenchmarkNextUntilNodes-4 100000 14459 ns/op 7944 B/op 248 allocs/op BenchmarkPrevUntil-4 20000 66296 ns/op 12856 B/op 448 allocs/op BenchmarkPrevUntilSelection-4 30000 45037 ns/op 23432 B/op 689 allocs/op BenchmarkPrevUntilNodes-4 200000 11525 ns/op 6152 B/op 203 allocs/op BenchmarkNextFilteredUntil-4 100000 12940 ns/op 4512 B/op 173 allocs/op BenchmarkNextFilteredUntilSelection-4 50000 38924 ns/op 19160 B/op 567 allocs/op BenchmarkNextFilteredUntilNodes-4 50000 38528 ns/op 19160 B/op 567 allocs/op BenchmarkPrevFilteredUntil-4 100000 12980 ns/op 4664 B/op 175 allocs/op BenchmarkPrevFilteredUntilSelection-4 50000 39671 ns/op 19936 B/op 587 allocs/op BenchmarkPrevFilteredUntilNodes-4 50000 39484 ns/op 19936 B/op 587 allocs/op BenchmarkClosest-4 500000 3310 ns/op 160 B/op 8 allocs/op BenchmarkClosestSelection-4 5000000 361 ns/op 96 B/op 6 allocs/op BenchmarkClosestNodes-4 5000000 359 ns/op 96 B/op 6 allocs/op PASS ok github.com/PuerkitoBio/goquery 163.718s goquery-1.8.1/bench/v1.0.1a-go1.7000066400000000000000000000206771437416732600160640ustar00rootroot00000000000000BenchmarkFirst-4 30000000 50.9 ns/op 48 B/op 1 allocs/op BenchmarkLast-4 30000000 50.0 ns/op 48 B/op 1 allocs/op BenchmarkEq-4 30000000 50.5 ns/op 48 B/op 1 allocs/op BenchmarkSlice-4 500000000 3.53 ns/op 0 B/op 0 allocs/op BenchmarkGet-4 2000000000 1.66 ns/op 0 B/op 0 allocs/op BenchmarkIndex-4 2000000 832 ns/op 248 B/op 10 allocs/op BenchmarkIndexSelector-4 100000 16073 ns/op 3839 B/op 21 allocs/op BenchmarkIndexOfNode-4 200000000 6.38 ns/op 0 B/op 0 allocs/op BenchmarkIndexOfSelection-4 200000000 7.14 ns/op 0 B/op 0 allocs/op BenchmarkMetalReviewExample-4 10000 140737 ns/op 12418 B/op 320 allocs/op BenchmarkAdd-4 100000 13162 ns/op 974 B/op 10 allocs/op BenchmarkAddSelection-4 500000 3160 ns/op 814 B/op 2 allocs/op BenchmarkAddNodes-4 500000 3159 ns/op 814 B/op 2 allocs/op BenchmarkAndSelf-4 200000 7423 ns/op 2404 B/op 9 allocs/op BenchmarkFilter-4 100000 19671 ns/op 360 B/op 8 allocs/op BenchmarkNot-4 100000 22577 ns/op 136 B/op 5 allocs/op BenchmarkFilterFunction-4 50000 33960 ns/op 22976 B/op 755 allocs/op BenchmarkNotFunction-4 50000 37909 ns/op 29120 B/op 757 allocs/op BenchmarkFilterNodes-4 50000 34196 ns/op 20960 B/op 749 allocs/op BenchmarkNotNodes-4 30000 40446 ns/op 29120 B/op 757 allocs/op BenchmarkFilterSelection-4 50000 33091 ns/op 20960 B/op 749 allocs/op BenchmarkNotSelection-4 30000 40609 ns/op 29120 B/op 757 allocs/op BenchmarkHas-4 5000 262936 ns/op 2371 B/op 50 allocs/op BenchmarkHasNodes-4 10000 148631 ns/op 21184 B/op 752 allocs/op BenchmarkHasSelection-4 10000 153117 ns/op 21184 B/op 752 allocs/op BenchmarkEnd-4 2000000000 1.02 ns/op 0 B/op 0 allocs/op BenchmarkEach-4 300000 4653 ns/op 3304 B/op 118 allocs/op BenchmarkMap-4 200000 8257 ns/op 5572 B/op 184 allocs/op BenchmarkEachWithBreak-4 2000000 806 ns/op 560 B/op 20 allocs/op BenchmarkAttr-4 100000000 22.0 ns/op 0 B/op 0 allocs/op BenchmarkText-4 200000 8913 ns/op 7536 B/op 110 allocs/op BenchmarkLength-4 2000000000 0.35 ns/op 0 B/op 0 allocs/op BenchmarkHtml-4 5000000 398 ns/op 120 B/op 2 allocs/op BenchmarkIs-4 100000 22392 ns/op 88 B/op 4 allocs/op BenchmarkIsPositional-4 50000 26259 ns/op 1112 B/op 10 allocs/op BenchmarkIsFunction-4 1000000 1212 ns/op 784 B/op 28 allocs/op BenchmarkIsSelection-4 50000 33222 ns/op 20960 B/op 749 allocs/op BenchmarkIsNodes-4 50000 33408 ns/op 20960 B/op 749 allocs/op BenchmarkHasClass-4 10000 233208 ns/op 14944 B/op 976 allocs/op BenchmarkContains-4 200000000 7.57 ns/op 0 B/op 0 allocs/op BenchmarkFind-4 100000 16121 ns/op 3839 B/op 21 allocs/op BenchmarkFindWithinSelection-4 20000 68019 ns/op 11521 B/op 97 allocs/op BenchmarkFindSelection-4 5000 387582 ns/op 59787 B/op 176 allocs/op BenchmarkFindNodes-4 5000 389246 ns/op 59797 B/op 176 allocs/op BenchmarkContents-4 200000 11475 ns/op 2878 B/op 42 allocs/op BenchmarkContentsFiltered-4 200000 11222 ns/op 2498 B/op 46 allocs/op BenchmarkChildren-4 2000000 650 ns/op 152 B/op 7 allocs/op BenchmarkChildrenFiltered-4 500000 2568 ns/op 352 B/op 15 allocs/op BenchmarkParent-4 2000 702513 ns/op 194478 B/op 828 allocs/op BenchmarkParentFiltered-4 2000 690778 ns/op 194658 B/op 835 allocs/op BenchmarkParents-4 10000 124855 ns/op 49869 B/op 868 allocs/op BenchmarkParentsFiltered-4 10000 128535 ns/op 50456 B/op 876 allocs/op BenchmarkParentsUntil-4 20000 72982 ns/op 23802 B/op 388 allocs/op BenchmarkParentsUntilSelection-4 10000 156099 ns/op 72453 B/op 1549 allocs/op BenchmarkParentsUntilNodes-4 10000 156610 ns/op 72455 B/op 1549 allocs/op BenchmarkParentsFilteredUntil-4 100000 15549 ns/op 4068 B/op 94 allocs/op BenchmarkParentsFilteredUntilSelection-4 100000 20564 ns/op 7276 B/op 198 allocs/op BenchmarkParentsFilteredUntilNodes-4 100000 20635 ns/op 7276 B/op 198 allocs/op BenchmarkSiblings-4 3000 565114 ns/op 205910 B/op 336 allocs/op BenchmarkSiblingsFiltered-4 3000 580264 ns/op 206993 B/op 345 allocs/op BenchmarkNext-4 20000 93177 ns/op 26810 B/op 169 allocs/op BenchmarkNextFiltered-4 20000 94171 ns/op 27013 B/op 175 allocs/op BenchmarkNextAll-4 5000 270320 ns/op 89289 B/op 237 allocs/op BenchmarkNextAllFiltered-4 5000 275283 ns/op 90375 B/op 246 allocs/op BenchmarkPrev-4 20000 92777 ns/op 26810 B/op 169 allocs/op BenchmarkPrevFiltered-4 20000 95577 ns/op 27007 B/op 175 allocs/op BenchmarkPrevAll-4 20000 86339 ns/op 27515 B/op 151 allocs/op BenchmarkPrevAllFiltered-4 20000 87759 ns/op 27715 B/op 157 allocs/op BenchmarkNextUntil-4 10000 163930 ns/op 48541 B/op 330 allocs/op BenchmarkNextUntilSelection-4 30000 56382 ns/op 23880 B/op 556 allocs/op BenchmarkNextUntilNodes-4 100000 18883 ns/op 8703 B/op 252 allocs/op BenchmarkPrevUntil-4 3000 484668 ns/op 145402 B/op 611 allocs/op BenchmarkPrevUntilSelection-4 20000 72125 ns/op 28865 B/op 705 allocs/op BenchmarkPrevUntilNodes-4 100000 14722 ns/op 6510 B/op 205 allocs/op BenchmarkNextFilteredUntil-4 50000 39006 ns/op 10990 B/op 192 allocs/op BenchmarkNextFilteredUntilSelection-4 20000 66048 ns/op 25641 B/op 586 allocs/op BenchmarkNextFilteredUntilNodes-4 20000 65314 ns/op 25640 B/op 586 allocs/op BenchmarkPrevFilteredUntil-4 50000 33312 ns/op 9709 B/op 189 allocs/op BenchmarkPrevFilteredUntilSelection-4 20000 64197 ns/op 24981 B/op 601 allocs/op BenchmarkPrevFilteredUntilNodes-4 20000 64505 ns/op 24982 B/op 601 allocs/op BenchmarkClosest-4 500000 4065 ns/op 160 B/op 8 allocs/op BenchmarkClosestSelection-4 2000000 756 ns/op 96 B/op 6 allocs/op BenchmarkClosestNodes-4 2000000 753 ns/op 96 B/op 6 allocs/op PASS ok github.com/PuerkitoBio/goquery 162.053s goquery-1.8.1/bench/v1.0.1b-go1.7000066400000000000000000000206771437416732600160650ustar00rootroot00000000000000BenchmarkFirst-4 30000000 51.8 ns/op 48 B/op 1 allocs/op BenchmarkLast-4 30000000 50.1 ns/op 48 B/op 1 allocs/op BenchmarkEq-4 30000000 51.4 ns/op 48 B/op 1 allocs/op BenchmarkSlice-4 500000000 3.52 ns/op 0 B/op 0 allocs/op BenchmarkGet-4 2000000000 1.65 ns/op 0 B/op 0 allocs/op BenchmarkIndex-4 2000000 787 ns/op 248 B/op 10 allocs/op BenchmarkIndexSelector-4 100000 16952 ns/op 3839 B/op 21 allocs/op BenchmarkIndexOfNode-4 200000000 6.42 ns/op 0 B/op 0 allocs/op BenchmarkIndexOfSelection-4 200000000 7.12 ns/op 0 B/op 0 allocs/op BenchmarkMetalReviewExample-4 10000 141994 ns/op 12418 B/op 320 allocs/op BenchmarkAdd-4 200000 10367 ns/op 208 B/op 9 allocs/op BenchmarkAddSelection-4 10000000 152 ns/op 48 B/op 1 allocs/op BenchmarkAddNodes-4 10000000 147 ns/op 48 B/op 1 allocs/op BenchmarkAndSelf-4 1000000 1647 ns/op 1008 B/op 5 allocs/op BenchmarkFilter-4 100000 19522 ns/op 360 B/op 8 allocs/op BenchmarkNot-4 100000 22546 ns/op 136 B/op 5 allocs/op BenchmarkFilterFunction-4 50000 35087 ns/op 22976 B/op 755 allocs/op BenchmarkNotFunction-4 50000 39123 ns/op 29120 B/op 757 allocs/op BenchmarkFilterNodes-4 50000 34890 ns/op 20960 B/op 749 allocs/op BenchmarkNotNodes-4 30000 41145 ns/op 29120 B/op 757 allocs/op BenchmarkFilterSelection-4 50000 33735 ns/op 20960 B/op 749 allocs/op BenchmarkNotSelection-4 30000 41334 ns/op 29120 B/op 757 allocs/op BenchmarkHas-4 5000 264058 ns/op 2370 B/op 50 allocs/op BenchmarkHasNodes-4 10000 151718 ns/op 21184 B/op 752 allocs/op BenchmarkHasSelection-4 10000 156955 ns/op 21184 B/op 752 allocs/op BenchmarkEnd-4 2000000000 1.01 ns/op 0 B/op 0 allocs/op BenchmarkEach-4 300000 4660 ns/op 3304 B/op 118 allocs/op BenchmarkMap-4 200000 8404 ns/op 5572 B/op 184 allocs/op BenchmarkEachWithBreak-4 2000000 806 ns/op 560 B/op 20 allocs/op BenchmarkAttr-4 100000000 21.6 ns/op 0 B/op 0 allocs/op BenchmarkText-4 200000 8911 ns/op 7536 B/op 110 allocs/op BenchmarkLength-4 2000000000 0.34 ns/op 0 B/op 0 allocs/op BenchmarkHtml-4 3000000 405 ns/op 120 B/op 2 allocs/op BenchmarkIs-4 100000 22228 ns/op 88 B/op 4 allocs/op BenchmarkIsPositional-4 50000 26469 ns/op 1112 B/op 10 allocs/op BenchmarkIsFunction-4 1000000 1240 ns/op 784 B/op 28 allocs/op BenchmarkIsSelection-4 50000 33709 ns/op 20960 B/op 749 allocs/op BenchmarkIsNodes-4 50000 33711 ns/op 20960 B/op 749 allocs/op BenchmarkHasClass-4 10000 236005 ns/op 14944 B/op 976 allocs/op BenchmarkContains-4 200000000 7.47 ns/op 0 B/op 0 allocs/op BenchmarkFind-4 100000 16075 ns/op 3839 B/op 21 allocs/op BenchmarkFindWithinSelection-4 30000 41418 ns/op 3539 B/op 82 allocs/op BenchmarkFindSelection-4 10000 209490 ns/op 5616 B/op 89 allocs/op BenchmarkFindNodes-4 10000 208206 ns/op 5614 B/op 89 allocs/op BenchmarkContents-4 300000 4751 ns/op 1420 B/op 36 allocs/op BenchmarkContentsFiltered-4 300000 5454 ns/op 1570 B/op 41 allocs/op BenchmarkChildren-4 3000000 527 ns/op 152 B/op 7 allocs/op BenchmarkChildrenFiltered-4 1000000 2484 ns/op 352 B/op 15 allocs/op BenchmarkParent-4 50000 34724 ns/op 6940 B/op 387 allocs/op BenchmarkParentFiltered-4 50000 35596 ns/op 7141 B/op 394 allocs/op BenchmarkParents-4 20000 62094 ns/op 30720 B/op 837 allocs/op BenchmarkParentsFiltered-4 20000 63223 ns/op 31304 B/op 845 allocs/op BenchmarkParentsUntil-4 50000 30391 ns/op 11828 B/op 358 allocs/op BenchmarkParentsUntilSelection-4 20000 99962 ns/op 54075 B/op 1523 allocs/op BenchmarkParentsUntilNodes-4 20000 98763 ns/op 54073 B/op 1523 allocs/op BenchmarkParentsFilteredUntil-4 200000 7982 ns/op 2787 B/op 88 allocs/op BenchmarkParentsFilteredUntilSelection-4 100000 13618 ns/op 5995 B/op 192 allocs/op BenchmarkParentsFilteredUntilNodes-4 100000 13639 ns/op 5994 B/op 192 allocs/op BenchmarkSiblings-4 20000 75287 ns/op 28453 B/op 225 allocs/op BenchmarkSiblingsFiltered-4 20000 80139 ns/op 29543 B/op 234 allocs/op BenchmarkNext-4 100000 14270 ns/op 4659 B/op 117 allocs/op BenchmarkNextFiltered-4 100000 15352 ns/op 4860 B/op 123 allocs/op BenchmarkNextAll-4 20000 60811 ns/op 22771 B/op 157 allocs/op BenchmarkNextAllFiltered-4 20000 69079 ns/op 23871 B/op 166 allocs/op BenchmarkPrev-4 100000 14417 ns/op 4659 B/op 117 allocs/op BenchmarkPrevFiltered-4 100000 15443 ns/op 4859 B/op 123 allocs/op BenchmarkPrevAll-4 100000 22008 ns/op 7346 B/op 120 allocs/op BenchmarkPrevAllFiltered-4 100000 23212 ns/op 7544 B/op 126 allocs/op BenchmarkNextUntil-4 50000 30589 ns/op 8767 B/op 267 allocs/op BenchmarkNextUntilSelection-4 30000 40875 ns/op 19862 B/op 546 allocs/op BenchmarkNextUntilNodes-4 100000 15987 ns/op 8134 B/op 249 allocs/op BenchmarkPrevUntil-4 20000 98799 ns/op 25727 B/op 467 allocs/op BenchmarkPrevUntilSelection-4 30000 51874 ns/op 24875 B/op 694 allocs/op BenchmarkPrevUntilNodes-4 100000 12901 ns/op 6334 B/op 204 allocs/op BenchmarkNextFilteredUntil-4 100000 19869 ns/op 5909 B/op 177 allocs/op BenchmarkNextFilteredUntilSelection-4 30000 45412 ns/op 20557 B/op 571 allocs/op BenchmarkNextFilteredUntilNodes-4 30000 45363 ns/op 20557 B/op 571 allocs/op BenchmarkPrevFilteredUntil-4 100000 19357 ns/op 6033 B/op 179 allocs/op BenchmarkPrevFilteredUntilSelection-4 30000 46396 ns/op 21305 B/op 591 allocs/op BenchmarkPrevFilteredUntilNodes-4 30000 46133 ns/op 21305 B/op 591 allocs/op BenchmarkClosest-4 500000 3448 ns/op 160 B/op 8 allocs/op BenchmarkClosestSelection-4 3000000 528 ns/op 96 B/op 6 allocs/op BenchmarkClosestNodes-4 3000000 523 ns/op 96 B/op 6 allocs/op PASS ok github.com/PuerkitoBio/goquery 162.012s goquery-1.8.1/bench/v1.0.1c-go1.7000066400000000000000000000210461437416732600160550ustar00rootroot00000000000000BenchmarkFirst-4 30000000 51.7 ns/op 48 B/op 1 allocs/op BenchmarkLast-4 30000000 51.9 ns/op 48 B/op 1 allocs/op BenchmarkEq-4 30000000 50.0 ns/op 48 B/op 1 allocs/op BenchmarkSlice-4 500000000 3.47 ns/op 0 B/op 0 allocs/op BenchmarkGet-4 2000000000 1.68 ns/op 0 B/op 0 allocs/op BenchmarkIndex-4 2000000 804 ns/op 248 B/op 10 allocs/op BenchmarkIndexSelector-4 100000 16285 ns/op 3839 B/op 21 allocs/op BenchmarkIndexOfNode-4 200000000 6.50 ns/op 0 B/op 0 allocs/op BenchmarkIndexOfSelection-4 200000000 7.02 ns/op 0 B/op 0 allocs/op BenchmarkMetalReviewExample-4 10000 143160 ns/op 12417 B/op 320 allocs/op BenchmarkAdd-4 200000 10326 ns/op 208 B/op 9 allocs/op BenchmarkAddSelection-4 10000000 155 ns/op 48 B/op 1 allocs/op BenchmarkAddNodes-4 10000000 156 ns/op 48 B/op 1 allocs/op BenchmarkAddNodesBig-4 20000 94439 ns/op 21847 B/op 37 allocs/op BenchmarkAndSelf-4 1000000 1791 ns/op 1008 B/op 5 allocs/op BenchmarkFilter-4 100000 19470 ns/op 360 B/op 8 allocs/op BenchmarkNot-4 100000 22500 ns/op 136 B/op 5 allocs/op BenchmarkFilterFunction-4 50000 34578 ns/op 22976 B/op 755 allocs/op BenchmarkNotFunction-4 50000 38703 ns/op 29120 B/op 757 allocs/op BenchmarkFilterNodes-4 50000 34486 ns/op 20960 B/op 749 allocs/op BenchmarkNotNodes-4 30000 41094 ns/op 29120 B/op 757 allocs/op BenchmarkFilterSelection-4 50000 33623 ns/op 20960 B/op 749 allocs/op BenchmarkNotSelection-4 30000 41483 ns/op 29120 B/op 757 allocs/op BenchmarkHas-4 5000 266628 ns/op 2371 B/op 50 allocs/op BenchmarkHasNodes-4 10000 152617 ns/op 21184 B/op 752 allocs/op BenchmarkHasSelection-4 10000 156682 ns/op 21184 B/op 752 allocs/op BenchmarkEnd-4 2000000000 1.00 ns/op 0 B/op 0 allocs/op BenchmarkEach-4 300000 4712 ns/op 3304 B/op 118 allocs/op BenchmarkMap-4 200000 8434 ns/op 5572 B/op 184 allocs/op BenchmarkEachWithBreak-4 2000000 819 ns/op 560 B/op 20 allocs/op BenchmarkAttr-4 100000000 21.7 ns/op 0 B/op 0 allocs/op BenchmarkText-4 200000 9376 ns/op 7536 B/op 110 allocs/op BenchmarkLength-4 2000000000 0.35 ns/op 0 B/op 0 allocs/op BenchmarkHtml-4 5000000 401 ns/op 120 B/op 2 allocs/op BenchmarkIs-4 100000 22214 ns/op 88 B/op 4 allocs/op BenchmarkIsPositional-4 50000 26559 ns/op 1112 B/op 10 allocs/op BenchmarkIsFunction-4 1000000 1228 ns/op 784 B/op 28 allocs/op BenchmarkIsSelection-4 50000 33471 ns/op 20960 B/op 749 allocs/op BenchmarkIsNodes-4 50000 34461 ns/op 20960 B/op 749 allocs/op BenchmarkHasClass-4 10000 232429 ns/op 14944 B/op 976 allocs/op BenchmarkContains-4 200000000 7.62 ns/op 0 B/op 0 allocs/op BenchmarkFind-4 100000 16114 ns/op 3839 B/op 21 allocs/op BenchmarkFindWithinSelection-4 30000 42520 ns/op 3540 B/op 82 allocs/op BenchmarkFindSelection-4 10000 209801 ns/op 5615 B/op 89 allocs/op BenchmarkFindNodes-4 10000 209082 ns/op 5614 B/op 89 allocs/op BenchmarkContents-4 300000 4836 ns/op 1420 B/op 36 allocs/op BenchmarkContentsFiltered-4 200000 5495 ns/op 1570 B/op 41 allocs/op BenchmarkChildren-4 3000000 527 ns/op 152 B/op 7 allocs/op BenchmarkChildrenFiltered-4 500000 2499 ns/op 352 B/op 15 allocs/op BenchmarkParent-4 50000 34072 ns/op 6942 B/op 387 allocs/op BenchmarkParentFiltered-4 50000 36077 ns/op 7141 B/op 394 allocs/op BenchmarkParents-4 20000 64118 ns/op 30719 B/op 837 allocs/op BenchmarkParentsFiltered-4 20000 63432 ns/op 31303 B/op 845 allocs/op BenchmarkParentsUntil-4 50000 29589 ns/op 11829 B/op 358 allocs/op BenchmarkParentsUntilSelection-4 10000 101033 ns/op 54076 B/op 1523 allocs/op BenchmarkParentsUntilNodes-4 10000 100584 ns/op 54076 B/op 1523 allocs/op BenchmarkParentsFilteredUntil-4 200000 8061 ns/op 2787 B/op 88 allocs/op BenchmarkParentsFilteredUntilSelection-4 100000 13848 ns/op 5995 B/op 192 allocs/op BenchmarkParentsFilteredUntilNodes-4 100000 13766 ns/op 5995 B/op 192 allocs/op BenchmarkSiblings-4 20000 75135 ns/op 28453 B/op 225 allocs/op BenchmarkSiblingsFiltered-4 20000 80532 ns/op 29544 B/op 234 allocs/op BenchmarkNext-4 100000 14200 ns/op 4660 B/op 117 allocs/op BenchmarkNextFiltered-4 100000 15284 ns/op 4859 B/op 123 allocs/op BenchmarkNextAll-4 20000 60889 ns/op 22774 B/op 157 allocs/op BenchmarkNextAllFiltered-4 20000 65125 ns/op 23869 B/op 166 allocs/op BenchmarkPrev-4 100000 14448 ns/op 4659 B/op 117 allocs/op BenchmarkPrevFiltered-4 100000 15444 ns/op 4859 B/op 123 allocs/op BenchmarkPrevAll-4 100000 22019 ns/op 7344 B/op 120 allocs/op BenchmarkPrevAllFiltered-4 100000 23307 ns/op 7545 B/op 126 allocs/op BenchmarkNextUntil-4 50000 30287 ns/op 8766 B/op 267 allocs/op BenchmarkNextUntilSelection-4 30000 41476 ns/op 19862 B/op 546 allocs/op BenchmarkNextUntilNodes-4 100000 16106 ns/op 8133 B/op 249 allocs/op BenchmarkPrevUntil-4 20000 98951 ns/op 25728 B/op 467 allocs/op BenchmarkPrevUntilSelection-4 30000 52390 ns/op 24875 B/op 694 allocs/op BenchmarkPrevUntilNodes-4 100000 12986 ns/op 6334 B/op 204 allocs/op BenchmarkNextFilteredUntil-4 100000 19365 ns/op 5908 B/op 177 allocs/op BenchmarkNextFilteredUntilSelection-4 30000 45334 ns/op 20555 B/op 571 allocs/op BenchmarkNextFilteredUntilNodes-4 30000 45292 ns/op 20556 B/op 571 allocs/op BenchmarkPrevFilteredUntil-4 100000 19412 ns/op 6032 B/op 179 allocs/op BenchmarkPrevFilteredUntilSelection-4 30000 46286 ns/op 21304 B/op 591 allocs/op BenchmarkPrevFilteredUntilNodes-4 30000 46554 ns/op 21305 B/op 591 allocs/op BenchmarkClosest-4 500000 3480 ns/op 160 B/op 8 allocs/op BenchmarkClosestSelection-4 2000000 722 ns/op 96 B/op 6 allocs/op BenchmarkClosestNodes-4 2000000 719 ns/op 96 B/op 6 allocs/op PASS ok github.com/PuerkitoBio/goquery 160.565s goquery-1.8.1/bench_array_test.go000066400000000000000000000036021437416732600170750ustar00rootroot00000000000000package goquery import ( "testing" ) func BenchmarkFirst(b *testing.B) { b.StopTimer() sel := DocB().Find("dd") b.StartTimer() for i := 0; i < b.N; i++ { sel.First() } } func BenchmarkLast(b *testing.B) { b.StopTimer() sel := DocB().Find("dd") b.StartTimer() for i := 0; i < b.N; i++ { sel.Last() } } func BenchmarkEq(b *testing.B) { b.StopTimer() sel := DocB().Find("dd") j := 0 b.StartTimer() for i := 0; i < b.N; i++ { sel.Eq(j) if j++; j >= sel.Length() { j = 0 } } } func BenchmarkSlice(b *testing.B) { b.StopTimer() sel := DocB().Find("dd") j := 0 b.StartTimer() for i := 0; i < b.N; i++ { sel.Slice(j, j+4) if j++; j >= (sel.Length() - 4) { j = 0 } } } func BenchmarkGet(b *testing.B) { b.StopTimer() sel := DocB().Find("dd") j := 0 b.StartTimer() for i := 0; i < b.N; i++ { sel.Get(j) if j++; j >= sel.Length() { j = 0 } } } func BenchmarkIndex(b *testing.B) { var j int b.StopTimer() sel := DocB().Find("#Main") b.StartTimer() for i := 0; i < b.N; i++ { j = sel.Index() } if j != 3 { b.Fatalf("want 3, got %d", j) } } func BenchmarkIndexSelector(b *testing.B) { var j int b.StopTimer() sel := DocB().Find("#manual-nav dl dd:nth-child(1)") b.StartTimer() for i := 0; i < b.N; i++ { j = sel.IndexSelector("dd") } if j != 4 { b.Fatalf("want 4, got %d", j) } } func BenchmarkIndexOfNode(b *testing.B) { var j int b.StopTimer() sel := DocB().Find("span a") sel2 := DocB().Find("span a:nth-child(3)") n := sel2.Get(0) b.StartTimer() for i := 0; i < b.N; i++ { j = sel.IndexOfNode(n) } if j != 2 { b.Fatalf("want 2, got %d", j) } } func BenchmarkIndexOfSelection(b *testing.B) { var j int b.StopTimer() sel := DocB().Find("span a") sel2 := DocB().Find("span a:nth-child(3)") b.StartTimer() for i := 0; i < b.N; i++ { j = sel.IndexOfSelection(sel2) } if j != 2 { b.Fatalf("want 2, got %d", j) } } goquery-1.8.1/bench_example_test.go000066400000000000000000000016321437416732600174130ustar00rootroot00000000000000package goquery import ( "bytes" "fmt" "strconv" "testing" ) func BenchmarkMetalReviewExample(b *testing.B) { var n int var buf bytes.Buffer b.StopTimer() doc := loadDoc("metalreview.html") b.StartTimer() for i := 0; i < b.N; i++ { doc.Find(".slider-row:nth-child(1) .slider-item").Each(func(i int, s *Selection) { var band, title string var score float64 var e error n++ // For each item found, get the band, title and score, and print it band = s.Find("strong").Text() title = s.Find("em").Text() if score, e = strconv.ParseFloat(s.Find(".score").Text(), 64); e != nil { // Not a valid float, ignore score if n <= 4 { buf.WriteString(fmt.Sprintf("Review %d: %s - %s.\n", i, band, title)) } } else { // Print all, including score if n <= 4 { buf.WriteString(fmt.Sprintf("Review %d: %s - %s (%2.1f).\n", i, band, title, score)) } } }) } } goquery-1.8.1/bench_expand_test.go000066400000000000000000000032151437416732600172360ustar00rootroot00000000000000package goquery import ( "testing" ) func BenchmarkAdd(b *testing.B) { var n int b.StopTimer() sel := DocB().Find("dd") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Add("h2[title]").Length() } else { sel.Add("h2[title]") } } if n != 43 { b.Fatalf("want 43, got %d", n) } } func BenchmarkAddSelection(b *testing.B) { var n int b.StopTimer() sel := DocB().Find("dd") sel2 := DocB().Find("h2[title]") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.AddSelection(sel2).Length() } else { sel.AddSelection(sel2) } } if n != 43 { b.Fatalf("want 43, got %d", n) } } func BenchmarkAddNodes(b *testing.B) { var n int b.StopTimer() sel := DocB().Find("dd") sel2 := DocB().Find("h2[title]") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.AddNodes(nodes...).Length() } else { sel.AddNodes(nodes...) } } if n != 43 { b.Fatalf("want 43, got %d", n) } } func BenchmarkAddNodesBig(b *testing.B) { var n int doc := DocW() sel := doc.Find("li") // make nodes > 1000 nodes := sel.Nodes nodes = append(nodes, nodes...) nodes = append(nodes, nodes...) sel = doc.Find("xyz") b.ResetTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.AddNodes(nodes...).Length() } else { sel.AddNodes(nodes...) } } if n != 373 { b.Fatalf("want 373, got %d", n) } } func BenchmarkAndSelf(b *testing.B) { var n int b.StopTimer() sel := DocB().Find("dd").Parent() b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.AndSelf().Length() } else { sel.AndSelf() } } if n != 44 { b.Fatalf("want 44, got %d", n) } } goquery-1.8.1/bench_filter_test.go000066400000000000000000000075171437416732600172550ustar00rootroot00000000000000package goquery import ( "testing" ) func BenchmarkFilter(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Filter(".toclevel-1").Length() } else { sel.Filter(".toclevel-1") } } if n != 13 { b.Fatalf("want 13, got %d", n) } } func BenchmarkNot(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Not(".toclevel-2").Length() } else { sel.Filter(".toclevel-2") } } if n != 371 { b.Fatalf("want 371, got %d", n) } } func BenchmarkFilterFunction(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") f := func(i int, s *Selection) bool { return len(s.Get(0).Attr) > 0 } b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.FilterFunction(f).Length() } else { sel.FilterFunction(f) } } if n != 112 { b.Fatalf("want 112, got %d", n) } } func BenchmarkNotFunction(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") f := func(i int, s *Selection) bool { return len(s.Get(0).Attr) > 0 } b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NotFunction(f).Length() } else { sel.NotFunction(f) } } if n != 261 { b.Fatalf("want 261, got %d", n) } } func BenchmarkFilterNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-2") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.FilterNodes(nodes...).Length() } else { sel.FilterNodes(nodes...) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkNotNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-1") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NotNodes(nodes...).Length() } else { sel.NotNodes(nodes...) } } if n != 360 { b.Fatalf("want 360, got %d", n) } } func BenchmarkFilterSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-2") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.FilterSelection(sel2).Length() } else { sel.FilterSelection(sel2) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkNotSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-1") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NotSelection(sel2).Length() } else { sel.NotSelection(sel2) } } if n != 360 { b.Fatalf("want 360, got %d", n) } } func BenchmarkHas(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Has(".editsection").Length() } else { sel.Has(".editsection") } } if n != 13 { b.Fatalf("want 13, got %d", n) } } func BenchmarkHasNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".tocnumber") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.HasNodes(nodes...).Length() } else { sel.HasNodes(nodes...) } } if n != 15 { b.Fatalf("want 15, got %d", n) } } func BenchmarkHasSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".tocnumber") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.HasSelection(sel2).Length() } else { sel.HasSelection(sel2) } } if n != 15 { b.Fatalf("want 15, got %d", n) } } func BenchmarkEnd(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li").Has(".tocnumber") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.End().Length() } else { sel.End() } } if n != 373 { b.Fatalf("want 373, got %d", n) } } goquery-1.8.1/bench_iteration_test.go000066400000000000000000000017201437416732600177540ustar00rootroot00000000000000package goquery import ( "strconv" "testing" ) func BenchmarkEach(b *testing.B) { var tmp, n int b.StopTimer() sel := DocW().Find("td") f := func(i int, s *Selection) { tmp++ } b.StartTimer() for i := 0; i < b.N; i++ { sel.Each(f) if n == 0 { n = tmp } } if n != 59 { b.Fatalf("want 59, got %d", n) } } func BenchmarkMap(b *testing.B) { var tmp, n int b.StopTimer() sel := DocW().Find("td") f := func(i int, s *Selection) string { tmp++ return strconv.Itoa(tmp) } b.StartTimer() for i := 0; i < b.N; i++ { sel.Map(f) if n == 0 { n = tmp } } if n != 59 { b.Fatalf("want 59, got %d", n) } } func BenchmarkEachWithBreak(b *testing.B) { var tmp, n int b.StopTimer() sel := DocW().Find("td") f := func(i int, s *Selection) bool { tmp++ return tmp < 10 } b.StartTimer() for i := 0; i < b.N; i++ { tmp = 0 sel.EachWithBreak(f) if n == 0 { n = tmp } } if n != 10 { b.Fatalf("want 10, got %d", n) } } goquery-1.8.1/bench_property_test.go000066400000000000000000000014021437416732600176370ustar00rootroot00000000000000package goquery import ( "testing" ) func BenchmarkAttr(b *testing.B) { var s string b.StopTimer() sel := DocW().Find("h1") b.StartTimer() for i := 0; i < b.N; i++ { s, _ = sel.Attr("id") } if s != "firstHeading" { b.Fatalf("want firstHeading, got %q", s) } } func BenchmarkText(b *testing.B) { b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { sel.Text() } } func BenchmarkLength(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { n = sel.Length() } if n != 14 { b.Fatalf("want 14, got %d", n) } } func BenchmarkHtml(b *testing.B) { b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { _, _ = sel.Html() } } goquery-1.8.1/bench_query_test.go000066400000000000000000000032661437416732600171320ustar00rootroot00000000000000package goquery import ( "testing" ) func BenchmarkIs(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { y = sel.Is(".toclevel-2") } if !y { b.Fatal("want true") } } func BenchmarkIsPositional(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { y = sel.Is("li:nth-child(2)") } if !y { b.Fatal("want true") } } func BenchmarkIsFunction(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find(".toclevel-1") f := func(i int, s *Selection) bool { return i == 8 } b.StartTimer() for i := 0; i < b.N; i++ { y = sel.IsFunction(f) } if !y { b.Fatal("want true") } } func BenchmarkIsSelection(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-2") b.StartTimer() for i := 0; i < b.N; i++ { y = sel.IsSelection(sel2) } if !y { b.Fatal("want true") } } func BenchmarkIsNodes(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("li") sel2 := DocW().Find(".toclevel-2") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { y = sel.IsNodes(nodes...) } if !y { b.Fatal("want true") } } func BenchmarkHasClass(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("span") b.StartTimer() for i := 0; i < b.N; i++ { y = sel.HasClass("official") } if !y { b.Fatal("want true") } } func BenchmarkContains(b *testing.B) { var y bool b.StopTimer() sel := DocW().Find("span.url") sel2 := DocW().Find("a[rel=\"nofollow\"]") node := sel2.Nodes[0] b.StartTimer() for i := 0; i < b.N; i++ { y = sel.Contains(node) } if !y { b.Fatal("want true") } } goquery-1.8.1/bench_traversal_test.go000066400000000000000000000341531437416732600177670ustar00rootroot00000000000000package goquery import ( "testing" "github.com/andybalholm/cascadia" ) func BenchmarkFind(b *testing.B) { var n int for i := 0; i < b.N; i++ { if n == 0 { n = DocB().Find("dd").Length() } else { DocB().Find("dd") } } if n != 41 { b.Fatalf("want 41, got %d", n) } } func BenchmarkFindWithinSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("ul") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Find("a[class]").Length() } else { sel.Find("a[class]") } } if n != 39 { b.Fatalf("want 39, got %d", n) } } func BenchmarkFindSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("ul") sel2 := DocW().Find("span") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.FindSelection(sel2).Length() } else { sel.FindSelection(sel2) } } if n != 73 { b.Fatalf("want 73, got %d", n) } } func BenchmarkFindNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("ul") sel2 := DocW().Find("span") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.FindNodes(nodes...).Length() } else { sel.FindNodes(nodes...) } } if n != 73 { b.Fatalf("want 73, got %d", n) } } func BenchmarkContents(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-1") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Contents().Length() } else { sel.Contents() } } if n != 16 { b.Fatalf("want 16, got %d", n) } } func BenchmarkContentsFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-1") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ContentsFiltered("a[href=\"#Examples\"]").Length() } else { sel.ContentsFiltered("a[href=\"#Examples\"]") } } if n != 1 { b.Fatalf("want 1, got %d", n) } } func BenchmarkChildren(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-2") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Children().Length() } else { sel.Children() } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkChildrenFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h3") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ChildrenFiltered(".editsection").Length() } else { sel.ChildrenFiltered(".editsection") } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkParent(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Parent().Length() } else { sel.Parent() } } if n != 55 { b.Fatalf("want 55, got %d", n) } } func BenchmarkParentFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentFiltered("ul[id]").Length() } else { sel.ParentFiltered("ul[id]") } } if n != 4 { b.Fatalf("want 4, got %d", n) } } func BenchmarkParents(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("th a") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Parents().Length() } else { sel.Parents() } } if n != 73 { b.Fatalf("want 73, got %d", n) } } func BenchmarkParentsFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("th a") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsFiltered("tr").Length() } else { sel.ParentsFiltered("tr") } } if n != 18 { b.Fatalf("want 18, got %d", n) } } func BenchmarkParentsUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("th a") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsUntil("table").Length() } else { sel.ParentsUntil("table") } } if n != 52 { b.Fatalf("want 52, got %d", n) } } func BenchmarkParentsUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("th a") sel2 := DocW().Find("#content") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsUntilSelection(sel2).Length() } else { sel.ParentsUntilSelection(sel2) } } if n != 70 { b.Fatalf("want 70, got %d", n) } } func BenchmarkParentsUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("th a") sel2 := DocW().Find("#content") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsUntilNodes(nodes...).Length() } else { sel.ParentsUntilNodes(nodes...) } } if n != 70 { b.Fatalf("want 70, got %d", n) } } func BenchmarkParentsFilteredUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-1 a") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsFilteredUntil(":nth-child(1)", "ul").Length() } else { sel.ParentsFilteredUntil(":nth-child(1)", "ul") } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkParentsFilteredUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-1 a") sel2 := DocW().Find("ul") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsFilteredUntilSelection(":nth-child(1)", sel2).Length() } else { sel.ParentsFilteredUntilSelection(":nth-child(1)", sel2) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkParentsFilteredUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find(".toclevel-1 a") sel2 := DocW().Find("ul") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ParentsFilteredUntilNodes(":nth-child(1)", nodes...).Length() } else { sel.ParentsFilteredUntilNodes(":nth-child(1)", nodes...) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkSiblings(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("ul li:nth-child(1)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Siblings().Length() } else { sel.Siblings() } } if n != 293 { b.Fatalf("want 293, got %d", n) } } func BenchmarkSiblingsFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("ul li:nth-child(1)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.SiblingsFiltered("[class]").Length() } else { sel.SiblingsFiltered("[class]") } } if n != 46 { b.Fatalf("want 46, got %d", n) } } func BenchmarkNext(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(1)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Next().Length() } else { sel.Next() } } if n != 49 { b.Fatalf("want 49, got %d", n) } } func BenchmarkNextFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(1)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextFiltered("[class]").Length() } else { sel.NextFiltered("[class]") } } if n != 6 { b.Fatalf("want 6, got %d", n) } } func BenchmarkNextAll(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(3)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextAll().Length() } else { sel.NextAll() } } if n != 234 { b.Fatalf("want 234, got %d", n) } } func BenchmarkNextAllFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(3)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextAllFiltered("[class]").Length() } else { sel.NextAllFiltered("[class]") } } if n != 33 { b.Fatalf("want 33, got %d", n) } } func BenchmarkPrev(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:last-child") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Prev().Length() } else { sel.Prev() } } if n != 49 { b.Fatalf("want 49, got %d", n) } } func BenchmarkPrevFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:last-child") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevFiltered("[class]").Length() } else { sel.PrevFiltered("[class]") } } // There is one more Prev li with a class, compared to Next li with a class // (confirmed by looking at the HTML, this is ok) if n != 7 { b.Fatalf("want 7, got %d", n) } } func BenchmarkPrevAll(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(4)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevAll().Length() } else { sel.PrevAll() } } if n != 78 { b.Fatalf("want 78, got %d", n) } } func BenchmarkPrevAllFiltered(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:nth-child(4)") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevAllFiltered("[class]").Length() } else { sel.PrevAllFiltered("[class]") } } if n != 6 { b.Fatalf("want 6, got %d", n) } } func BenchmarkNextUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:first-child") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextUntil(":nth-child(4)").Length() } else { sel.NextUntil(":nth-child(4)") } } if n != 84 { b.Fatalf("want 84, got %d", n) } } func BenchmarkNextUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("ul") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextUntilSelection(sel2).Length() } else { sel.NextUntilSelection(sel2) } } if n != 42 { b.Fatalf("want 42, got %d", n) } } func BenchmarkNextUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("p") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextUntilNodes(nodes...).Length() } else { sel.NextUntilNodes(nodes...) } } if n != 12 { b.Fatalf("want 12, got %d", n) } } func BenchmarkPrevUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("li:last-child") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevUntil(":nth-child(4)").Length() } else { sel.PrevUntil(":nth-child(4)") } } if n != 238 { b.Fatalf("want 238, got %d", n) } } func BenchmarkPrevUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("ul") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevUntilSelection(sel2).Length() } else { sel.PrevUntilSelection(sel2) } } if n != 49 { b.Fatalf("want 49, got %d", n) } } func BenchmarkPrevUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("p") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevUntilNodes(nodes...).Length() } else { sel.PrevUntilNodes(nodes...) } } if n != 11 { b.Fatalf("want 11, got %d", n) } } func BenchmarkNextFilteredUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextFilteredUntil("p", "div").Length() } else { sel.NextFilteredUntil("p", "div") } } if n != 22 { b.Fatalf("want 22, got %d", n) } } func BenchmarkNextFilteredUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("div") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextFilteredUntilSelection("p", sel2).Length() } else { sel.NextFilteredUntilSelection("p", sel2) } } if n != 22 { b.Fatalf("want 22, got %d", n) } } func BenchmarkNextFilteredUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("div") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.NextFilteredUntilNodes("p", nodes...).Length() } else { sel.NextFilteredUntilNodes("p", nodes...) } } if n != 22 { b.Fatalf("want 22, got %d", n) } } func BenchmarkPrevFilteredUntil(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevFilteredUntil("p", "div").Length() } else { sel.PrevFilteredUntil("p", "div") } } if n != 20 { b.Fatalf("want 20, got %d", n) } } func BenchmarkPrevFilteredUntilSelection(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("div") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevFilteredUntilSelection("p", sel2).Length() } else { sel.PrevFilteredUntilSelection("p", sel2) } } if n != 20 { b.Fatalf("want 20, got %d", n) } } func BenchmarkPrevFilteredUntilNodes(b *testing.B) { var n int b.StopTimer() sel := DocW().Find("h2") sel2 := DocW().Find("div") nodes := sel2.Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.PrevFilteredUntilNodes("p", nodes...).Length() } else { sel.PrevFilteredUntilNodes("p", nodes...) } } if n != 20 { b.Fatalf("want 20, got %d", n) } } func BenchmarkClosest(b *testing.B) { var n int b.StopTimer() sel := Doc().Find(".container-fluid") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.Closest(".pvk-content").Length() } else { sel.Closest(".pvk-content") } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkClosestSelection(b *testing.B) { var n int b.StopTimer() sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".pvk-content") b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ClosestSelection(sel2).Length() } else { sel.ClosestSelection(sel2) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkClosestNodes(b *testing.B) { var n int b.StopTimer() sel := Doc().Find(".container-fluid") nodes := Doc().Find(".pvk-content").Nodes b.StartTimer() for i := 0; i < b.N; i++ { if n == 0 { n = sel.ClosestNodes(nodes...).Length() } else { sel.ClosestNodes(nodes...) } } if n != 2 { b.Fatalf("want 2, got %d", n) } } func BenchmarkSingleMatcher(b *testing.B) { doc := Doc() multi := cascadia.MustCompile(`div`) single := SingleMatcher(multi) b.ResetTimer() b.Run("multi", func(b *testing.B) { for i := 0; i < b.N; i++ { _ = doc.FindMatcher(multi) } }) b.Run("single", func(b *testing.B) { for i := 0; i < b.N; i++ { _ = doc.FindMatcher(single) } }) } goquery-1.8.1/doc.go000066400000000000000000000111431437416732600143250ustar00rootroot00000000000000// Copyright (c) 2012-2016, Martin Angers & Contributors // All rights reserved. // // Redistribution and use in source and binary forms, with or without modification, // are permitted provided that the following conditions are met: // // * Redistributions of source code must retain the above copyright notice, // this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright notice, // this list of conditions and the following disclaimer in the documentation and/or // other materials provided with the distribution. // * Neither the name of the author nor the names of its contributors may be used to // endorse or promote products derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS // OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY // AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, // WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY // WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. /* Package goquery implements features similar to jQuery, including the chainable syntax, to manipulate and query an HTML document. It brings a syntax and a set of features similar to jQuery to the Go language. It is based on Go's net/html package and the CSS Selector library cascadia. Since the net/html parser returns nodes, and not a full-featured DOM tree, jQuery's stateful manipulation functions (like height(), css(), detach()) have been left off. Also, because the net/html parser requires UTF-8 encoding, so does goquery: it is the caller's responsibility to ensure that the source document provides UTF-8 encoded HTML. See the repository's wiki for various options on how to do this. Syntax-wise, it is as close as possible to jQuery, with the same method names when possible, and that warm and fuzzy chainable interface. jQuery being the ultra-popular library that it is, writing a similar HTML-manipulating library was better to follow its API than to start anew (in the same spirit as Go's fmt package), even though some of its methods are less than intuitive (looking at you, index()...). It is hosted on GitHub, along with additional documentation in the README.md file: https://github.com/puerkitobio/goquery Please note that because of the net/html dependency, goquery requires Go1.1+. The various methods are split into files based on the category of behavior. The three dots (...) indicate that various "overloads" are available. * array.go : array-like positional manipulation of the selection. - Eq() - First() - Get() - Index...() - Last() - Slice() * expand.go : methods that expand or augment the selection's set. - Add...() - AndSelf() - Union(), which is an alias for AddSelection() * filter.go : filtering methods, that reduce the selection's set. - End() - Filter...() - Has...() - Intersection(), which is an alias of FilterSelection() - Not...() * iteration.go : methods to loop over the selection's nodes. - Each() - EachWithBreak() - Map() * manipulation.go : methods for modifying the document - After...() - Append...() - Before...() - Clone() - Empty() - Prepend...() - Remove...() - ReplaceWith...() - Unwrap() - Wrap...() - WrapAll...() - WrapInner...() * property.go : methods that inspect and get the node's properties values. - Attr*(), RemoveAttr(), SetAttr() - AddClass(), HasClass(), RemoveClass(), ToggleClass() - Html() - Length() - Size(), which is an alias for Length() - Text() * query.go : methods that query, or reflect, a node's identity. - Contains() - Is...() * traversal.go : methods to traverse the HTML document tree. - Children...() - Contents() - Find...() - Next...() - Parent[s]...() - Prev...() - Siblings...() * type.go : definition of the types exposed by goquery. - Document - Selection - Matcher * utilities.go : definition of helper functions (and not methods on a *Selection) that are not part of jQuery, but are useful to goquery. - NodeName - OuterHtml */ package goquery goquery-1.8.1/doc/000077500000000000000000000000001437416732600137765ustar00rootroot00000000000000goquery-1.8.1/doc/tips.md000066400000000000000000000040371437416732600153030ustar00rootroot00000000000000# Tips and tricks ## Handle Non-UTF8 html Pages The `go.net/html` package used by `goquery` requires that the html document is UTF-8 encoded. When you know the encoding of the html page is not UTF-8, you can use the `iconv` package to convert it to UTF-8 (there are various implementation of the `iconv` API, see [godoc.org][iconv] for other options): ```bash $ go get -u github.com/djimenez/iconv-go ``` and then: ```golang // Load the URL res, err := http.Get(url) if err != nil { // handle error } defer res.Body.Close() // Convert the designated charset HTML to utf-8 encoded HTML. // `charset` being one of the charsets known by the iconv package. utfBody, err := iconv.NewReader(res.Body, charset, "utf-8") if err != nil { // handler error } // use utfBody using goquery doc, err := goquery.NewDocumentFromReader(utfBody) if err != nil { // handler error } // use doc... ``` Thanks to github user @YuheiNakasaka. Actually, the official go.text repository covers this use case too, see its [godoc page][text] for the details. ## Handle Javascript-based Pages `goquery` is great to handle normal html pages, but when most of the page is build dynamically using javascript, there's not much it can do. There are various options when faced with this problem: * Use a headless browser such as [webloop][]. * Use a Go javascript parser package, such as [otto][]. You can find a code example using `otto` [in this gist][exotto]. Thanks to github user @cryptix. ## For Loop If all you need is a normal `for` loop over all nodes in the current selection, where `Map/Each`-style iteration is not necessary, you can use the following: ```golang sel := Doc().Find(".selector") for i := range sel.Nodes { single := sel.Eq(i) // use `single` as a selection of 1 node } ``` Thanks to github user @jmoiron. [webloop]: https://github.com/sourcegraph/webloop [otto]: https://github.com/robertkrimen/otto [exotto]: https://gist.github.com/cryptix/87127f76a94183747b53 [iconv]: http://godoc.org/?q=iconv [text]: https://godoc.org/golang.org/x/text/encoding goquery-1.8.1/example_test.go000066400000000000000000000046031437416732600162550ustar00rootroot00000000000000package goquery_test import ( "fmt" "log" "net/http" "os" "strings" "github.com/PuerkitoBio/goquery" ) // This example scrapes the reviews shown on the home page of metalsucks.net. func Example() { // Request the HTML page. res, err := http.Get("http://metalsucks.net") if err != nil { log.Fatal(err) } defer res.Body.Close() if res.StatusCode != 200 { log.Fatalf("status code error: %d %s", res.StatusCode, res.Status) } // Load the HTML document doc, err := goquery.NewDocumentFromReader(res.Body) if err != nil { log.Fatal(err) } // Find the review items doc.Find(".sidebar-reviews article .content-block").Each(func(i int, s *goquery.Selection) { // For each item found, get the band and title band := s.Find("a").Text() title := s.Find("i").Text() fmt.Printf("Review %d: %s - %s\n", i, band, title) }) // To see the output of the Example while running the test suite (go test), simply // remove the leading "x" before Output on the next line. This will cause the // example to fail (all the "real" tests should pass). // xOutput: voluntarily fail the Example output. } // This example shows how to use NewDocumentFromReader from a file. func ExampleNewDocumentFromReader_file() { // create from a file f, err := os.Open("some/file.html") if err != nil { log.Fatal(err) } defer f.Close() doc, err := goquery.NewDocumentFromReader(f) if err != nil { log.Fatal(err) } // use the goquery document... _ = doc.Find("h1") } // This example shows how to use NewDocumentFromReader from a string. func ExampleNewDocumentFromReader_string() { // create from a string data := ` My document

Header

` doc, err := goquery.NewDocumentFromReader(strings.NewReader(data)) if err != nil { log.Fatal(err) } header := doc.Find("h1").Text() fmt.Println(header) // Output: Header } func ExampleSingle() { html := `
1
2
3
` doc, err := goquery.NewDocumentFromReader(strings.NewReader(html)) if err != nil { log.Fatal(err) } // By default, the selector string selects all matching nodes multiSel := doc.Find("div") fmt.Println(multiSel.Text()) // Using goquery.Single, only the first match is selected singleSel := doc.FindMatcher(goquery.Single("div")) fmt.Println(singleSel.Text()) // Output: // 123 // 1 } goquery-1.8.1/expand.go000066400000000000000000000052761437416732600150510ustar00rootroot00000000000000package goquery import "golang.org/x/net/html" // Add adds the selector string's matching nodes to those in the current // selection and returns a new Selection object. // The selector string is run in the context of the document of the current // Selection object. func (s *Selection) Add(selector string) *Selection { return s.AddNodes(findWithMatcher([]*html.Node{s.document.rootNode}, compileMatcher(selector))...) } // AddMatcher adds the matcher's matching nodes to those in the current // selection and returns a new Selection object. // The matcher is run in the context of the document of the current // Selection object. func (s *Selection) AddMatcher(m Matcher) *Selection { return s.AddNodes(findWithMatcher([]*html.Node{s.document.rootNode}, m)...) } // AddSelection adds the specified Selection object's nodes to those in the // current selection and returns a new Selection object. func (s *Selection) AddSelection(sel *Selection) *Selection { if sel == nil { return s.AddNodes() } return s.AddNodes(sel.Nodes...) } // Union is an alias for AddSelection. func (s *Selection) Union(sel *Selection) *Selection { return s.AddSelection(sel) } // AddNodes adds the specified nodes to those in the // current selection and returns a new Selection object. func (s *Selection) AddNodes(nodes ...*html.Node) *Selection { return pushStack(s, appendWithoutDuplicates(s.Nodes, nodes, nil)) } // AndSelf adds the previous set of elements on the stack to the current set. // It returns a new Selection object containing the current Selection combined // with the previous one. // Deprecated: This function has been deprecated and is now an alias for AddBack(). func (s *Selection) AndSelf() *Selection { return s.AddBack() } // AddBack adds the previous set of elements on the stack to the current set. // It returns a new Selection object containing the current Selection combined // with the previous one. func (s *Selection) AddBack() *Selection { return s.AddSelection(s.prevSel) } // AddBackFiltered reduces the previous set of elements on the stack to those that // match the selector string, and adds them to the current set. // It returns a new Selection object containing the current Selection combined // with the filtered previous one func (s *Selection) AddBackFiltered(selector string) *Selection { return s.AddSelection(s.prevSel.Filter(selector)) } // AddBackMatcher reduces the previous set of elements on the stack to those that match // the mateher, and adds them to the curernt set. // It returns a new Selection object containing the current Selection combined // with the filtered previous one func (s *Selection) AddBackMatcher(m Matcher) *Selection { return s.AddSelection(s.prevSel.FilterMatcher(m)) } goquery-1.8.1/expand_test.go000066400000000000000000000054041437416732600161010ustar00rootroot00000000000000package goquery import ( "testing" ) func TestAdd(t *testing.T) { sel := Doc().Find("div.row-fluid").Add("a") assertLength(t, sel.Nodes, 19) } func TestAddInvalid(t *testing.T) { sel1 := Doc().Find("div.row-fluid") sel2 := sel1.Add("") assertLength(t, sel1.Nodes, 9) assertLength(t, sel2.Nodes, 9) if sel1 == sel2 { t.Errorf("selections should not be the same") } } func TestAddRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Add("a").End() assertEqual(t, sel, sel2) } func TestAddSelection(t *testing.T) { sel := Doc().Find("div.row-fluid") sel2 := Doc().Find("a") sel = sel.AddSelection(sel2) assertLength(t, sel.Nodes, 19) } func TestAddSelectionNil(t *testing.T) { sel := Doc().Find("div.row-fluid") assertLength(t, sel.Nodes, 9) sel = sel.AddSelection(nil) assertLength(t, sel.Nodes, 9) } func TestAddSelectionRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Find("a") sel2 = sel.AddSelection(sel2).End() assertEqual(t, sel, sel2) } func TestAddNodes(t *testing.T) { sel := Doc().Find("div.pvk-gutter") sel2 := Doc().Find(".pvk-content") sel = sel.AddNodes(sel2.Nodes...) assertLength(t, sel.Nodes, 9) } func TestAddNodesNone(t *testing.T) { sel := Doc().Find("div.pvk-gutter").AddNodes() assertLength(t, sel.Nodes, 6) } func TestAddNodesRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Find("a") sel2 = sel.AddNodes(sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestAddNodesBig(t *testing.T) { doc := DocW() sel := doc.Find("li") assertLength(t, sel.Nodes, 373) sel2 := doc.Find("xyz") assertLength(t, sel2.Nodes, 0) nodes := sel.Nodes sel2 = sel2.AddNodes(nodes...) assertLength(t, sel2.Nodes, 373) nodes2 := append(nodes, nodes...) sel2 = sel2.End().AddNodes(nodes2...) assertLength(t, sel2.Nodes, 373) nodes3 := append(nodes2, nodes...) sel2 = sel2.End().AddNodes(nodes3...) assertLength(t, sel2.Nodes, 373) } func TestAndSelf(t *testing.T) { sel := Doc().Find(".span12").Last().AndSelf() assertLength(t, sel.Nodes, 2) } func TestAndSelfRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Find("a").AndSelf().End().End() assertEqual(t, sel, sel2) } func TestAddBack(t *testing.T) { sel := Doc().Find(".span12").Last().AddBack() assertLength(t, sel.Nodes, 2) } func TestAddBackRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Find("a").AddBack().End().End() assertEqual(t, sel, sel2) } func TestAddBackFiltered(t *testing.T) { sel := Doc().Find(".span12, .footer").Find("h1").AddBackFiltered(".footer") assertLength(t, sel.Nodes, 2) } func TestAddBackFilteredRollback(t *testing.T) { sel := Doc().Find(".span12, .footer") sel2 := sel.Find("h1").AddBackFiltered(".footer").End().End() assertEqual(t, sel, sel2) } goquery-1.8.1/filter.go000066400000000000000000000134421437416732600150510ustar00rootroot00000000000000package goquery import "golang.org/x/net/html" // Filter reduces the set of matched elements to those that match the selector string. // It returns a new Selection object for this subset of matching elements. func (s *Selection) Filter(selector string) *Selection { return s.FilterMatcher(compileMatcher(selector)) } // FilterMatcher reduces the set of matched elements to those that match // the given matcher. It returns a new Selection object for this subset // of matching elements. func (s *Selection) FilterMatcher(m Matcher) *Selection { return pushStack(s, winnow(s, m, true)) } // Not removes elements from the Selection that match the selector string. // It returns a new Selection object with the matching elements removed. func (s *Selection) Not(selector string) *Selection { return s.NotMatcher(compileMatcher(selector)) } // NotMatcher removes elements from the Selection that match the given matcher. // It returns a new Selection object with the matching elements removed. func (s *Selection) NotMatcher(m Matcher) *Selection { return pushStack(s, winnow(s, m, false)) } // FilterFunction reduces the set of matched elements to those that pass the function's test. // It returns a new Selection object for this subset of elements. func (s *Selection) FilterFunction(f func(int, *Selection) bool) *Selection { return pushStack(s, winnowFunction(s, f, true)) } // NotFunction removes elements from the Selection that pass the function's test. // It returns a new Selection object with the matching elements removed. func (s *Selection) NotFunction(f func(int, *Selection) bool) *Selection { return pushStack(s, winnowFunction(s, f, false)) } // FilterNodes reduces the set of matched elements to those that match the specified nodes. // It returns a new Selection object for this subset of elements. func (s *Selection) FilterNodes(nodes ...*html.Node) *Selection { return pushStack(s, winnowNodes(s, nodes, true)) } // NotNodes removes elements from the Selection that match the specified nodes. // It returns a new Selection object with the matching elements removed. func (s *Selection) NotNodes(nodes ...*html.Node) *Selection { return pushStack(s, winnowNodes(s, nodes, false)) } // FilterSelection reduces the set of matched elements to those that match a // node in the specified Selection object. // It returns a new Selection object for this subset of elements. func (s *Selection) FilterSelection(sel *Selection) *Selection { if sel == nil { return pushStack(s, winnowNodes(s, nil, true)) } return pushStack(s, winnowNodes(s, sel.Nodes, true)) } // NotSelection removes elements from the Selection that match a node in the specified // Selection object. It returns a new Selection object with the matching elements removed. func (s *Selection) NotSelection(sel *Selection) *Selection { if sel == nil { return pushStack(s, winnowNodes(s, nil, false)) } return pushStack(s, winnowNodes(s, sel.Nodes, false)) } // Intersection is an alias for FilterSelection. func (s *Selection) Intersection(sel *Selection) *Selection { return s.FilterSelection(sel) } // Has reduces the set of matched elements to those that have a descendant // that matches the selector. // It returns a new Selection object with the matching elements. func (s *Selection) Has(selector string) *Selection { return s.HasSelection(s.document.Find(selector)) } // HasMatcher reduces the set of matched elements to those that have a descendant // that matches the matcher. // It returns a new Selection object with the matching elements. func (s *Selection) HasMatcher(m Matcher) *Selection { return s.HasSelection(s.document.FindMatcher(m)) } // HasNodes reduces the set of matched elements to those that have a // descendant that matches one of the nodes. // It returns a new Selection object with the matching elements. func (s *Selection) HasNodes(nodes ...*html.Node) *Selection { return s.FilterFunction(func(_ int, sel *Selection) bool { // Add all nodes that contain one of the specified nodes for _, n := range nodes { if sel.Contains(n) { return true } } return false }) } // HasSelection reduces the set of matched elements to those that have a // descendant that matches one of the nodes of the specified Selection object. // It returns a new Selection object with the matching elements. func (s *Selection) HasSelection(sel *Selection) *Selection { if sel == nil { return s.HasNodes() } return s.HasNodes(sel.Nodes...) } // End ends the most recent filtering operation in the current chain and // returns the set of matched elements to its previous state. func (s *Selection) End() *Selection { if s.prevSel != nil { return s.prevSel } return newEmptySelection(s.document) } // Filter based on the matcher, and the indicator to keep (Filter) or // to get rid of (Not) the matching elements. func winnow(sel *Selection, m Matcher, keep bool) []*html.Node { // Optimize if keep is requested if keep { return m.Filter(sel.Nodes) } // Use grep return grep(sel, func(i int, s *Selection) bool { return !m.Match(s.Get(0)) }) } // Filter based on an array of nodes, and the indicator to keep (Filter) or // to get rid of (Not) the matching elements. func winnowNodes(sel *Selection, nodes []*html.Node, keep bool) []*html.Node { if len(nodes)+len(sel.Nodes) < minNodesForSet { return grep(sel, func(i int, s *Selection) bool { return isInSlice(nodes, s.Get(0)) == keep }) } set := make(map[*html.Node]bool) for _, n := range nodes { set[n] = true } return grep(sel, func(i int, s *Selection) bool { return set[s.Get(0)] == keep }) } // Filter based on a function test, and the indicator to keep (Filter) or // to get rid of (Not) the matching elements. func winnowFunction(sel *Selection, f func(int, *Selection) bool, keep bool) []*html.Node { return grep(sel, func(i int, s *Selection) bool { return f(i, s) == keep }) } goquery-1.8.1/filter_test.go000066400000000000000000000116571437416732600161160ustar00rootroot00000000000000package goquery import ( "testing" ) func TestFilter(t *testing.T) { sel := Doc().Find(".span12").Filter(".alert") assertLength(t, sel.Nodes, 1) } func TestFilterNone(t *testing.T) { sel := Doc().Find(".span12").Filter(".zzalert") assertLength(t, sel.Nodes, 0) } func TestFilterInvalid(t *testing.T) { sel := Doc().Find(".span12").Filter("") assertLength(t, sel.Nodes, 0) } func TestFilterRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Filter(".alert").End() assertEqual(t, sel, sel2) } func TestFilterFunction(t *testing.T) { sel := Doc().Find(".pvk-content").FilterFunction(func(i int, s *Selection) bool { return i > 0 }) assertLength(t, sel.Nodes, 2) } func TestFilterFunctionRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.FilterFunction(func(i int, s *Selection) bool { return i > 0 }).End() assertEqual(t, sel, sel2) } func TestFilterNode(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.FilterNodes(sel.Nodes[2]) assertLength(t, sel2.Nodes, 1) } func TestFilterNodeRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.FilterNodes(sel.Nodes[2]).End() assertEqual(t, sel, sel2) } func TestFilterSelection(t *testing.T) { sel := Doc().Find(".link") sel2 := Doc().Find("a[ng-click]") sel3 := sel.FilterSelection(sel2) assertLength(t, sel3.Nodes, 1) } func TestFilterSelectionRollback(t *testing.T) { sel := Doc().Find(".link") sel2 := Doc().Find("a[ng-click]") sel2 = sel.FilterSelection(sel2).End() assertEqual(t, sel, sel2) } func TestFilterSelectionNil(t *testing.T) { var sel2 *Selection sel := Doc().Find(".link") sel3 := sel.FilterSelection(sel2) assertLength(t, sel3.Nodes, 0) } func TestNot(t *testing.T) { sel := Doc().Find(".span12").Not(".alert") assertLength(t, sel.Nodes, 1) } func TestNotInvalid(t *testing.T) { sel := Doc().Find(".span12").Not("") assertLength(t, sel.Nodes, 2) } func TestNotRollback(t *testing.T) { sel := Doc().Find(".span12") sel2 := sel.Not(".alert").End() assertEqual(t, sel, sel2) } func TestNotNone(t *testing.T) { sel := Doc().Find(".span12").Not(".zzalert") assertLength(t, sel.Nodes, 2) } func TestNotFunction(t *testing.T) { sel := Doc().Find(".pvk-content").NotFunction(func(i int, s *Selection) bool { return i > 0 }) assertLength(t, sel.Nodes, 1) } func TestNotFunctionRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.NotFunction(func(i int, s *Selection) bool { return i > 0 }).End() assertEqual(t, sel, sel2) } func TestNotNode(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.NotNodes(sel.Nodes[2]) assertLength(t, sel2.Nodes, 2) } func TestNotNodeRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.NotNodes(sel.Nodes[2]).End() assertEqual(t, sel, sel2) } func TestNotSelection(t *testing.T) { sel := Doc().Find(".link") sel2 := Doc().Find("a[ng-click]") sel3 := sel.NotSelection(sel2) assertLength(t, sel3.Nodes, 6) } func TestNotSelectionRollback(t *testing.T) { sel := Doc().Find(".link") sel2 := Doc().Find("a[ng-click]") sel2 = sel.NotSelection(sel2).End() assertEqual(t, sel, sel2) } func TestIntersection(t *testing.T) { sel := Doc().Find(".pvk-gutter") sel2 := Doc().Find("div").Intersection(sel) assertLength(t, sel2.Nodes, 6) } func TestIntersectionRollback(t *testing.T) { sel := Doc().Find(".pvk-gutter") sel2 := Doc().Find("div") sel2 = sel.Intersection(sel2).End() assertEqual(t, sel, sel2) } func TestHas(t *testing.T) { sel := Doc().Find(".container-fluid").Has(".center-content") assertLength(t, sel.Nodes, 2) // Has() returns the high-level .container-fluid div, and the one that is the immediate parent of center-content } func TestHasInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").Has("") assertLength(t, sel.Nodes, 0) } func TestHasRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.Has(".center-content").End() assertEqual(t, sel, sel2) } func TestHasNodes(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".center-content") sel = sel.HasNodes(sel2.Nodes...) assertLength(t, sel.Nodes, 2) // Has() returns the high-level .container-fluid div, and the one that is the immediate parent of center-content } func TestHasNodesRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".center-content") sel2 = sel.HasNodes(sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestHasSelection(t *testing.T) { sel := Doc().Find("p") sel2 := Doc().Find("small") sel = sel.HasSelection(sel2) assertLength(t, sel.Nodes, 1) } func TestHasSelectionRollback(t *testing.T) { sel := Doc().Find("p") sel2 := Doc().Find("small") sel2 = sel.HasSelection(sel2).End() assertEqual(t, sel, sel2) } func TestEnd(t *testing.T) { sel := Doc().Find("p").Has("small").End() assertLength(t, sel.Nodes, 4) } func TestEndToTop(t *testing.T) { sel := Doc().Find("p").Has("small").End().End().End() assertLength(t, sel.Nodes, 0) } goquery-1.8.1/go.mod000066400000000000000000000001751437416732600143420ustar00rootroot00000000000000module github.com/PuerkitoBio/goquery require ( github.com/andybalholm/cascadia v1.3.1 golang.org/x/net v0.7.0 ) go 1.13 goquery-1.8.1/go.sum000066400000000000000000000062311437416732600143660ustar00rootroot00000000000000github.com/andybalholm/cascadia v1.3.1 h1:nhxRkql1kdYCc8Snf7D5/D3spOX+dBgjA6u8x004T2c= github.com/andybalholm/cascadia v1.3.1/go.mod h1:R4bJ1UQfqADjvDa4P6HZHLh/3OxWWEqc0Sk8XGwHqvA= github.com/yuin/goldmark v1.4.13/go.mod h1:6yULJ656Px+3vBD8DxQVa3kxgyrAnzto9xy5taEt/CY= golang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w= golang.org/x/crypto v0.0.0-20210921155107-089bfa567519/go.mod h1:GvvjBRRGRdwPK5ydBHafDWAxML/pGHZbMvKqRZ5+Abc= golang.org/x/mod v0.6.0-dev.0.20220419223038-86c51ed26bb4/go.mod h1:jJ57K6gSWd91VN4djpZkiMVwK6gcyfeH4XE8wZrZaV4= golang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= golang.org/x/net v0.0.0-20210226172049-e18ecbb05110/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg= golang.org/x/net v0.0.0-20210916014120-12bc252f5db8/go.mod h1:9nx3DQGgdP8bBQD5qxJ1jj9UTztislL4KSBs9R2vV5Y= golang.org/x/net v0.0.0-20220722155237-a158d28d115b/go.mod h1:XRhObCWvk6IyKnWLug+ECip1KBveYUHfp+8e9klMJ9c= golang.org/x/net v0.7.0 h1:rJrUqqhjsgNp7KqAIc25s9pZnjU7TUcSY7HcVZjdn1g= golang.org/x/net v0.7.0/go.mod h1:2Tu9+aMcznHK/AK1HMvgo6xiTLG5rD5rZLDS+rp2Bjs= golang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= golang.org/x/sync v0.0.0-20220722155255-886fb9371eb4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= golang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= golang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= golang.org/x/sys v0.0.0-20210423082822-04245dca01da/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= golang.org/x/sys v0.0.0-20210615035016-665e8c7367d1/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/sys v0.0.0-20220520151302-bc2c85ada10a/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/sys v0.0.0-20220722155257-8c9f86f7a55f/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/sys v0.5.0/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo= golang.org/x/term v0.0.0-20210927222741-03fcf44c2211/go.mod h1:jbD1KX2456YbFQfuXm/mYQcufACuNUgVhRMnK/tPxf8= golang.org/x/term v0.5.0/go.mod h1:jMB1sMXY+tzblOD4FWmEbocvup2/aLOaQEp7JmGp78k= golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= golang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= golang.org/x/text v0.3.6/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= golang.org/x/text v0.3.7/go.mod h1:u+2+/6zg+i71rQMx5EYifcz6MCKuco9NR6JIITiCfzQ= golang.org/x/text v0.7.0/go.mod h1:mrYo+phRRbMaCq/xk9113O4dZlRixOauAjOtrjsXDZ8= golang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ= golang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= golang.org/x/tools v0.1.12/go.mod h1:hNGJHUnrk76NpqgfD5Aqm5Crs+Hm0VOH/i9J2+nxYbc= golang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= goquery-1.8.1/iteration.go000066400000000000000000000026441437416732600155640ustar00rootroot00000000000000package goquery // Each iterates over a Selection object, executing a function for each // matched element. It returns the current Selection object. The function // f is called for each element in the selection with the index of the // element in that selection starting at 0, and a *Selection that contains // only that element. func (s *Selection) Each(f func(int, *Selection)) *Selection { for i, n := range s.Nodes { f(i, newSingleSelection(n, s.document)) } return s } // EachWithBreak iterates over a Selection object, executing a function for each // matched element. It is identical to Each except that it is possible to break // out of the loop by returning false in the callback function. It returns the // current Selection object. func (s *Selection) EachWithBreak(f func(int, *Selection) bool) *Selection { for i, n := range s.Nodes { if !f(i, newSingleSelection(n, s.document)) { return s } } return s } // Map passes each element in the current matched set through a function, // producing a slice of string holding the returned values. The function // f is called for each element in the selection with the index of the // element in that selection starting at 0, and a *Selection that contains // only that element. func (s *Selection) Map(f func(int, *Selection) string) (result []string) { for i, n := range s.Nodes { result = append(result, f(i, newSingleSelection(n, s.document))) } return result } goquery-1.8.1/iteration_test.go000066400000000000000000000036041437416732600166200ustar00rootroot00000000000000package goquery import ( "testing" "golang.org/x/net/html" ) func TestEach(t *testing.T) { var cnt int sel := Doc().Find(".hero-unit .row-fluid").Each(func(i int, n *Selection) { cnt++ t.Logf("At index %v, node %v", i, n.Nodes[0].Data) }).Find("a") if cnt != 4 { t.Errorf("Expected Each() to call function 4 times, got %v times.", cnt) } assertLength(t, sel.Nodes, 6) } func TestEachWithBreak(t *testing.T) { var cnt int sel := Doc().Find(".hero-unit .row-fluid").EachWithBreak(func(i int, n *Selection) bool { cnt++ t.Logf("At index %v, node %v", i, n.Nodes[0].Data) return false }).Find("a") if cnt != 1 { t.Errorf("Expected Each() to call function 1 time, got %v times.", cnt) } assertLength(t, sel.Nodes, 6) } func TestEachEmptySelection(t *testing.T) { var cnt int sel := Doc().Find("zzzz") sel.Each(func(i int, n *Selection) { cnt++ }) if cnt > 0 { t.Error("Expected Each() to not be called on empty Selection.") } sel2 := sel.Find("div") assertLength(t, sel2.Nodes, 0) } func TestMap(t *testing.T) { sel := Doc().Find(".pvk-content") vals := sel.Map(func(i int, s *Selection) string { n := s.Get(0) if n.Type == html.ElementNode { return n.Data } return "" }) for _, v := range vals { if v != "div" { t.Error("Expected Map array result to be all 'div's.") } } if len(vals) != 3 { t.Errorf("Expected Map array result to have a length of 3, found %v.", len(vals)) } } func TestForRange(t *testing.T) { sel := Doc().Find(".pvk-content") initLen := sel.Length() for i := range sel.Nodes { single := sel.Eq(i) //h, err := single.Html() //if err != nil { // t.Fatal(err) //} //fmt.Println(i, h) if single.Length() != 1 { t.Errorf("%d: expected length of 1, got %d", i, single.Length()) } } if sel.Length() != initLen { t.Errorf("expected initial selection to still have length %d, got %d", initLen, sel.Length()) } } goquery-1.8.1/manipulation.go000066400000000000000000000524271437416732600162720ustar00rootroot00000000000000package goquery import ( "strings" "golang.org/x/net/html" ) // After applies the selector from the root document and inserts the matched elements // after the elements in the set of matched elements. // // If one of the matched elements in the selection is not currently in the // document, it's impossible to insert nodes after it, so it will be ignored. // // This follows the same rules as Selection.Append. func (s *Selection) After(selector string) *Selection { return s.AfterMatcher(compileMatcher(selector)) } // AfterMatcher applies the matcher from the root document and inserts the matched elements // after the elements in the set of matched elements. // // If one of the matched elements in the selection is not currently in the // document, it's impossible to insert nodes after it, so it will be ignored. // // This follows the same rules as Selection.Append. func (s *Selection) AfterMatcher(m Matcher) *Selection { return s.AfterNodes(m.MatchAll(s.document.rootNode)...) } // AfterSelection inserts the elements in the selection after each element in the set of matched // elements. // // This follows the same rules as Selection.Append. func (s *Selection) AfterSelection(sel *Selection) *Selection { return s.AfterNodes(sel.Nodes...) } // AfterHtml parses the html and inserts it after the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) AfterHtml(htmlStr string) *Selection { return s.eachNodeHtml(htmlStr, true, func(node *html.Node, nodes []*html.Node) { nextSibling := node.NextSibling for _, n := range nodes { if node.Parent != nil { node.Parent.InsertBefore(n, nextSibling) } } }) } // AfterNodes inserts the nodes after each element in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) AfterNodes(ns ...*html.Node) *Selection { return s.manipulateNodes(ns, true, func(sn *html.Node, n *html.Node) { if sn.Parent != nil { sn.Parent.InsertBefore(n, sn.NextSibling) } }) } // Append appends the elements specified by the selector to the end of each element // in the set of matched elements, following those rules: // // 1) The selector is applied to the root document. // // 2) Elements that are part of the document will be moved to the new location. // // 3) If there are multiple locations to append to, cloned nodes will be // appended to all target locations except the last one, which will be moved // as noted in (2). func (s *Selection) Append(selector string) *Selection { return s.AppendMatcher(compileMatcher(selector)) } // AppendMatcher appends the elements specified by the matcher to the end of each element // in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) AppendMatcher(m Matcher) *Selection { return s.AppendNodes(m.MatchAll(s.document.rootNode)...) } // AppendSelection appends the elements in the selection to the end of each element // in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) AppendSelection(sel *Selection) *Selection { return s.AppendNodes(sel.Nodes...) } // AppendHtml parses the html and appends it to the set of matched elements. func (s *Selection) AppendHtml(htmlStr string) *Selection { return s.eachNodeHtml(htmlStr, false, func(node *html.Node, nodes []*html.Node) { for _, n := range nodes { node.AppendChild(n) } }) } // AppendNodes appends the specified nodes to each node in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) AppendNodes(ns ...*html.Node) *Selection { return s.manipulateNodes(ns, false, func(sn *html.Node, n *html.Node) { sn.AppendChild(n) }) } // Before inserts the matched elements before each element in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) Before(selector string) *Selection { return s.BeforeMatcher(compileMatcher(selector)) } // BeforeMatcher inserts the matched elements before each element in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) BeforeMatcher(m Matcher) *Selection { return s.BeforeNodes(m.MatchAll(s.document.rootNode)...) } // BeforeSelection inserts the elements in the selection before each element in the set of matched // elements. // // This follows the same rules as Selection.Append. func (s *Selection) BeforeSelection(sel *Selection) *Selection { return s.BeforeNodes(sel.Nodes...) } // BeforeHtml parses the html and inserts it before the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) BeforeHtml(htmlStr string) *Selection { return s.eachNodeHtml(htmlStr, true, func(node *html.Node, nodes []*html.Node) { for _, n := range nodes { if node.Parent != nil { node.Parent.InsertBefore(n, node) } } }) } // BeforeNodes inserts the nodes before each element in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) BeforeNodes(ns ...*html.Node) *Selection { return s.manipulateNodes(ns, false, func(sn *html.Node, n *html.Node) { if sn.Parent != nil { sn.Parent.InsertBefore(n, sn) } }) } // Clone creates a deep copy of the set of matched nodes. The new nodes will not be // attached to the document. func (s *Selection) Clone() *Selection { ns := newEmptySelection(s.document) ns.Nodes = cloneNodes(s.Nodes) return ns } // Empty removes all children nodes from the set of matched elements. // It returns the children nodes in a new Selection. func (s *Selection) Empty() *Selection { var nodes []*html.Node for _, n := range s.Nodes { for c := n.FirstChild; c != nil; c = n.FirstChild { n.RemoveChild(c) nodes = append(nodes, c) } } return pushStack(s, nodes) } // Prepend prepends the elements specified by the selector to each element in // the set of matched elements, following the same rules as Append. func (s *Selection) Prepend(selector string) *Selection { return s.PrependMatcher(compileMatcher(selector)) } // PrependMatcher prepends the elements specified by the matcher to each // element in the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) PrependMatcher(m Matcher) *Selection { return s.PrependNodes(m.MatchAll(s.document.rootNode)...) } // PrependSelection prepends the elements in the selection to each element in // the set of matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) PrependSelection(sel *Selection) *Selection { return s.PrependNodes(sel.Nodes...) } // PrependHtml parses the html and prepends it to the set of matched elements. func (s *Selection) PrependHtml(htmlStr string) *Selection { return s.eachNodeHtml(htmlStr, false, func(node *html.Node, nodes []*html.Node) { firstChild := node.FirstChild for _, n := range nodes { node.InsertBefore(n, firstChild) } }) } // PrependNodes prepends the specified nodes to each node in the set of // matched elements. // // This follows the same rules as Selection.Append. func (s *Selection) PrependNodes(ns ...*html.Node) *Selection { return s.manipulateNodes(ns, true, func(sn *html.Node, n *html.Node) { // sn.FirstChild may be nil, in which case this functions like // sn.AppendChild() sn.InsertBefore(n, sn.FirstChild) }) } // Remove removes the set of matched elements from the document. // It returns the same selection, now consisting of nodes not in the document. func (s *Selection) Remove() *Selection { for _, n := range s.Nodes { if n.Parent != nil { n.Parent.RemoveChild(n) } } return s } // RemoveFiltered removes from the current set of matched elements those that // match the selector filter. It returns the Selection of removed nodes. // // For example if the selection s contains "

", "

" and "

" // and s.RemoveFiltered("h2") is called, only the "

" node is removed // (and returned), while "

" and "

" are kept in the document. func (s *Selection) RemoveFiltered(selector string) *Selection { return s.RemoveMatcher(compileMatcher(selector)) } // RemoveMatcher removes from the current set of matched elements those that // match the Matcher filter. It returns the Selection of removed nodes. // See RemoveFiltered for additional information. func (s *Selection) RemoveMatcher(m Matcher) *Selection { return s.FilterMatcher(m).Remove() } // ReplaceWith replaces each element in the set of matched elements with the // nodes matched by the given selector. // It returns the removed elements. // // This follows the same rules as Selection.Append. func (s *Selection) ReplaceWith(selector string) *Selection { return s.ReplaceWithMatcher(compileMatcher(selector)) } // ReplaceWithMatcher replaces each element in the set of matched elements with // the nodes matched by the given Matcher. // It returns the removed elements. // // This follows the same rules as Selection.Append. func (s *Selection) ReplaceWithMatcher(m Matcher) *Selection { return s.ReplaceWithNodes(m.MatchAll(s.document.rootNode)...) } // ReplaceWithSelection replaces each element in the set of matched elements with // the nodes from the given Selection. // It returns the removed elements. // // This follows the same rules as Selection.Append. func (s *Selection) ReplaceWithSelection(sel *Selection) *Selection { return s.ReplaceWithNodes(sel.Nodes...) } // ReplaceWithHtml replaces each element in the set of matched elements with // the parsed HTML. // It returns the removed elements. // // This follows the same rules as Selection.Append. func (s *Selection) ReplaceWithHtml(htmlStr string) *Selection { s.eachNodeHtml(htmlStr, true, func(node *html.Node, nodes []*html.Node) { nextSibling := node.NextSibling for _, n := range nodes { if node.Parent != nil { node.Parent.InsertBefore(n, nextSibling) } } }) return s.Remove() } // ReplaceWithNodes replaces each element in the set of matched elements with // the given nodes. // It returns the removed elements. // // This follows the same rules as Selection.Append. func (s *Selection) ReplaceWithNodes(ns ...*html.Node) *Selection { s.AfterNodes(ns...) return s.Remove() } // SetHtml sets the html content of each element in the selection to // specified html string. func (s *Selection) SetHtml(htmlStr string) *Selection { for _, context := range s.Nodes { for c := context.FirstChild; c != nil; c = context.FirstChild { context.RemoveChild(c) } } return s.eachNodeHtml(htmlStr, false, func(node *html.Node, nodes []*html.Node) { for _, n := range nodes { node.AppendChild(n) } }) } // SetText sets the content of each element in the selection to specified content. // The provided text string is escaped. func (s *Selection) SetText(text string) *Selection { return s.SetHtml(html.EscapeString(text)) } // Unwrap removes the parents of the set of matched elements, leaving the matched // elements (and their siblings, if any) in their place. // It returns the original selection. func (s *Selection) Unwrap() *Selection { s.Parent().Each(func(i int, ss *Selection) { // For some reason, jquery allows unwrap to remove the element, so // allowing it here too. Same for . Why it allows those elements to // be unwrapped while not allowing body is a mystery to me. if ss.Nodes[0].Data != "body" { ss.ReplaceWithSelection(ss.Contents()) } }) return s } // Wrap wraps each element in the set of matched elements inside the first // element matched by the given selector. The matched child is cloned before // being inserted into the document. // // It returns the original set of elements. func (s *Selection) Wrap(selector string) *Selection { return s.WrapMatcher(compileMatcher(selector)) } // WrapMatcher wraps each element in the set of matched elements inside the // first element matched by the given matcher. The matched child is cloned // before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapMatcher(m Matcher) *Selection { return s.wrapNodes(m.MatchAll(s.document.rootNode)...) } // WrapSelection wraps each element in the set of matched elements inside the // first element in the given Selection. The element is cloned before being // inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapSelection(sel *Selection) *Selection { return s.wrapNodes(sel.Nodes...) } // WrapHtml wraps each element in the set of matched elements inside the inner- // most child of the given HTML. // // It returns the original set of elements. func (s *Selection) WrapHtml(htmlStr string) *Selection { nodesMap := make(map[string][]*html.Node) for _, context := range s.Nodes { var parent *html.Node if context.Parent != nil { parent = context.Parent } else { parent = &html.Node{Type: html.ElementNode} } nodes, found := nodesMap[nodeName(parent)] if !found { nodes = parseHtmlWithContext(htmlStr, parent) nodesMap[nodeName(parent)] = nodes } newSingleSelection(context, s.document).wrapAllNodes(cloneNodes(nodes)...) } return s } // WrapNode wraps each element in the set of matched elements inside the inner- // most child of the given node. The given node is copied before being inserted // into the document. // // It returns the original set of elements. func (s *Selection) WrapNode(n *html.Node) *Selection { return s.wrapNodes(n) } func (s *Selection) wrapNodes(ns ...*html.Node) *Selection { s.Each(func(i int, ss *Selection) { ss.wrapAllNodes(ns...) }) return s } // WrapAll wraps a single HTML structure, matched by the given selector, around // all elements in the set of matched elements. The matched child is cloned // before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapAll(selector string) *Selection { return s.WrapAllMatcher(compileMatcher(selector)) } // WrapAllMatcher wraps a single HTML structure, matched by the given Matcher, // around all elements in the set of matched elements. The matched child is // cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapAllMatcher(m Matcher) *Selection { return s.wrapAllNodes(m.MatchAll(s.document.rootNode)...) } // WrapAllSelection wraps a single HTML structure, the first node of the given // Selection, around all elements in the set of matched elements. The matched // child is cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapAllSelection(sel *Selection) *Selection { return s.wrapAllNodes(sel.Nodes...) } // WrapAllHtml wraps the given HTML structure around all elements in the set of // matched elements. The matched child is cloned before being inserted into the // document. // // It returns the original set of elements. func (s *Selection) WrapAllHtml(htmlStr string) *Selection { var context *html.Node var nodes []*html.Node if len(s.Nodes) > 0 { context = s.Nodes[0] if context.Parent != nil { nodes = parseHtmlWithContext(htmlStr, context) } else { nodes = parseHtml(htmlStr) } } return s.wrapAllNodes(nodes...) } func (s *Selection) wrapAllNodes(ns ...*html.Node) *Selection { if len(ns) > 0 { return s.WrapAllNode(ns[0]) } return s } // WrapAllNode wraps the given node around the first element in the Selection, // making all other nodes in the Selection children of the given node. The node // is cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapAllNode(n *html.Node) *Selection { if s.Size() == 0 { return s } wrap := cloneNode(n) first := s.Nodes[0] if first.Parent != nil { first.Parent.InsertBefore(wrap, first) first.Parent.RemoveChild(first) } for c := getFirstChildEl(wrap); c != nil; c = getFirstChildEl(wrap) { wrap = c } newSingleSelection(wrap, s.document).AppendSelection(s) return s } // WrapInner wraps an HTML structure, matched by the given selector, around the // content of element in the set of matched elements. The matched child is // cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapInner(selector string) *Selection { return s.WrapInnerMatcher(compileMatcher(selector)) } // WrapInnerMatcher wraps an HTML structure, matched by the given selector, // around the content of element in the set of matched elements. The matched // child is cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapInnerMatcher(m Matcher) *Selection { return s.wrapInnerNodes(m.MatchAll(s.document.rootNode)...) } // WrapInnerSelection wraps an HTML structure, matched by the given selector, // around the content of element in the set of matched elements. The matched // child is cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapInnerSelection(sel *Selection) *Selection { return s.wrapInnerNodes(sel.Nodes...) } // WrapInnerHtml wraps an HTML structure, matched by the given selector, around // the content of element in the set of matched elements. The matched child is // cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapInnerHtml(htmlStr string) *Selection { nodesMap := make(map[string][]*html.Node) for _, context := range s.Nodes { nodes, found := nodesMap[nodeName(context)] if !found { nodes = parseHtmlWithContext(htmlStr, context) nodesMap[nodeName(context)] = nodes } newSingleSelection(context, s.document).wrapInnerNodes(cloneNodes(nodes)...) } return s } // WrapInnerNode wraps an HTML structure, matched by the given selector, around // the content of element in the set of matched elements. The matched child is // cloned before being inserted into the document. // // It returns the original set of elements. func (s *Selection) WrapInnerNode(n *html.Node) *Selection { return s.wrapInnerNodes(n) } func (s *Selection) wrapInnerNodes(ns ...*html.Node) *Selection { if len(ns) == 0 { return s } s.Each(func(i int, s *Selection) { contents := s.Contents() if contents.Size() > 0 { contents.wrapAllNodes(ns...) } else { s.AppendNodes(cloneNode(ns[0])) } }) return s } func parseHtml(h string) []*html.Node { // Errors are only returned when the io.Reader returns any error besides // EOF, but strings.Reader never will nodes, err := html.ParseFragment(strings.NewReader(h), &html.Node{Type: html.ElementNode}) if err != nil { panic("goquery: failed to parse HTML: " + err.Error()) } return nodes } func parseHtmlWithContext(h string, context *html.Node) []*html.Node { // Errors are only returned when the io.Reader returns any error besides // EOF, but strings.Reader never will nodes, err := html.ParseFragment(strings.NewReader(h), context) if err != nil { panic("goquery: failed to parse HTML: " + err.Error()) } return nodes } // Get the first child that is an ElementNode func getFirstChildEl(n *html.Node) *html.Node { c := n.FirstChild for c != nil && c.Type != html.ElementNode { c = c.NextSibling } return c } // Deep copy a slice of nodes. func cloneNodes(ns []*html.Node) []*html.Node { cns := make([]*html.Node, 0, len(ns)) for _, n := range ns { cns = append(cns, cloneNode(n)) } return cns } // Deep copy a node. The new node has clones of all the original node's // children but none of its parents or siblings. func cloneNode(n *html.Node) *html.Node { nn := &html.Node{ Type: n.Type, DataAtom: n.DataAtom, Data: n.Data, Attr: make([]html.Attribute, len(n.Attr)), } copy(nn.Attr, n.Attr) for c := n.FirstChild; c != nil; c = c.NextSibling { nn.AppendChild(cloneNode(c)) } return nn } func (s *Selection) manipulateNodes(ns []*html.Node, reverse bool, f func(sn *html.Node, n *html.Node)) *Selection { lasti := s.Size() - 1 // net.Html doesn't provide document fragments for insertion, so to get // things in the correct order with After() and Prepend(), the callback // needs to be called on the reverse of the nodes. if reverse { for i, j := 0, len(ns)-1; i < j; i, j = i+1, j-1 { ns[i], ns[j] = ns[j], ns[i] } } for i, sn := range s.Nodes { for _, n := range ns { if i != lasti { f(sn, cloneNode(n)) } else { if n.Parent != nil { n.Parent.RemoveChild(n) } f(sn, n) } } } return s } // eachNodeHtml parses the given html string and inserts the resulting nodes in the dom with the mergeFn. // The parsed nodes are inserted for each element of the selection. // isParent can be used to indicate that the elements of the selection should be treated as the parent for the parsed html. // A cache is used to avoid parsing the html multiple times should the elements of the selection result in the same context. func (s *Selection) eachNodeHtml(htmlStr string, isParent bool, mergeFn func(n *html.Node, nodes []*html.Node)) *Selection { // cache to avoid parsing the html for the same context multiple times nodeCache := make(map[string][]*html.Node) var context *html.Node for _, n := range s.Nodes { if isParent { context = n.Parent } else { if n.Type != html.ElementNode { continue } context = n } if context != nil { nodes, found := nodeCache[nodeName(context)] if !found { nodes = parseHtmlWithContext(htmlStr, context) nodeCache[nodeName(context)] = nodes } mergeFn(n, cloneNodes(nodes)) } } return s } goquery-1.8.1/manipulation_test.go000066400000000000000000000430701437416732600173230ustar00rootroot00000000000000package goquery import ( "log" "testing" ) const ( wrapHtml = "
test string

" ) func TestAfter(t *testing.T) { doc := Doc2Clone() doc.Find("#main").After("#nf6") assertLength(t, doc.Find("#main #nf6").Nodes, 0) assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("#main + #nf6").Nodes, 1) printSel(t, doc.Selection) } func TestAfterMany(t *testing.T) { doc := Doc2Clone() doc.Find(".one").After("#nf6") assertLength(t, doc.Find("#foot #nf6").Nodes, 1) assertLength(t, doc.Find("#main #nf6").Nodes, 1) assertLength(t, doc.Find(".one + #nf6").Nodes, 2) printSel(t, doc.Selection) } func TestAfterWithRemoved(t *testing.T) { doc := Doc2Clone() s := doc.Find("#main").Remove() s.After("#nf6") assertLength(t, s.Find("#nf6").Nodes, 0) assertLength(t, doc.Find("#nf6").Nodes, 0) printSel(t, doc.Selection) } func TestAfterSelection(t *testing.T) { doc := Doc2Clone() doc.Find("#main").AfterSelection(doc.Find("#nf1, #nf2")) assertLength(t, doc.Find("#main #nf1, #main #nf2").Nodes, 0) assertLength(t, doc.Find("#foot #nf1, #foot #nf2").Nodes, 0) assertLength(t, doc.Find("#main + #nf1, #nf1 + #nf2").Nodes, 2) printSel(t, doc.Selection) } func TestAfterHtml(t *testing.T) { doc := Doc2Clone() doc.Find("#main").AfterHtml("new node") assertLength(t, doc.Find("#main + strong").Nodes, 1) printSel(t, doc.Selection) } func TestAfterHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table tr td").AfterHtml("TestAgain") assertLength(t, doc.Find("table tr td").Nodes, 6) assertClass(t, doc.Find("table tr td").Last(), "c2") printSel(t, doc.Selection) } func TestAppend(t *testing.T) { doc := Doc2Clone() doc.Find("#main").Append("#nf6") assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("#main #nf6").Nodes, 1) printSel(t, doc.Selection) } func TestAppendBody(t *testing.T) { doc := Doc2Clone() doc.Find("body").Append("#nf6") assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("#main #nf6").Nodes, 0) assertLength(t, doc.Find("body > #nf6").Nodes, 1) printSel(t, doc.Selection) } func TestAppendSelection(t *testing.T) { doc := Doc2Clone() doc.Find("#main").AppendSelection(doc.Find("#nf1, #nf2")) assertLength(t, doc.Find("#foot #nf1").Nodes, 0) assertLength(t, doc.Find("#foot #nf2").Nodes, 0) assertLength(t, doc.Find("#main #nf1").Nodes, 1) assertLength(t, doc.Find("#main #nf2").Nodes, 1) printSel(t, doc.Selection) } func TestAppendSelectionExisting(t *testing.T) { doc := Doc2Clone() doc.Find("#main").AppendSelection(doc.Find("#n1, #n2")) assertClass(t, doc.Find("#main :nth-child(1)"), "three") assertClass(t, doc.Find("#main :nth-child(5)"), "one") assertClass(t, doc.Find("#main :nth-child(6)"), "two") printSel(t, doc.Selection) } func TestAppendClone(t *testing.T) { doc := Doc2Clone() doc.Find("#n1").AppendSelection(doc.Find("#nf1").Clone()) assertLength(t, doc.Find("#foot #nf1").Nodes, 1) assertLength(t, doc.Find("#main #nf1").Nodes, 1) printSel(t, doc.Selection) } func TestAppendHtml(t *testing.T) { doc := Doc2Clone() doc.Find("div").AppendHtml("new node") assertLength(t, doc.Find("strong").Nodes, 14) printSel(t, doc.Selection) } func TestAppendHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table tr").AppendHtml("new1new2") assertLength(t, doc.Find("table td").Nodes, 6) assertClass(t, doc.Find("table td").Last(), "c2") printSel(t, doc.Selection) } func TestBefore(t *testing.T) { doc := Doc2Clone() doc.Find("#main").Before("#nf6") assertLength(t, doc.Find("#main #nf6").Nodes, 0) assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("body > #nf6:first-child").Nodes, 1) printSel(t, doc.Selection) } func TestBeforeWithRemoved(t *testing.T) { doc := Doc2Clone() s := doc.Find("#main").Remove() s.Before("#nf6") assertLength(t, s.Find("#nf6").Nodes, 0) assertLength(t, doc.Find("#nf6").Nodes, 0) printSel(t, doc.Selection) } func TestBeforeSelection(t *testing.T) { doc := Doc2Clone() doc.Find("#main").BeforeSelection(doc.Find("#nf1, #nf2")) assertLength(t, doc.Find("#main #nf1, #main #nf2").Nodes, 0) assertLength(t, doc.Find("#foot #nf1, #foot #nf2").Nodes, 0) assertLength(t, doc.Find("body > #nf1:first-child, #nf1 + #nf2").Nodes, 2) printSel(t, doc.Selection) } func TestBeforeHtml(t *testing.T) { doc := Doc2Clone() doc.Find("#main").BeforeHtml("new node") assertLength(t, doc.Find("body > strong:first-child").Nodes, 1) printSel(t, doc.Selection) } func TestBeforeHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table tr td:first-child").BeforeHtml("new1new2") assertLength(t, doc.Find("table td").Nodes, 6) assertClass(t, doc.Find("table td").First(), "c1") printSel(t, doc.Selection) } func TestEmpty(t *testing.T) { doc := Doc2Clone() s := doc.Find("#main").Empty() assertLength(t, doc.Find("#main").Children().Nodes, 0) assertLength(t, s.Filter("div").Nodes, 6) printSel(t, doc.Selection) } func TestPrepend(t *testing.T) { doc := Doc2Clone() doc.Find("#main").Prepend("#nf6") assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("#main #nf6:first-child").Nodes, 1) printSel(t, doc.Selection) } func TestPrependBody(t *testing.T) { doc := Doc2Clone() doc.Find("body").Prepend("#nf6") assertLength(t, doc.Find("#foot #nf6").Nodes, 0) assertLength(t, doc.Find("#main #nf6").Nodes, 0) assertLength(t, doc.Find("body > #nf6:first-child").Nodes, 1) printSel(t, doc.Selection) } func TestPrependSelection(t *testing.T) { doc := Doc2Clone() doc.Find("#main").PrependSelection(doc.Find("#nf1, #nf2")) assertLength(t, doc.Find("#foot #nf1").Nodes, 0) assertLength(t, doc.Find("#foot #nf2").Nodes, 0) assertLength(t, doc.Find("#main #nf1:first-child").Nodes, 1) assertLength(t, doc.Find("#main #nf2:nth-child(2)").Nodes, 1) printSel(t, doc.Selection) } func TestPrependSelectionExisting(t *testing.T) { doc := Doc2Clone() doc.Find("#main").PrependSelection(doc.Find("#n5, #n6")) assertClass(t, doc.Find("#main :nth-child(1)"), "five") assertClass(t, doc.Find("#main :nth-child(2)"), "six") assertClass(t, doc.Find("#main :nth-child(5)"), "three") assertClass(t, doc.Find("#main :nth-child(6)"), "four") printSel(t, doc.Selection) } func TestPrependClone(t *testing.T) { doc := Doc2Clone() doc.Find("#n1").PrependSelection(doc.Find("#nf1").Clone()) assertLength(t, doc.Find("#foot #nf1:first-child").Nodes, 1) assertLength(t, doc.Find("#main #nf1:first-child").Nodes, 1) printSel(t, doc.Selection) } func TestPrependHtml(t *testing.T) { doc := Doc2Clone() doc.Find("div").PrependHtml("new node") assertLength(t, doc.Find("strong:first-child").Nodes, 14) printSel(t, doc.Selection) } func TestPrependHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table tr").PrependHtml("new nodeother new node") assertLength(t, doc.Find("table td").Nodes, 6) assertClass(t, doc.Find("table tr td").First(), "c1") printSel(t, doc.Selection) } func TestRemove(t *testing.T) { doc := Doc2Clone() doc.Find("#nf1").Remove() assertLength(t, doc.Find("#foot #nf1").Nodes, 0) printSel(t, doc.Selection) } func TestRemoveAll(t *testing.T) { doc := Doc2Clone() doc.Find("*").Remove() assertLength(t, doc.Find("*").Nodes, 0) printSel(t, doc.Selection) } func TestRemoveRoot(t *testing.T) { doc := Doc2Clone() doc.Find("html").Remove() assertLength(t, doc.Find("html").Nodes, 0) printSel(t, doc.Selection) } func TestRemoveFiltered(t *testing.T) { doc := Doc2Clone() nf6 := doc.Find("#nf6") s := doc.Find("div").RemoveFiltered("#nf6") assertLength(t, doc.Find("#nf6").Nodes, 0) assertLength(t, s.Nodes, 1) if nf6.Nodes[0] != s.Nodes[0] { t.Error("Removed node does not match original") } printSel(t, doc.Selection) } func TestReplaceWith(t *testing.T) { doc := Doc2Clone() doc.Find("#nf6").ReplaceWith("#main") assertLength(t, doc.Find("#foot #main:last-child").Nodes, 1) printSel(t, doc.Selection) doc.Find("#foot").ReplaceWith("#main") assertLength(t, doc.Find("#foot").Nodes, 0) assertLength(t, doc.Find("#main").Nodes, 1) printSel(t, doc.Selection) } func TestReplaceWithHtml(t *testing.T) { doc := Doc2Clone() doc.Find("#main, #foot").ReplaceWithHtml("
") assertLength(t, doc.Find("#replace").Nodes, 2) printSel(t, doc.Selection) } func TestReplaceWithHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table th").ReplaceWithHtml("TestReplace") assertLength(t, doc.Find("table th").Nodes, 0) assertLength(t, doc.Find("table tr td").Nodes, 4) assertClass(t, doc.Find("table tr td").First(), "c1") printSel(t, doc.Selection) } func TestSetHtml(t *testing.T) { doc := Doc2Clone() q := doc.Find("#main, #foot") q.SetHtml(`
test
`) assertLength(t, doc.Find("#replace").Nodes, 2) assertLength(t, doc.Find("#main, #foot").Nodes, 2) if q.Text() != "testtest" { t.Errorf("Expected text to be %v, found %v", "testtest", q.Text()) } printSel(t, doc.Selection) } func TestSetHtmlNoMatch(t *testing.T) { doc := Doc2Clone() q := doc.Find("#notthere") q.SetHtml(`
test
`) assertLength(t, doc.Find("#replace").Nodes, 0) printSel(t, doc.Selection) } func TestSetHtmlEmpty(t *testing.T) { doc := Doc2Clone() q := doc.Find("#main") q.SetHtml(``) assertLength(t, doc.Find("#main").Nodes, 1) assertLength(t, doc.Find("#main").Children().Nodes, 0) printSel(t, doc.Selection) } func TestSetHtmlContext(t *testing.T) { doc := loadString(t, `
Before1
Before2
`) doc.Find("table tr").SetHtml("TestAgain") assertLength(t, doc.Find("table th").Nodes, 0) assertLength(t, doc.Find("table td").Nodes, 4) assertLength(t, doc.Find("table tr").Nodes, 2) printSel(t, doc.Selection) } func TestSetText(t *testing.T) { doc := Doc2Clone() q := doc.Find("#main, #foot") repl := "
test
" q.SetText(repl) assertLength(t, doc.Find("#replace").Nodes, 0) assertLength(t, doc.Find("#main, #foot").Nodes, 2) if q.Text() != (repl + repl) { t.Errorf("Expected text to be %v, found %v", (repl + repl), q.Text()) } h, err := q.Html() if err != nil { t.Errorf("Error: %v", err) } esc := "<div id="replace">test</div>" if h != esc { t.Errorf("Expected html to be %v, found %v", esc, h) } printSel(t, doc.Selection) } func TestReplaceWithSelection(t *testing.T) { doc := Doc2Clone() sel := doc.Find("#nf6").ReplaceWithSelection(doc.Find("#nf5")) assertSelectionIs(t, sel, "#nf6") assertLength(t, doc.Find("#nf6").Nodes, 0) assertLength(t, doc.Find("#nf5").Nodes, 1) printSel(t, doc.Selection) } func TestUnwrap(t *testing.T) { doc := Doc2Clone() doc.Find("#nf5").Unwrap() assertLength(t, doc.Find("#foot").Nodes, 0) assertLength(t, doc.Find("body > #nf1").Nodes, 1) assertLength(t, doc.Find("body > #nf5").Nodes, 1) printSel(t, doc.Selection) doc = Doc2Clone() doc.Find("#nf5, #n1").Unwrap() assertLength(t, doc.Find("#foot").Nodes, 0) assertLength(t, doc.Find("#main").Nodes, 0) assertLength(t, doc.Find("body > #n1").Nodes, 1) assertLength(t, doc.Find("body > #nf5").Nodes, 1) printSel(t, doc.Selection) } func TestUnwrapBody(t *testing.T) { doc := Doc2Clone() doc.Find("#main").Unwrap() assertLength(t, doc.Find("body").Nodes, 1) assertLength(t, doc.Find("body > #main").Nodes, 1) printSel(t, doc.Selection) } func TestUnwrapHead(t *testing.T) { doc := Doc2Clone() doc.Find("title").Unwrap() assertLength(t, doc.Find("head").Nodes, 0) assertLength(t, doc.Find("head > title").Nodes, 0) assertLength(t, doc.Find("title").Nodes, 1) printSel(t, doc.Selection) } func TestUnwrapHtml(t *testing.T) { doc := Doc2Clone() doc.Find("head").Unwrap() assertLength(t, doc.Find("html").Nodes, 0) assertLength(t, doc.Find("html head").Nodes, 0) assertLength(t, doc.Find("head").Nodes, 1) printSel(t, doc.Selection) } func TestWrap(t *testing.T) { doc := Doc2Clone() doc.Find("#nf1").Wrap("#nf2") nf1 := doc.Find("#foot #nf2 #nf1") assertLength(t, nf1.Nodes, 1) nf2 := doc.Find("#nf2") assertLength(t, nf2.Nodes, 2) printSel(t, doc.Selection) } func TestWrapEmpty(t *testing.T) { doc := Doc2Clone() doc.Find("#nf1").Wrap("#doesnt-exist") origHtml, _ := Doc2().Html() newHtml, _ := doc.Html() if origHtml != newHtml { t.Error("Expected the two documents to be identical.") } printSel(t, doc.Selection) } func TestWrapHtml(t *testing.T) { doc := Doc2Clone() doc.Find(".odd").WrapHtml(wrapHtml) nf2 := doc.Find("#ins #nf2") assertLength(t, nf2.Nodes, 1) printSel(t, doc.Selection) } func TestWrapSelection(t *testing.T) { doc := Doc2Clone() doc.Find("#nf1").WrapSelection(doc.Find("#nf2")) nf1 := doc.Find("#foot #nf2 #nf1") assertLength(t, nf1.Nodes, 1) nf2 := doc.Find("#nf2") assertLength(t, nf2.Nodes, 2) printSel(t, doc.Selection) } func TestWrapAll(t *testing.T) { doc := Doc2Clone() doc.Find(".odd").WrapAll("#nf1") nf1 := doc.Find("#main #nf1") assertLength(t, nf1.Nodes, 1) sel := nf1.Find("#n2 ~ #n4 ~ #n6 ~ #nf2 ~ #nf4 ~ #nf6") assertLength(t, sel.Nodes, 1) printSel(t, doc.Selection) } func TestWrapAllHtml(t *testing.T) { doc := Doc2Clone() doc.Find(".odd").WrapAllHtml(wrapHtml) nf1 := doc.Find("#main div#ins div p em b #n2 ~ #n4 ~ #n6 ~ #nf2 ~ #nf4 ~ #nf6") assertLength(t, nf1.Nodes, 1) printSel(t, doc.Selection) } func TestWrapInnerNoContent(t *testing.T) { doc := Doc2Clone() doc.Find(".one").WrapInner(".two") twos := doc.Find(".two") assertLength(t, twos.Nodes, 4) assertLength(t, doc.Find(".one .two").Nodes, 2) printSel(t, doc.Selection) } func TestWrapInnerWithContent(t *testing.T) { doc := Doc3Clone() doc.Find(".one").WrapInner(".two") twos := doc.Find(".two") assertLength(t, twos.Nodes, 4) assertLength(t, doc.Find(".one .two").Nodes, 2) printSel(t, doc.Selection) } func TestWrapInnerNoWrapper(t *testing.T) { doc := Doc2Clone() doc.Find(".one").WrapInner(".not-exist") twos := doc.Find(".two") assertLength(t, twos.Nodes, 2) assertLength(t, doc.Find(".one").Nodes, 2) assertLength(t, doc.Find(".one .two").Nodes, 0) printSel(t, doc.Selection) } func TestWrapInnerHtml(t *testing.T) { doc := Doc2Clone() doc.Find("#foot").WrapInnerHtml(wrapHtml) foot := doc.Find("#foot div#ins div p em b #nf1 ~ #nf2 ~ #nf3") assertLength(t, foot.Nodes, 1) printSel(t, doc.Selection) } func TestParsingRespectsVaryingContext(t *testing.T) { docA := loadString(t, ` `) docTable := loadString(t, `
`) docBoth := loadString(t, `
`) sA := docA.Find(".x").AppendHtml("Hello") sTable := docTable.Find(".x").AppendHtml("Hello") sBoth := docBoth.Find(".x").AppendHtml("Hello") printSel(t, docA.Selection) printSel(t, docTable.Selection) printSel(t, docBoth.Selection) oA, _ := sA.Html() oTable, _ := sTable.Html() if oA == oTable { t.Errorf("Expected inner html of and to not be equal, but got %s and %s", oA, oTable) } oBothTable, _ := sBoth.First().Html() if oBothTable != oTable { t.Errorf("Expected inner html of
and
in doc containing both tags to be equal, but got %s and %s", oTable, oBothTable) } oBothA, _ := sBoth.Last().Html() if oBothA != oA { t.Errorf("Expected inner html of and in doc containing both tags to be equal, but got %s and %s", oA, oBothA) } } func TestHtmlWithNonElementNode(t *testing.T) { const data = `

This is sometext.

` cases := map[string]func(*Selection, string) *Selection{ "AfterHtml": (*Selection).AfterHtml, "AppendHtml": (*Selection).AppendHtml, "BeforeHtml": (*Selection).BeforeHtml, "PrependHtml": (*Selection).PrependHtml, "ReplaceWithHtml": (*Selection).ReplaceWithHtml, "SetHtml": (*Selection).SetHtml, } for nm, fn := range cases { // this test is only to make sure that the HTML parsing/manipulation // methods do not raise panics when executed over Selections that contain // non-Element nodes. t.Run(nm, func(t *testing.T) { doc := loadString(t, data) sel := doc.Find("p").Contents() func() { defer func() { if err := recover(); err != nil { t.Fatal(err) } }() fn(sel, "
") }() // print the resulting document in verbose mode h, err := OuterHtml(doc.Selection) if err != nil { log.Fatal(err) } t.Log(h) }) } } goquery-1.8.1/misc/000077500000000000000000000000001437416732600141645ustar00rootroot00000000000000goquery-1.8.1/misc/git/000077500000000000000000000000001437416732600147475ustar00rootroot00000000000000goquery-1.8.1/misc/git/pre-commit000077500000000000000000000014571437416732600167600ustar00rootroot00000000000000#!/bin/sh echo ">>> golint" for dir in $(go list ./... | grep -v /vendor/) do golint "${dir}" done echo "<<< golint" echo echo ">>> go vet" go vet $(go list ./... | grep -v /vendor/) echo "<<< go vet" echo echo ">>> gosimple" gosimple $(go list ./... | grep -v /vendor/) echo "<<< gosimple" echo # Check for gofmt problems and report if any. gofiles=$(git diff --cached --name-only --diff-filter=ACM | grep '.go$' | grep -v /vendor/) [ -z "$gofiles" ] && echo "EXIT $vetres" && exit $vetres if [ -n "$gofiles" ]; then unformatted=$(gofmt -l $gofiles) if [ -n "$unformatted" ]; then # Some files are not gofmt'd. echo >&2 "Go files must be formatted with gofmt. Please run:" for fn in $unformatted; do echo >&2 " gofmt -w $PWD/$fn" done fi fi echo goquery-1.8.1/property.go000066400000000000000000000146421437416732600154530ustar00rootroot00000000000000package goquery import ( "bytes" "regexp" "strings" "golang.org/x/net/html" ) var rxClassTrim = regexp.MustCompile("[\t\r\n]") // Attr gets the specified attribute's value for the first element in the // Selection. To get the value for each element individually, use a looping // construct such as Each or Map method. func (s *Selection) Attr(attrName string) (val string, exists bool) { if len(s.Nodes) == 0 { return } return getAttributeValue(attrName, s.Nodes[0]) } // AttrOr works like Attr but returns default value if attribute is not present. func (s *Selection) AttrOr(attrName, defaultValue string) string { if len(s.Nodes) == 0 { return defaultValue } val, exists := getAttributeValue(attrName, s.Nodes[0]) if !exists { return defaultValue } return val } // RemoveAttr removes the named attribute from each element in the set of matched elements. func (s *Selection) RemoveAttr(attrName string) *Selection { for _, n := range s.Nodes { removeAttr(n, attrName) } return s } // SetAttr sets the given attribute on each element in the set of matched elements. func (s *Selection) SetAttr(attrName, val string) *Selection { for _, n := range s.Nodes { attr := getAttributePtr(attrName, n) if attr == nil { n.Attr = append(n.Attr, html.Attribute{Key: attrName, Val: val}) } else { attr.Val = val } } return s } // Text gets the combined text contents of each element in the set of matched // elements, including their descendants. func (s *Selection) Text() string { var buf bytes.Buffer // Slightly optimized vs calling Each: no single selection object created var f func(*html.Node) f = func(n *html.Node) { if n.Type == html.TextNode { // Keep newlines and spaces, like jQuery buf.WriteString(n.Data) } if n.FirstChild != nil { for c := n.FirstChild; c != nil; c = c.NextSibling { f(c) } } } for _, n := range s.Nodes { f(n) } return buf.String() } // Size is an alias for Length. func (s *Selection) Size() int { return s.Length() } // Length returns the number of elements in the Selection object. func (s *Selection) Length() int { return len(s.Nodes) } // Html gets the HTML contents of the first element in the set of matched // elements. It includes text and comment nodes. func (s *Selection) Html() (ret string, e error) { // Since there is no .innerHtml, the HTML content must be re-created from // the nodes using html.Render. var buf bytes.Buffer if len(s.Nodes) > 0 { for c := s.Nodes[0].FirstChild; c != nil; c = c.NextSibling { e = html.Render(&buf, c) if e != nil { return } } ret = buf.String() } return } // AddClass adds the given class(es) to each element in the set of matched elements. // Multiple class names can be specified, separated by a space or via multiple arguments. func (s *Selection) AddClass(class ...string) *Selection { classStr := strings.TrimSpace(strings.Join(class, " ")) if classStr == "" { return s } tcls := getClassesSlice(classStr) for _, n := range s.Nodes { curClasses, attr := getClassesAndAttr(n, true) for _, newClass := range tcls { if !strings.Contains(curClasses, " "+newClass+" ") { curClasses += newClass + " " } } setClasses(n, attr, curClasses) } return s } // HasClass determines whether any of the matched elements are assigned the // given class. func (s *Selection) HasClass(class string) bool { class = " " + class + " " for _, n := range s.Nodes { classes, _ := getClassesAndAttr(n, false) if strings.Contains(classes, class) { return true } } return false } // RemoveClass removes the given class(es) from each element in the set of matched elements. // Multiple class names can be specified, separated by a space or via multiple arguments. // If no class name is provided, all classes are removed. func (s *Selection) RemoveClass(class ...string) *Selection { var rclasses []string classStr := strings.TrimSpace(strings.Join(class, " ")) remove := classStr == "" if !remove { rclasses = getClassesSlice(classStr) } for _, n := range s.Nodes { if remove { removeAttr(n, "class") } else { classes, attr := getClassesAndAttr(n, true) for _, rcl := range rclasses { classes = strings.Replace(classes, " "+rcl+" ", " ", -1) } setClasses(n, attr, classes) } } return s } // ToggleClass adds or removes the given class(es) for each element in the set of matched elements. // Multiple class names can be specified, separated by a space or via multiple arguments. func (s *Selection) ToggleClass(class ...string) *Selection { classStr := strings.TrimSpace(strings.Join(class, " ")) if classStr == "" { return s } tcls := getClassesSlice(classStr) for _, n := range s.Nodes { classes, attr := getClassesAndAttr(n, true) for _, tcl := range tcls { if strings.Contains(classes, " "+tcl+" ") { classes = strings.Replace(classes, " "+tcl+" ", " ", -1) } else { classes += tcl + " " } } setClasses(n, attr, classes) } return s } func getAttributePtr(attrName string, n *html.Node) *html.Attribute { if n == nil { return nil } for i, a := range n.Attr { if a.Key == attrName { return &n.Attr[i] } } return nil } // Private function to get the specified attribute's value from a node. func getAttributeValue(attrName string, n *html.Node) (val string, exists bool) { if a := getAttributePtr(attrName, n); a != nil { val = a.Val exists = true } return } // Get and normalize the "class" attribute from the node. func getClassesAndAttr(n *html.Node, create bool) (classes string, attr *html.Attribute) { // Applies only to element nodes if n.Type == html.ElementNode { attr = getAttributePtr("class", n) if attr == nil && create { n.Attr = append(n.Attr, html.Attribute{ Key: "class", Val: "", }) attr = &n.Attr[len(n.Attr)-1] } } if attr == nil { classes = " " } else { classes = rxClassTrim.ReplaceAllString(" "+attr.Val+" ", " ") } return } func getClassesSlice(classes string) []string { return strings.Split(rxClassTrim.ReplaceAllString(" "+classes+" ", " "), " ") } func removeAttr(n *html.Node, attrName string) { for i, a := range n.Attr { if a.Key == attrName { n.Attr[i], n.Attr[len(n.Attr)-1], n.Attr = n.Attr[len(n.Attr)-1], html.Attribute{}, n.Attr[:len(n.Attr)-1] return } } } func setClasses(n *html.Node, attr *html.Attribute, classes string) { classes = strings.TrimSpace(classes) if classes == "" { removeAttr(n, "class") return } attr.Val = classes } goquery-1.8.1/property_test.go000066400000000000000000000136011437416732600165040ustar00rootroot00000000000000package goquery import ( "regexp" "strings" "testing" ) func TestAttrExists(t *testing.T) { if val, ok := Doc().Find("a").Attr("href"); !ok { t.Error("Expected a value for the href attribute.") } else { t.Logf("Href of first anchor: %v.", val) } } func TestAttrOr(t *testing.T) { if val := Doc().Find("a").AttrOr("fake-attribute", "alternative"); val != "alternative" { t.Error("Expected an alternative value for 'fake-attribute' attribute.") } else { t.Logf("Value returned for not existing attribute: %v.", val) } if val := Doc().Find("zz").AttrOr("fake-attribute", "alternative"); val != "alternative" { t.Error("Expected an alternative value for 'fake-attribute' on an empty selection.") } else { t.Logf("Value returned for empty selection: %v.", val) } } func TestAttrNotExist(t *testing.T) { if val, ok := Doc().Find("div.row-fluid").Attr("href"); ok { t.Errorf("Expected no value for the href attribute, got %v.", val) } } func TestRemoveAttr(t *testing.T) { sel := Doc2Clone().Find("div") sel.RemoveAttr("id") _, ok := sel.Attr("id") if ok { t.Error("Expected there to be no id attributes set") } } func TestSetAttr(t *testing.T) { sel := Doc2Clone().Find("#main") sel.SetAttr("id", "not-main") val, ok := sel.Attr("id") if !ok { t.Error("Expected an id attribute on main") } if val != "not-main" { t.Errorf("Expected an attribute id to be not-main, got %s", val) } } func TestSetAttr2(t *testing.T) { sel := Doc2Clone().Find("#main") sel.SetAttr("foo", "bar") val, ok := sel.Attr("foo") if !ok { t.Error("Expected an 'foo' attribute on main") } if val != "bar" { t.Errorf("Expected an attribute 'foo' to be 'bar', got '%s'", val) } } func TestText(t *testing.T) { txt := Doc().Find("h1").Text() if strings.Trim(txt, " \n\r\t") != "Provok.in" { t.Errorf("Expected text to be Provok.in, found %s.", txt) } } func TestText2(t *testing.T) { txt := Doc().Find(".hero-unit .container-fluid .row-fluid:nth-child(1)").Text() if ok, e := regexp.MatchString(`^\s+Provok\.in\s+Prove your point.\s+$`, txt); !ok || e != nil { t.Errorf("Expected text to be Provok.in Prove your point., found %s.", txt) if e != nil { t.Logf("Error: %s.", e.Error()) } } } func TestText3(t *testing.T) { txt := Doc().Find(".pvk-gutter").First().Text() // There's an   character in there... if ok, e := regexp.MatchString(`^[\s\x{00A0}]+$`, txt); !ok || e != nil { t.Errorf("Expected spaces, found <%v>.", txt) if e != nil { t.Logf("Error: %s.", e.Error()) } } } func TestHtml(t *testing.T) { txt, e := Doc().Find("h1").Html() if e != nil { t.Errorf("Error: %s.", e) } if ok, e := regexp.MatchString(`^\s*
Provok\.in\s*$`, txt); !ok || e != nil { t.Errorf("Unexpected HTML content, found %s.", txt) if e != nil { t.Logf("Error: %s.", e.Error()) } } } func TestNbsp(t *testing.T) { src := `

Some text

` d, err := NewDocumentFromReader(strings.NewReader(src)) if err != nil { t.Fatal(err) } txt := d.Find("p").Text() ix := strings.Index(txt, "\u00a0") if ix != 4 { t.Errorf("Text: expected a non-breaking space at index 4, got %d", ix) } h, err := d.Find("p").Html() if err != nil { t.Fatal(err) } ix = strings.Index(h, "\u00a0") if ix != 4 { t.Errorf("Html: expected a non-breaking space at index 4, got %d", ix) } } func TestAddClass(t *testing.T) { sel := Doc2Clone().Find("#main") sel.AddClass("main main main") // Make sure that class was only added once if a, ok := sel.Attr("class"); !ok || a != "main" { t.Error("Expected #main to have class main") } } func TestAddClassSimilar(t *testing.T) { sel := Doc2Clone().Find("#nf5") sel.AddClass("odd") assertClass(t, sel, "odd") assertClass(t, sel, "odder") printSel(t, sel.Parent()) } func TestAddEmptyClass(t *testing.T) { sel := Doc2Clone().Find("#main") sel.AddClass("") // Make sure that class was only added once if a, ok := sel.Attr("class"); ok { t.Errorf("Expected #main to not to have a class, have: %s", a) } } func TestAddClasses(t *testing.T) { sel := Doc2Clone().Find("#main") sel.AddClass("a b") // Make sure that class was only added once if !sel.HasClass("a") || !sel.HasClass("b") { t.Errorf("#main does not have classes") } } func TestHasClass(t *testing.T) { sel := Doc().Find("div") if !sel.HasClass("span12") { t.Error("Expected at least one div to have class span12.") } } func TestHasClassNone(t *testing.T) { sel := Doc().Find("h2") if sel.HasClass("toto") { t.Error("Expected h1 to have no class.") } } func TestHasClassNotFirst(t *testing.T) { sel := Doc().Find(".alert") if !sel.HasClass("alert-error") { t.Error("Expected .alert to also have class .alert-error.") } } func TestRemoveClass(t *testing.T) { sel := Doc2Clone().Find("#nf1") sel.RemoveClass("one row") if !sel.HasClass("even") || sel.HasClass("one") || sel.HasClass("row") { classes, _ := sel.Attr("class") t.Error("Expected #nf1 to have class even, has ", classes) } } func TestRemoveClassSimilar(t *testing.T) { sel := Doc2Clone().Find("#nf5, #nf6") assertLength(t, sel.Nodes, 2) sel.RemoveClass("odd") assertClass(t, sel.Eq(0), "odder") printSel(t, sel) } func TestRemoveAllClasses(t *testing.T) { sel := Doc2Clone().Find("#nf1") sel.RemoveClass() if a, ok := sel.Attr("class"); ok { t.Error("All classes were not removed, has ", a) } sel = Doc2Clone().Find("#main") sel.RemoveClass() if a, ok := sel.Attr("class"); ok { t.Error("All classes were not removed, has ", a) } } func TestToggleClass(t *testing.T) { sel := Doc2Clone().Find("#nf1") sel.ToggleClass("one") if sel.HasClass("one") { t.Error("Expected #nf1 to not have class one") } sel.ToggleClass("one") if !sel.HasClass("one") { t.Error("Expected #nf1 to have class one") } sel.ToggleClass("one even row") if a, ok := sel.Attr("class"); ok { t.Errorf("Expected #nf1 to have no classes, have %q", a) } } goquery-1.8.1/query.go000066400000000000000000000033021437416732600147230ustar00rootroot00000000000000package goquery import "golang.org/x/net/html" // Is checks the current matched set of elements against a selector and // returns true if at least one of these elements matches. func (s *Selection) Is(selector string) bool { return s.IsMatcher(compileMatcher(selector)) } // IsMatcher checks the current matched set of elements against a matcher and // returns true if at least one of these elements matches. func (s *Selection) IsMatcher(m Matcher) bool { if len(s.Nodes) > 0 { if len(s.Nodes) == 1 { return m.Match(s.Nodes[0]) } return len(m.Filter(s.Nodes)) > 0 } return false } // IsFunction checks the current matched set of elements against a predicate and // returns true if at least one of these elements matches. func (s *Selection) IsFunction(f func(int, *Selection) bool) bool { return s.FilterFunction(f).Length() > 0 } // IsSelection checks the current matched set of elements against a Selection object // and returns true if at least one of these elements matches. func (s *Selection) IsSelection(sel *Selection) bool { return s.FilterSelection(sel).Length() > 0 } // IsNodes checks the current matched set of elements against the specified nodes // and returns true if at least one of these elements matches. func (s *Selection) IsNodes(nodes ...*html.Node) bool { return s.FilterNodes(nodes...).Length() > 0 } // Contains returns true if the specified Node is within, // at any depth, one of the nodes in the Selection object. // It is NOT inclusive, to behave like jQuery's implementation, and // unlike Javascript's .contains, so if the contained // node is itself in the selection, it returns false. func (s *Selection) Contains(n *html.Node) bool { return sliceContains(s.Nodes, n) } goquery-1.8.1/query_test.go000066400000000000000000000044131437416732600157660ustar00rootroot00000000000000package goquery import ( "testing" ) func TestIs(t *testing.T) { sel := Doc().Find(".footer p:nth-child(1)") if !sel.Is("p") { t.Error("Expected .footer p:nth-child(1) to be p.") } } func TestIsInvalid(t *testing.T) { sel := Doc().Find(".footer p:nth-child(1)") if sel.Is("") { t.Error("Is should not succeed with invalid selector string") } } func TestIsPositional(t *testing.T) { sel := Doc().Find(".footer p:nth-child(2)") if !sel.Is("p:nth-child(2)") { t.Error("Expected .footer p:nth-child(2) to be p:nth-child(2).") } } func TestIsPositionalNot(t *testing.T) { sel := Doc().Find(".footer p:nth-child(1)") if sel.Is("p:nth-child(2)") { t.Error("Expected .footer p:nth-child(1) NOT to be p:nth-child(2).") } } func TestIsFunction(t *testing.T) { ok := Doc().Find("div").IsFunction(func(i int, s *Selection) bool { return s.HasClass("container-fluid") }) if !ok { t.Error("Expected some div to have a container-fluid class.") } } func TestIsFunctionRollback(t *testing.T) { ok := Doc().Find("div").IsFunction(func(i int, s *Selection) bool { return s.HasClass("container-fluid") }) if !ok { t.Error("Expected some div to have a container-fluid class.") } } func TestIsSelection(t *testing.T) { sel := Doc().Find("div") sel2 := Doc().Find(".pvk-gutter") if !sel.IsSelection(sel2) { t.Error("Expected some div to have a pvk-gutter class.") } } func TestIsSelectionNot(t *testing.T) { sel := Doc().Find("div") sel2 := Doc().Find("a") if sel.IsSelection(sel2) { t.Error("Expected some div NOT to be an anchor.") } } func TestIsNodes(t *testing.T) { sel := Doc().Find("div") sel2 := Doc().Find(".footer") if !sel.IsNodes(sel2.Nodes[0]) { t.Error("Expected some div to have a footer class.") } } func TestDocContains(t *testing.T) { sel := Doc().Find("h1") if !Doc().Contains(sel.Nodes[0]) { t.Error("Expected document to contain H1 tag.") } } func TestSelContains(t *testing.T) { sel := Doc().Find(".row-fluid") sel2 := Doc().Find("a[ng-click]") if !sel.Contains(sel2.Nodes[0]) { t.Error("Expected .row-fluid to contain a[ng-click] tag.") } } func TestSelNotContains(t *testing.T) { sel := Doc().Find("a.link") sel2 := Doc().Find("span") if sel.Contains(sel2.Nodes[0]) { t.Error("Expected a.link to NOT contain span tag.") } } goquery-1.8.1/testdata/000077500000000000000000000000001437416732600150425ustar00rootroot00000000000000goquery-1.8.1/testdata/gotesting.html000066400000000000000000000516251437416732600177440ustar00rootroot00000000000000testing - The Go Programming Language

Package testing

import "testing"
Overview
Index
Subdirectories

Overview ▾

Package testing provides support for automated testing of Go packages. It is intended to be used in concert with the “go test” command, which automates execution of any function of the form

func TestXxx(*testing.T)

where Xxx can be any alphanumeric string (but the first letter must not be in [a-z]) and serves to identify the test routine. These TestXxx routines should be declared within the package they are testing.

Functions of the form

func BenchmarkXxx(*testing.B)

are considered benchmarks, and are executed by the "go test" command when the -test.bench flag is provided.

A sample benchmark function looks like this:

func BenchmarkHello(b *testing.B) {
    for i := 0; i < b.N; i++ {
        fmt.Sprintf("hello")
    }
}

The benchmark package will vary b.N until the benchmark function lasts long enough to be timed reliably. The output

testing.BenchmarkHello    10000000    282 ns/op

means that the loop ran 10000000 times at a speed of 282 ns per loop.

If a benchmark needs some expensive setup before running, the timer may be stopped:

func BenchmarkBigLen(b *testing.B) {
    b.StopTimer()
    big := NewBig()
    b.StartTimer()
    for i := 0; i < b.N; i++ {
        big.Len()
    }
}

The package also runs and verifies example code. Example functions may include a concluding comment that begins with "Output:" and is compared with the standard output of the function when the tests are run, as in these examples of an example:

func ExampleHello() {
        fmt.Println("hello")
        // Output: hello
}

func ExampleSalutations() {
        fmt.Println("hello, and")
        fmt.Println("goodbye")
        // Output:
        // hello, and
        // goodbye
}

Example functions without output comments are compiled but not executed.

The naming convention to declare examples for a function F, a type T and method M on type T are:

func ExampleF() { ... }
func ExampleT() { ... }
func ExampleT_M() { ... }

Multiple example functions for a type/function/method may be provided by appending a distinct suffix to the name. The suffix must start with a lower-case letter.

func ExampleF_suffix() { ... }
func ExampleT_suffix() { ... }
func ExampleT_M_suffix() { ... }

The entire test file is presented as the example when it contains a single example function, at least one other function, type, variable, or constant declaration, and no test or benchmark functions.

Index

func Main(matchString func(pat, str string) (bool, error), tests []InternalTest, benchmarks []InternalBenchmark, examples []InternalExample)
func RunBenchmarks(matchString func(pat, str string) (bool, error), benchmarks []InternalBenchmark)
func RunExamples(matchString func(pat, str string) (bool, error), examples []InternalExample) (ok bool)
func RunTests(matchString func(pat, str string) (bool, error), tests []InternalTest) (ok bool)
func Short() bool
type B
    func (c *B) Error(args ...interface{})
    func (c *B) Errorf(format string, args ...interface{})
    func (c *B) Fail()
    func (c *B) FailNow()
    func (c *B) Failed() bool
    func (c *B) Fatal(args ...interface{})
    func (c *B) Fatalf(format string, args ...interface{})
    func (c *B) Log(args ...interface{})
    func (c *B) Logf(format string, args ...interface{})
    func (b *B) ResetTimer()
    func (b *B) SetBytes(n int64)
    func (b *B) StartTimer()
    func (b *B) StopTimer()
type BenchmarkResult
    func Benchmark(f func(b *B)) BenchmarkResult
    func (r BenchmarkResult) NsPerOp() int64
    func (r BenchmarkResult) String() string
type InternalBenchmark
type InternalExample
type InternalTest
type T
    func (c *T) Error(args ...interface{})
    func (c *T) Errorf(format string, args ...interface{})
    func (c *T) Fail()
    func (c *T) FailNow()
    func (c *T) Failed() bool
    func (c *T) Fatal(args ...interface{})
    func (c *T) Fatalf(format string, args ...interface{})
    func (c *T) Log(args ...interface{})
    func (c *T) Logf(format string, args ...interface{})
    func (t *T) Parallel()

Package files

benchmark.go example.go testing.go

func Main

func Main(matchString func(pat, str string) (bool, error), tests []InternalTest, benchmarks []InternalBenchmark, examples []InternalExample)

An internal function but exported because it is cross-package; part of the implementation of the "go test" command.

func RunBenchmarks

func RunBenchmarks(matchString func(pat, str string) (bool, error), benchmarks []InternalBenchmark)

An internal function but exported because it is cross-package; part of the implementation of the "go test" command.

func RunExamples

func RunExamples(matchString func(pat, str string) (bool, error), examples []InternalExample) (ok bool)

func RunTests

func RunTests(matchString func(pat, str string) (bool, error), tests []InternalTest) (ok bool)

func Short

func Short() bool

Short reports whether the -test.short flag is set.

type B

type B struct {
    N int
    // contains filtered or unexported fields
}

B is a type passed to Benchmark functions to manage benchmark timing and to specify the number of iterations to run.

func (*B) Error

func (c *B) Error(args ...interface{})

Error is equivalent to Log() followed by Fail().

func (*B) Errorf

func (c *B) Errorf(format string, args ...interface{})

Errorf is equivalent to Logf() followed by Fail().

func (*B) Fail

func (c *B) Fail()

Fail marks the function as having failed but continues execution.

func (*B) FailNow

func (c *B) FailNow()

FailNow marks the function as having failed and stops its execution. Execution will continue at the next test or benchmark.

func (*B) Failed

func (c *B) Failed() bool

Failed returns whether the function has failed.

func (*B) Fatal

func (c *B) Fatal(args ...interface{})

Fatal is equivalent to Log() followed by FailNow().

func (*B) Fatalf

func (c *B) Fatalf(format string, args ...interface{})

Fatalf is equivalent to Logf() followed by FailNow().

func (*B) Log

func (c *B) Log(args ...interface{})

Log formats its arguments using default formatting, analogous to Println(), and records the text in the error log.

func (*B) Logf

func (c *B) Logf(format string, args ...interface{})

Logf formats its arguments according to the format, analogous to Printf(), and records the text in the error log.

func (*B) ResetTimer

func (b *B) ResetTimer()

ResetTimer sets the elapsed benchmark time to zero. It does not affect whether the timer is running.

func (*B) SetBytes

func (b *B) SetBytes(n int64)

SetBytes records the number of bytes processed in a single operation. If this is called, the benchmark will report ns/op and MB/s.

func (*B) StartTimer

func (b *B) StartTimer()

StartTimer starts timing a test. This function is called automatically before a benchmark starts, but it can also used to resume timing after a call to StopTimer.

func (*B) StopTimer

func (b *B) StopTimer()

StopTimer stops timing a test. This can be used to pause the timer while performing complex initialization that you don't want to measure.

type BenchmarkResult

type BenchmarkResult struct {
    N     int           // The number of iterations.
    T     time.Duration // The total time taken.
    Bytes int64         // Bytes processed in one iteration.
}

The results of a benchmark run.

func Benchmark

func Benchmark(f func(b *B)) BenchmarkResult

Benchmark benchmarks a single function. Useful for creating custom benchmarks that do not use the "go test" command.

func (BenchmarkResult) NsPerOp

func (r BenchmarkResult) NsPerOp() int64

func (BenchmarkResult) String

func (r BenchmarkResult) String() string

type InternalBenchmark

type InternalBenchmark struct {
    Name string
    F    func(b *B)
}

An internal type but exported because it is cross-package; part of the implementation of the "go test" command.

type InternalExample

type InternalExample struct {
    Name   string
    F      func()
    Output string
}

type InternalTest

type InternalTest struct {
    Name string
    F    func(*T)
}

An internal type but exported because it is cross-package; part of the implementation of the "go test" command.

type T

type T struct {
    // contains filtered or unexported fields
}

T is a type passed to Test functions to manage test state and support formatted test logs. Logs are accumulated during execution and dumped to standard error when done.

func (*T) Error

func (c *T) Error(args ...interface{})

Error is equivalent to Log() followed by Fail().

func (*T) Errorf

func (c *T) Errorf(format string, args ...interface{})

Errorf is equivalent to Logf() followed by Fail().

func (*T) Fail

func (c *T) Fail()

Fail marks the function as having failed but continues execution.

func (*T) FailNow

func (c *T) FailNow()

FailNow marks the function as having failed and stops its execution. Execution will continue at the next test or benchmark.

func (*T) Failed

func (c *T) Failed() bool

Failed returns whether the function has failed.

func (*T) Fatal

func (c *T) Fatal(args ...interface{})

Fatal is equivalent to Log() followed by FailNow().

func (*T) Fatalf

func (c *T) Fatalf(format string, args ...interface{})

Fatalf is equivalent to Logf() followed by FailNow().

func (*T) Log

func (c *T) Log(args ...interface{})

Log formats its arguments using default formatting, analogous to Println(), and records the text in the error log.

func (*T) Logf

func (c *T) Logf(format string, args ...interface{})

Logf formats its arguments according to the format, analogous to Printf(), and records the text in the error log.

func (*T) Parallel

func (t *T) Parallel()

Parallel signals that this test is to be run in parallel with (and only with) other parallel tests in this CPU group.

Subdirectories

Name      Synopsis
..
iotest      Package iotest implements Readers and Writers useful mainly for testing.
quick      Package quick implements utility functions to help with black box testing.
goquery-1.8.1/testdata/gowiki.html000066400000000000000000003720731437416732600172350ustar00rootroot00000000000000 Go (programming language) - Wikipedia, the free encyclopedia

Go (programming language)

From Wikipedia, the free encyclopedia
  (Redirected from Golang)
Jump to: navigation, search
Go
Golang.png
Paradigm(s) compiled, concurrent, imperative, structured
Appeared in 2009
Designed by Robert Griesemer
Rob Pike
Ken Thompson
Developer Google Inc.
Stable release version 1.0.2[1] (14 June 2012; 2 months ago (2012-06-14))
Typing discipline strong, static
Major implementations gc (8g, 6g, 5g), gccgo
Influenced by C, Limbo, Modula, Newsqueak, Oberon, Pascal,[2] Python
OS Linux, Mac OS X, FreeBSD, OpenBSD, MS Windows, Plan 9[3]
License BSD-style[4] + Patent grant[5]
Usual filename extensions .go
Website golang.org

Go is a compiled, garbage-collected, concurrent programming language developed by Google Inc.[6]

The initial design of Go was started in September 2007 by Robert Griesemer, Rob Pike, and Ken Thompson.[2] Go was officially announced in November 2009. In May 2010, Rob Pike publicly stated that Go was being used "for real stuff" at Google.[7] Go's "gc" compiler targets the Linux, Mac OS X, FreeBSD, OpenBSD, Plan 9, and Microsoft Windows operating systems and the i386, amd64, and ARM processor architectures.[8]

Contents

[edit] Goals

Go aims to provide the efficiency of a statically typed compiled language with the ease of programming of a dynamic language.[9] Other goals include:

  • Safety: Type-safe and memory-safe.
  • Good support for concurrency and communication.
  • Efficient, latency-free garbage collection.
  • High-speed compilation.

[edit] Description

The syntax of Go is broadly similar to that of C: blocks of code are surrounded with curly braces; common control flow structures include for, switch, and if. Unlike C, line-ending semicolons are optional, variable declarations are written differently and are usually optional, type conversions must be made explicit, and new go and select control keywords have been introduced to support concurrent programming. New built-in types include maps, Unicode strings, array slices, and channels for inter-thread communication.

Go is designed for exceptionally fast compiling times, even on modest hardware.[10] The language requires garbage collection. Certain concurrency-related structural conventions of Go (channels and alternative channel inputs) are borrowed from Tony Hoare's CSP. Unlike previous concurrent programming languages such as occam or Limbo, Go does not provide any built-in notion of safe or verifiable concurrency.[11]

Of features found in C++ or Java, Go does not include type inheritance, generic programming, assertions, method overloading, or pointer arithmetic.[2] Of these, the Go authors express an openness to generic programming, explicitly argue against assertions and pointer arithmetic, while defending the choice to omit type inheritance as giving a more useful language, encouraging heavy use of interfaces instead.[2] Initially, the language did not include exception handling, but in March 2010 a mechanism known as panic/recover was implemented to handle exceptional errors while avoiding some of the problems the Go authors find with exceptions.[12][13]

[edit] Type system

Go allows a programmer to write functions that can operate on inputs of arbitrary type, provided that the type implements the functions defined by a given interface.

Unlike Java, the interfaces a type supports do not need to be specified at the point at which the type is defined, and Go interfaces do not participate in a type hierarchy. A Go interface is best described as a set of methods, each identified by a name and signature. A type is considered to implement an interface if all the required methods have been defined for that type. An interface can be declared to "embed" other interfaces, meaning the declared interface includes the methods defined in the other interfaces.[11]

Unlike Java, the in-memory representation of an object does not contain a pointer to a virtual method table. Instead a value of interface type is implemented as a pair of a pointer to the object, and a pointer to a dictionary containing implementations of the interface methods for that type.

Consider the following example:

type Sequence []int
 
func (s Sequence) Len() int {
    return len(s)
}
 
type HasLength interface {
    Len() int
}
 
func Foo (o HasLength) {
    ...
}

These four definitions could have been placed in separate files, in different parts of the program. Notably, the programmer who defined the Sequence type did not need to declare that the type implemented HasLength, and the person who implemented the Len method for Sequence did not need to specify that this method was part of HasLength.

[edit] Name visibility

Visibility of structures, structure fields, variables, constants, methods, top-level types and functions outside their defining package is defined implicitly according to the capitalization of their identifier.[14]

[edit] Concurrency

Go provides goroutines, small lightweight threads; the name alludes to coroutines. Goroutines are created with the go statement from anonymous or named functions.

Goroutines are executed in parallel with other goroutines, including their caller. They do not necessarily run in separate threads, but a group of goroutines are multiplexed onto multiple threads — execution control is moved between them by blocking them when sending or receiving messages over channels.

[edit] Implementations

There are currently two Go compilers:

  • 6g/8g/5g (the compilers for AMD64, x86, and ARM respectively) with their supporting tools (collectively known as "gc") based on Ken's previous work on Plan 9's C toolchain.
  • gccgo, a GCC frontend written in C++,[15] and now officially supported as of version 4.6, albeit not part of the standard binary for gcc.[16]

Both compilers work on Unix-like systems, and a port to Microsoft Windows of the gc compiler and runtime have been integrated in the main distribution. Most of the standard libraries also work on Windows.

There is also an unmaintained "tiny" runtime environment that allows Go programs to run on bare hardware.[17]

[edit] Examples

[edit] Hello world

The following is a Hello world program in Go:

package main
 
import "fmt"
 
func main() {
        fmt.Println("Hello, World")
}

Go's automatic semicolon insertion feature requires that opening braces not be placed on their own lines, and this is thus the preferred brace style; the examples shown comply with this style.[18]

[edit] Echo

Example illustrating how to write a program like the Unix echo command in Go:[19]

package main
 
import (
        "os"
        "flag"  // command line option parser
)
 
var omitNewline = flag.Bool("n", false, "don't print final newline")
 
const (
        Space = " "
        Newline = "\n"
)
 
func main() {
        flag.Parse()   // Scans the arg list and sets up flags
        var s string
        for i := 0; i < flag.NArg(); i++ {
                if i > 0 {
                        s += Space
                }
                s += flag.Arg(i)
        }
        if !*omitNewline {
                s += Newline
        }
        os.Stdout.WriteString(s)
}

[edit] Reception

Go's initial release led to much discussion.

Michele Simionato wrote in an article for artima.com:[20]

Here I just wanted to point out the design choices about interfaces and inheritance. Such ideas are not new and it is a shame that no popular language has followed such particular route in the design space. I hope Go will become popular; if not, I hope such ideas will finally enter in a popular language, we are already 10 or 20 years too late :-(

Dave Astels at Engine Yard wrote:[21]

Go is extremely easy to dive into. There are a minimal number of fundamental language concepts and the syntax is clean and designed to be clear and unambiguous. Go is still experimental and still a little rough around the edges.

Ars Technica interviewed Rob Pike, one of the authors of Go, and asked why a new language was needed. He replied that:[22]

It wasn't enough to just add features to existing programming languages, because sometimes you can get more in the long run by taking things away. They wanted to start from scratch and rethink everything. ... [But they did not want] to deviate too much from what developers already knew because they wanted to avoid alienating Go's target audience.

Go was in 15th place on the TIOBE Programming Community Index of programming language popularity in its first year, 2009,[citation needed] surpassing established languages like Pascal. As of March 2012, it ranked 66th in the index.[23]

Bruce Eckel stated:[24]

The complexity of C++ (even more complexity has been added in the new C++), and the resulting impact on productivity, is no longer justified. All the hoops that the C++ programmer had to jump through in order to use a C-compatible language make no sense anymore -- they're just a waste of time and effort. Now, Go makes much more sense for the class of problems that C++ was originally intended to solve.

[edit] Naming dispute

On the day of the general release of the language, Francis McCabe, developer of the Go! programming language (note the exclamation point), requested a name change of Google's language to prevent confusion with his language.[25] The issue was closed by a Google developer on 12 October 2010 with the custom status "Unfortunate", with a comment that "there are many computing products and services named Go. In the 11 months since our release, there has been minimal confusion of the two languages."[26]

[edit] See also

[edit] References

  1. ^ "golang-announce: go1.0.2 released". https://groups.google.com/forum/#!msg/golang-announce/9-f_fnXNDzw/MiM3tk0iyjYJ. Retrieved 14 June 2012. 
  2. ^ a b c d "Language Design FAQ". golang.org. 16 January 2010. http://golang.org/doc/go_faq.html. Retrieved 27 February 2010. 
  3. ^ "Go Porting Efforts". Go Language Resources. cat-v. 12 January 2010. http://go-lang.cat-v.org/os-ports. Retrieved 18 January 2010. 
  4. ^ "Text file LICENSE". http://golang.org/LICENSE. Retrieved 27 January 2011. 
  5. ^ "Additional IP Rights Grant". http://code.google.com/p/go/source/browse/PATENTS. Retrieved 26 July 2012. 
  6. ^ Kincaid, Jason (10 November 2009). "Google’s Go: A New Programming Language That’s Python Meets C++". TechCrunch. http://www.techcrunch.com/2009/11/10/google-go-language/. Retrieved 18 January 2010. 
  7. ^ Metz, Cade (20 May 2010). "Google programming Frankenstein is a Go". The Register. http://www.theregister.co.uk/2010/05/20/go_in_production_at_google/. 
  8. ^ "Installing Go". golang.org. The Go Authors. 11 June 2010. http://golang.org/doc/install.html#tmp_33. Retrieved 11 June 2010. 
  9. ^ Pike, Rob. "The Go Programming Language". YouTube. http://www.youtube.com/watch?v=rKnDgT73v8s&feature=related. Retrieved 1 Jul 2011. 
  10. ^ Rob Pike (10 November 2009) (flv). The Go Programming Language (Tech talk). Google. Event occurs at 8:53. http://www.youtube.com/watch?v=rKnDgT73v8s#t=8m53. 
  11. ^ a b "The Go Memory Model". Google. http://golang.org/doc/go_mem.html. Retrieved 5 January 2011. 
  12. ^ Release notes, 30 March 2010
  13. ^ "Proposal for an exception-like mechanism". golang-nuts. 25 March 2010. http://groups.google.com/group/golang-nuts/browse_thread/thread/1ce5cd050bb973e4. Retrieved 25 March 2010. 
  14. ^ "A Tutorial for the Go Programming Language". The Go Programming Language. Google. http://golang.org/doc/go_tutorial.html. Retrieved 10 March 2010. "In Go the rule about visibility of information is simple: if a name (of a top-level type, function, method, constant or variable, or of a structure field or method) is capitalized, users of the package may see it. Otherwise, the name and hence the thing being named is visible only inside the package in which it is declared." 
  15. ^ "FAQ: Implementation". golang.org. 16 January 2010. http://golang.org/doc/go_faq.html#Implementation. Retrieved 18 January 2010. 
  16. ^ "Installing GCC: Configuration". http://gcc.gnu.org/install/configure.html. Retrieved 3 December 2011. "Ada, Go and Objective-C++ are not default languages" 
  17. ^ Gerrand, Andrew (1 February 2011). "release.2011-02-01". golang-nuts. Google. http://groups.google.com/group/golang-nuts/browse_thread/thread/b877e34723b543a7. Retrieved 5 February 2011. 
  18. ^ "A Tutorial for the Go Programming Language". The Go Programming Language. Google. http://golang.org/doc/go_tutorial.html. Retrieved 10 March 2010. "The one surprise is that it's important to put the opening brace of a construct such as an if statement on the same line as the if; however, if you don't, there are situations that may not compile or may give the wrong result. The language forces the brace style to some extent." 
  19. ^ "A Tutorial for the Go Programming Language". golang.org. 16 January 2010. http://golang.org/doc/go_tutorial.html. Retrieved 18 January 2010. 
  20. ^ Simionato, Michele (15 November 2009). "Interfaces vs Inheritance (or, watch out for Go!)". artima. http://www.artima.com/weblogs/viewpost.jsp?thread=274019. Retrieved 15 November 2009. 
  21. ^ Astels, Dave (9 November 2009). "Ready, Set, Go!". engineyard. http://www.engineyard.com/blog/2009/ready-set-go/. Retrieved 9 November 2009. 
  22. ^ Paul, Ryan (10 November 2009). "Go: new open source programming language from Google". Ars Technica. http://arstechnica.com/open-source/news/2009/11/go-new-open-source-programming-language-from-google.ars. Retrieved 13 November 2009. 
  23. ^ "TIOBE Programming Community Index for March 2012". TIOBE Software. March 2012. http://es.scribd.com/doc/89569304/TIOBE-Programming-Community-Index-for-March-2012. Retrieved 28 April 2012. 
  24. ^ Bruce Eckel (27). "Calling Go from Python via JSON-RPC". http://www.artima.com/weblogs/viewpost.jsp?thread=333589. Retrieved 29 August 2011. 
  25. ^ Claburn, Thomas (11 November 2009). "Google 'Go' Name Brings Accusations Of Evil'". InformationWeek. http://www.informationweek.com/news/software/web_services/showArticle.jhtml?articleID=221601351. Retrieved 18 January 2010. 
  26. ^ "Issue 9 - go - I have already used the name for *MY* programming language". Google Code. Google Inc.. http://code.google.com/p/go/issues/detail?id=9. Retrieved 12 October 2010. 

[edit] Further reading

[edit] External links

Personal tools
Namespaces

Variants
Actions
goquery-1.8.1/testdata/metalreview.html000066400000000000000000001171741437416732600202670ustar00rootroot00000000000000 Metal Reviews, News, Blogs, Interviews and Community | Metal Review

Reviews

  • Serpentine Path - Serpentine Path Serpentine Path
    Serpentine Path

  • Hunter Hunter's Ground
    No God But the Wild

  • Blut Aus Nord - 777 - Cosmosophy Blut Aus Nord
    777 - Cosmosophy
    Black

  • Ufomammut - Oro: Opus Alter Ufomammut
    Oro: Opus Alter
    Doom

  • Resurgency - False Enlightenment Resurgency
    False Enlightenment
    Death

  • Morgoth - Cursed to Live Morgoth
    Cursed to Live
    DeathLive

  • Krallice - Years Past Matter Krallice
    Years Past Matter
    Black

  • Murder Construct - Results Murder Construct
    Results
    Grindcore

  • Grave - Endless Procession of Souls Grave
    Endless Procession of Souls
    Death

  • Master - The New Elite Master
    The New Elite
    Death

Serpentine Path - Serpentine PathHunter's Ground - No God But the WildBlut Aus Nord - 777 - CosmosophyUfomammut - Oro: Opus AlterResurgency - False EnlightenmentMorgoth - Cursed to LiveKrallice - Years Past MatterMurder Construct - ResultsGrave - Endless Procession of SoulsMaster - The New Elite
Goto Next Group
Goto Previous Group

Lashes

NEW Katatonia - Dead End Kings
45 minutes ago by Chaosjunkie
Katatonia - Dead End Kings
1 hour ago by Harry Dick Rotten
Resurgency - False Enlightenment
3 hours ago by Anonymous
Witchcraft - The Alchemist
5 hours ago by Luke_22
Katatonia - Dead End Kings
9 hours ago by chaosjunkie
Katatonia - Dead End Kings
10 hours ago by Compeller
Manetheren - Time
10 hours ago by xpmule
Ufomammut - Oro: Opus Alter
16 hours ago by Anonymous
Ufomammut - Oro: Opus Alter
17 hours ago by Harry Dick Rotten
Katatonia - Dead End Kings
yesterday by Chaosjunkie
Katatonia - Dead End Kings
yesterday by Anonymous
Katatonia - Dead End Kings
yesterday by Anonymous
Katatonia - Dead End Kings
yesterday by Anonymous
Katatonia - Dead End Kings
yesterday by frantic
Blut Aus Nord - 777 - Cosmosophy
yesterday by Dimensional Bleedthrough
goquery-1.8.1/testdata/page.html000066400000000000000000000127311437416732600166500ustar00rootroot00000000000000 Provok.in
 

Provok.in

Prove your point.

Beta Version. Things may change. Or disappear. Or fail miserably. If it's the latter, please file an issue.
Welcome, {{getUserName()}} ( logout )
 
 
×

{{ title }}

{{ message }}

 
 
 
goquery-1.8.1/testdata/page2.html000066400000000000000000000013531437416732600167300ustar00rootroot00000000000000 Tests for siblings
goquery-1.8.1/testdata/page3.html000066400000000000000000000013641437416732600167330ustar00rootroot00000000000000 Tests for siblings
hello
goquery-1.8.1/traversal.go000066400000000000000000000671571437416732600156030ustar00rootroot00000000000000package goquery import "golang.org/x/net/html" type siblingType int // Sibling type, used internally when iterating over children at the same // level (siblings) to specify which nodes are requested. const ( siblingPrevUntil siblingType = iota - 3 siblingPrevAll siblingPrev siblingAll siblingNext siblingNextAll siblingNextUntil siblingAllIncludingNonElements ) // Find gets the descendants of each element in the current set of matched // elements, filtered by a selector. It returns a new Selection object // containing these matched elements. func (s *Selection) Find(selector string) *Selection { return pushStack(s, findWithMatcher(s.Nodes, compileMatcher(selector))) } // FindMatcher gets the descendants of each element in the current set of matched // elements, filtered by the matcher. It returns a new Selection object // containing these matched elements. func (s *Selection) FindMatcher(m Matcher) *Selection { return pushStack(s, findWithMatcher(s.Nodes, m)) } // FindSelection gets the descendants of each element in the current // Selection, filtered by a Selection. It returns a new Selection object // containing these matched elements. func (s *Selection) FindSelection(sel *Selection) *Selection { if sel == nil { return pushStack(s, nil) } return s.FindNodes(sel.Nodes...) } // FindNodes gets the descendants of each element in the current // Selection, filtered by some nodes. It returns a new Selection object // containing these matched elements. func (s *Selection) FindNodes(nodes ...*html.Node) *Selection { return pushStack(s, mapNodes(nodes, func(i int, n *html.Node) []*html.Node { if sliceContains(s.Nodes, n) { return []*html.Node{n} } return nil })) } // Contents gets the children of each element in the Selection, // including text and comment nodes. It returns a new Selection object // containing these elements. func (s *Selection) Contents() *Selection { return pushStack(s, getChildrenNodes(s.Nodes, siblingAllIncludingNonElements)) } // ContentsFiltered gets the children of each element in the Selection, // filtered by the specified selector. It returns a new Selection // object containing these elements. Since selectors only act on Element nodes, // this function is an alias to ChildrenFiltered unless the selector is empty, // in which case it is an alias to Contents. func (s *Selection) ContentsFiltered(selector string) *Selection { if selector != "" { return s.ChildrenFiltered(selector) } return s.Contents() } // ContentsMatcher gets the children of each element in the Selection, // filtered by the specified matcher. It returns a new Selection // object containing these elements. Since matchers only act on Element nodes, // this function is an alias to ChildrenMatcher. func (s *Selection) ContentsMatcher(m Matcher) *Selection { return s.ChildrenMatcher(m) } // Children gets the child elements of each element in the Selection. // It returns a new Selection object containing these elements. func (s *Selection) Children() *Selection { return pushStack(s, getChildrenNodes(s.Nodes, siblingAll)) } // ChildrenFiltered gets the child elements of each element in the Selection, // filtered by the specified selector. It returns a new // Selection object containing these elements. func (s *Selection) ChildrenFiltered(selector string) *Selection { return filterAndPush(s, getChildrenNodes(s.Nodes, siblingAll), compileMatcher(selector)) } // ChildrenMatcher gets the child elements of each element in the Selection, // filtered by the specified matcher. It returns a new // Selection object containing these elements. func (s *Selection) ChildrenMatcher(m Matcher) *Selection { return filterAndPush(s, getChildrenNodes(s.Nodes, siblingAll), m) } // Parent gets the parent of each element in the Selection. It returns a // new Selection object containing the matched elements. func (s *Selection) Parent() *Selection { return pushStack(s, getParentNodes(s.Nodes)) } // ParentFiltered gets the parent of each element in the Selection filtered by a // selector. It returns a new Selection object containing the matched elements. func (s *Selection) ParentFiltered(selector string) *Selection { return filterAndPush(s, getParentNodes(s.Nodes), compileMatcher(selector)) } // ParentMatcher gets the parent of each element in the Selection filtered by a // matcher. It returns a new Selection object containing the matched elements. func (s *Selection) ParentMatcher(m Matcher) *Selection { return filterAndPush(s, getParentNodes(s.Nodes), m) } // Closest gets the first element that matches the selector by testing the // element itself and traversing up through its ancestors in the DOM tree. func (s *Selection) Closest(selector string) *Selection { cs := compileMatcher(selector) return s.ClosestMatcher(cs) } // ClosestMatcher gets the first element that matches the matcher by testing the // element itself and traversing up through its ancestors in the DOM tree. func (s *Selection) ClosestMatcher(m Matcher) *Selection { return pushStack(s, mapNodes(s.Nodes, func(i int, n *html.Node) []*html.Node { // For each node in the selection, test the node itself, then each parent // until a match is found. for ; n != nil; n = n.Parent { if m.Match(n) { return []*html.Node{n} } } return nil })) } // ClosestNodes gets the first element that matches one of the nodes by testing the // element itself and traversing up through its ancestors in the DOM tree. func (s *Selection) ClosestNodes(nodes ...*html.Node) *Selection { set := make(map[*html.Node]bool) for _, n := range nodes { set[n] = true } return pushStack(s, mapNodes(s.Nodes, func(i int, n *html.Node) []*html.Node { // For each node in the selection, test the node itself, then each parent // until a match is found. for ; n != nil; n = n.Parent { if set[n] { return []*html.Node{n} } } return nil })) } // ClosestSelection gets the first element that matches one of the nodes in the // Selection by testing the element itself and traversing up through its ancestors // in the DOM tree. func (s *Selection) ClosestSelection(sel *Selection) *Selection { if sel == nil { return pushStack(s, nil) } return s.ClosestNodes(sel.Nodes...) } // Parents gets the ancestors of each element in the current Selection. It // returns a new Selection object with the matched elements. func (s *Selection) Parents() *Selection { return pushStack(s, getParentsNodes(s.Nodes, nil, nil)) } // ParentsFiltered gets the ancestors of each element in the current // Selection. It returns a new Selection object with the matched elements. func (s *Selection) ParentsFiltered(selector string) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, nil, nil), compileMatcher(selector)) } // ParentsMatcher gets the ancestors of each element in the current // Selection. It returns a new Selection object with the matched elements. func (s *Selection) ParentsMatcher(m Matcher) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, nil, nil), m) } // ParentsUntil gets the ancestors of each element in the Selection, up to but // not including the element matched by the selector. It returns a new Selection // object containing the matched elements. func (s *Selection) ParentsUntil(selector string) *Selection { return pushStack(s, getParentsNodes(s.Nodes, compileMatcher(selector), nil)) } // ParentsUntilMatcher gets the ancestors of each element in the Selection, up to but // not including the element matched by the matcher. It returns a new Selection // object containing the matched elements. func (s *Selection) ParentsUntilMatcher(m Matcher) *Selection { return pushStack(s, getParentsNodes(s.Nodes, m, nil)) } // ParentsUntilSelection gets the ancestors of each element in the Selection, // up to but not including the elements in the specified Selection. It returns a // new Selection object containing the matched elements. func (s *Selection) ParentsUntilSelection(sel *Selection) *Selection { if sel == nil { return s.Parents() } return s.ParentsUntilNodes(sel.Nodes...) } // ParentsUntilNodes gets the ancestors of each element in the Selection, // up to but not including the specified nodes. It returns a // new Selection object containing the matched elements. func (s *Selection) ParentsUntilNodes(nodes ...*html.Node) *Selection { return pushStack(s, getParentsNodes(s.Nodes, nil, nodes)) } // ParentsFilteredUntil is like ParentsUntil, with the option to filter the // results based on a selector string. It returns a new Selection // object containing the matched elements. func (s *Selection) ParentsFilteredUntil(filterSelector, untilSelector string) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, compileMatcher(untilSelector), nil), compileMatcher(filterSelector)) } // ParentsFilteredUntilMatcher is like ParentsUntilMatcher, with the option to filter the // results based on a matcher. It returns a new Selection object containing the matched elements. func (s *Selection) ParentsFilteredUntilMatcher(filter, until Matcher) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, until, nil), filter) } // ParentsFilteredUntilSelection is like ParentsUntilSelection, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) ParentsFilteredUntilSelection(filterSelector string, sel *Selection) *Selection { return s.ParentsMatcherUntilSelection(compileMatcher(filterSelector), sel) } // ParentsMatcherUntilSelection is like ParentsUntilSelection, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) ParentsMatcherUntilSelection(filter Matcher, sel *Selection) *Selection { if sel == nil { return s.ParentsMatcher(filter) } return s.ParentsMatcherUntilNodes(filter, sel.Nodes...) } // ParentsFilteredUntilNodes is like ParentsUntilNodes, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) ParentsFilteredUntilNodes(filterSelector string, nodes ...*html.Node) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, nil, nodes), compileMatcher(filterSelector)) } // ParentsMatcherUntilNodes is like ParentsUntilNodes, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) ParentsMatcherUntilNodes(filter Matcher, nodes ...*html.Node) *Selection { return filterAndPush(s, getParentsNodes(s.Nodes, nil, nodes), filter) } // Siblings gets the siblings of each element in the Selection. It returns // a new Selection object containing the matched elements. func (s *Selection) Siblings() *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingAll, nil, nil)) } // SiblingsFiltered gets the siblings of each element in the Selection // filtered by a selector. It returns a new Selection object containing the // matched elements. func (s *Selection) SiblingsFiltered(selector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingAll, nil, nil), compileMatcher(selector)) } // SiblingsMatcher gets the siblings of each element in the Selection // filtered by a matcher. It returns a new Selection object containing the // matched elements. func (s *Selection) SiblingsMatcher(m Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingAll, nil, nil), m) } // Next gets the immediately following sibling of each element in the // Selection. It returns a new Selection object containing the matched elements. func (s *Selection) Next() *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingNext, nil, nil)) } // NextFiltered gets the immediately following sibling of each element in the // Selection filtered by a selector. It returns a new Selection object // containing the matched elements. func (s *Selection) NextFiltered(selector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNext, nil, nil), compileMatcher(selector)) } // NextMatcher gets the immediately following sibling of each element in the // Selection filtered by a matcher. It returns a new Selection object // containing the matched elements. func (s *Selection) NextMatcher(m Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNext, nil, nil), m) } // NextAll gets all the following siblings of each element in the // Selection. It returns a new Selection object containing the matched elements. func (s *Selection) NextAll() *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingNextAll, nil, nil)) } // NextAllFiltered gets all the following siblings of each element in the // Selection filtered by a selector. It returns a new Selection object // containing the matched elements. func (s *Selection) NextAllFiltered(selector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextAll, nil, nil), compileMatcher(selector)) } // NextAllMatcher gets all the following siblings of each element in the // Selection filtered by a matcher. It returns a new Selection object // containing the matched elements. func (s *Selection) NextAllMatcher(m Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextAll, nil, nil), m) } // Prev gets the immediately preceding sibling of each element in the // Selection. It returns a new Selection object containing the matched elements. func (s *Selection) Prev() *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingPrev, nil, nil)) } // PrevFiltered gets the immediately preceding sibling of each element in the // Selection filtered by a selector. It returns a new Selection object // containing the matched elements. func (s *Selection) PrevFiltered(selector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrev, nil, nil), compileMatcher(selector)) } // PrevMatcher gets the immediately preceding sibling of each element in the // Selection filtered by a matcher. It returns a new Selection object // containing the matched elements. func (s *Selection) PrevMatcher(m Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrev, nil, nil), m) } // PrevAll gets all the preceding siblings of each element in the // Selection. It returns a new Selection object containing the matched elements. func (s *Selection) PrevAll() *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingPrevAll, nil, nil)) } // PrevAllFiltered gets all the preceding siblings of each element in the // Selection filtered by a selector. It returns a new Selection object // containing the matched elements. func (s *Selection) PrevAllFiltered(selector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevAll, nil, nil), compileMatcher(selector)) } // PrevAllMatcher gets all the preceding siblings of each element in the // Selection filtered by a matcher. It returns a new Selection object // containing the matched elements. func (s *Selection) PrevAllMatcher(m Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevAll, nil, nil), m) } // NextUntil gets all following siblings of each element up to but not // including the element matched by the selector. It returns a new Selection // object containing the matched elements. func (s *Selection) NextUntil(selector string) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingNextUntil, compileMatcher(selector), nil)) } // NextUntilMatcher gets all following siblings of each element up to but not // including the element matched by the matcher. It returns a new Selection // object containing the matched elements. func (s *Selection) NextUntilMatcher(m Matcher) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingNextUntil, m, nil)) } // NextUntilSelection gets all following siblings of each element up to but not // including the element matched by the Selection. It returns a new Selection // object containing the matched elements. func (s *Selection) NextUntilSelection(sel *Selection) *Selection { if sel == nil { return s.NextAll() } return s.NextUntilNodes(sel.Nodes...) } // NextUntilNodes gets all following siblings of each element up to but not // including the element matched by the nodes. It returns a new Selection // object containing the matched elements. func (s *Selection) NextUntilNodes(nodes ...*html.Node) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingNextUntil, nil, nodes)) } // PrevUntil gets all preceding siblings of each element up to but not // including the element matched by the selector. It returns a new Selection // object containing the matched elements. func (s *Selection) PrevUntil(selector string) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingPrevUntil, compileMatcher(selector), nil)) } // PrevUntilMatcher gets all preceding siblings of each element up to but not // including the element matched by the matcher. It returns a new Selection // object containing the matched elements. func (s *Selection) PrevUntilMatcher(m Matcher) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingPrevUntil, m, nil)) } // PrevUntilSelection gets all preceding siblings of each element up to but not // including the element matched by the Selection. It returns a new Selection // object containing the matched elements. func (s *Selection) PrevUntilSelection(sel *Selection) *Selection { if sel == nil { return s.PrevAll() } return s.PrevUntilNodes(sel.Nodes...) } // PrevUntilNodes gets all preceding siblings of each element up to but not // including the element matched by the nodes. It returns a new Selection // object containing the matched elements. func (s *Selection) PrevUntilNodes(nodes ...*html.Node) *Selection { return pushStack(s, getSiblingNodes(s.Nodes, siblingPrevUntil, nil, nodes)) } // NextFilteredUntil is like NextUntil, with the option to filter // the results based on a selector string. // It returns a new Selection object containing the matched elements. func (s *Selection) NextFilteredUntil(filterSelector, untilSelector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextUntil, compileMatcher(untilSelector), nil), compileMatcher(filterSelector)) } // NextFilteredUntilMatcher is like NextUntilMatcher, with the option to filter // the results based on a matcher. // It returns a new Selection object containing the matched elements. func (s *Selection) NextFilteredUntilMatcher(filter, until Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextUntil, until, nil), filter) } // NextFilteredUntilSelection is like NextUntilSelection, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) NextFilteredUntilSelection(filterSelector string, sel *Selection) *Selection { return s.NextMatcherUntilSelection(compileMatcher(filterSelector), sel) } // NextMatcherUntilSelection is like NextUntilSelection, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) NextMatcherUntilSelection(filter Matcher, sel *Selection) *Selection { if sel == nil { return s.NextMatcher(filter) } return s.NextMatcherUntilNodes(filter, sel.Nodes...) } // NextFilteredUntilNodes is like NextUntilNodes, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) NextFilteredUntilNodes(filterSelector string, nodes ...*html.Node) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextUntil, nil, nodes), compileMatcher(filterSelector)) } // NextMatcherUntilNodes is like NextUntilNodes, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) NextMatcherUntilNodes(filter Matcher, nodes ...*html.Node) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingNextUntil, nil, nodes), filter) } // PrevFilteredUntil is like PrevUntil, with the option to filter // the results based on a selector string. // It returns a new Selection object containing the matched elements. func (s *Selection) PrevFilteredUntil(filterSelector, untilSelector string) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevUntil, compileMatcher(untilSelector), nil), compileMatcher(filterSelector)) } // PrevFilteredUntilMatcher is like PrevUntilMatcher, with the option to filter // the results based on a matcher. // It returns a new Selection object containing the matched elements. func (s *Selection) PrevFilteredUntilMatcher(filter, until Matcher) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevUntil, until, nil), filter) } // PrevFilteredUntilSelection is like PrevUntilSelection, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) PrevFilteredUntilSelection(filterSelector string, sel *Selection) *Selection { return s.PrevMatcherUntilSelection(compileMatcher(filterSelector), sel) } // PrevMatcherUntilSelection is like PrevUntilSelection, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) PrevMatcherUntilSelection(filter Matcher, sel *Selection) *Selection { if sel == nil { return s.PrevMatcher(filter) } return s.PrevMatcherUntilNodes(filter, sel.Nodes...) } // PrevFilteredUntilNodes is like PrevUntilNodes, with the // option to filter the results based on a selector string. It returns a new // Selection object containing the matched elements. func (s *Selection) PrevFilteredUntilNodes(filterSelector string, nodes ...*html.Node) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevUntil, nil, nodes), compileMatcher(filterSelector)) } // PrevMatcherUntilNodes is like PrevUntilNodes, with the // option to filter the results based on a matcher. It returns a new // Selection object containing the matched elements. func (s *Selection) PrevMatcherUntilNodes(filter Matcher, nodes ...*html.Node) *Selection { return filterAndPush(s, getSiblingNodes(s.Nodes, siblingPrevUntil, nil, nodes), filter) } // Filter and push filters the nodes based on a matcher, and pushes the results // on the stack, with the srcSel as previous selection. func filterAndPush(srcSel *Selection, nodes []*html.Node, m Matcher) *Selection { // Create a temporary Selection with the specified nodes to filter using winnow sel := &Selection{nodes, srcSel.document, nil} // Filter based on matcher and push on stack return pushStack(srcSel, winnow(sel, m, true)) } // Internal implementation of Find that return raw nodes. func findWithMatcher(nodes []*html.Node, m Matcher) []*html.Node { // Map nodes to find the matches within the children of each node return mapNodes(nodes, func(i int, n *html.Node) (result []*html.Node) { // Go down one level, becausejQuery's Find selects only within descendants for c := n.FirstChild; c != nil; c = c.NextSibling { if c.Type == html.ElementNode { result = append(result, m.MatchAll(c)...) } } return }) } // Internal implementation to get all parent nodes, stopping at the specified // node (or nil if no stop). func getParentsNodes(nodes []*html.Node, stopm Matcher, stopNodes []*html.Node) []*html.Node { return mapNodes(nodes, func(i int, n *html.Node) (result []*html.Node) { for p := n.Parent; p != nil; p = p.Parent { sel := newSingleSelection(p, nil) if stopm != nil { if sel.IsMatcher(stopm) { break } } else if len(stopNodes) > 0 { if sel.IsNodes(stopNodes...) { break } } if p.Type == html.ElementNode { result = append(result, p) } } return }) } // Internal implementation of sibling nodes that return a raw slice of matches. func getSiblingNodes(nodes []*html.Node, st siblingType, untilm Matcher, untilNodes []*html.Node) []*html.Node { var f func(*html.Node) bool // If the requested siblings are ...Until, create the test function to // determine if the until condition is reached (returns true if it is) if st == siblingNextUntil || st == siblingPrevUntil { f = func(n *html.Node) bool { if untilm != nil { // Matcher-based condition sel := newSingleSelection(n, nil) return sel.IsMatcher(untilm) } else if len(untilNodes) > 0 { // Nodes-based condition sel := newSingleSelection(n, nil) return sel.IsNodes(untilNodes...) } return false } } return mapNodes(nodes, func(i int, n *html.Node) []*html.Node { return getChildrenWithSiblingType(n.Parent, st, n, f) }) } // Gets the children nodes of each node in the specified slice of nodes, // based on the sibling type request. func getChildrenNodes(nodes []*html.Node, st siblingType) []*html.Node { return mapNodes(nodes, func(i int, n *html.Node) []*html.Node { return getChildrenWithSiblingType(n, st, nil, nil) }) } // Gets the children of the specified parent, based on the requested sibling // type, skipping a specified node if required. func getChildrenWithSiblingType(parent *html.Node, st siblingType, skipNode *html.Node, untilFunc func(*html.Node) bool) (result []*html.Node) { // Create the iterator function var iter = func(cur *html.Node) (ret *html.Node) { // Based on the sibling type requested, iterate the right way for { switch st { case siblingAll, siblingAllIncludingNonElements: if cur == nil { // First iteration, start with first child of parent // Skip node if required if ret = parent.FirstChild; ret == skipNode && skipNode != nil { ret = skipNode.NextSibling } } else { // Skip node if required if ret = cur.NextSibling; ret == skipNode && skipNode != nil { ret = skipNode.NextSibling } } case siblingPrev, siblingPrevAll, siblingPrevUntil: if cur == nil { // Start with previous sibling of the skip node ret = skipNode.PrevSibling } else { ret = cur.PrevSibling } case siblingNext, siblingNextAll, siblingNextUntil: if cur == nil { // Start with next sibling of the skip node ret = skipNode.NextSibling } else { ret = cur.NextSibling } default: panic("Invalid sibling type.") } if ret == nil || ret.Type == html.ElementNode || st == siblingAllIncludingNonElements { return } // Not a valid node, try again from this one cur = ret } } for c := iter(nil); c != nil; c = iter(c) { // If this is an ...Until case, test before append (returns true // if the until condition is reached) if st == siblingNextUntil || st == siblingPrevUntil { if untilFunc(c) { return } } result = append(result, c) if st == siblingNext || st == siblingPrev { // Only one node was requested (immediate next or previous), so exit return } } return } // Internal implementation of parent nodes that return a raw slice of Nodes. func getParentNodes(nodes []*html.Node) []*html.Node { return mapNodes(nodes, func(i int, n *html.Node) []*html.Node { if n.Parent != nil && n.Parent.Type == html.ElementNode { return []*html.Node{n.Parent} } return nil }) } // Internal map function used by many traversing methods. Takes the source nodes // to iterate on and the mapping function that returns an array of nodes. // Returns an array of nodes mapped by calling the callback function once for // each node in the source nodes. func mapNodes(nodes []*html.Node, f func(int, *html.Node) []*html.Node) (result []*html.Node) { set := make(map[*html.Node]bool) for i, n := range nodes { if vals := f(i, n); len(vals) > 0 { result = appendWithoutDuplicates(result, vals, set) } } return result } goquery-1.8.1/traversal_test.go000066400000000000000000000506071437416732600166320ustar00rootroot00000000000000package goquery import ( "strings" "testing" ) func TestFind(t *testing.T) { sel := Doc().Find("div.row-fluid") assertLength(t, sel.Nodes, 9) } func TestFindRollback(t *testing.T) { sel := Doc().Find("div.row-fluid") sel2 := sel.Find("a").End() assertEqual(t, sel, sel2) } func TestFindNotSelf(t *testing.T) { sel := Doc().Find("h1").Find("h1") assertLength(t, sel.Nodes, 0) } func TestFindInvalid(t *testing.T) { sel := Doc().Find(":+ ^") assertLength(t, sel.Nodes, 0) } func TestFindBig(t *testing.T) { doc := DocW() sel := doc.Find("li") assertLength(t, sel.Nodes, 373) sel2 := doc.Find("span") assertLength(t, sel2.Nodes, 448) sel3 := sel.FindSelection(sel2) assertLength(t, sel3.Nodes, 248) } func TestChainedFind(t *testing.T) { sel := Doc().Find("div.hero-unit").Find(".row-fluid") assertLength(t, sel.Nodes, 4) } func TestChainedFindInvalid(t *testing.T) { sel := Doc().Find("div.hero-unit").Find("") assertLength(t, sel.Nodes, 0) } func TestChildren(t *testing.T) { sel := Doc().Find(".pvk-content").Children() assertLength(t, sel.Nodes, 5) } func TestChildrenRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Children().End() assertEqual(t, sel, sel2) } func TestContents(t *testing.T) { sel := Doc().Find(".pvk-content").Contents() assertLength(t, sel.Nodes, 13) } func TestContentsRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.Contents().End() assertEqual(t, sel, sel2) } func TestChildrenFiltered(t *testing.T) { sel := Doc().Find(".pvk-content").ChildrenFiltered(".hero-unit") assertLength(t, sel.Nodes, 1) } func TestChildrenFilteredInvalid(t *testing.T) { sel := Doc().Find(".pvk-content").ChildrenFiltered("") assertLength(t, sel.Nodes, 0) } func TestChildrenFilteredRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.ChildrenFiltered(".hero-unit").End() assertEqual(t, sel, sel2) } func TestContentsFiltered(t *testing.T) { sel := Doc().Find(".pvk-content").ContentsFiltered(".hero-unit") assertLength(t, sel.Nodes, 1) } func TestContentsFilteredInvalid(t *testing.T) { sel := Doc().Find(".pvk-content").ContentsFiltered("~") assertLength(t, sel.Nodes, 0) } func TestContentsFilteredRollback(t *testing.T) { sel := Doc().Find(".pvk-content") sel2 := sel.ContentsFiltered(".hero-unit").End() assertEqual(t, sel, sel2) } func TestChildrenFilteredNone(t *testing.T) { sel := Doc().Find(".pvk-content").ChildrenFiltered("a.btn") assertLength(t, sel.Nodes, 0) } func TestParent(t *testing.T) { sel := Doc().Find(".container-fluid").Parent() assertLength(t, sel.Nodes, 3) } func TestParentRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.Parent().End() assertEqual(t, sel, sel2) } func TestParentBody(t *testing.T) { sel := Doc().Find("body").Parent() assertLength(t, sel.Nodes, 1) } func TestParentFiltered(t *testing.T) { sel := Doc().Find(".container-fluid").ParentFiltered(".hero-unit") assertLength(t, sel.Nodes, 1) assertClass(t, sel, "hero-unit") } func TestParentFilteredInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").ParentFiltered("") assertLength(t, sel.Nodes, 0) } func TestParentFilteredRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ParentFiltered(".hero-unit").End() assertEqual(t, sel, sel2) } func TestParents(t *testing.T) { sel := Doc().Find(".container-fluid").Parents() assertLength(t, sel.Nodes, 8) } func TestParentsOrder(t *testing.T) { sel := Doc().Find("#cf2").Parents() assertLength(t, sel.Nodes, 6) assertSelectionIs(t, sel, ".hero-unit", ".pvk-content", "div.row-fluid", "#cf1", "body", "html") } func TestParentsRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.Parents().End() assertEqual(t, sel, sel2) } func TestParentsFiltered(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsFiltered("body") assertLength(t, sel.Nodes, 1) } func TestParentsFilteredInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsFiltered("") assertLength(t, sel.Nodes, 0) } func TestParentsFilteredRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ParentsFiltered("body").End() assertEqual(t, sel, sel2) } func TestParentsUntil(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsUntil("body") assertLength(t, sel.Nodes, 6) } func TestParentsUntilInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsUntil("") assertLength(t, sel.Nodes, 8) } func TestParentsUntilRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ParentsUntil("body").End() assertEqual(t, sel, sel2) } func TestParentsUntilSelection(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".pvk-content") sel = sel.ParentsUntilSelection(sel2) assertLength(t, sel.Nodes, 3) } func TestParentsUntilSelectionRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".pvk-content") sel2 = sel.ParentsUntilSelection(sel2).End() assertEqual(t, sel, sel2) } func TestParentsUntilNodes(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".pvk-content, .hero-unit") sel = sel.ParentsUntilNodes(sel2.Nodes...) assertLength(t, sel.Nodes, 2) } func TestParentsUntilNodesRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".pvk-content, .hero-unit") sel2 = sel.ParentsUntilNodes(sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestParentsFilteredUntil(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsFilteredUntil(".pvk-content", "body") assertLength(t, sel.Nodes, 2) } func TestParentsFilteredUntilInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").ParentsFilteredUntil("", "") assertLength(t, sel.Nodes, 0) } func TestParentsFilteredUntilRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ParentsFilteredUntil(".pvk-content", "body").End() assertEqual(t, sel, sel2) } func TestParentsFilteredUntilSelection(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".row-fluid") sel = sel.ParentsFilteredUntilSelection("div", sel2) assertLength(t, sel.Nodes, 3) } func TestParentsFilteredUntilSelectionRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".row-fluid") sel2 = sel.ParentsFilteredUntilSelection("div", sel2).End() assertEqual(t, sel, sel2) } func TestParentsFilteredUntilNodes(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".row-fluid") sel = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...) assertLength(t, sel.Nodes, 1) } func TestParentsFilteredUntilNodesRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := Doc().Find(".row-fluid") sel2 = sel.ParentsFilteredUntilNodes("body", sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestSiblings(t *testing.T) { sel := Doc().Find("h1").Siblings() assertLength(t, sel.Nodes, 1) } func TestSiblingsRollback(t *testing.T) { sel := Doc().Find("h1") sel2 := sel.Siblings().End() assertEqual(t, sel, sel2) } func TestSiblings2(t *testing.T) { sel := Doc().Find(".pvk-gutter").Siblings() assertLength(t, sel.Nodes, 9) } func TestSiblings3(t *testing.T) { sel := Doc().Find("body>.container-fluid").Siblings() assertLength(t, sel.Nodes, 0) } func TestSiblingsFiltered(t *testing.T) { sel := Doc().Find(".pvk-gutter").SiblingsFiltered(".pvk-content") assertLength(t, sel.Nodes, 3) } func TestSiblingsFilteredInvalid(t *testing.T) { sel := Doc().Find(".pvk-gutter").SiblingsFiltered("") assertLength(t, sel.Nodes, 0) } func TestSiblingsFilteredRollback(t *testing.T) { sel := Doc().Find(".pvk-gutter") sel2 := sel.SiblingsFiltered(".pvk-content").End() assertEqual(t, sel, sel2) } func TestNext(t *testing.T) { sel := Doc().Find("h1").Next() assertLength(t, sel.Nodes, 1) } func TestNextRollback(t *testing.T) { sel := Doc().Find("h1") sel2 := sel.Next().End() assertEqual(t, sel, sel2) } func TestNext2(t *testing.T) { sel := Doc().Find(".close").Next() assertLength(t, sel.Nodes, 1) } func TestNextNone(t *testing.T) { sel := Doc().Find("small").Next() assertLength(t, sel.Nodes, 0) } func TestNextFiltered(t *testing.T) { sel := Doc().Find(".container-fluid").NextFiltered("div") assertLength(t, sel.Nodes, 2) } func TestNextFilteredInvalid(t *testing.T) { sel := Doc().Find(".container-fluid").NextFiltered("") assertLength(t, sel.Nodes, 0) } func TestNextFilteredRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.NextFiltered("div").End() assertEqual(t, sel, sel2) } func TestNextFiltered2(t *testing.T) { sel := Doc().Find(".container-fluid").NextFiltered("[ng-view]") assertLength(t, sel.Nodes, 1) } func TestPrev(t *testing.T) { sel := Doc().Find(".red").Prev() assertLength(t, sel.Nodes, 1) assertClass(t, sel, "green") } func TestPrevRollback(t *testing.T) { sel := Doc().Find(".red") sel2 := sel.Prev().End() assertEqual(t, sel, sel2) } func TestPrev2(t *testing.T) { sel := Doc().Find(".row-fluid").Prev() assertLength(t, sel.Nodes, 5) } func TestPrevNone(t *testing.T) { sel := Doc().Find("h2").Prev() assertLength(t, sel.Nodes, 0) } func TestPrevFiltered(t *testing.T) { sel := Doc().Find(".row-fluid").PrevFiltered(".row-fluid") assertLength(t, sel.Nodes, 5) } func TestPrevFilteredInvalid(t *testing.T) { sel := Doc().Find(".row-fluid").PrevFiltered("") assertLength(t, sel.Nodes, 0) } func TestPrevFilteredRollback(t *testing.T) { sel := Doc().Find(".row-fluid") sel2 := sel.PrevFiltered(".row-fluid").End() assertEqual(t, sel, sel2) } func TestNextAll(t *testing.T) { sel := Doc().Find("#cf2 div:nth-child(1)").NextAll() assertLength(t, sel.Nodes, 3) } func TestNextAllRollback(t *testing.T) { sel := Doc().Find("#cf2 div:nth-child(1)") sel2 := sel.NextAll().End() assertEqual(t, sel, sel2) } func TestNextAll2(t *testing.T) { sel := Doc().Find("div[ng-cloak]").NextAll() assertLength(t, sel.Nodes, 1) } func TestNextAllNone(t *testing.T) { sel := Doc().Find(".footer").NextAll() assertLength(t, sel.Nodes, 0) } func TestNextAllFiltered(t *testing.T) { sel := Doc().Find("#cf2 .row-fluid").NextAllFiltered("[ng-cloak]") assertLength(t, sel.Nodes, 2) } func TestNextAllFilteredInvalid(t *testing.T) { sel := Doc().Find("#cf2 .row-fluid").NextAllFiltered("") assertLength(t, sel.Nodes, 0) } func TestNextAllFilteredRollback(t *testing.T) { sel := Doc().Find("#cf2 .row-fluid") sel2 := sel.NextAllFiltered("[ng-cloak]").End() assertEqual(t, sel, sel2) } func TestNextAllFiltered2(t *testing.T) { sel := Doc().Find(".close").NextAllFiltered("h4") assertLength(t, sel.Nodes, 1) } func TestPrevAll(t *testing.T) { sel := Doc().Find("[ng-view]").PrevAll() assertLength(t, sel.Nodes, 2) } func TestPrevAllOrder(t *testing.T) { sel := Doc().Find("[ng-view]").PrevAll() assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#cf4", "#cf3") } func TestPrevAllRollback(t *testing.T) { sel := Doc().Find("[ng-view]") sel2 := sel.PrevAll().End() assertEqual(t, sel, sel2) } func TestPrevAll2(t *testing.T) { sel := Doc().Find(".pvk-gutter").PrevAll() assertLength(t, sel.Nodes, 6) } func TestPrevAllFiltered(t *testing.T) { sel := Doc().Find(".pvk-gutter").PrevAllFiltered(".pvk-content") assertLength(t, sel.Nodes, 3) } func TestPrevAllFilteredInvalid(t *testing.T) { sel := Doc().Find(".pvk-gutter").PrevAllFiltered("") assertLength(t, sel.Nodes, 0) } func TestPrevAllFilteredRollback(t *testing.T) { sel := Doc().Find(".pvk-gutter") sel2 := sel.PrevAllFiltered(".pvk-content").End() assertEqual(t, sel, sel2) } func TestNextUntil(t *testing.T) { sel := Doc().Find(".alert a").NextUntil("p") assertLength(t, sel.Nodes, 1) assertSelectionIs(t, sel, "h4") } func TestNextUntilInvalid(t *testing.T) { sel := Doc().Find(".alert a").NextUntil("") assertLength(t, sel.Nodes, 2) } func TestNextUntil2(t *testing.T) { sel := Doc().Find("#cf2-1").NextUntil("[ng-cloak]") assertLength(t, sel.Nodes, 1) assertSelectionIs(t, sel, "#cf2-2") } func TestNextUntilOrder(t *testing.T) { sel := Doc().Find("#cf2-1").NextUntil("#cf2-4") assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#cf2-2", "#cf2-3") } func TestNextUntilRollback(t *testing.T) { sel := Doc().Find("#cf2-1") sel2 := sel.PrevUntil("#cf2-4").End() assertEqual(t, sel, sel2) } func TestNextUntilSelection(t *testing.T) { sel := Doc2().Find("#n2") sel2 := Doc2().Find("#n4") sel2 = sel.NextUntilSelection(sel2) assertLength(t, sel2.Nodes, 1) assertSelectionIs(t, sel2, "#n3") } func TestNextUntilSelectionRollback(t *testing.T) { sel := Doc2().Find("#n2") sel2 := Doc2().Find("#n4") sel2 = sel.NextUntilSelection(sel2).End() assertEqual(t, sel, sel2) } func TestNextUntilNodes(t *testing.T) { sel := Doc2().Find("#n2") sel2 := Doc2().Find("#n5") sel2 = sel.NextUntilNodes(sel2.Nodes...) assertLength(t, sel2.Nodes, 2) assertSelectionIs(t, sel2, "#n3", "#n4") } func TestNextUntilNodesRollback(t *testing.T) { sel := Doc2().Find("#n2") sel2 := Doc2().Find("#n5") sel2 = sel.NextUntilNodes(sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestPrevUntil(t *testing.T) { sel := Doc().Find(".alert p").PrevUntil("a") assertLength(t, sel.Nodes, 1) assertSelectionIs(t, sel, "h4") } func TestPrevUntilInvalid(t *testing.T) { sel := Doc().Find(".alert p").PrevUntil("") assertLength(t, sel.Nodes, 2) } func TestPrevUntil2(t *testing.T) { sel := Doc().Find("[ng-cloak]").PrevUntil(":not([ng-cloak])") assertLength(t, sel.Nodes, 1) assertSelectionIs(t, sel, "[ng-cloak]") } func TestPrevUntilOrder(t *testing.T) { sel := Doc().Find("#cf2-4").PrevUntil("#cf2-1") assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#cf2-3", "#cf2-2") } func TestPrevUntilRollback(t *testing.T) { sel := Doc().Find("#cf2-4") sel2 := sel.PrevUntil("#cf2-1").End() assertEqual(t, sel, sel2) } func TestPrevUntilSelection(t *testing.T) { sel := Doc2().Find("#n4") sel2 := Doc2().Find("#n2") sel2 = sel.PrevUntilSelection(sel2) assertLength(t, sel2.Nodes, 1) assertSelectionIs(t, sel2, "#n3") } func TestPrevUntilSelectionRollback(t *testing.T) { sel := Doc2().Find("#n4") sel2 := Doc2().Find("#n2") sel2 = sel.PrevUntilSelection(sel2).End() assertEqual(t, sel, sel2) } func TestPrevUntilNodes(t *testing.T) { sel := Doc2().Find("#n5") sel2 := Doc2().Find("#n2") sel2 = sel.PrevUntilNodes(sel2.Nodes...) assertLength(t, sel2.Nodes, 2) assertSelectionIs(t, sel2, "#n4", "#n3") } func TestPrevUntilNodesRollback(t *testing.T) { sel := Doc2().Find("#n5") sel2 := Doc2().Find("#n2") sel2 = sel.PrevUntilNodes(sel2.Nodes...).End() assertEqual(t, sel, sel2) } func TestNextFilteredUntil(t *testing.T) { sel := Doc2().Find(".two").NextFilteredUntil(".even", ".six") assertLength(t, sel.Nodes, 4) assertSelectionIs(t, sel, "#n3", "#n5", "#nf3", "#nf5") } func TestNextFilteredUntilInvalid(t *testing.T) { sel := Doc2().Find(".two").NextFilteredUntil("", "") assertLength(t, sel.Nodes, 0) } func TestNextFilteredUntilRollback(t *testing.T) { sel := Doc2().Find(".two") sel2 := sel.NextFilteredUntil(".even", ".six").End() assertEqual(t, sel, sel2) } func TestNextFilteredUntilSelection(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".five") sel = sel.NextFilteredUntilSelection(".even", sel2) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#n3", "#nf3") } func TestNextFilteredUntilSelectionRollback(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".five") sel3 := sel.NextFilteredUntilSelection(".even", sel2).End() assertEqual(t, sel, sel3) } func TestNextFilteredUntilNodes(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".four") sel = sel.NextFilteredUntilNodes(".odd", sel2.Nodes...) assertLength(t, sel.Nodes, 4) assertSelectionIs(t, sel, "#n2", "#n6", "#nf2", "#nf6") } func TestNextFilteredUntilNodesRollback(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".four") sel3 := sel.NextFilteredUntilNodes(".odd", sel2.Nodes...).End() assertEqual(t, sel, sel3) } func TestPrevFilteredUntil(t *testing.T) { sel := Doc2().Find(".five").PrevFilteredUntil(".odd", ".one") assertLength(t, sel.Nodes, 4) assertSelectionIs(t, sel, "#n4", "#n2", "#nf4", "#nf2") } func TestPrevFilteredUntilInvalid(t *testing.T) { sel := Doc2().Find(".five").PrevFilteredUntil("", "") assertLength(t, sel.Nodes, 0) } func TestPrevFilteredUntilRollback(t *testing.T) { sel := Doc2().Find(".four") sel2 := sel.PrevFilteredUntil(".odd", ".one").End() assertEqual(t, sel, sel2) } func TestPrevFilteredUntilSelection(t *testing.T) { sel := Doc2().Find(".odd") sel2 := Doc2().Find(".two") sel = sel.PrevFilteredUntilSelection(".odd", sel2) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#n4", "#nf4") } func TestPrevFilteredUntilSelectionRollback(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".five") sel3 := sel.PrevFilteredUntilSelection(".even", sel2).End() assertEqual(t, sel, sel3) } func TestPrevFilteredUntilNodes(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".four") sel = sel.PrevFilteredUntilNodes(".odd", sel2.Nodes...) assertLength(t, sel.Nodes, 2) assertSelectionIs(t, sel, "#n2", "#nf2") } func TestPrevFilteredUntilNodesRollback(t *testing.T) { sel := Doc2().Find(".even") sel2 := Doc2().Find(".four") sel3 := sel.PrevFilteredUntilNodes(".odd", sel2.Nodes...).End() assertEqual(t, sel, sel3) } func TestClosestItself(t *testing.T) { sel := Doc2().Find(".three") sel2 := sel.Closest(".row") assertLength(t, sel2.Nodes, sel.Length()) assertSelectionIs(t, sel2, "#n3", "#nf3") } func TestClosestNoDupes(t *testing.T) { sel := Doc().Find(".span12") sel2 := sel.Closest(".pvk-content") assertLength(t, sel2.Nodes, 1) assertClass(t, sel2, "pvk-content") } func TestClosestNone(t *testing.T) { sel := Doc().Find("h4") sel2 := sel.Closest("a") assertLength(t, sel2.Nodes, 0) } func TestClosestInvalid(t *testing.T) { sel := Doc().Find("h4") sel2 := sel.Closest("") assertLength(t, sel2.Nodes, 0) } func TestClosestMany(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.Closest(".pvk-content") assertLength(t, sel2.Nodes, 2) assertSelectionIs(t, sel2, "#pc1", "#pc2") } func TestClosestRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.Closest(".pvk-content").End() assertEqual(t, sel, sel2) } func TestClosestSelectionItself(t *testing.T) { sel := Doc2().Find(".three") sel2 := sel.ClosestSelection(Doc2().Find(".row")) assertLength(t, sel2.Nodes, sel.Length()) } func TestClosestSelectionNoDupes(t *testing.T) { sel := Doc().Find(".span12") sel2 := sel.ClosestSelection(Doc().Find(".pvk-content")) assertLength(t, sel2.Nodes, 1) assertClass(t, sel2, "pvk-content") } func TestClosestSelectionNone(t *testing.T) { sel := Doc().Find("h4") sel2 := sel.ClosestSelection(Doc().Find("a")) assertLength(t, sel2.Nodes, 0) } func TestClosestSelectionMany(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ClosestSelection(Doc().Find(".pvk-content")) assertLength(t, sel2.Nodes, 2) assertSelectionIs(t, sel2, "#pc1", "#pc2") } func TestClosestSelectionRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ClosestSelection(Doc().Find(".pvk-content")).End() assertEqual(t, sel, sel2) } func TestClosestNodesItself(t *testing.T) { sel := Doc2().Find(".three") sel2 := sel.ClosestNodes(Doc2().Find(".row").Nodes...) assertLength(t, sel2.Nodes, sel.Length()) } func TestClosestNodesNoDupes(t *testing.T) { sel := Doc().Find(".span12") sel2 := sel.ClosestNodes(Doc().Find(".pvk-content").Nodes...) assertLength(t, sel2.Nodes, 1) assertClass(t, sel2, "pvk-content") } func TestClosestNodesNone(t *testing.T) { sel := Doc().Find("h4") sel2 := sel.ClosestNodes(Doc().Find("a").Nodes...) assertLength(t, sel2.Nodes, 0) } func TestClosestNodesMany(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ClosestNodes(Doc().Find(".pvk-content").Nodes...) assertLength(t, sel2.Nodes, 2) assertSelectionIs(t, sel2, "#pc1", "#pc2") } func TestClosestNodesRollback(t *testing.T) { sel := Doc().Find(".container-fluid") sel2 := sel.ClosestNodes(Doc().Find(".pvk-content").Nodes...).End() assertEqual(t, sel, sel2) } func TestIssue26(t *testing.T) { img1 := `150x150` img2 := `150x150` cases := []struct { s string l int }{ {s: img1 + img2, l: 2}, {s: img1, l: 1}, {s: img2, l: 1}, } for _, c := range cases { doc, err := NewDocumentFromReader(strings.NewReader(c.s)) if err != nil { t.Fatal(err) } sel := doc.Find("img[src]") assertLength(t, sel.Nodes, c.l) } } goquery-1.8.1/type.go000066400000000000000000000147131437416732600145470ustar00rootroot00000000000000package goquery import ( "errors" "io" "net/http" "net/url" "github.com/andybalholm/cascadia" "golang.org/x/net/html" ) // Document represents an HTML document to be manipulated. Unlike jQuery, which // is loaded as part of a DOM document, and thus acts upon its containing // document, GoQuery doesn't know which HTML document to act upon. So it needs // to be told, and that's what the Document class is for. It holds the root // document node to manipulate, and can make selections on this document. type Document struct { *Selection Url *url.URL rootNode *html.Node } // NewDocumentFromNode is a Document constructor that takes a root html Node // as argument. func NewDocumentFromNode(root *html.Node) *Document { return newDocument(root, nil) } // NewDocument is a Document constructor that takes a string URL as argument. // It loads the specified document, parses it, and stores the root Document // node, ready to be manipulated. // // Deprecated: Use the net/http standard library package to make the request // and validate the response before calling goquery.NewDocumentFromReader // with the response's body. func NewDocument(url string) (*Document, error) { // Load the URL res, e := http.Get(url) if e != nil { return nil, e } return NewDocumentFromResponse(res) } // NewDocumentFromReader returns a Document from an io.Reader. // It returns an error as second value if the reader's data cannot be parsed // as html. It does not check if the reader is also an io.Closer, the // provided reader is never closed by this call. It is the responsibility // of the caller to close it if required. func NewDocumentFromReader(r io.Reader) (*Document, error) { root, e := html.Parse(r) if e != nil { return nil, e } return newDocument(root, nil), nil } // NewDocumentFromResponse is another Document constructor that takes an http response as argument. // It loads the specified response's document, parses it, and stores the root Document // node, ready to be manipulated. The response's body is closed on return. // // Deprecated: Use goquery.NewDocumentFromReader with the response's body. func NewDocumentFromResponse(res *http.Response) (*Document, error) { if res == nil { return nil, errors.New("Response is nil") } defer res.Body.Close() if res.Request == nil { return nil, errors.New("Response.Request is nil") } // Parse the HTML into nodes root, e := html.Parse(res.Body) if e != nil { return nil, e } // Create and fill the document return newDocument(root, res.Request.URL), nil } // CloneDocument creates a deep-clone of a document. func CloneDocument(doc *Document) *Document { return newDocument(cloneNode(doc.rootNode), doc.Url) } // Private constructor, make sure all fields are correctly filled. func newDocument(root *html.Node, url *url.URL) *Document { // Create and fill the document d := &Document{nil, url, root} d.Selection = newSingleSelection(root, d) return d } // Selection represents a collection of nodes matching some criteria. The // initial Selection can be created by using Document.Find, and then // manipulated using the jQuery-like chainable syntax and methods. type Selection struct { Nodes []*html.Node document *Document prevSel *Selection } // Helper constructor to create an empty selection func newEmptySelection(doc *Document) *Selection { return &Selection{nil, doc, nil} } // Helper constructor to create a selection of only one node func newSingleSelection(node *html.Node, doc *Document) *Selection { return &Selection{[]*html.Node{node}, doc, nil} } // Matcher is an interface that defines the methods to match // HTML nodes against a compiled selector string. Cascadia's // Selector implements this interface. type Matcher interface { Match(*html.Node) bool MatchAll(*html.Node) []*html.Node Filter([]*html.Node) []*html.Node } // Single compiles a selector string to a Matcher that stops after the first // match is found. // // By default, Selection.Find and other functions that accept a selector string // to select nodes will use all matches corresponding to that selector. By // using the Matcher returned by Single, at most the first match will be // selected. // // For example, those two statements are semantically equivalent: // // sel1 := doc.Find("a").First() // sel2 := doc.FindMatcher(goquery.Single("a")) // // The one using Single is optimized to be potentially much faster on large // documents. // // Only the behaviour of the MatchAll method of the Matcher interface is // altered compared to standard Matchers. This means that the single-selection // property of the Matcher only applies for Selection methods where the Matcher // is used to select nodes, not to filter or check if a node matches the // Matcher - in those cases, the behaviour of the Matcher is unchanged (e.g. // FilterMatcher(Single("div")) will still result in a Selection with multiple // "div"s if there were many "div"s in the Selection to begin with). func Single(selector string) Matcher { return singleMatcher{compileMatcher(selector)} } // SingleMatcher returns a Matcher matches the same nodes as m, but that stops // after the first match is found. // // See the documentation of function Single for more details. func SingleMatcher(m Matcher) Matcher { if _, ok := m.(singleMatcher); ok { // m is already a singleMatcher return m } return singleMatcher{m} } // compileMatcher compiles the selector string s and returns // the corresponding Matcher. If s is an invalid selector string, // it returns a Matcher that fails all matches. func compileMatcher(s string) Matcher { cs, err := cascadia.Compile(s) if err != nil { return invalidMatcher{} } return cs } type singleMatcher struct { Matcher } func (m singleMatcher) MatchAll(n *html.Node) []*html.Node { // Optimized version - stops finding at the first match (cascadia-compiled // matchers all use this code path). if mm, ok := m.Matcher.(interface{ MatchFirst(*html.Node) *html.Node }); ok { node := mm.MatchFirst(n) if node == nil { return nil } return []*html.Node{node} } // Fallback version, for e.g. test mocks that don't provide the MatchFirst // method. nodes := m.Matcher.MatchAll(n) if len(nodes) > 0 { return nodes[:1:1] } return nil } // invalidMatcher is a Matcher that always fails to match. type invalidMatcher struct{} func (invalidMatcher) Match(n *html.Node) bool { return false } func (invalidMatcher) MatchAll(n *html.Node) []*html.Node { return nil } func (invalidMatcher) Filter(ns []*html.Node) []*html.Node { return nil } goquery-1.8.1/type_test.go000066400000000000000000000116121437416732600156010ustar00rootroot00000000000000package goquery import ( "bytes" "fmt" "os" "strings" "testing" "github.com/andybalholm/cascadia" "golang.org/x/net/html" ) // Test helper functions and members var doc *Document var doc2 *Document var doc3 *Document var docB *Document var docW *Document func Doc() *Document { if doc == nil { doc = loadDoc("page.html") } return doc } func Doc2() *Document { if doc2 == nil { doc2 = loadDoc("page2.html") } return doc2 } func Doc2Clone() *Document { return CloneDocument(Doc2()) } func Doc3() *Document { if doc3 == nil { doc3 = loadDoc("page3.html") } return doc3 } func Doc3Clone() *Document { return CloneDocument(Doc3()) } func DocB() *Document { if docB == nil { docB = loadDoc("gotesting.html") } return docB } func DocW() *Document { if docW == nil { docW = loadDoc("gowiki.html") } return docW } func assertLength(t *testing.T, nodes []*html.Node, length int) { if len(nodes) != length { t.Errorf("Expected %d nodes, found %d.", length, len(nodes)) for i, n := range nodes { t.Logf("Node %d: %+v.", i, n) } } } func assertClass(t *testing.T, sel *Selection, class string) { if !sel.HasClass(class) { t.Errorf("Expected node to have class %s, found %+v.", class, sel.Get(0)) } } func assertPanic(t *testing.T) { if e := recover(); e == nil { t.Error("Expected a panic.") } } func assertEqual(t *testing.T, s1 *Selection, s2 *Selection) { if s1 != s2 { t.Error("Expected selection objects to be the same.") } } func assertSelectionIs(t *testing.T, sel *Selection, is ...string) { for i := 0; i < sel.Length(); i++ { if !sel.Eq(i).Is(is[i]) { t.Errorf("Expected node %d to be %s, found %+v", i, is[i], sel.Get(i)) } } } func printSel(t *testing.T, sel *Selection) { if testing.Verbose() { h, err := sel.Html() if err != nil { t.Fatal(err) } t.Log(h) } } func loadDoc(page string) *Document { var f *os.File var e error if f, e = os.Open(fmt.Sprintf("./testdata/%s", page)); e != nil { panic(e.Error()) } defer f.Close() var node *html.Node if node, e = html.Parse(f); e != nil { panic(e.Error()) } return NewDocumentFromNode(node) } func loadString(t *testing.T, doc string) *Document { d, err := NewDocumentFromReader(strings.NewReader(doc)) if err != nil { t.Error("Failed to parse test document") } return d } func TestNewDocument(t *testing.T) { if f, e := os.Open("./testdata/page.html"); e != nil { t.Error(e.Error()) } else { defer f.Close() if node, e := html.Parse(f); e != nil { t.Error(e.Error()) } else { doc = NewDocumentFromNode(node) } } } func TestNewDocumentFromReader(t *testing.T) { cases := []struct { src string err bool sel string cnt int }{ 0: { src: ` Test

Hi

`, sel: "h1", cnt: 1, }, 1: { // Actually pretty hard to make html.Parse return an error // based on content... src: `>>qq>`, }, } buf := bytes.NewBuffer(nil) for i, c := range cases { buf.Reset() buf.WriteString(c.src) d, e := NewDocumentFromReader(buf) if (e != nil) != c.err { if c.err { t.Errorf("[%d] - expected error, got none", i) } else { t.Errorf("[%d] - expected no error, got %s", i, e) } } if c.sel != "" { s := d.Find(c.sel) if s.Length() != c.cnt { t.Errorf("[%d] - expected %d nodes, found %d", i, c.cnt, s.Length()) } } } } func TestNewDocumentFromResponseNil(t *testing.T) { _, e := NewDocumentFromResponse(nil) if e == nil { t.Error("Expected error, got none") } } func TestIssue103(t *testing.T) { d, err := NewDocumentFromReader(strings.NewReader("Scientists Stored These Images in DNA—Then Flawlessly Retrieved Them")) if err != nil { t.Error(err) } text := d.Find("title").Text() for i, r := range text { t.Logf("%d: %d - %q\n", i, r, string(r)) } t.Log(text) } func TestSingle(t *testing.T) { data := `
1
2
3

4

` doc, err := NewDocumentFromReader(strings.NewReader(data)) if err != nil { t.Fatal(err) } text := doc.FindMatcher(Single("div")).Text() if text != "1" { t.Fatalf("want %q, got %q", "1", text) } // Verify semantic equivalence sel1 := doc.Find("div").First() sel2 := doc.FindMatcher(Single("div")) if sel1.Text() != sel2.Text() { t.Fatalf("want sel1 to equal sel2") } // Here, the Single has no effect as the selector is used to filter // from the existing selection, not to find nodes in the document. divs := doc.Find("div") text = divs.FilterMatcher(Single(".a")).Text() if text != "23" { t.Fatalf("want %q, got %q", "23", text) } classA := cascadia.MustCompile(".a") classB := cascadia.MustCompile(".b") text = doc.FindMatcher(classB).AddMatcher(SingleMatcher(classA)).Text() if text != "142" { t.Fatalf("want %q, got %q", "142", text) } } goquery-1.8.1/utilities.go000066400000000000000000000120701437416732600155730ustar00rootroot00000000000000package goquery import ( "bytes" "io" "golang.org/x/net/html" ) // used to determine if a set (map[*html.Node]bool) should be used // instead of iterating over a slice. The set uses more memory and // is slower than slice iteration for small N. const minNodesForSet = 1000 var nodeNames = []string{ html.ErrorNode: "#error", html.TextNode: "#text", html.DocumentNode: "#document", html.CommentNode: "#comment", } // NodeName returns the node name of the first element in the selection. // It tries to behave in a similar way as the DOM's nodeName property // (https://developer.mozilla.org/en-US/docs/Web/API/Node/nodeName). // // Go's net/html package defines the following node types, listed with // the corresponding returned value from this function: // // ErrorNode : #error // TextNode : #text // DocumentNode : #document // ElementNode : the element's tag name // CommentNode : #comment // DoctypeNode : the name of the document type // func NodeName(s *Selection) string { if s.Length() == 0 { return "" } return nodeName(s.Get(0)) } // nodeName returns the node name of the given html node. // See NodeName for additional details on behaviour. func nodeName(node *html.Node) string { if node == nil { return "" } switch node.Type { case html.ElementNode, html.DoctypeNode: return node.Data default: if int(node.Type) < len(nodeNames) { return nodeNames[node.Type] } return "" } } // Render renders the HTML of the first item in the selection and writes it to // the writer. It behaves the same as OuterHtml but writes to w instead of // returning the string. func Render(w io.Writer, s *Selection) error { if s.Length() == 0 { return nil } n := s.Get(0) return html.Render(w, n) } // OuterHtml returns the outer HTML rendering of the first item in // the selection - that is, the HTML including the first element's // tag and attributes. // // Unlike Html, this is a function and not a method on the Selection, // because this is not a jQuery method (in javascript-land, this is // a property provided by the DOM). func OuterHtml(s *Selection) (string, error) { var buf bytes.Buffer if err := Render(&buf, s); err != nil { return "", err } return buf.String(), nil } // Loop through all container nodes to search for the target node. func sliceContains(container []*html.Node, contained *html.Node) bool { for _, n := range container { if nodeContains(n, contained) { return true } } return false } // Checks if the contained node is within the container node. func nodeContains(container *html.Node, contained *html.Node) bool { // Check if the parent of the contained node is the container node, traversing // upward until the top is reached, or the container is found. for contained = contained.Parent; contained != nil; contained = contained.Parent { if container == contained { return true } } return false } // Checks if the target node is in the slice of nodes. func isInSlice(slice []*html.Node, node *html.Node) bool { return indexInSlice(slice, node) > -1 } // Returns the index of the target node in the slice, or -1. func indexInSlice(slice []*html.Node, node *html.Node) int { if node != nil { for i, n := range slice { if n == node { return i } } } return -1 } // Appends the new nodes to the target slice, making sure no duplicate is added. // There is no check to the original state of the target slice, so it may still // contain duplicates. The target slice is returned because append() may create // a new underlying array. If targetSet is nil, a local set is created with the // target if len(target) + len(nodes) is greater than minNodesForSet. func appendWithoutDuplicates(target []*html.Node, nodes []*html.Node, targetSet map[*html.Node]bool) []*html.Node { // if there are not that many nodes, don't use the map, faster to just use nested loops // (unless a non-nil targetSet is passed, in which case the caller knows better). if targetSet == nil && len(target)+len(nodes) < minNodesForSet { for _, n := range nodes { if !isInSlice(target, n) { target = append(target, n) } } return target } // if a targetSet is passed, then assume it is reliable, otherwise create one // and initialize it with the current target contents. if targetSet == nil { targetSet = make(map[*html.Node]bool, len(target)) for _, n := range target { targetSet[n] = true } } for _, n := range nodes { if !targetSet[n] { target = append(target, n) targetSet[n] = true } } return target } // Loop through a selection, returning only those nodes that pass the predicate // function. func grep(sel *Selection, predicate func(i int, s *Selection) bool) (result []*html.Node) { for i, n := range sel.Nodes { if predicate(i, newSingleSelection(n, sel.document)) { result = append(result, n) } } return result } // Creates a new Selection object based on the specified nodes, and keeps the // source Selection object on the stack (linked list). func pushStack(fromSel *Selection, nodes []*html.Node) *Selection { result := &Selection{nodes, fromSel.document, fromSel} return result } goquery-1.8.1/utilities_test.go000066400000000000000000000051671437416732600166430ustar00rootroot00000000000000package goquery import ( "reflect" "sort" "strings" "testing" "golang.org/x/net/html" ) var allNodes = `

This is some text.

` func TestNodeName(t *testing.T) { doc, err := NewDocumentFromReader(strings.NewReader(allNodes)) if err != nil { t.Fatal(err) } n0 := doc.Nodes[0] nDT := n0.FirstChild sMeta := doc.Find("meta") nMeta := sMeta.Get(0) sP := doc.Find("p") nP := sP.Get(0) nComment := nP.FirstChild nText := nComment.NextSibling cases := []struct { node *html.Node typ html.NodeType want string }{ {n0, html.DocumentNode, nodeNames[html.DocumentNode]}, {nDT, html.DoctypeNode, "html"}, {nMeta, html.ElementNode, "meta"}, {nP, html.ElementNode, "p"}, {nComment, html.CommentNode, nodeNames[html.CommentNode]}, {nText, html.TextNode, nodeNames[html.TextNode]}, } for i, c := range cases { got := NodeName(newSingleSelection(c.node, doc)) if c.node.Type != c.typ { t.Errorf("%d: want type %v, got %v", i, c.typ, c.node.Type) } if got != c.want { t.Errorf("%d: want %q, got %q", i, c.want, got) } } } func TestNodeNameMultiSel(t *testing.T) { doc, err := NewDocumentFromReader(strings.NewReader(allNodes)) if err != nil { t.Fatal(err) } in := []string{"p", "h1", "div"} var out []string doc.Find(strings.Join(in, ", ")).Each(func(i int, s *Selection) { got := NodeName(s) out = append(out, got) }) sort.Strings(in) sort.Strings(out) if !reflect.DeepEqual(in, out) { t.Errorf("want %v, got %v", in, out) } } func TestOuterHtml(t *testing.T) { doc, err := NewDocumentFromReader(strings.NewReader(allNodes)) if err != nil { t.Fatal(err) } n0 := doc.Nodes[0] nDT := n0.FirstChild sMeta := doc.Find("meta") sP := doc.Find("p") nP := sP.Get(0) nComment := nP.FirstChild nText := nComment.NextSibling sHeaders := doc.Find(".header") cases := []struct { node *html.Node sel *Selection want string }{ {nDT, nil, ""}, // render makes DOCTYPE all caps {nil, sMeta, ``}, // and auto-closes the meta {nil, sP, `

This is some text.

`}, {nComment, nil, ""}, {nText, nil, ` This is some text. `}, {nil, sHeaders, `

`}, } for i, c := range cases { if c.sel == nil { c.sel = newSingleSelection(c.node, doc) } got, err := OuterHtml(c.sel) if err != nil { t.Fatal(err) } if got != c.want { t.Errorf("%d: want %q, got %q", i, c.want, got) } } }