| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | move more param stuff to lazy_params.h | Håvard Pettersen | 2018-01-16 | 9 | -36/+41 |
| | | |||||
| * | Use lazy parameters in tensor functions. | Håvard Pettersen | 2018-01-16 | 17 | -79/+67 |
| | | |||||
| * | move LazyParams to separate file | Håvard Pettersen | 2018-01-16 | 6 | -12/+44 |
| | | |||||
| * | added test for push_children (tensor IR nodes) | Håvard Pettersen | 2018-01-15 | 1 | -0/+24 |
| | | |||||
| * | tensor function compilation based on bottom-up in-place optimization | Håvard Pettersen | 2018-01-15 | 4 | -12/+75 |
| | | |||||
| * | separate optimize and compile concepts | Håvard Pettersen | 2018-01-15 | 10 | -77/+85 |
| | | | | | | | | | optimize: tensor function -> tensor function compile: node tree -> tensor function node trees now contain tensor functions to support direct recursive mixed-mode evaluation. | ||||
| * | Merge pull request #4612 from vespa-engine/balder/some-misc-old-cleanup | Henning Baldersheim | 2018-01-11 | 2 | -17/+13 |
| |\ | | | | | Use c++11 for loops and alignment. | ||||
| | * | Avoid using temporaries. | Henning Baldersheim | 2018-01-10 | 2 | -17/+13 |
| | | | |||||
| * | | Merge pull request #4595 from vespa-engine/balder/track-common-cell-index | Henning Baldersheim | 2018-01-11 | 3 | -66/+93 |
| |\ \ | |/ |/| | Balder/track common cell index | ||||
| | * | Put the address back in the combiner. | Henning Baldersheim | 2018-01-10 | 3 | -25/+24 |
| | | | |||||
| | * | Add comment explaining a bit about the right address. | Henning Baldersheim | 2018-01-10 | 1 | -0/+2 |
| | | | |||||
| | * | Move the right address context on the outside. | Henning Baldersheim | 2018-01-10 | 3 | -75/+68 |
| | | | |||||
| | * | Use the same AddressContext for the combinedAddress and compute the ↵ | Henning Baldersheim | 2018-01-10 | 3 | -30/+45 |
| | | | | | | | | | combinedIdx inline too. | ||||
| | * | Hide the calculation inside the address context. | Henning Baldersheim | 2018-01-09 | 1 | -2/+3 |
| | | | |||||
| | * | Make and address context to keep code together. | Henning Baldersheim | 2018-01-09 | 2 | -30/+47 |
| | | | |||||
| | * | Rename to indicate it refers to right side. | Henning Baldersheim | 2018-01-09 | 2 | -10/+10 |
| | | | |||||
| * | | Revert earlier reorder. | Henning Baldersheim | 2018-01-10 | 1 | -2/+2 |
| | | | |||||
| * | | Use cheap and_modulator instead of prime modulator to avoid costly division. | Henning Baldersheim | 2018-01-10 | 2 | -2/+4 |
| | | | |||||
| * | | Different hashing gives different order. | Henning Baldersheim | 2018-01-10 | 1 | -2/+2 |
| | | | |||||
| * | | Add missing newline at eof and align members. | Henning Baldersheim | 2018-01-10 | 1 | -2/+3 |
| | | | |||||
| * | | Use XXH32 for hashing. | Henning Baldersheim | 2018-01-10 | 1 | -9/+4 |
| |/ | |||||
| * | Go back to using a single combiner. | Henning Baldersheim | 2018-01-09 | 3 | -98/+58 |
| | | |||||
| * | Allow for building index on the outside. | Henning Baldersheim | 2018-01-09 | 1 | -1/+4 |
| | | |||||
| * | Use braces | Henning Baldersheim | 2018-01-09 | 1 | -1/+3 |
| | | |||||
| * | _mutable -> _right | Henning Baldersheim | 2018-01-09 | 2 | -5/+5 |
| | | |||||
| * | combiner not needed in lambda | Henning Baldersheim | 2018-01-09 | 1 | -1/+1 |
| | | |||||
| * | Remove unused code. | Henning Baldersheim | 2018-01-09 | 2 | -35/+10 |
| | | |||||
| * | Remove unused code. | Henning Baldersheim | 2018-01-09 | 1 | -25/+0 |
| | | |||||
| * | Initialize members | Henning Baldersheim | 2018-01-09 | 1 | -1/+4 |
| | | |||||
| * | No need to update the right address, as we update cellIdx inline. | Henning Baldersheim | 2018-01-09 | 1 | -7/+6 |
| | | |||||
| * | Specialize add and mul | Henning Baldersheim | 2018-01-09 | 1 | -0/+12 |
| | | |||||
| * | Update the combined adress inline. | Henning Baldersheim | 2018-01-09 | 3 | -28/+27 |
| | | |||||
| * | Split in 2 methods to avoid if in inner loop. | Henning Baldersheim | 2018-01-09 | 2 | -8/+36 |
| | | |||||
| * | Iterate only the valid dimensions. | Henning Baldersheim | 2018-01-09 | 3 | -6/+109 |
| | | |||||
| * | Combine address in steps to reduce amount of work in inner loop. | Henning Baldersheim | 2018-01-09 | 3 | -5/+28 |
| | | |||||
| * | Inline simple method called in innerloop. | Henning Baldersheim | 2018-01-09 | 2 | -22/+11 |
| | | |||||
| * | Add an inner unconditional reduce to avoid temporary vector. | Henning Baldersheim | 2018-01-09 | 2 | -2/+10 |
| | | |||||
| * | Add newline at eof | Henning Baldersheim | 2018-01-09 | 1 | -1/+2 |
| | | |||||
| * | Move implementation form headerfile to implementationfile. | Henning Baldersheim | 2018-01-09 | 4 | -49/+70 |
| | | |||||
| * | Inline Mul and Add in reduce | Henning Baldersheim | 2018-01-09 | 1 | -0/+6 |
| | | |||||
| * | Unify alignment. | Henning Baldersheim | 2018-01-09 | 1 | -4/+4 |
| | | |||||
| * | Cache the size in a 32 bit variable | Henning Baldersheim | 2018-01-09 | 2 | -8/+10 |
| | | |||||
| * | Use nested namespace | Henning Baldersheim | 2018-01-09 | 3 | -27/+12 |
| | | |||||
| * | initial experimentation with genetic programming | Håvard Pettersen | 2018-01-09 | 9 | -5/+921 |
| | | |||||
| * | Add a for_each method for more efficient iteration. | Henning Baldersheim | 2018-01-03 | 2 | -4/+1 |
| | | |||||
| * | Let implementation be visible too. | Henning Baldersheim | 2017-12-29 | 1 | -3/+1 |
| | | |||||
| * | Must see implementation too. | Henning Baldersheim | 2017-12-29 | 2 | -0/+2 |
| | | |||||
| * | Include implementation file too. | Henning Baldersheim | 2017-12-29 | 1 | -4/+3 |
| | | |||||
| * | Ensure methods are inlined. | Henning Baldersheim | 2017-12-29 | 1 | -1/+5 |
| | | |||||
| * | Also copy the zero termination. | Henning Baldersheim | 2017-12-29 | 1 | -1/+1 |
| | | |||||
 |
index : vespa | |
| An engine for low-latency computation over large data sets |
| summaryrefslogtreecommitdiffstats |