On Sun, Mar 18, 2012 at 06:33:54PM +0100, Ralf Hemmecke wrote: >> But what will be cost of search/insert for this >> HashTable(Integer, ConstructedDomain, ?) ? > > Waldek wrote > http://groups.google.com/group/fricas-devel/browse_thread/thread/e629652b3291e021#b7b44869dd0ab376 > so I don't understand your question. > You find complexity values for Hashtables here > http://en.wikipedia.org/wiki/Hash_table
I see. This is because I never used a hash table. > But maybe you want a binary search tree. There is one in FriCAS, but I > don't see whether it is matching your purpose. I am looking into "Browse -- BinarySearchTree -- domains". It shows BinarySearchTree(S) -- it has only S. And it should be BinarySearchTree(Key, Entry), and each node should contain a key value and an entry value. May be, BinarySearchTree(S) fits defining a _finite set_, but I need to define a _finite map_ Key -> Entry. I do not understand Axiom at this point, may be, I am missing something. I do not know, so far, I try HashTable. Thanks, ------ Sergei [email protected] -- 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.
