> This is a very old technique for representing queues in functional > languages where you have no assignment. It's called immutable because > pointers are never changed once they're set.
Gene, thanks a lot for your reply. I'm not sure if I understand what pointers we're talking about; are they the pointers to each instance of the 'ImmutableQueue' class? If that's the case, then why are queue implemented in conventional ways (such as using an array) mutable? The pointer to the instance, in such methods, still doesn't have to change right? (Er, by the way, I believe that car is the head and cdr the tail, not the other way around.) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
