Re: Hash Function

[Sergei Steshenko]

----- Original Message -----
> From: Jordi Gutiérrez Hermoso <address@hidden>
> To: Sergei Steshenko <address@hidden>
> Cc: Jonathan Karsch <address@hidden>; "address@hidden" <address@hidden>
> Sent: Wednesday, December 5, 2012 6:13 PM
> Subject: Re: Hash Function
> 
> On 5 December 2012 11:04, Sergei Steshenko <address@hidden> wrote:
> 
>>  Jordi,
> 
> Hello, Sergei. Nice to talk to you again.
> 
>>  why are you posting distracting info ?
> 
> I'm sorry to inform you that you are. As I have explained numerous
> times, there is no hashing in Octave, despite your deceptive variable
> names. I know you are well aware of this, but for the edification of
> those who are not as blessed in computer science as you are, here is a
> description of the actual data structure available in Octave:
> 
>     http://en.wikipedia.org/wiki/Red-black_tree
> 
>>  It _is_ possible to do this in Octave
> 
> As you well know, this is only possible due to a bug in Octave that
> you have exploited, and you should be happy to know that this bug has
> been elevated to the status of feature in the current development
> version.
> 
> - Jordi G. H.
>

http://en.wikipedia.org/wiki/Red-black_tree :

"... typically used to implement associative arrays."



https://en.wikipedia.org/wiki/Duck_test :

"If it looks like a duck, swims like a duck, and quacks like a duck, then it 
probably is a duck".



So, why do _you_ post distracting information instead of providing a simple 
Octave-only solution ?

--Sergei.