Sat, 6 Oct 2001 14:10:05 +0300, Cagdas Ozgenc pisze:

As I understand from the concepts of Functional Programming, it is not possible to implement a Hashtable ADT in Haskell language, where one can insert, and access values in O(1) complexity. It has to be implemented with an external language.

I don't know if it can be done in standard Haskell 98, but it can certainly be done using extensions provided by most or all implementations (IORef, IOArray). There is no need of using an external language, although it will not fit well the functional style. -- __("< Marcin Kowalczyk * qrczak@knm.org.pl http://qrczak.ids.net.pl/ \__/ ^^ SYGNATURA ZASTÊPCZA QRCZAK