What about some sort of hashing algorithm that operates on regular expression sums or is otherwise tuned by regex elements?
I have no idea what such an algorithm is, but I imagine there exist ways to evaluate large lists of regular expressions in a way that is at least to some extent non-linear, somewhat in the way that a spell checker works?
Juha Heinanen wrote:
by accident i sent this message to devel list when i intended to send it to users list.
i'm thinking to speed up lcr load_gws() implementation by storing prefixes into hash table. it would allow load_gws() to execute (if necessary) in constant time independent of the number of prefixes. also, i'm planing to make the size of hash table controllable by module parameter.
the side effect of this is that prefix_mode=1, where prefixes are regular expressions, would have to be dropped, because hashing on regular expressions makes no sense.
something close to prefix_mode=1 could be achieved using dialplan module to store the regular expressions and return as attribute a gateway grp_id. that could then be used by new load_gws_from_group(grp_id) to load gws in the given group.
any comments on this? is someone depending on prefix_mode=1?
by the way, before starting this project, i took a look at opensips drouting module, but unfortunately it does not cover many features of lcr module that i use in my configurations and thus cannot be used to replace lcr module.
-- juha
Users mailing list Users@lists.kamailio.org http://lists.kamailio.org/cgi-bin/mailman/listinfo/users