> I was thinking about this in my CS class a couple of weeks ago, >and wondered about a data structure that would basically be an array >(for fast random access), but every k positions (lines in this case >I suppose) would maintain a pointer to that position, making a new >pointer-list of length n/k.
Hi Jim, Karl Petersen wrote a HyperTalk script or external that indexed strings in some fashion. Perhaps he'll respond in more detail. -- Rob Cozens CCW, Serendipity Software Company http://www.oenolog.com/who.htm "And I, which was two fooles, do so grow three; Who are a little wise, the best fooles bee." from "The Triple Foole" by John Donne (1572-1631) _______________________________________________ use-revolution mailing list [EMAIL PROTECTED] http://lists.runrev.com/mailman/listinfo/use-revolution
