| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Simplify how used elements across all active buffers are aggregated. | Geir Storli | 2021-03-01 | 1 | -3/+3 |
| * | Account for different memory usage with libc++. | Tor Egge | 2021-02-27 | 1 | -0/+5 |
| * | use size literals in vespalib | Arne Juul | 2021-02-15 | 1 | -2/+3 |
| * | Forward declare MemoryAllocator in vespalib/util/alloc.h. | Tor Egge | 2021-02-13 | 1 | -0/+1 |
| * | Annotate the expensive array_store test not the array_test. | Henning Baldersheim | 2021-01-13 | 1 | -1/+1 |
| * | Store the entry refs in an vepalib::hash_map that is faster than std::map. Sa... | Henning Baldersheim | 2021-01-12 | 1 | -1/+2 |
| * | Have the BufferType::_emptyEntry be static. | Henning Baldersheim | 2021-01-10 | 1 | -0/+9 |
| * | Rename namespace search::btree to vespalib::btree. | Tor Egge | 2020-05-04 | 1 | -3/+3 |
| * | Add free-list support to ArrayStore | Tor Brede Vekterli | 2019-08-16 | 1 | -4/+49 |
| * | Add separate allocator for strings in unique store. | Tor Egge | 2019-08-15 | 1 | -1/+1 |
| * | Move datastore and btree code from searchlib to vespalib | Tor Brede Vekterli | 2019-05-27 | 2 | -0/+368 |
 |
index : vespa | |
| An engine for low-latency computation over large data sets |
| summaryrefslogtreecommitdiffstats |