mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-10 20:05:49 +00:00
96593594d3
The test captures the existing logic in `_processIncoming`, even though it's not quite correct: * First, we fetch all records changed since the last sync, up to the download limit, and without an explicit sort order. This happens to work correctly now because the Python server uses "newest" by default, but can change in the future. * If we reached the download limit fetching records, we request IDs for all records changed since the last sync, also up to the download limit, and sorted by index. This is likely to return IDs for records we've already seen, since the index is based on the frecency. It's also likely to miss IDs for other changed records, because the number of changed records might be higher than the download limit. * Since we then fast-forward the last sync time, we'll never download any remaining changed records that we didn't add to our backlog. * Finally, we backfill previously failed and backlogged records. MozReview-Commit-ID: 7uQLXMseMIU --HG-- extra : rebase_source : 719ee2d9e46102195251b410f093da3247095c22 |
||
---|---|---|
.. | ||
blocklists | ||
common | ||
crypto | ||
fxaccounts | ||
sync | ||
.eslintrc.js | ||
moz.build |