aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorIgor Pashev <pashev.igor@gmail.com>2019-09-02 23:49:45 +0200
committerGitHub <noreply@github.com>2019-09-02 23:49:45 +0200
commit815d792c9a095ccffc7f01391836d3e5e6fc6f72 (patch)
tree41362749b428d1e809ad604567c7861490baf378
parent72480d98aff91590f11adee8ea0501ba7c490764 (diff)
downloadfrotate.hs-815d792c9a095ccffc7f01391836d3e5e6fc6f72.tar.gz
Fix a typo
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index ace4c08..132cc7f 100644
--- a/README.md
+++ b/README.md
@@ -14,7 +14,7 @@ The idea is simple, the rotation schedule is determined by an integer function.
This function gives us a period (number) of days when we must encounter at
least one backup or whatever we are rotating. When we use an exponential
function, the scheme is similar to the radioactive decay law. When the
-funtion is simply a constant 1, we don't rotate anything and retain all
+function is simply a constant 1, we don't rotate anything and retain all
the backups. If it is 2, we retain each second backup. With some trivial
function we can achieve a well-known dayly-weekly-monthly-yearly scheme.