Age | Commit message (Collapse) | Author | |
---|---|---|---|
2011-08-07 | JANITORIAL: Remove trailing empty lines. | Christoph Mallon | |
2011-05-12 | GIT: Clean up: Suppress SVN tags, now useless | strangerke | |
2010-11-01 | COMMON: Change some (f)printf to debug calls; clenaup hashmap.h | Max Horn | |
svn-id: r54003 | |||
2010-03-20 | Some style fixes. | Johannes Schickel | |
svn-id: r48313 | |||
2009-12-07 | COMMON: Document class MemoryPool; make MemoryPool::_chunkSize const | Max Horn | |
svn-id: r46282 | |||
2009-09-06 | COMMON: (Inactive) code to debug memory leaks in memory pools + typo fix | Bertrand Augereau | |
svn-id: r43990 | |||
2009-05-03 | COMMON: Optimized MemoryPool::freeUnusedPages (if many pages are phased out ↵ | Max Horn | |
at once, don't copy everything multiple times around) svn-id: r40292 | |||
2008-12-22 | Fixed indentation and removed whitespaces at the end of line | Jordi Vilalta Prat | |
svn-id: r35481 | |||
2008-10-30 | Reset _chunksPerPage after MemoryPool::freeUnusedPages, to avoid enormous ↵ | Max Horn | |
memory consumption in various easy to trigger situations; out of paranoia, prohibit for now memory chunks bigger than 16MB svn-id: r34868 | |||
2008-10-12 | COMMON: Added a new ObjectPool class, with matching operator new/delete ↵ | Max Horn | |
overloads svn-id: r34785 | |||
2008-09-02 | Revised HashMap implementation | Max Horn | |
svn-id: r34273 | |||
2008-04-04 | cleanup | Max Horn | |
svn-id: r31391 | |||
2008-03-30 | Some minor whitespace changes, and the customary "end of namespace" comment. | Torbjörn Andersson | |
svn-id: r31338 | |||
2008-03-30 | Whitespacing fixes | Bertrand Augereau | |
svn-id: r31330 | |||
2008-03-30 | std::max => utils.h MAX | Bertrand Augereau | |
Added GPL headers svn-id: r31324 | |||
2008-03-30 | Fixed signed/unsigned warning. | Torbjörn Andersson | |
svn-id: r31322 | |||
2008-03-30 | The hashmap uses the memorypool for allocating/deallocating its Nodes | Bertrand Augereau | |
(It is faster and it saves approximately 70kB the DS or other small devices will appreciate having) svn-id: r31321 | |||
2008-03-30 | Introduction of a fixed size memory pool with a typical free list implementation | Bertrand Augereau | |
+ : amortized O(1) allocation, O(1) deallocation, less overhead per allocation - : unused memory is not reclaimed until death or manual invocation of a function svn-id: r31320 |