Op Sun, 5 Jun 2005, schreef Jamie McCracken:
> yes but isn't it fair to say that such developers that require such > structures would be knowledgable enough to make it safe by using weak refs? What is a weak ref? > My point is that the everyday structures that most developers (and in > particular the more naive and less knowledgable ones) will use are not > vulnerable to cycles and its only the more obscure and specialised use > cases that will need to use weak refs. In those cases like building a > compiler is it reasonable to assume that they will be smart enough to > handle cycles with weak refs? I don't know, anyway, structures like trees, graphs, stacks, ringbuffers, linked lists etc. etc. are the basis of programming. A language that makes using them hard or impossible becomes a toy language. Hmmm... Is a double linked list a cycle? I think yes. Daniël _______________________________________________ fpc-devel maillist - fpc-devel@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-devel
