Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Always use array of AtomicEntryRef in unique store remapper. | Tor Egge | 2022-03-17 | 1 | -10/+13 |
| | |||||
* | Use AtomicEntryRef in MultiValueMappingBase. | Tor Egge | 2022-03-09 | 1 | -20/+10 |
| | |||||
* | Use AtomicEntryRef as key for unique store btree dictionary. | Tor Egge | 2022-03-03 | 2 | -3/+3 |
| | |||||
* | Move memory allocator argument to be last argument. | Tor Egge | 2022-02-11 | 1 | -5/+4 |
| | |||||
* | Add memory allocator to array store. | Tor Egge | 2022-02-11 | 1 | -4/+16 |
| | |||||
* | Add memory allocator to unique store allocator | Tor Egge | 2022-02-10 | 4 | -4/+32 |
| | |||||
* | ignore local core files produced by gtest during death testing | Håvard Pettersen | 2022-01-27 | 1 | -0/+1 |
| | |||||
* | Rename max_buffers_ratio to active_buffers_ratio. | Tor Egge | 2021-12-14 | 1 | -6/+6 |
| | | | | Add comment before calculation of max buffers to compact at once. | ||||
* | Limit buffers to compact based on number of active and free buffers. | Tor Egge | 2021-12-14 | 1 | -9/+31 |
| | |||||
* | Add CompactBufferCandidates, used to select buffers to compact. | Tor Egge | 2021-12-13 | 2 | -0/+100 |
| | |||||
* | Add CompactionSpec. | Tor Egge | 2021-12-08 | 3 | -3/+13 |
| | | | | | Pass CompactionStrategy to DataStoreBase::startCompactWorstBuffers in preparation for compacting more buffers in the same compaction round. | ||||
* | Add EntryRefFilter class. | Tor Egge | 2021-12-06 | 1 | -22/+29 |
| | |||||
* | Filter early on buffer id and pass vector of entries in normalize_values | Tor Egge | 2021-12-03 | 1 | -29/+148 |
| | | | | and foreach_value ShardedHashMap member functions to limit number of callbacks. | ||||
* | Don't try to move dictionary keys that won't move. | Tor Egge | 2021-12-02 | 1 | -1/+25 |
| | |||||
* | Avoid livelock when running sharded hash map unit test with valgrind. | Tor Egge | 2021-11-28 | 1 | -0/+15 |
| | |||||
* | Detect direct free of element to held buffer. | Tor Egge | 2021-11-19 | 1 | -0/+52 |
| | |||||
* | Update 2019 Oath copyrights. | gjoranv | 2021-10-27 | 4 | -4/+4 |
| | |||||
* | Update Verizon Media copyright notices. | gjoranv | 2021-10-07 | 4 | -4/+4 |
| | |||||
* | Update 2018 copyright notices. | gjoranv | 2021-10-07 | 2 | -2/+2 |
| | |||||
* | Update 2017 copyright notices. | gjoranv | 2021-10-07 | 8 | -8/+8 |
| | |||||
* | Extend test of array store compaction context. | Tor Egge | 2021-08-18 | 1 | -10/+34 |
| | |||||
* | Consider reusing active buffer. | Tor Egge | 2021-08-16 | 3 | -15/+45 |
| | |||||
* | Revert "Consider reusing active buffer." | Henning Baldersheim | 2021-08-15 | 3 | -45/+15 |
| | |||||
* | Consider reusing active buffer. | Tor Egge | 2021-08-13 | 3 | -15/+45 |
| | |||||
* | Use stats from all active buffers of same type when resizing a buffer. | Tor Egge | 2021-08-12 | 2 | -16/+16 |
| | |||||
* | Use grow factor when considering switching to a new buffer. | Tor Egge | 2021-08-11 | 1 | -10/+10 |
| | | | | This enables earlier ramp-up of buffer sizes. | ||||
* | Use a list instead of a set to make building faster. | Henning Baldersheim | 2021-06-14 | 1 | -0/+33 |
| | | | | Then sort and uniq before applying the list. | ||||
* | Add explicit unit test for compact_worst_shard(). | Tor Egge | 2021-04-14 | 1 | -0/+13 |
| | |||||
* | Compact enum store dictionary when needed. | Tor Egge | 2021-04-13 | 1 | -11/+60 |
| | |||||
* | Sort unique values during load if needed. | Tor Egge | 2021-04-08 | 1 | -3/+3 |
| | |||||
* | Add noexcept specifier to lambda. | Tor Egge | 2021-04-07 | 1 | -1/+1 |
| | |||||
* | Extend unit test for ShardedHashMap. | Tor Egge | 2021-04-07 | 1 | -0/+61 |
| | |||||
* | Rename unit test type parameters. | Tor Egge | 2021-04-06 | 1 | -16/+16 |
| | |||||
* | Follow codestyle: getComp -> get_comp | Henning Baldersheim | 2021-04-06 | 1 | -4/+4 |
| | |||||
* | Add ShardedHashComparator so that a single divison will be used for both ↵ | Henning Baldersheim | 2021-03-31 | 1 | -4/+4 |
| | | | | | | dividend and remainder. The compiler will also be smarter about it as it is a known constsnt compile time both. | ||||
* | Handle UniqueStoreDictionary without B-tree. | Tor Egge | 2021-03-30 | 2 | -8/+53 |
| | |||||
* | Factor out ReadSnapshot from UniqueStoreDictionary. | Tor Egge | 2021-03-29 | 1 | -1/+1 |
| | |||||
* | Rename SimpleHashMap to ShardedHashMap. | Tor Egge | 2021-03-26 | 5 | -31/+31 |
| | |||||
* | Report memory usage from unique store dictionary hash. | Tor Egge | 2021-03-25 | 3 | -21/+88 |
| | |||||
* | Track name change from ordered / unordered to btree / hash. | Tor Egge | 2021-03-24 | 1 | -19/+19 |
| | |||||
* | Extend UniqueStore unit test. | Tor Egge | 2021-03-18 | 1 | -41/+117 |
| | |||||
* | Update unordered dictionary. | Tor Egge | 2021-03-18 | 2 | -3/+3 |
| | |||||
* | Wire in ordering enum in EnumStore. | Tor Egge | 2021-03-17 | 1 | -1/+1 |
| | |||||
* | Extend FixedSizeHashMap unit test. | Tor Egge | 2021-03-12 | 1 | -4/+86 |
| | |||||
* | Remove duplicate tests. | Tor Egge | 2021-03-11 | 2 | -171/+26 |
| | |||||
* | Update prev_node_idx in loop when removing entry. | Tor Egge | 2021-03-11 | 2 | -0/+321 |
| | | | | | Use next_node_idx instead of next. Use first_used instead of used_gen or usedGen. | ||||
* | Add lock free hash map. | Tor Egge | 2021-03-10 | 3 | -0/+244 |
| | |||||
* | Add simple equal to Comparator interface. | Henning Baldersheim | 2021-03-09 | 1 | -0/+3 |
| | |||||
* | Convert comparator from being a simple comparator to using an explicit less ↵ | Henning Baldersheim | 2021-03-09 | 1 | -1/+1 |
| | | | | method. | ||||
* | Take dead elements into account (and subtract them) when calculating how ↵ | Geir Storli | 2021-03-01 | 1 | -3/+30 |
| | | | | | | | | | | | | many arrays to allocate in a datastore buffer. This avoids a problem were allocated memory can accumulate over time in components using an ArrayStore. If all documents in an array attribute vector changes from one value class to another, all elements in the buffers of the previous value class are marked dead. Those buffers will eventually be compacted. Without this fix the wanted size of the resulting compacted buffer is calculated too high, and we allocate memory we are not going to use. If we move to yet another value class later, the same problem occurs again and more memory is allocated. |