Reducing complexity of implementation in order to be able to add Atlas text search token based pagination

[kbuma]

Summary

Major changes:

• remove parallelization of server requests
• re-implement handling of list criteria for parameters in endpoints that do not accept lists (this was tied into the parallelization code previously)
• re-implement handling of list criteria that is too large for a single request (this was tied into the parallelization code previously)

[tsmathis]

Not really much to say on my end, I am be curious though about the performance/execution time of this implementation vs. the parallel approach.

[esoteric-ephemera]

any(trace in str(e) for trace in ("422","414","Got 0 results"))

[kbuma]

addressed with 18b0b79

[kbuma]

@esoteric-ephemera @tsmathis I've addressed all outstanding comments. Ready for re-review.

[tsmathis]

Nothing else to add from my end

[kbuma]

still a couple of .extend(...)s

this one should be fine, it's just the final step right? https://github.com/kbuma/api/blob/858accf6b00d90055eb21d642e0ac4eabf8ba921/mp_api/client/core/client.py#L732

this one is in a while loop: https://github.com/kbuma/api/blob/858accf6b00d90055eb21d642e0ac4eabf8ba921/mp_api/client/core/client.py#L806

@tsmathis addressed with fc25c1e