Home | Trees | Indices | Help |
|
---|
|
object --+ | list --+ | Cache
An object representing a LAL cache file. Currently it is possible to add anything to a Cache. This method should check that the thing you are adding is a CacheEntry and throw and error if it is not.
|
|||
entry_class |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
|
|||
|
|||
|
|
|||
Inherited from |
|
|||
Inherited from |
|
x[i:j] Use of negative indices is not supported.
|
Runs through the entries of the Cache() object and checks each entry if the file which it points to exists or not. If the file does exist then it adds the entry to the Cache() object containing found files, otherwise it adds the entry to the Cache() object containing all entries that are missing. It returns both in the follwing order: Cache_Found, Cache_Missed. Pass on_missing to control how missing files are handled: "warn": print a warning message saying how many files are missing out of the total checked. "error": raise an exception if any are missing "ignore": do nothing |
Return a Cache whose entries are inferred from the URLs in urllist, if possible. PFN lists will also work; for PFNs, the path will be absolutized and "file://" and "localhost" will be assumed for the schemes and hosts. The filenames must be in the format set forth by DASWG in T050017-00. |
Return a Cache object with those CacheEntries that contain the given patterns (or overlap, in the case of segment or segmentlist). If exact_match is True, then non-None ifos, description, and segment patterns must match exactly, and a non-None segmentlist must contain a segment which matches exactly). It makes little sense to specify both segment and segmentlist arguments, but it is not prohibited. Bash-style wildcards (*?) are allowed for ifos and description. |
Return a segmentlistdict object describing the instruments and times spanned by the entries in this Cache. The return value is coalesced. |
Return a Cache which has every element of self, but without duplication. Preserve order. Does not hash, so a bit slow. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Dec 12 00:34:18 2017 | http://epydoc.sourceforge.net |