summaryrefslogtreecommitdiffstats
path: root/eval
Commit message (Expand)AuthorAgeFilesLines
...
* | Use cheap and_modulator instead of prime modulator to avoid costly division.Henning Baldersheim2018-01-102-2/+4
* | Different hashing gives different order.Henning Baldersheim2018-01-101-2/+2
* | Add missing newline at eof and align members.Henning Baldersheim2018-01-101-2/+3
* | Use XXH32 for hashing.Henning Baldersheim2018-01-101-9/+4
|/
* Go back to using a single combiner.Henning Baldersheim2018-01-093-98/+58
* Allow for building index on the outside.Henning Baldersheim2018-01-091-1/+4
* Use bracesHenning Baldersheim2018-01-091-1/+3
* _mutable -> _rightHenning Baldersheim2018-01-092-5/+5
* combiner not needed in lambdaHenning Baldersheim2018-01-091-1/+1
* Remove unused code.Henning Baldersheim2018-01-092-35/+10
* Remove unused code.Henning Baldersheim2018-01-091-25/+0
* Initialize membersHenning Baldersheim2018-01-091-1/+4
* No need to update the right address, as we update cellIdx inline.Henning Baldersheim2018-01-091-7/+6
* Specialize add and mulHenning Baldersheim2018-01-091-0/+12
* Update the combined adress inline.Henning Baldersheim2018-01-093-28/+27
* Split in 2 methods to avoid if in inner loop.Henning Baldersheim2018-01-092-8/+36
* Iterate only the valid dimensions.Henning Baldersheim2018-01-093-6/+109
* Combine address in steps to reduce amount of work in inner loop.Henning Baldersheim2018-01-093-5/+28
* Inline simple method called in innerloop.Henning Baldersheim2018-01-092-22/+11
* Add an inner unconditional reduce to avoid temporary vector.Henning Baldersheim2018-01-092-2/+10
* Add newline at eofHenning Baldersheim2018-01-091-1/+2
* Move implementation form headerfile to implementationfile.Henning Baldersheim2018-01-094-49/+70
* Inline Mul and Add in reduceHenning Baldersheim2018-01-091-0/+6
* Unify alignment.Henning Baldersheim2018-01-091-4/+4
* Cache the size in a 32 bit variableHenning Baldersheim2018-01-092-8/+10
* Use nested namespaceHenning Baldersheim2018-01-093-27/+12
* initial experimentation with genetic programmingHåvard Pettersen2018-01-099-5/+921
* Add a for_each method for more efficient iteration.Henning Baldersheim2018-01-032-4/+1
* Let implementation be visible too.Henning Baldersheim2017-12-291-3/+1
* Must see implementation too.Henning Baldersheim2017-12-292-0/+2
* Include implementation file too.Henning Baldersheim2017-12-291-4/+3
* Ensure methods are inlined.Henning Baldersheim2017-12-291-1/+5
* Also copy the zero termination.Henning Baldersheim2017-12-291-1/+1
* Avoid all the plt indirections by declaring dll local and using simpler struc...Henning Baldersheim2017-12-294-14/+20
* Use a prime based hash instead.Henning Baldersheim2017-12-192-6/+2
* Add fully parameterized instantiation macros.Henning Baldersheim2017-12-191-1/+4
* Use 2inN modulator instead of prime number modulator to avoid expensive divHenning Baldersheim2017-12-191-1/+2
* Inline DenseTensorAddressCombiner::combineHenning Baldersheim2017-12-192-59/+35
* Avoid type conversion and also use a presized address scratchpadHenning Baldersheim2017-12-191-7/+9
* DenseTensorCellsIterator::nextHenning Baldersheim2017-12-192-16/+12
* Micro optimize DenseTensorCellsIterator::next by expecting most probable bran...Henning Baldersheim2017-12-1914-52/+46
* Avoid division imposed by moduloHenning Baldersheim2017-12-181-2/+4
* Unify on nested namespace.Henning Baldersheim2017-12-1834-200/+116
* Consider overlapping dimensions when estimating resulting tensor space.Henning Baldersheim2017-12-185-24/+40
* Estimate number of cells needed in the hashmap.Henning Baldersheim2017-12-182-2/+3
* Use nested namespace.Henning Baldersheim2017-12-1814-66/+26
* Use nested namespace.Henning Baldersheim2017-12-183-28/+17
* Reserve space up front.Henning Baldersheim2017-12-181-13/+7
* Add method to allocate space up front.Henning Baldersheim2017-12-181-4/+3
* Only use 32 bits for hash and size.Henning Baldersheim2017-12-182-9/+9