The classes of reconciliation tests

[novakboskov]

There are at least the following classes of tests we need to cover in each sync algorithm:

• Both A and B are empty sets
• A is empty, B is not
• B is empty, A is not
• A is subset B
• B is subset A
• A intersection B is non-empty set but A - B is a huge set
• A intersection B is non-empty set but B - A is a huge set
• A and B have no intersection and both are huge sets
• A and B are exactly equal but non-empty

Although, some specific syncs may need some extra. For example:

• (IBLTSync) A or B contain a large number of duplicate elements (see Multiset reconciliation with IBLTSync #63)