Miss Dada  🏳️‍⚧️

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

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

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.

I think this is GROUP BY / HAVING with that fn ?

I'm not sure I follow. Can you give me more context on what you mean?

sorry, haven't worked through the details, but.. order by / where apply to original rows, group by / having apply to an aggregate function over that result. So presumably you can have a bistable function that is true once your condition is seen..

That's not really helpful here, this is for seeking in a pagination context. E.g. turning `ORDER BY ... LIMIT X OFFSET Y` into a where clause only for records appearing after OFFSET Y

oh.. something with cursors, probably where your function returns the cursor?