tree ff1566f79f72edcc7af57672dacf3a345ef9545a
parent d32079e30e83921e83c94871918ad417dbc21731
author Thierry FOURNIER <tfournier@exceliance.fr> 1391038035 +0100
committer Willy Tarreau <w@1wt.eu> 1395075968 +0100
encoding latin1

MINOR: pattern: index duplicates

The indexation functions now accept duplicates. This way it is possible
to always have some consistency between lists and trees. The "add" command
will always add regardless of any previous existence. The new entry will
not be used because both trees and list retrieve keys in insertion order.
Thus the "add" operation will always succeed (as long as there is enough
memory).