Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Cleanup | Jon Bratseth | 2019-09-17 | 1 | -4/+3 |
| | |||||
* | Add equals and cleanup | Jon Bratseth | 2019-09-17 | 15 | -82/+110 |
| | |||||
* | Set relevance to 0.0 if sorting. | Henning Baldersheim | 2019-09-16 | 1 | -2/+2 |
| | |||||
* | Revert "Revert "Revert "Revert "Use a LeanHit until merging is done." MERGEOK""" | Henning Baldersheim | 2019-09-16 | 11 | -147/+201 |
| | |||||
* | Revert "Revert "Revert "Use a LeanHit until merging is done." MERGEOK"" | Henning Baldersheim | 2019-09-16 | 11 | -201/+147 |
| | |||||
* | Add simple protobuf decoding test and fix logic inversion. | Henning Baldersheim | 2019-09-16 | 2 | -8/+8 |
| | |||||
* | Revert "Revert "Use a LeanHit until merging is done." MERGEOK" | Henning Baldersheim | 2019-09-16 | 11 | -147/+201 |
| | |||||
* | Revert "Use a LeanHit until merging is done." | Henning Baldersheim | 2019-09-16 | 11 | -201/+147 |
| | |||||
* | Use a LeanHit until merging is done. | Henning Baldersheim | 2019-09-16 | 11 | -147/+201 |
| | |||||
* | Remove obsolete todo and rename countFastHits -> countUnfilledFastHits | Henning Baldersheim | 2019-09-13 | 2 | -3/+2 |
| | |||||
* | Avoid wrapping the 12 bytes in yet another object. | Henning Baldersheim | 2019-09-13 | 9 | -163/+58 |
| | |||||
* | Merge pull request #10625 from ↵ | Jon Bratseth | 2019-09-13 | 1 | -32/+33 |
|\ | | | | | | | | | vespa-engine/bratseth/allow-alternatives-under-equiv Allow word alternatives under Equiv | ||||
| * | Allow word alternatives under Equiv | Jon Bratseth | 2019-09-12 | 1 | -32/+33 |
| | | |||||
* | | Merge pull request #10621 from vespa-engine/balder/avoid-double-bookeeping-of-id | Henning Baldersheim | 2019-09-12 | 3 | -8/+6 |
|\ \ | | | | | | | Balder/avoid double bookeeping of. | ||||
| * | | Minor cleanup | Henning Baldersheim | 2019-09-12 | 1 | -2/+0 |
| | | | |||||
| * | | Avoid double bookkeeping as it already has a place in the parent. | Henning Baldersheim | 2019-09-12 | 2 | -6/+6 |
| |/ | |||||
* | | Merge pull request #10601 from ↵ | Henning Baldersheim | 2019-09-12 | 3 | -11/+20 |
|\ \ | | | | | | | | | | | | | vespa-engine/revert-10575-revert-10569-balder/more-efficient-trim Revert "Revert "Removing elements from an array is very costly | ||||
| * | | Since we are trimming we need to reflect that in the offsets too. | Henning Baldersheim | 2019-09-11 | 1 | -0/+1 |
| | | | |||||
| * | | Consider auxiliary hits too. | Henning Baldersheim | 2019-09-11 | 1 | -15/+17 |
| | | | |||||
| * | | Revert "Revert "Removing elements from an array is very costly."" | Henning Baldersheim | 2019-09-11 | 2 | -7/+13 |
| |/ | |||||
* / | - query.setOffset(0) when you conduct a trim. | Henning Baldersheim | 2019-09-11 | 2 | -1/+3 |
|/ | | | | - Remove a clone that is not necessary. | ||||
* | Check for auxiliary hits in first chunk explicit | Henning Baldersheim | 2019-09-11 | 1 | -1/+10 |
| | |||||
* | Add minmal testing of merge and offset and auxiliary hits. | Henning Baldersheim | 2019-09-11 | 1 | -4/+14 |
| | |||||
* | Also consider auxiliary hits. | Henning Baldersheim | 2019-09-10 | 1 | -6/+24 |
| | |||||
* | Revert "Revert "Make fasthit leaner since it appears in considerable amounts ↵ | Henning Baldersheim | 2019-09-10 | 3 | -20/+32 |
| | | | | during m…"" | ||||
* | Revert "Make fasthit leaner since it appears in considerable amounts during ↵ | Harald Musum | 2019-09-10 | 3 | -32/+20 |
| | | | | m…" | ||||
* | Make fasthit leaner since it appears in considerable amounts during merging, ↵ | Henning Baldersheim | 2019-09-10 | 3 | -20/+32 |
| | | | | and only a few are filled. | ||||
* | HitGroup.sort and hit.compareTo must ensure same ordering... | Henning Baldersheim | 2019-09-10 | 4 | -25/+31 |
| | | | | Do not use the first result as starting point. Start off with a fresh one. | ||||
* | Revert "Revert "Append all, the sort all, then trim tail is too expensive."" | Henning Baldersheim | 2019-09-10 | 1 | -14/+33 |
| | |||||
* | Revert "Append all, the sort all, then trim tail is too expensive." | Henning Baldersheim | 2019-09-10 | 1 | -33/+14 |
| | |||||
* | Revert "Removing elements from an array is very costly." | Henning Baldersheim | 2019-09-10 | 2 | -13/+7 |
| | |||||
* | Merge pull request #10569 from vespa-engine/balder/more-efficient-trim | Jon Bratseth | 2019-09-09 | 2 | -7/+13 |
|\ | | | | | Removing elements from an array is very costly. | ||||
| * | Propagate listeners | Jon Bratseth | 2019-09-09 | 1 | -7/+7 |
| | | |||||
| * | Removing elements from an array is very costly. | Henning Baldersheim | 2019-09-09 | 2 | -2/+8 |
| | | | | | | | | Make a new one and copy the ones to keep instead. | ||||
* | | Merge pull request #10551 from ↵ | Henning Baldersheim | 2019-09-09 | 1 | -14/+33 |
|\ \ | |/ |/| | | | | | vespa-engine/balder/merge-topn-instead-of-append-sort-trim Append all, the sort all, then trim tail is too expensive. | ||||
| * | Append all, the sort all, then trim tail is too expensive. | Henning Baldersheim | 2019-09-08 | 1 | -14/+33 |
| | | | | | | | | Continous merge with trim is far more efficient as input is already sorted. | ||||
* | | Merge pull request #10555 from vespa-engine/bratseth/log-cause | Jon Bratseth | 2019-09-09 | 1 | -4/+4 |
|\ \ | | | | | | | Log cause directly to avoid it being truncated away | ||||
| * | | Don't cast | Jon Bratseth | 2019-09-09 | 1 | -2/+2 |
| | | | |||||
| * | | Log cause directly to avoid it being truncated away | Jon Bratseth | 2019-09-09 | 1 | -6/+6 |
| | | | |||||
* | | | Merge pull request #10519 from ↵ | Tor Brede Vekterli | 2019-09-09 | 13 | -43/+424 |
|\ \ \ | | | | | | | | | | | | | | | | | vespa-engine/vekterli/add-simple-logging-query-tracing-to-timed-out-streaming-searches Add simple probabilistic query tracing and logging for streaming searches that time out. | ||||
| * | | | Fix JavaDoc | Tor Brede Vekterli | 2019-09-09 | 1 | -1/+1 |
| | | | | |||||
| * | | | Add class comments | Tor Brede Vekterli | 2019-09-06 | 2 | -1/+19 |
| | | | | |||||
| * | | | Log elapsed time in seconds instead of milliseconds | Tor Brede Vekterli | 2019-09-06 | 1 | -2/+2 |
| | | | | | | | | | | | | | | | | Query timeouts are specified in seconds, so be consistent with this. | ||||
| * | | | Add simple probabilistic query tracing and logging for streaming searches ↵ | Tor Brede Vekterli | 2019-09-05 | 13 | -43/+406 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | that time out This currently only catches the cases where a query has not respected its expected timeout and therefore has an actual timeout that is at least a 5x multiple of its expected one. Due to the response payload nature of MessageBus traces it's not given that the trace will contain any information from the backend nodes. But it is highly likely to contain useful information from the client-local policy instances, as well as resending info. To test this very conservatively, only allows approximately 1 query to be traced every 2 seconds and only dumps traces to logs once every 10 seconds. | ||||
* | | | | default constructor must be empty as it is used in tests in other packages. | Henning Baldersheim | 2019-09-08 | 1 | -1/+1 |
| | | | | |||||
* | | | | Revert "Revert "Warmup yql"" | Henning Baldersheim | 2019-09-08 | 1 | -16/+47 |
| |/ / |/| | | |||||
* | | | Revert "Warmup yql" | Henning Baldersheim | 2019-09-08 | 1 | -47/+16 |
| |/ |/| | |||||
* | | Add comments and more clear error messages. | Henning Baldersheim | 2019-09-06 | 1 | -3/+4 |
| | | |||||
* | | Warmup yql. | Henning Baldersheim | 2019-09-06 | 1 | -16/+46 |
| | | |||||
* | | Merge pull request #10510 from ↵ | Bjørn Meland | 2019-09-06 | 1 | -11/+6 |
|\ \ | |/ |/| | | | | | vespa-engine/bjormel/endpoint-as-a-dimension-for-search-requests VESPA-16236: endpoint as a dimension to search requests |