| Home | Trees | Indices | Help |
|
|---|
|
|
object --+
|
QuerySet
A representation of the translation from (name, versionStr, flavor) to a set of queries that can be made to the repository.
The set of queries may be ordered, as when an installLabelPath is checked, or they may be unordered as when using label affinity to search for updates to two packages at once.
The query has several components.
troveSpec: The original (n,v,f) query success: True if this query is successful results: List of results returned by this query (unordered)
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from |
|||
|
|||
useFilter = False
|
|||
|
|||
| _activeByQueue | |||
| _alternatesByQueue | |||
| _searchIdx | |||
| _searchQueues | |||
| results | |||
| searchKey | |||
| success | |||
| troveSpec | |||
|
Inherited from |
|||
|
|||
|
|
Add a set of searches to do, in order, for this QuerySet. The queue should be a list of lists to search, e.g.: [[(n,v,f), (n,v,f')], [(n,v',f), (n,v',f'')]] Items in the first list will be searched first and a result for any of those queries will stop the queue. If no results from the first list return the second list will be searched, and so on. |
Return the next set of queries to pass to the repository (max one per queue). The returned result is of the form: [(queueIdx, list of queries for this idx), (queueIdx', ...)] |
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0beta1 on Thu Jul 10 11:46:15 2008 | http://epydoc.sourceforge.net |