[asterisk-dev] Asterisk 1.6 peer matching working differently

Johansson Olle E oej at edvina.net
Thu May 1 07:25:32 CDT 2008

30 apr 2008 kl. 22.27 skrev Simon Perreault:

> On Wednesday 30 April 2008 16:05:51 Johansson Olle E wrote:
>> With the new code in svn trunk (not 1.6.0) we will match any peer by
>> using hatches.
> Do you mean hashes? If not, then WTF are hatches?
Well, it's swenglish for hashes... ( :-) )
We still are working on the hatch-an-easter-egg API, but the released  
is postponed to next year.

>> We can't really say which one.
> What? It just picks one at random?
> Are you using the usual list-per-hash-bucket data structure? If so,  
> then won't
> the returned peer just be the first matching one in the list from the
> corresponding hash bucket? And doesn't the order of the list follow  
> the order
> of insertion? And if so, where's the problem? ;)
> P.S. I just wrote a complete reply using only questions. Beat that.
I'm happy with that, but at this point I'll just be waiting for the  
answers from Steve,
while eating breakfast in the Huntsville airport with free WiFi!


More information about the asterisk-dev mailing list