Lister* intermediate class for any service that follows the pattern:
The service must report at least one stable unique identifier, known herein as the UID value, for every listed repository.
If the service splits the list of repositories into sublists, it must report at least one stable and sorted index identifier for every listed repository, known herein as the indexable value, which can be used as part of the service endpoint query to request a sublist beginning from that index. This might be the UID if the UID is monotonic.
Client sends a request to list repositories starting from a given index.
Client receives structured (json/xml/etc) response with information about a sequential series of repositories starting from that index and, if necessary/available, some indication of the URL or index for fetching the next series of repository data.
swh.lister.core.lister_base.ListerBasefor more details.
This class cannot be instantiated. To create a new Lister for a source code listing service that follows the model described above, you must subclass this class and provide the required overrides in addition to any unmet implementation/override requirements of this class’s base. (see parent class and member docstrings for details)
Number of iterations in-between write flushes of lister repositories to db (see fn:run).
Default initialization value for the minimum boundary index to use when undefined (see fn:run).
Find the next server endpoint identifier given the entire response.
Implementation of this method depends on the server API spec and the shape of the network response object returned by the transport_request method.
response (transport response) – response page from the server
index of next page, possibly extracted from a next href url
Bounds query results by this Lister’s set max_index.
- Look in the db for a range of repositories with indexable
values in the range [start, end]
start (model indexable type) – start of desired indexable range
end (model indexable type) – end of desired indexable range
- a list of sqlalchemy.ext.declarative.declarative_base objects
with indexable values within the given range
- Describe an index-space compartmentalization of the db table
in equal sized chunks. This is used to describe min&max bounds for parallelizing fetch tasks.
partition_size (int) – desired size to make each partition
a list of tuples (begin, end) of indexable value that declare approximately equal-sized ranges of existing repos
Look in the db for the smallest indexable value
the smallest indexable value of all repos in the db
Look in the db for the largest indexable value
the largest indexable value of all repos in the db
disable_deleted_repo_tasks(start, end, keep_these)¶
Disable tasks for repos that no longer exist between start and end.
start – beginning of range to disable
end – end of range to disable
keep_these (uid list) – do not disable repos with uids in this list
- Main entry function. Sequentially fetches repository data
from the service according to the basic outline in the class docstring, continually fetching sublists until either there is no next index reference given or the given next index is greater than the desired max_bound.
min_bound (indexable type) – optional index to start from
max_bound (indexable type) – optional index to stop at
Convenience class for ensuring right lookup and init order when combining IndexingLister and ListerHttpTransport.