mirror of
https://github.com/avelino/awesome-go.git
synced 2024-12-12 17:13:58 +00:00
9b9606baba
* Update test to 1.7 and display correct sorting order * Fix potential issue with goroutine exiting prematurely * Better naming for category * Remove unnecesarry format
93 lines
1.8 KiB
Go
93 lines
1.8 KiB
Go
package main
|
|
|
|
import (
|
|
"bytes"
|
|
"io/ioutil"
|
|
"sort"
|
|
"strings"
|
|
"testing"
|
|
|
|
"github.com/PuerkitoBio/goquery"
|
|
"github.com/russross/blackfriday"
|
|
)
|
|
|
|
func TestAlpha(t *testing.T) {
|
|
query := startQuery()
|
|
|
|
query.Find("body > ul").Each(func(_ int, s *goquery.Selection) {
|
|
testList(t, s)
|
|
})
|
|
}
|
|
|
|
func TestDuplicatedLinks(t *testing.T) {
|
|
query := startQuery()
|
|
links := make(map[string]bool, 0)
|
|
|
|
query.Find("body a").Each(func(_ int, s *goquery.Selection) {
|
|
t.Run(s.Text(), func(t *testing.T) {
|
|
href, ok := s.Attr("href")
|
|
if !ok {
|
|
t.Error("expected to have href")
|
|
}
|
|
|
|
if links[href] {
|
|
t.Fatalf("duplicated link '%s'", href)
|
|
}
|
|
|
|
links[href] = true
|
|
})
|
|
})
|
|
}
|
|
|
|
func testList(t *testing.T, list *goquery.Selection) {
|
|
list.Find("ul").Each(func(_ int, items *goquery.Selection) {
|
|
testList(t, items)
|
|
items.RemoveFiltered("ul")
|
|
})
|
|
|
|
category := list.Prev().Text()
|
|
|
|
t.Run(category, func(t *testing.T) {
|
|
checkAlphabeticOrder(t, list)
|
|
})
|
|
}
|
|
|
|
func readme() []byte {
|
|
input, err := ioutil.ReadFile("./README.md")
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
html := append([]byte("<body>"), blackfriday.MarkdownCommon(input)...)
|
|
html = append(html, []byte("</body>")...)
|
|
return html
|
|
}
|
|
|
|
func startQuery() *goquery.Document {
|
|
buf := bytes.NewBuffer(readme())
|
|
query, err := goquery.NewDocumentFromReader(buf)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
|
|
return query
|
|
}
|
|
|
|
func checkAlphabeticOrder(t *testing.T, s *goquery.Selection) {
|
|
items := s.Find("li > a:first-child").Map(func(_ int, li *goquery.Selection) string {
|
|
return strings.ToLower(li.Text())
|
|
})
|
|
|
|
sorted := make([]string, len(items))
|
|
copy(sorted, items)
|
|
sort.Strings(sorted)
|
|
|
|
for k, item := range items {
|
|
if item != sorted[k] {
|
|
t.Errorf("expected '%s' but actual is '%s'", sorted[k], item)
|
|
}
|
|
}
|
|
if t.Failed() {
|
|
t.Logf("expected order is:\n%s", strings.Join(sorted, "\n"))
|
|
}
|
|
}
|