summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorJulian Andres Klode <julian.klode@canonical.com>2021-07-08 16:49:20 +0200
committerJulian Andres Klode <julian.klode@canonical.com>2021-07-28 13:04:10 +0200
commit121ccd0e0c2612bab9ba5383d5599b54e29e4643 (patch)
tree2ea80ee1db0f6878e53068961f6b68e1bb0d0840 /doc
parent363e3a4c91da353d99cf1af3d5089c9455d461de (diff)
Implement exponential delay between retries
Add a new Item field called FetchAfter, which determines the earliest time the item should be fetched at. Adjust insertion into queue to take it into account alongside priority, and only fill pipelines with items that are ready.
Diffstat (limited to 'doc')
-rw-r--r--doc/examples/configure-index4
1 files changed, 3 insertions, 1 deletions
diff --git a/doc/examples/configure-index b/doc/examples/configure-index
index 312ee27d6..e74ebc3d7 100644
--- a/doc/examples/configure-index
+++ b/doc/examples/configure-index
@@ -230,7 +230,9 @@ APT
Acquire
{
Queue-Mode "<STRING>"; // host or access
- Retries "<INT>";
+ Retries "<INT>" {
+ Delay "<BOOL>"; // whether to backoff between retries using the delay: method
+ };
Source-Symlinks "<BOOL>";
ForceHash "<STRING>"; // hashmethod used for expected hash: sha256, sha1 or md5sum
Send-URI-Encoded "<BOOL>"; // false does the old encode/decode dance even if we could avoid it