Victor Tao
Victor Tao
I'm having a lot of trouble debouncing search. Do you see how it could be done? Also still have no idea why rendering results takes so long :/ Would appreciate...
I think this pr is ready to be reviewed, I'll leave debounce for the future. In its current state this pr makes search very usable for large documents, just typing...
Does this sound feasible? Separate the document into chunks, a chunk is a collection of rows that has up to k characters. We maintain a suffix array in each chunk...
You could set k=sqrt(n) :P Perhaps we could use a single dynamic suffix array? I think all operations are logarithmic. https://elar.urfu.ru/bitstream/10995/3710/3/RuSSIR_2011_04.pdf The limitation of this paper is text can only...
oh that looks cool! this basic functionality is enough for me, but if anyone wants to make a version 3 that would be cool.
I think it will be better to implement this as a mode, will update this later
Still don't know why it happens :/
I usually click the share button on the playlist to get the url, which is why its this way. Adding more parsing options would be good.
The main issue is maintenance, if someone else is willing to maintain a CLI I have no issue with it. I got tired of keeping the documentation up to date....
Thanks for the interest! I just added a beatsaber service, you can look at these commits to see what needs to be changed. The Spotify service is likely very similar...