Hi,
we are building a software that aims to find out what repositories contain a specific file (eg: .gitignore)
In order to obtain that file, we send our requests to the bitbucket REST APIs after parsing the list of repositories (https://api.bitbucket.org/2.0/repositories).
The rate-limit is pretty high but we need to ensure that, if something goes wrong and that limits are hit, we can recover our process from last successful request.
We have implemented a simple solution but it’s really hard to test.
We cannot exhaust our resources (60k https r/h and 1k r/h on repos) every time we want to check out if the implemented solution is correct (and it’s really a bad idea to waste server resources only for these tests).
Do you have any ideas on how manage this problem?
Hi!
Is it possible use the limit and start parameters, of course you need to save last position.
Hence you can iterate correctly under limitations as well,
Cheers,
Gonchik Tsymzhitov
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.