| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | test and adjust some stuff | Håvard Pettersen | 2024-05-03 | 1 | -0/+30 |
| | | |||||
| * | Remove unused variables. | Tor Egge | 2024-04-15 | 1 | -2/+0 |
| | | |||||
| * | add code to AndFlow that can perform additional incremental reordering | Håvard Pettersen | 2024-04-12 | 1 | -121/+120 |
| | | | | | | | | | of children based on the future possibility of forcing those children to be strict. update unit test to use code from AndFlow and add tests for non-strict AND ordering as well. | ||||
| * | consolidate solutions into a single heuristic algorithm | Håvard Pettersen | 2024-04-10 | 1 | -57/+7 |
| | | | | | use error relative to minimal cost rather than error potential | ||||
| * | add some comparison slack to improve robustness | Håvard Pettersen | 2024-04-10 | 1 | -7/+7 |
| | | |||||
| * | more experiments | Håvard Pettersen | 2024-04-05 | 1 | -83/+127 |
| | | | | | also pruned some of the less promising alternatives | ||||
| * | force strictness where allowed and cheaper | Håvard Pettersen | 2024-04-04 | 1 | -2/+2 |
| | | |||||
| * | more experiments with multi-strict AND sorting | Håvard Pettersen | 2024-04-02 | 1 | -37/+115 |
| | | |||||
| * | experiment with allow_force_strict | Håvard Pettersen | 2024-03-27 | 1 | -22/+128 |
| | | | | | during sorting and cost calculations | ||||
| * | split estimates from incremental flow calculations | Håvard Pettersen | 2024-02-27 | 1 | -42/+83 |
| | | | | | replace FlowCalc with AnyFlow and add RankFlow and BlenderFlow | ||||
| * | added generic type-erased flow class | Håvard Pettersen | 2024-02-23 | 1 | -20/+29 |
| | | |||||
| * | know the in-flow when sorting blueprints | Håvard Pettersen | 2024-02-23 | 1 | -17/+24 |
| | | | | | | | also added the option and tagging mechanic needed to force selected blueprints to be strict even in a non-strict context as well as calculating how much time this saves you. | ||||
| * | use flow for fetchPostings | Håvard Pettersen | 2024-02-16 | 1 | -0/+58 |
| | | | | | | note that only AND/OR are wired to their respective flows here, which means only strict OR should change (all children getting full in-flow) | ||||
| * | account for heap cost in strict OR | Håvard Pettersen | 2024-02-12 | 1 | -82/+84 |
| | | | | | | | | | - make it easier to do flow analysis directly on FlowStats - use FlowStats in tests (less custom test code) - added flow_tuning.h for special sauce - strict flow must now have in-flow of 1.0 - split low-level flow tests into full/partial | ||||
| * | adjust strict OR flow | Håvard Pettersen | 2024-02-05 | 1 | -13/+12 |
| | | | | | | | | A simple heap-based strict OR is not able to benefit from short circuiting of the per-document evaluation. An 'optimal' strict OR would need more book-keeping and would probably be slower than the simple implementation in most normal cases. | ||||
| * | make sure empty AND/OR/ANDNOT flow estimates 0.0 regardless of input flow | Håvard Pettersen | 2024-01-15 | 1 | -3/+3 |
| | | |||||
| * | take strictness into account for flow/cost/sorting | Håvard Pettersen | 2024-01-15 | 1 | -50/+206 |
| | | | | | | | use common code with adapters make cost calculation const (sort index, not children) empty AND/ANDNOT estimate now equals input flow | ||||
| * | verify that suggested sort order gives minimal flow cost | Håvard Pettersen | 2023-12-18 | 1 | -0/+117 |
 |
index : vespa | |
| An engine for low-latency computation over large data sets |
| aboutsummaryrefslogtreecommitdiffstats |