Skip to content
Rotate backups with an optimal balance between retention and space usage
Haskell
Find file
Latest commit c79c5da Jan 25, 2011 @jekor Moving to github.com
Failed to load latest commit information.
COPYING Moving to github.com Jan 25, 2011
Makefile Moving to github.com Jan 26, 2011
README Moving to github.com Jan 26, 2011
Setup.lhs Moving to github.com Jan 26, 2011
log2rotate.cabal Moving to github.com Jan 26, 2011
log2rotate.lhs Moving to github.com Jan 26, 2011

README

log2rotate is designed to rotate backups with an optimal balance between retention and space usage. Instead of rotating backups using some familiar method such as daily, weekly, monthly, and yearly periods, it rotates backups using exponentially-growing periods. The exponential periods are based on the base 2 logarithm (log2x) or squaring (x2), depending on how you look at it.

log2rotate makes the guarantee that the distance between the nth and (n+1)th backups will be no greater than twice the distance between the (n-1)th and nth backups. The optimal is periodically achieved. For example, on the 64th rotation, log2rotate will recommend retaining the backups numbered: 1, 2, 4, 8, 16, 32, and 64.

How to Build
============
Just run make.

Note that you'll need lhs2TeX installed (even though the .cabal file does not
list it as a dependency). This is so that GHC can use lhs2TeX as a preprocessor
(there is some verbatim LaTeX in log2rotate.lhs that throws off the default
preprocessor).
Something went wrong with that request. Please try again.