couchbase
/
moss
/
107
83%
|
Ran
|
Jobs
1
|
Files
20
|
Run time
1s
|
Badge
Embed ▾
README BADGES
|
push
travis-ci
steveyenoptimize Iterator.SeekTo() by first trying some naive Next()'s This optimization is based on the assumption that a forward SeekTo() will often be to a key that's nearby. In that case, it's fruitful to try some limited number of Next()'s in a loop, and then devolve back to binary search if the seekToKey isn't encountered. In one application benchmark (bleve-query on a wiki dataset with a query-string of "+text:afternoon +text:coffee"), the search throughput jumped from 858 queries/sec to 1222 queries/sec after this change. Change-Id: Id15506426 Reviewed-on: http://review.couchbase.org/67930 Reviewed-by: Marty Schoch <marty.schoch@gmail.com> Tested-by: Steve Yen <steve.yen@gmail.com>
2129 of 2492 relevant lines covered (85.43%)
9760.41 hits per line
Jobs
| ID | Job ID | Ran | Files | Coverage | |
|---|---|---|---|---|---|
| 1 | 107.1 | 20 |
85.43 |
Travis Job 107.1 |
Source Files on build 107
| Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
|---|