| commit | 31db4ae7b457888b911a7f836c57c420ddc1a546 | [log] [tgz] |
|---|---|---|
| author | Thierry FOURNIER <tfournier@exceliance.fr> | Thu Jan 30 00:27:15 2014 +0100 |
| committer | Willy Tarreau <w@1wt.eu> | Mon Mar 17 18:06:08 2014 +0100 |
| tree | ff1566f79f72edcc7af57672dacf3a345ef9545a | |
| parent | d32079e30e83921e83c94871918ad417dbc21731 [diff] |
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).