Hey Bastien,
> > I see. That way I'm not sure we get the line number though? This is rather a
> > nice usability feature IMHO.
>
> No we do not get the line number, but in theory it is possible by
> counting the number of \n each time we had a block
Given the non-trivial complexity of a sliding
On Sat, Jul 15, 2017 at 12:02 PM, Chris Lamb wrote:
> Hi Bastien,
>
>> > Thanks for your review. Whilst I am aware of such algorithms, could you
>> > elaborate on what you mean in concrete terms here?
>>
>> see sub full_text_check function
>
> I see. That way I'm not sure we get the line number th
Hi Bastien,
> > Thanks for your review. Whilst I am aware of such algorithms, could you
> > elaborate on what you mean in concrete terms here?
>
> see sub full_text_check function
I see. That way I'm not sure we get the line number though? This is rather a
nice usability feature IMHO.
Best wis
On Fri, Jul 14, 2017 at 9:36 PM, Chris Lamb wrote:
> Hi Bastien,
>
>> >
>> > https://anonscm.debian.org/git/lintian/lintian.git/commit/?id=7319953bad3ae5e0e15f778a7ed19dd20241b77c
>>
>> Did you consider to use the sliding windows algo ?
>
> Thanks for your review. Whilst I am aware of such algo
Hi Bastien,
> >
> > https://anonscm.debian.org/git/lintian/lintian.git/commit/?id=7319953bad3ae5e0e15f778a7ed19dd20241b77c
>
> Did you consider to use the sliding windows algo ?
Thanks for your review. Whilst I am aware of such algorithms, could you
elaborate on what you mean in concrete term
On Tue, Jul 11, 2017 at 11:44 PM, Chris Lamb wrote:
> tags 846009 + pending
> thanks
>
> Fixed in Git:
>
>
> https://anonscm.debian.org/git/lintian/lintian.git/commit/?id=7319953bad3ae5e0e15f778a7ed19dd20241b77c
Did you consider to use the sliding windows algo ?
Bastien
>
>
> Regards,
>
> --
tags 846009 + pending
thanks
Fixed in Git:
https://anonscm.debian.org/git/lintian/lintian.git/commit/?id=7319953bad3ae5e0e15f778a7ed19dd20241b77c
Regards,
--
,''`.
: :' : Chris Lamb, Debian Project Leader
`. `'` la...@debian.org / chris-lamb.co.uk
`-
7 matches
Mail list logo