Re: Sorting nodes by clocked time

[Noah Slater <nslater@tumbolia.org>]

[-- Attachment #1: Type: text/plain, Size: 1643 bytes --]

Using this a bit, it doesn't quite do what I want it to do.

Is there any way to sort recursively?

At the moment, calling org-sort-entries on the whole buffer only sorts the
top level nodes.


On 17 April 2014 14:45, Noah Slater <nslater@tumbolia.org> wrote:

> Actually, I renamed this my-overview, added (org-clock-display), and bound
> it to C-c o. Very swish.
>
>
> On 17 April 2014 14:34, Noah Slater <nslater@tumbolia.org> wrote:
>
>> I came up with this:
>>
>> (defun my-sort-buffer ()
>>   (interactive)
>>   (mark-whole-buffer)
>>   (org-sort-entries t ?K)
>>   (org-overview))
>>
>> Seems to do what I want. This is most excellent. Making some great
>> progress here. Thanks. And I will send you a token of my gratitude at the
>> end of the month, when I have funds available.
>>
>>
>>
>>
>> On 17 April 2014 14:26, Bastien <bzg@gnu.org> wrote:
>>
>>> Noah Slater <nslater@tumbolia.org> writes:
>>>
>>> > Okay, wow. Thanks for writing that. Do you have a Gittip or
>>> > something? I would love to support your OSS work in some way or
>>> > otherwise show my gratitude beyond words in an email!
>>>
>>> You can use my paypal account: bastien.guerry@free.fr
>>>
>>> Thanks!
>>>
>>> > Anyway. I tried your function and it works. But afterwards, the node
>>> > is completely folded. So I added (org-cycle) to the sequence of
>>> > functions inside save-restriction. That seems to work, but I'm no
>>> > elisp/Org pro. Is this how you would have done it?
>>>
>>> Well, quite long explanations would follow... I'll let you discover by
>>> reading the code and by trial-and-error for now, need to run!
>>>
>>> --
>>>  Bastien
>>>
>>
>>
>

[-- Attachment #2: Type: text/html, Size: 2982 bytes --]