add dlist_node_fast_find. This function performs a bidirectional
search which allows faster finds near the edges. In cases where there
are duplicates, the return will always be the nearest to an edge.