From mboxrd@z Thu Jan 1 00:00:00 1970 Path: main.gmane.org!not-for-mail From: Stefan Monnier Newsgroups: gmane.emacs.help Subject: Re: A couple of lisp questions Date: Thu, 13 Nov 2003 16:31:52 GMT Sender: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Message-ID: References: NNTP-Posting-Host: deer.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: sea.gmane.org 1068742108 14761 80.91.224.253 (13 Nov 2003 16:48:28 GMT) X-Complaints-To: usenet@sea.gmane.org NNTP-Posting-Date: Thu, 13 Nov 2003 16:48:28 +0000 (UTC) Original-X-From: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Thu Nov 13 17:48:26 2003 Return-path: Original-Received: from monty-python.gnu.org ([199.232.76.173]) by deer.gmane.org with esmtp (Exim 3.35 #1 (Debian)) id 1AKKdt-000476-00 for ; Thu, 13 Nov 2003 17:48:25 +0100 Original-Received: from localhost ([127.0.0.1] helo=monty-python.gnu.org) by monty-python.gnu.org with esmtp (Exim 4.24) id 1AKLYe-0004ex-Fa for geh-help-gnu-emacs@m.gmane.org; Thu, 13 Nov 2003 12:47:04 -0500 Original-Path: shelby.stanford.edu!newsfeed.stanford.edu!nntp.cs.ubc.ca!cyclone.bc.net!snoopy.risq.qc.ca!charlie.risq.qc.ca!53ab2750!not-for-mail Original-Newsgroups: gnu.emacs.help Original-Lines: 26 User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3.50 Original-NNTP-Posting-Host: 132.204.24.42 Original-X-Complaints-To: abuse@umontreal.ca Original-X-Trace: charlie.risq.qc.ca 1068741112 132.204.24.42 (Thu, 13 Nov 2003 11:31:52 EST) Original-NNTP-Posting-Date: Thu, 13 Nov 2003 11:31:52 EST Original-Xref: shelby.stanford.edu gnu.emacs.help:118202 Original-To: help-gnu-emacs@gnu.org X-BeenThere: help-gnu-emacs@gnu.org X-Mailman-Version: 2.1.2 Precedence: list List-Id: Users list for the GNU Emacs text editor List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: help-gnu-emacs-bounces+geh-help-gnu-emacs=m.gmane.org@gnu.org Xref: main.gmane.org gmane.emacs.help:14143 X-Report-Spam: http://spam.gmane.org/gmane.emacs.help:14143 >>> suffix-hash: "t" --> (("the" . 4) ("then" . 3) ("talk" . 2) etc) >>> "th" --> (("the" . 4) etc ) "the" --> (("the" . 4) etc ) Stefan> Is `try-completion' too slow (because the usage-hash is too Stefan> large?) to build the suffixes on the fly ? > I'm not convinced it does what I want. Perhaps I am wrong. > When the letter "t" is pressed I get an alist back. The alist is > actually ordered, with the most commonly occurring words first. So I > pick the preferred usage straight of the front. So I have constant > time access to the hash, and constant time access to the list. Admittedly, `try-completions' does not sort things as you want them, but finding the most commonly word out of the ones returned is not too difficult either. If `try-completion' is fast enough (even tho it takes time proportional the total number of words), then finding the most common word out of the ones returned shouldn't be a problem either (it's proportional to the number of words returned, although the constant factor might indeed be higher since the loop would be in elisp and requires a "slow" hash lookup for each iteration). I have no idea whether it'd be slow or not, but it would save you the effort of maintaining a second data structure in sync. I.e. it'd save code and live-memory at the cost of CPU of dynamic memory allocation (i.e. GC, which translates into yet more CPU time eaten). Stefan