| Home | Trees | Indices | Help |
|
|---|
|
|
Hold information about available chains and sets
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Make new object. Does not set values |
Set values from archive_dir and backend. Returns self for convenience. If sig_chain_warning is set to None, do not warn about unnecessary sig chains. This is because there may naturally be some unecessary ones after a full backup. |
Set self.matched_chain_pair and self.other_sig/backup_chains The latest matched_chain_pair will be set. If there are both remote and local signature chains capable of matching the latest backup chain, use the local sig chain (it does not need to be downloaded). |
Split given filename_list into chains Return value will be tuple (list of chains, list of sets, list of incomplete sets), where the list of sets will comprise sets not fitting into any chain, and the incomplete sets are sets missing files. |
Find chains in archive_dir (if local is true) or backend Use filelist if given, otherwise regenerate. Return value is pair (list of chains, list of signature paths not in any chains). |
Return chains sorted by end_time. If tie, local goes last |
Return backup chain covering specified time Tries to find the backup chain covering the given time. If there is none, return the earliest chain before, and failing that, the earliest chain. |
Return signature chain covering specified time Tries to find the signature chain covering the given time. If there is none, return the earliest chain before, and failing that, the earliest chain. |
Return list of the names of extraneous duplicity files A duplicity file is considered extraneous if it is recognizable as a duplicity file, but isn't part of some complete backup set, or current signature chain. |
Return the nth-to-last full backup of the collection, or None if there is less than n backup chains. NOTE: n = 1 -> time of latest available chain (n = 0 is not a valid input). Thus the second-to-last is obtained with n=2 rather than n=1. |
Returns a list of backup sets older than the given time t All of the times will be associated with an intact chain. Furthermore, none of the times will be of a set which a newer set may depend on. For instance, if set A is a full set older than t, and set B is an incremental based on A which is newer than t, then the time of set A will not be returned. |
Returns list of old backup sets required by new sets This function is similar to the previous one, but it only returns the times of sets which are old but part of the chains where the newer end of the chain is newer than t. |
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Fri Nov 25 13:38:18 2011 | http://epydoc.sourceforge.net |