Howard Chu authored Jun 22, 2018 and Quanah Gibson-Mount committed Jul 03, 2018

in idl_intersection. It may lose precision in a subsequent union.

Howard Chu authored Nov 11, 2013 and Quanah Gibson-Mount committed Nov 12, 2013

Partially revert 47f6aec6
Was using RANGE_FIRST/RANGE_LAST on an IDL known to *not* be a range.

Howard Chu authored Mar 18, 2013 and Quanah Gibson-Mount committed Mar 18, 2013

typos in quicksort

Howard Chu authored Oct 04, 2011 and Quanah Gibson-Mount committed Nov 04, 2011

Well, just like in back-bdb in 2005, it only slowed things down
on larger LDIFs.

Hallvard Furuseth authored Sep 13, 2011 and Quanah Gibson-Mount committed Nov 04, 2011

Parenthesize macros.  Microoptimize IDL search.  Use RANGE_<FIRST/LAST>
when IDL is known to be a range.

Hallvard Furuseth authored Sep 18, 2011 and Quanah Gibson-Mount committed Nov 04, 2011

Do not access a size_t via an unsigned long pointer, an MDB_val via a
berval pointer, or the inverse. Instead copy into the proper data types.

Howard Chu authored Sep 13, 2011 and Quanah Gibson-Mount committed Nov 04, 2011

Tighten up entry_alloc/entry_decode
Track parent nodes in idscopes

Hallvard Furuseth authored Sep 12, 2011 and Quanah Gibson-Mount committed Nov 04, 2011

Also do not cast between berval and MDB_val.  That breaks when
sizeof(berval.bv_len) != sizeof(MDB_val.mv_size).