Fixed typos in redis.conf file.

This commit is contained in:
antirez 2013-12-05 16:28:35 +01:00
parent 58713c6b13
commit 74da4a574f

View File

@ -34,7 +34,7 @@ port 6379
# bind 192.168.1.100 10.0.0.1 # bind 192.168.1.100 10.0.0.1
# bind 127.0.0.1 # bind 127.0.0.1
# Specify the path for the unix socket that will be used to listen for # Specify the path for the Unix socket that will be used to listen for
# incoming connections. There is no default, so Redis will not listen # incoming connections. There is no default, so Redis will not listen
# on a unix socket when not specified. # on a unix socket when not specified.
# #
@ -68,7 +68,7 @@ tcp-keepalive 0
# warning (only very important / critical messages are logged) # warning (only very important / critical messages are logged)
loglevel notice loglevel notice
# Specify the log file name. Also the emptry string can be used to force # Specify the log file name. Also the empty string can be used to force
# Redis to log on the standard output. Note that if you use standard # Redis to log on the standard output. Note that if you use standard
# output for logging but daemonize, logs will be sent to /dev/null # output for logging but daemonize, logs will be sent to /dev/null
logfile "" logfile ""
@ -116,9 +116,9 @@ save 60 10000
# By default Redis will stop accepting writes if RDB snapshots are enabled # By default Redis will stop accepting writes if RDB snapshots are enabled
# (at least one save point) and the latest background save failed. # (at least one save point) and the latest background save failed.
# This will make the user aware (in an hard way) that data is not persisting # This will make the user aware (in a hard way) that data is not persisting
# on disk properly, otherwise chances are that no one will notice and some # on disk properly, otherwise chances are that no one will notice and some
# distater will happen. # disaster will happen.
# #
# If the background saving process will start working again Redis will # If the background saving process will start working again Redis will
# automatically allow writes again. # automatically allow writes again.
@ -263,7 +263,7 @@ repl-disable-tcp-nodelay no
# #
# A slave with a low priority number is considered better for promotion, so # A slave with a low priority number is considered better for promotion, so
# for instance if there are three slaves with priority 10, 100, 25 Sentinel will # for instance if there are three slaves with priority 10, 100, 25 Sentinel will
# pick the one wtih priority 10, that is the lowest. # pick the one with priority 10, that is the lowest.
# #
# However a special priority of 0 marks the slave as not able to perform the # However a special priority of 0 marks the slave as not able to perform the
# role of master, so a slave with priority of 0 will never be selected by # role of master, so a slave with priority of 0 will never be selected by
@ -351,7 +351,7 @@ slave-priority 100
# to reply to read-only commands like GET. # to reply to read-only commands like GET.
# #
# This option is usually useful when using Redis as an LRU cache, or to set # This option is usually useful when using Redis as an LRU cache, or to set
# an hard memory limit for an instance (using the 'noeviction' policy). # a hard memory limit for an instance (using the 'noeviction' policy).
# #
# WARNING: If you have slaves attached to an instance with maxmemory on, # WARNING: If you have slaves attached to an instance with maxmemory on,
# the size of the output buffers needed to feed the slaves are subtracted # the size of the output buffers needed to feed the slaves are subtracted
@ -632,7 +632,7 @@ zset-max-ziplist-value 64
# Active rehashing uses 1 millisecond every 100 milliseconds of CPU time in # Active rehashing uses 1 millisecond every 100 milliseconds of CPU time in
# order to help rehashing the main Redis hash table (the one mapping top-level # order to help rehashing the main Redis hash table (the one mapping top-level
# keys to values). The hash table implementation Redis uses (see dict.c) # keys to values). The hash table implementation Redis uses (see dict.c)
# performs a lazy rehashing: the more operation you run into an hash table # performs a lazy rehashing: the more operation you run into a hash table
# that is rehashing, the more rehashing "steps" are performed, so if the # that is rehashing, the more rehashing "steps" are performed, so if the
# server is idle the rehashing is never complete and some more memory is used # server is idle the rehashing is never complete and some more memory is used
# by the hash table. # by the hash table.
@ -687,7 +687,7 @@ client-output-buffer-limit slave 256mb 64mb 60
client-output-buffer-limit pubsub 32mb 8mb 60 client-output-buffer-limit pubsub 32mb 8mb 60
# Redis calls an internal function to perform many background tasks, like # Redis calls an internal function to perform many background tasks, like
# closing connections of clients in timeot, purging expired keys that are # closing connections of clients in timeout, purging expired keys that are
# never requested, and so forth. # never requested, and so forth.
# #
# Not all tasks are performed with the same frequency, but Redis checks for # Not all tasks are performed with the same frequency, but Redis checks for