There is big array of entries having the following type:
typedef struct {
int value;
int mask;
int otherData;
} Entry;
I'd like to find an entry in this array according to provided int key; as fast as posible. The entry is required to ensure that (key & mask) == value.
What will be the best way for such array organization and what is the corresponding algorithm processing it?
Edit: There is no restrictions on the array organization; it is static and can be prepared before lookup. The value and mask may have arbitrary values.
Edit2: value and mask may have arbitrary values, but number of entries in the array is about 10000. So, certain "paterns" can be calculated in advance.
The number of lookups is big.