Jason Stover <[EMAIL PROTECTED]> writes:
>> > One node in the tree would look like this:
>> >
>> > struct node
>> > {
>> > struct variable *v1;
>> > struct variable *v2;
>> > double covariance_element;
>> > double center;
>> > union value *val1;
>> > union value *val2;
>> > size_t count;
>> > struct node *right;
>> > struct node *left;
>> > };
>>
>> Which members are the key that you want to look up to find a
>> node?
>
> The key is a quadruple: (v1, v2, val1, val2).
>
> I quickly wrote something to do what I want, but I would prefer to use
> something we already have.
>
> So does the hashing in src/libpspp sound like what I need?
I think that the hash table there will work fine.
--
"...I've forgotten where I was going with this,
but you can bet it was scathing."
--DesiredUsername
_______________________________________________
pspp-dev mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/pspp-dev
