Path: csiph.com!usenet.pasdenom.info!aioe.org!.POSTED!not-for-mail From: "Rod Pemberton" Newsgroups: comp.lang.forth Subject: Re: Just an idea : B-tree on-disk storage of FORTH dictrionary words for fast indexing and search Date: Thu, 16 Oct 2014 17:53:38 -0400 Organization: Aioe.org NNTP Server Lines: 26 Message-ID: References: <0a242e60-65db-4e17-a98b-e797d5b35905@googlegroups.com> NNTP-Posting-Host: CNsg4fVcCsvs3UaOgZtQCw.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1; format=flowed; delsp=yes Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Opera Mail/12.16 (Linux) X-Notice: Filtered by postfilter v. 0.8.2 Xref: csiph.com comp.lang.forth:33959 On Sat, 11 Oct 2014 11:52:50 -0400, wrote: > Ideally , the forth dictionary is a linked list of data , a nice > conventional way to store data , but what if you need to store more than > just a linked list of forth words , then stuff begins to get interesting > , recently I have been working on several projects where I needed to > apply some kick-ass ADT stuff to sort and index a large array and ummm I > just though that some of the ideas that I was working with would > properly organise forth and make it super optimal. > > I must admit that I am not the first person to ask this or even think > about it but could someone tell me why there hasn't been any serious > work done in trying to store the dictionary using an alternative > structure other than linked lists? I know Chuck Moore has used a bit of > hash tables in his flavours of the language but is that the end of it? > The answer to your question as to why more complex solutions aren't used or haven't been is likely Occam's razor, or a slight variation of it. The simplest solution generally wins. In this case, a linked-list is all that was necessary. http://en.wikipedia.org/wiki/Occam's_razor Rod Pemberton