[syslog-ng] [PATCH (3.4) 0/2] value-pairs: Efficient sorting

[Balazs Scheidler]

Hi,

Applied all patches in the series to 3.4 master. Thanks Gergely.

On Fri, 2012-02-10 at 17:35 +0100, Gergely Nagy wrote:
> In the two patches that will follow, a subtle, yet very important
> change will be made to the core of value-pairs: instead of building a
> GHashTable during a value_pairs_foreach(), we now build a binary tree,
> that's sorted at insert time, and traversing through it is much
> faster.
> 
> This also buys us sorted keys almost free of charge!
> 
> And once we have that, the second patch exports a
> value_pairs_foreach_sorted() function, so that modules who want to
> override the default alphabetical sort will be able to do so.
> 
> --
> |8]
> 
> ______________________________________________________________________________
> Member info: https://lists.balabit.hu/mailman/listinfo/syslog-ng
> Documentation: http://www.balabit.com/support/documentation/?product=syslog-ng
> FAQ: http://www.balabit.com/wiki/syslog-ng-faq
> 
> 

-- 
Bazsi