So simple! Thank you! I've already take that to my Tiddlywiki!
среда, 14 октября 2020 г. в 03:33:48 UTC+6, Eric Shulman:
> On Tuesday, October 13, 2020 at 2:25:26 PM UTC-7, Shareda wrote:
>>
>> What is more pretty and fast way to exclude first N items from the list?
>> Now I have
>> \define fas
On Tuesday, October 13, 2020 at 2:25:26 PM UTC-7, Shareda wrote:
>
> What is more pretty and fast way to exclude first N items from the list?
> Now I have
> \define fastFilter() [all[tiddlers]b{!!b}
> +[putlast:$(curN)$[]limit[$(CountMinusN)$]]
>
The rest[] operator does this. Thus:
\define fast
2 matches
Mail list logo