[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Axiom-developer] pointers
From: |
Gabriel Dos Reis |
Subject: |
Re: [Axiom-developer] pointers |
Date: |
Tue, 10 Nov 2009 01:42:51 -0600 |
Tim Daly <address@hidden> writes:
| Note that, under this definition
|
| a:Dequeue(Integer):= dequeue [1,2,3,4,5]
| b:Queue(Integer):= queue [1,2,3,4,5]
|
| hash(a) == hash(b)
^^
I suspect you meant '='.
In any case, unless you have a hash function that is a bijection of the
whole universe onto the finite set SingleInteger, you're going to get
different objects/values mapped to the same hash value no matter what.
OpenAxiom being strongly typed, I'm not worried that you're going to put
both a and b in the same HashTable and not being able to avoid the
collision.
-- Gaby
- Re: [Axiom-developer] pointers, (continued)
- Re: [Axiom-developer] pointers, William Sit, 2009/11/10
- Re: [Axiom-developer] pointers, Waldek Hebisch, 2009/11/10
- Re: [Axiom-developer] pointers, William Sit, 2009/11/10
- Re: [Axiom-developer] pointers, Tim Daly, 2009/11/10
- Re: [Axiom-developer] pointers, Gabriel Dos Reis, 2009/11/10
- Re: [Axiom-developer] pointers, William Sit, 2009/11/11
- Re: [Axiom-developer] pointers, Gabriel Dos Reis, 2009/11/10
- Re: [Axiom-developer] pointers, Bill Page, 2009/11/09
- Re: [Axiom-developer] pointers, Tim Daly, 2009/11/09
- Re: [Axiom-developer] pointers, Tim Daly, 2009/11/10
- Re: [Axiom-developer] pointers,
Gabriel Dos Reis <=
[Axiom-developer] Function cache in Axiom, Tim Daly, 2009/11/15
Message not availableMessage not availableMessage not availableMessage not availableMessage not available[Axiom-developer] Function cache in Axiom (Memoizing), Tim Daly, 2009/11/18
[Axiom-developer] Re: Function cache in Axiom (Memoizing), Bertfried Fauser, 2009/11/19