if random sorting of siblings is useful, another entry in the sorting
menu, dedicated to it, would eliminate any issues with completion.
it is a clever idea to feed random to sort by function. maybe some
won't catch the connection. just a possibility. not trying to bloat.
On 11/23/21, Vikas
i have found or would find random line within buffer or region to be
useful, and also random entry in org agenda files.
i'd find this useful too, but i think i'd find it more useful to keep
the ordering the same but instead go to a random entry within region.
On 11/23/21, Samuel Wales wrote:
>
>
>
> I think that depends on the completion framework. With the default
> completion, yes, I think RET should do it. With ivy, it's instead
> ivy-immediate-done (C-M-j). I'm not sure offhand about other
> frameworks.
>
>
That's what it needed. Thanks.
I wonder if there would be a better way
(Please don't drop the list.)
Vikas Rawal writes:
> That is, just press RET?
I think that depends on the completion framework. With the default
completion, yes, I think RET should do it. With ivy, it's instead
ivy-immediate-done (C-M-j). I'm not sure offhand about other
frameworks.
> If I
On 11/22/21 07:40:35 +0530, Vikas Rawal wrote:
> I am trying to sort a sub-tree of headings randomly. But `C-c ^ f
> random RET` asks for a "function for comparing keys". What am I
> supposed to do?
Here's the prompt:
Function for comparing keys (empty for default `sort-subr' predicate):
And
I am trying to sort a sub-tree of headings randomly. But `C-c ^ f random RET`
asks for a "function for comparing keys". What am I supposed to do?
Reference:
https://lists.gnu.org/archive/html/emacs-orgmode/2011-02/msg00089.html
I have also tried the custom function proposed in the previous
