| Shuffled sift_down() code, so the compiler may easily prove that children_count passed to move_up_max_child() is always greater than zero |
|
More...
|
over 11 years ago
|
| Shuffled _sift_down() code, so the compiler may easily prove that children_count passed to move_up_max_child() is always greater than zero |
|
More...
|
over 11 years ago
|
| added more asserts |
|
More...
|
over 11 years ago
|
| Removed unused value_type typedef and added an additional assert() into _move_up_max_child() |
|
More...
|
over 11 years ago
|
| move_up_max_child() micro-optimization, which lead to few percents performance increase in certain perftests |
|
More...
|
over 11 years ago
|
| Decreased the level of WTF in Makefile: now 'make tests' actually builds and runs tests instead of just building the tests |
|
More...
|
over 11 years ago
|
| README prettifying |
|
More...
|
about 12 years ago
|
| added missing 'static' specifier for private function defined in galgorithm.h file |
|
More...
|
about 12 years ago
|
| Don't count pagefaults if the previous page is in LRU list |
|
More...
|
about 12 years ago
|
| Properly handle possible integer overflow, when size (unsigned type) is larger than the maximum value of ptrdiff_t (signed type) |
|
More...
|
about 12 years ago
|
| handle the case when std::get_temporary_buffer() returns less memory than requested |
|
More...
|
about 12 years ago
|
| use std::list instead of std::deque for emulating of LRU list of memory pages, because std::list is faster in moving elements from the middle of the list to the beginning of the list comparing to std::deque |
|
More...
|
about 12 years ago
|
| fixed misleading description for nway_mergesort() |
|
More...
|
about 12 years ago
|
| _std_small_range_sorter() should work with LessComparer functor |
|
More...
|
about 12 years ago
|
| take into account pagefaults on swap() and operator<() calls |
|
More...
|
about 12 years ago
|
| resolved problems with -std=c++98 builds |
|
More...
|
about 12 years ago
|
| added Makefile for building various tests |
|
More...
|
about 12 years ago
|
| mention test files in README |
|
More...
|
about 12 years ago
|
| put least recently used pages into the front of deque instead of back for speeding up least recently used pages search |
|
More...
|
about 12 years ago
|
| track the number of pagefaults in ops_count_test.cpp |
|
More...
|
about 12 years ago
|
| added worst-case tests for STL sort and n-way mergesort for proof that n-way mergesort is free of bad cases |
|
More...
|
about 12 years ago
|
| mention about sophisticated heap implementation in README |
|
More...
|
about 12 years ago
|
| README update |
|
More...
|
about 12 years ago
|
| updated comments for nway_mergesort() |
|
More...
|
about 12 years ago
|
| dynamically allocate space for input contextes |
|
More...
|
about 12 years ago
|
| added n-way mergesort implementation in C |
|
More...
|
about 12 years ago
|
| rename _galgorithm_nway_less_comparer* to _galgorithm_nway_merge_less_comparer* for the consistency with C++ implementation |
|
More...
|
about 12 years ago
|
| use the trick suggested at http://gcc.gnu.org/bugzilla/show_bug.cgi?id=51981#c2 for uninitialized_move() implementation |
|
More...
|
about 12 years ago
|
| now nway_mergesort() accepts forward iterators instead of random-access iterators |
|
More...
|
about 12 years ago
|
| use std::uninitialized_copy() where appropriate |
|
More...
|
about 12 years ago
|
