My point was about hashtable in general: by definition hashtable
is supposed to find entry with equal key, so you need equality
of keys to _specify_ what hashtable is doing.
Right. So the Key parameter must have some concept of equality. I was
never saying anything else. I was solely talking about the "Entry"
parameter (i.e. the V parameter in the Aldor example).
Ralf
HashTable(K:PrimitiveType, V:Type, hash: K -> Z): TableType(K, V) with {
...
}
define PrimitiveType: Category == with {
=: (%, %) -> Boolean;
~=: (%, %) -> Boolean;
}
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
