lib: bsearch - make BINARY_NUMBER_SEARCH more widely usable This template is more widely usable if we do not hard-code into it the method of accessing the value being compared. For the default case we already use, this accessor is just a simple array dereferencing macro. As rewriting with the array access happens in the preprocessor, the code generated is completely unchanged. Expected future use: : #define MY_GETTER(array, index) ((array)[(index)].index_field) : #define MY_BINARY_SEARCH(data, count, value, idx_r) \ : BINARY_NUMERIC_SEARCH(MY_GETTER, data, count, value, idx_r); Signed-off-by: Phil Carmody <phil@dovecot.fi>

Added asserts to binary searches to make sure we don't go to infinite loop. Using idx=left+(right-left)/2 would have worked also to allow 4GB sizes, but since none of the places in the code are likely to reach 2GB we might as well just add an assert. (Also if they do reach 2GB, it could be possible that they could reach also above 4GB and cause problems. Better to see an early error.)

Removed CONTEXT_TYPE_SAFETY macro and reimplemented its functionality better. gcc/clang now gives a compiler error in many places if callback isn't exactly what was expected. It's also now much easier to add more of these checks.

Avoid using (void)s by adding ATTR_NOWARN_UNUSED_RESULT attributes and other ways.

Compile fix for non-gcc. --HG-- branch : HEAD

Added type safe array_bsearch_insert_pos(). --HG-- branch : HEAD

Changed .h ifdef/defines to use <NAME>_H format. --HG-- branch : HEAD

Added BINARY_NUMBER_SEARCH() macro. --HG-- branch : HEAD

bsearch_insert_pos() API changed. Patch by Max Kellermann --HG-- branch : HEAD

Added bsearch_insert_pos(). Similar to bsearch(), but if value isn't found, returns the position where it would be inserted. --HG-- branch : HEAD