Age | Commit message (Collapse) | Author |
|
|
|
requests concurrently in due course
|
|
|
|
|
|
quickly
Rather than waiting for the whole length of a visibility timeout,
in which time another process may grab the message, instead wait
a short amount of time, each time the message is searched for.
Also add a bit more logging.
|
|
the case of heartbeat running out
|
|
|
|
|
|
the graph
|
|
This is done by checking for the error that is emitted in such a
case, and if it's found trying several times to find the message
back in the queue, and returning the message with an updated
handle back to the caller to use in the future.
|
|
|
|
confidence is recognised
|
|
|
|
|
|
|
|
doesn't rely on channels
|
|
are done in the case of an error
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
This has involved refactoring to make the interface simpler, and just
use the URLs / IDs for the necessary queues and storage locations,
rather than wrap these in functions.
|
|
|
|
to be passed
|
|
|
|
|