pub fn accesses_per_refresh<'a>(&'a mut self, accesses: usize) -> &mut Self {
        if accesses < 1 {
            panic!("Incorrectly configured access_per_refresh rate. Values of 0 or 1 are not allowed.");
        } else {
            if accesses == 1 {
                warn!("The accesses_per_refresh value of 1 should not be used except in a development environment. This will cause the cache to refresh the file every time it is requested, negating its purpose as a cache.");
            }
            self.accesses_per_refresh = Some(accesses);
        }
        self
    }
/// Sets the number of times a file can be accessed from the cache before it will be refreshed from the disk.
/// By providing 1000, that will instruct the cache to refresh the file every 1000 times its accessed.
/// By default, the cache will not refresh the file.
///
/// This should be useful if you anticipate bitrot for the cache contents in RAM, as it will
/// refresh the file from the FileSystem, meaning that if there is an error in the cached data,
/// it will only be served for an average of n/2 accesses before the automatic refresh replaces it
/// with an assumed correct copy.
///
/// # Panics
/// This function will panic if 0 is supplied.
/// This is to prevent 0 being used as a divisor in a modulo operation later.
///
Sets the number of times a file can be accessed from the cache before it will be refreshed from the disk.
By providing 1000, that will instruct the cache to refresh the file every 1000 times its accessed.
By default, the cache will not refresh the file.

This should be useful if you anticipate bitrot for the cache contents in RAM, as it will
refresh the file from the FileSystem, meaning that if there is an error in the cached data,
it will only be served for an average of n/2 accesses before the automatic refresh replaces it
with an assumed correct copy.
Sets the number of times a file can be accessed from the cache before it will be refreshed from the disk . By providing 1000 that will instruct the cache to refresh the file every 1000 times its accessed . By default the cache will not refresh the file . This should be useful if you anticipate bitrot for the cache contents in RAM as it will refresh the file from the FileSystem meaning that if there is an error in the cached data it will only be served for an average of n / 2 accesses before the automatic refresh replaces it with an assumed correct copy .
pub fn accesses_per_refresh<'a>(&'a mut self, accesses: usize) -> &mut Self {
        if accesses < 1 {
            panic!("Incorrectly configured access_per_refresh rate. Values of 0 or 1 are not allowed.");
        } else {
            if accesses == 1 {
                warn!("The accesses_per_refresh value of 1 should not be used except in a development environment. This will cause the cache to refresh the file every time it is requested, negating its purpose as a cache.");
            }
            self.accesses_per_refresh = Some(accesses);
        }
        self
    }
pub fn accesses_per_refresh < ' a > ( & ' a mut self , accesses : usize ) -> & mut Self { if accesses < 1 { panic ! ( " " ) ; } else { if accesses == 1 { warn ! ( " " ) ; } self . accesses_per_refresh = Some ( accesses ) ; } self }
Sets the number of times a file can be accessed from the cache before it will be refreshed from the disk.
Sets the number of times a file can be accessed from the cache before it will be refreshed from the disk .
&'a mut self
accesses
usize
&'a mut self
accesses
usize
panics
This function will panic if 0 is supplied.
This is to prevent 0 being used as a divisor in a modulo operation later.
This function will panic if 0 is supplied . This is to prevent 0 being used as a divisor in a modulo operation later .