In T344378 we've prototyped a linter check to detect missing image alt text which we can then draw from; need to confirm whether we can suitably pick a random matching page from a very long list (potentially hundreds of thousands of matches or more) without overstacking things from one end or the other or becoming too slow.
Randomization is hard. ;)
Todo:
- look at the Extension:Linter API endpoint to confirm how to fetch matches via it now
- do some query tests to see if similar queries with large random offsets perform well
- if not, devise an alternate fetch method, eg a pre-sorted queue
Acceptable possibilities:
- extend the linter API with suitable parameters if needed
- add a second extension with a targeted API if it doesn't fit well
- a second table with a suitably sorted queue may need to be maintained. this will be expected to be small in absolute terms, and self-contained with easy deployment characteristics
- if this is easy to do for all lints, do it that way, it will be useful later for other microtasks