https://developer.apple.com/documentation/corelocation/clloc...
(Edit: annoyingly, the parentheses are part of the URL. I don’t know how to encode them to make HN’s link parser happy, so you may have to add them by hand if you follow the link.)
(Edit 2: fixed, duh--thanks @akovaski!)
> If more than two elements are missing (or duplicated), then analyzing the individual bits fails because there are several combinations possible for both 0 and 1 as results. The problem then seems to require more complex solutions, which are not based on XOR anymore.
If you consider XOR to be a little bit more general, I think you can still use something like the partitioning algorithm. That is to say, considering XOR on a bit level behaves like XOR_bit(a,b)=a+b%2, you might consider a generalized XOR_bit(a,b,k)=a+b%k. With this I think you can decide partitions with up to k missing numbers, but I'm too tired to verify/implement this right now.