Hello,
On 8/18/11 3:15 PM, Juha Heinanen wrote:
Daniel-Constantin Mierla writes:
* this is intended to control the behavior of the tree data and matching
mode. The default one is 0, match longest prefix and the associated data
with the prefix is a string. This is complete implementation.
Ther
Daniel-Constantin Mierla writes:
> * this is intended to control the behavior of the tree data and matching
> mode. The default one is 0, match longest prefix and the associated data
> with the prefix is a string. This is complete implementation.
>
> There is actually a second mode, 1, intended
Javier Gallart writes:
> -mt_match() will match the longest prefix in the tree, in your case
> -00358
in that case, it might make sense to implement a version of mt_match()
that loads ALL matching tree branch values to an avp. in case of 00 and
00358 prefixes in the three, string 0035892345670 w
Hi Daniel
thanks for giving a more detailed information. About the last point, it
sounds really interesting; as a matter of fact it's exactly what I'm doing
manually right now (we get a bunch of k,v pairs in each entry in the mtree
and right now I parse them manually with loops and or transformat
Hello,
some more comments/confirmations:
On 8/12/11 11:31 PM, Javier Gallart wrote:
Hi Juha
based on my experience with the mtree module:
-mt_match() will match the longest prefix in the tree, in your case 00358
* yes, longest prefix is matched
-mt_ignore_duplicates makes sense when loading
Hi Juha
based on my experience with the mtree module:
-mt_match() will match the longest prefix in the tree, in your case 00358
-mt_ignore_duplicates makes sense when loading the data in the DB to the
memory. There could be duplicate entries in the db and with that directive
you tell kamailio how
