GNU bug report logs - #79026
30.1; TAB in Minibuffer when using a quail input-method should complete the longest common suffix of candidates

Previous Next

Full log

View this message in rfc822 format

From: Eli Zaretskii <eliz <at> gnu.org>
To: Visuwesh <visuweshm <at> gmail.com>
Cc: arash <at> gnu.org, 79026 <at> debbugs.gnu.org, g.cassian.alexandru <at> posteo.eu, monnier <at> iro.umontreal.ca
Subject: bug#79026: 30.1; TAB in Minibuffer when using a quail input-method should complete the longest common suffix of candidates
Date: Thu, 17 Jul 2025 11:00:59 +0300

> From: Visuwesh <visuweshm <at> gmail.com>
> Cc: arash <at> gnu.org,  g.cassian.alexandru <at> posteo.eu,  79026 <at> debbugs.gnu.org,
>   monnier <at> iro.umontreal.ca
> Date: Thu, 17 Jul 2025 13:16:54 +0530
> 
> [வியாழன் ஜூலை 17, 2025] Eli Zaretskii wrote:
> 
> > IOW, the request here is to make quail-completion work as minibuffer
> > completion works elsewhere.  If you can come up with a patch to do
> > that (probably optionally, given how quail-completion's original
> > behavior was very different), that'd be appreciated.
> 
> If there is only one translation for the current key, it should just
> insert it?  I.e., typing TAB after \alph should insert α.
> 
> If there is more than one, it should complete to the longest possible
> common key i.e., typing TAB after \app should complete to \approx and
> the Quail loop would be active.  Another TAB from here on would pop up
> the *Quail Completions* buffer?

Yes, I think so.

> Did I get it right?  I wonder if we can reuse the completion facility
> for this.

That's the question, yes.

Previous Next

GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.