bench_filter_test.go 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  1. package goquery
  2. import (
  3. "testing"
  4. )
  5. func BenchmarkFilter(b *testing.B) {
  6. var n int
  7. b.StopTimer()
  8. sel := DocW().Find("li")
  9. b.StartTimer()
  10. for i := 0; i < b.N; i++ {
  11. if n == 0 {
  12. n = sel.Filter(".toclevel-1").Length()
  13. } else {
  14. sel.Filter(".toclevel-1")
  15. }
  16. }
  17. if n != 13 {
  18. b.Fatalf("want 13, got %d", n)
  19. }
  20. }
  21. func BenchmarkNot(b *testing.B) {
  22. var n int
  23. b.StopTimer()
  24. sel := DocW().Find("li")
  25. b.StartTimer()
  26. for i := 0; i < b.N; i++ {
  27. if n == 0 {
  28. n = sel.Not(".toclevel-2").Length()
  29. } else {
  30. sel.Filter(".toclevel-2")
  31. }
  32. }
  33. if n != 371 {
  34. b.Fatalf("want 371, got %d", n)
  35. }
  36. }
  37. func BenchmarkFilterFunction(b *testing.B) {
  38. var n int
  39. b.StopTimer()
  40. sel := DocW().Find("li")
  41. f := func(i int, s *Selection) bool {
  42. return len(s.Get(0).Attr) > 0
  43. }
  44. b.StartTimer()
  45. for i := 0; i < b.N; i++ {
  46. if n == 0 {
  47. n = sel.FilterFunction(f).Length()
  48. } else {
  49. sel.FilterFunction(f)
  50. }
  51. }
  52. if n != 112 {
  53. b.Fatalf("want 112, got %d", n)
  54. }
  55. }
  56. func BenchmarkNotFunction(b *testing.B) {
  57. var n int
  58. b.StopTimer()
  59. sel := DocW().Find("li")
  60. f := func(i int, s *Selection) bool {
  61. return len(s.Get(0).Attr) > 0
  62. }
  63. b.StartTimer()
  64. for i := 0; i < b.N; i++ {
  65. if n == 0 {
  66. n = sel.NotFunction(f).Length()
  67. } else {
  68. sel.NotFunction(f)
  69. }
  70. }
  71. if n != 261 {
  72. b.Fatalf("want 261, got %d", n)
  73. }
  74. }
  75. func BenchmarkFilterNodes(b *testing.B) {
  76. var n int
  77. b.StopTimer()
  78. sel := DocW().Find("li")
  79. sel2 := DocW().Find(".toclevel-2")
  80. nodes := sel2.Nodes
  81. b.StartTimer()
  82. for i := 0; i < b.N; i++ {
  83. if n == 0 {
  84. n = sel.FilterNodes(nodes...).Length()
  85. } else {
  86. sel.FilterNodes(nodes...)
  87. }
  88. }
  89. if n != 2 {
  90. b.Fatalf("want 2, got %d", n)
  91. }
  92. }
  93. func BenchmarkNotNodes(b *testing.B) {
  94. var n int
  95. b.StopTimer()
  96. sel := DocW().Find("li")
  97. sel2 := DocW().Find(".toclevel-1")
  98. nodes := sel2.Nodes
  99. b.StartTimer()
  100. for i := 0; i < b.N; i++ {
  101. if n == 0 {
  102. n = sel.NotNodes(nodes...).Length()
  103. } else {
  104. sel.NotNodes(nodes...)
  105. }
  106. }
  107. if n != 360 {
  108. b.Fatalf("want 360, got %d", n)
  109. }
  110. }
  111. func BenchmarkFilterSelection(b *testing.B) {
  112. var n int
  113. b.StopTimer()
  114. sel := DocW().Find("li")
  115. sel2 := DocW().Find(".toclevel-2")
  116. b.StartTimer()
  117. for i := 0; i < b.N; i++ {
  118. if n == 0 {
  119. n = sel.FilterSelection(sel2).Length()
  120. } else {
  121. sel.FilterSelection(sel2)
  122. }
  123. }
  124. if n != 2 {
  125. b.Fatalf("want 2, got %d", n)
  126. }
  127. }
  128. func BenchmarkNotSelection(b *testing.B) {
  129. var n int
  130. b.StopTimer()
  131. sel := DocW().Find("li")
  132. sel2 := DocW().Find(".toclevel-1")
  133. b.StartTimer()
  134. for i := 0; i < b.N; i++ {
  135. if n == 0 {
  136. n = sel.NotSelection(sel2).Length()
  137. } else {
  138. sel.NotSelection(sel2)
  139. }
  140. }
  141. if n != 360 {
  142. b.Fatalf("want 360, got %d", n)
  143. }
  144. }
  145. func BenchmarkHas(b *testing.B) {
  146. var n int
  147. b.StopTimer()
  148. sel := DocW().Find("h2")
  149. b.StartTimer()
  150. for i := 0; i < b.N; i++ {
  151. if n == 0 {
  152. n = sel.Has(".editsection").Length()
  153. } else {
  154. sel.Has(".editsection")
  155. }
  156. }
  157. if n != 13 {
  158. b.Fatalf("want 13, got %d", n)
  159. }
  160. }
  161. func BenchmarkHasNodes(b *testing.B) {
  162. var n int
  163. b.StopTimer()
  164. sel := DocW().Find("li")
  165. sel2 := DocW().Find(".tocnumber")
  166. nodes := sel2.Nodes
  167. b.StartTimer()
  168. for i := 0; i < b.N; i++ {
  169. if n == 0 {
  170. n = sel.HasNodes(nodes...).Length()
  171. } else {
  172. sel.HasNodes(nodes...)
  173. }
  174. }
  175. if n != 15 {
  176. b.Fatalf("want 15, got %d", n)
  177. }
  178. }
  179. func BenchmarkHasSelection(b *testing.B) {
  180. var n int
  181. b.StopTimer()
  182. sel := DocW().Find("li")
  183. sel2 := DocW().Find(".tocnumber")
  184. b.StartTimer()
  185. for i := 0; i < b.N; i++ {
  186. if n == 0 {
  187. n = sel.HasSelection(sel2).Length()
  188. } else {
  189. sel.HasSelection(sel2)
  190. }
  191. }
  192. if n != 15 {
  193. b.Fatalf("want 15, got %d", n)
  194. }
  195. }
  196. func BenchmarkEnd(b *testing.B) {
  197. var n int
  198. b.StopTimer()
  199. sel := DocW().Find("li").Has(".tocnumber")
  200. b.StartTimer()
  201. for i := 0; i < b.N; i++ {
  202. if n == 0 {
  203. n = sel.End().Length()
  204. } else {
  205. sel.End()
  206. }
  207. }
  208. if n != 373 {
  209. b.Fatalf("want 373, got %d", n)
  210. }
  211. }