MIME-Version: 1.0
In-Reply-To: <87lhos5duu.fsf@nikula.org>
References:
 <CAHc2pO2_mQZzG7TqntSLEY78YEZSVEwDSesgpCn1ZbngJvM0dQ@mail.gmail.com>
	<87lhos5duu.fsf@nikula.org>
Date: Tue, 7 Oct 2014 18:04:09 +0400
Message-ID:
 <CAHc2pO2J6-UMVnLx3dSGns1z4aaxSZZdGfVNVtetcex9xbsCKQ@mail.gmail.com>
Subject: Re: Backward scrolling notmuch_messages_t and notmuch_threads_t
From: Sergei Shilovsky <sshilovsky@gmail.com>
To: Jani Nikula <jani@nikula.org>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
Cc: notmuch@notmuchmail.org
Precedence: list
Reply-To: sshilovsky@gmail.com

notmuch search --offset` simply skips the number of threads/messages.
This is not so fast if the offset is large.

 98     for (i =3D 0;
 99          notmuch_threads_valid (threads) && (limit < 0 || i <
offset + limit    );
100          notmuch_threads_move_to_next (threads), i++)
101     {
102         thread =3D notmuch_threads_get (threads);
103
104         if (i < offset) {
105             notmuch_thread_destroy (thread);
106             continue;
107         }

On Tue, Oct 7, 2014 at 3:16 PM, Jani Nikula <jani@nikula.org> wrote:
> On Tue, 07 Oct 2014, Sergei Shilovsky <sshilovsky@gmail.com> wrote:
>> Lets consider messages first.
>>
>> As far as I get there is no straightforward
>> notmuch_messages_move_to_previous. One can usually implement such
>> behaviour with caching previous messages which is slightly inefficient
>> in memory consumption terms.
>>
>> But we can sort messages either date asc or date desc.
>>
>> Suppose, we're currently at the 1000th message in query "tag:whatever".
>>
>> So if we need to go to the previous message we could do something like
>>
>>     notmuch search --sort=3Doldest-first tag:whatever and \
>>         date:..<here is the date of the 1000th message>
>>
>> This query's result should start with our 1000th message following its
>> previous message (in terms of the original request). So backward
>> scrolling with no cache looks to be at least possible.
>>
>> Any idea of would that be fine? Is it possible to implement similar
>> thing at low-level?
>
> See notmuch search --offset=3DN and --limit=3DN options.
>
> BR,
> Jani.
>
>
>>
>> --
>> =D0=A1 =D1=83=D0=B2=D0=B0=D0=B6=D0=B5=D0=BD=D0=B8=D0=B5=D0=BC,
>> =D0=A1=D0=B5=D1=80=D0=B3=D0=B5=D0=B9 =D0=A8=D0=B8=D0=BB=D0=BE=D0=B2=D1=
=81=D0=BA=D0=B8=D0=B9
>> Sergei Shilovsky
>> _______________________________________________
>> notmuch mailing list
>> notmuch@notmuchmail.org
>> http://notmuchmail.org/mailman/listinfo/notmuch



--=20
=D0=A1 =D1=83=D0=B2=D0=B0=D0=B6=D0=B5=D0=BD=D0=B8=D0=B5=D0=BC,
=D0=A1=D0=B5=D1=80=D0=B3=D0=B5=D0=B9 =D0=A8=D0=B8=D0=BB=D0=BE=D0=B2=D1=81=
=D0=BA=D0=B8=D0=B9
Sergei Shilovsky