I really wish a function existed in PG that took some order by clause and gave a value with comparator functions... I'll hopefully write a blog post about this in the next few days. Or I'll get sidetracked writing bg info on btrees and why offset is bad and never finish
-
Show this thread
-
Writing a where clause that is "rows that appear after the row with a given id" for an arbitrary order by clause in generic code is possible, but obnoxiously hard. Especially once you start assuming all columns can contain null and handling nulls first/last
1 reply 0 retweets 0 likesShow this thread -
I can't be the first person to want to do this. And this feels like the sort of thing that PG has hidden gems to help with, but I can't seem to find them.
2 replies 0 retweets 1 likeShow this thread
Anyway I guess this is also me announcing my upcoming library to handle seek based pagination for arbitrary order by clauses >_>
6:16 PM - 19 Aug 2019
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.