summaryrefslogtreecommitdiffstats
path: root/searchlib
Commit message (Expand)AuthorAgeFilesLines
...
| * | | Invalidate previous KeySetHenning Baldersheim2016-08-263-9/+68
| * | | Must invalidate on remove too ...Henning Baldersheim2016-08-261-0/+1
| * | | Must invalidate on remove/write ...Henning Baldersheim2016-08-262-0/+2
| * | | Initial end to end visit cache skelton.Henning Baldersheim2016-08-261-1/+156
| * | | Add the cache stats from the visit cache too.Henning Baldersheim2016-08-263-2/+12
| * | | Ensure that remove invalidates the correct keyset.Henning Baldersheim2016-08-263-5/+55
| * | | Test that we get a set when requesting so.Henning Baldersheim2016-08-261-1/+6
| * | | Test basics of VisitCacheHenning Baldersheim2016-08-261-15/+59
| * | | Do not cache, empty results.Henning Baldersheim2016-08-262-1/+2
| * | | Avoid accessing non-exiting lids.Henning Baldersheim2016-08-261-3/+5
| * | | Add test for BlobSet/CompressedBlobSet.Henning Baldersheim2016-08-264-4/+29
| * | | Add unit tests to the sortable KeySet.Henning Baldersheim2016-08-264-0/+57
| * | | Actually copy the data in.Henning Baldersheim2016-08-262-1/+7
| * | | Copy, not reference temporarry stuff.Henning Baldersheim2016-08-261-2/+2
| * | | Initialize compression type.Henning Baldersheim2016-08-262-2/+2
| * | | Code wired all the way through ..... perhaps.....Henning Baldersheim2016-08-262-11/+87
| * | | Wire in some more meat to the bone.Henning Baldersheim2016-08-263-11/+34
| * | | Some more meat to the bone.Henning Baldersheim2016-08-261-0/+32
| * | | Now headers compiles fine.Henning Baldersheim2016-08-263-19/+25
| * | | Create VisitCache in documentstore.Henning Baldersheim2016-08-264-7/+30
| * | | Reformat.Henning Baldersheim2016-08-262-41/+29
| * | | make it compile.Henning Baldersheim2016-08-262-5/+3
| * | | Add skeleton of a visit cache.Henning Baldersheim2016-08-265-1/+135
| * | | Both config and visitor must allow visit caching.Henning Baldersheim2016-08-262-11/+3
| * | | Revert previous commit.Henning Baldersheim2016-08-262-23/+2
| * | | Wire in a cacheAdapter so that visiting can fill the cache too.Henning Baldersheim2016-08-262-2/+23
| * | | Allow visiting to read from the cache, but not fill it.Henning Baldersheim2016-08-262-4/+22
| * | | Unify code.Henning Baldersheim2016-08-261-8/+3
* | | | Avoid gcc 6 misbehaviour.Henning Baldersheim2016-08-291-0/+2
* | | | GC unused codeHenning Baldersheim2016-08-291-15/+0
* | | | gcc 6 says that visibility is ignored on anonymous classes/methods. They are ...Henning Baldersheim2016-08-292-6/+6
| |/ / |/| |
* | | Fix comments and std::make_uniqueHenning Baldersheim2016-08-292-4/+4
* | | Use std::make_uniqueHenning Baldersheim2016-08-291-1/+1
| |/ |/|
* | Add class comments.Henning Baldersheim2016-08-271-0/+9
* | Need external store now.Henning Baldersheim2016-08-271-1/+2
* | Store the large temporary compressed data in a large mmapped buffer.Henning Baldersheim2016-08-274-16/+27
* | Move compacters to separate file.Henning Baldersheim2016-08-275-129/+146
|/
* We should drop the bucektizer guard to prevent the metastore from growing a h...Henning Baldersheim2016-08-261-0/+7
* Use bucketIdToKey instead of reverse.Henning Baldersheim2016-08-261-1/+1
* Use toKey instead of reverse of getId.Henning Baldersheim2016-08-261-1/+1
* Use toKey and upper bits.Henning Baldersheim2016-08-261-2/+2
* Test that sortorder is maintained.Henning Baldersheim2016-08-261-0/+1
* Also add medium level sorting.Henning Baldersheim2016-08-261-1/+1
* Remove unused include.Henning Baldersheim2016-08-261-1/+0
* Also verify content.Henning Baldersheim2016-08-261-1/+1
* Take advantage of order to achieve overall sorted buckets.Henning Baldersheim2016-08-262-3/+3
* Split code to separate file and add unit test for correct order.Henning Baldersheim2016-08-254-14/+83
* Move StoreByBucket to its own file for testability.Henning Baldersheim2016-08-254-97/+127
* Add ordering withing a bucket by using all bits.Henning Baldersheim2016-08-254-12/+22
* Add a function to IIndexEnvironment to get a constant rank value by name.Geir Storli2016-08-252-8/+26