On Mon, Oct 21, 2024 at 8:40 AM Andrei Lepikhov <lepi...@gmail.com> wrote: > > On 21/10/2024 06:32, Dagfinn Ilmari Mannsåker wrote: > > Alexander Korotkov <aekorot...@gmail.com> writes: > > > >> +static Oid *in_progress_list; > >> +static int in_progress_list_len; > >> +static int in_progress_list_maxlen; > > > > Is there any particular reason not to use pg_list.h for this? > Sure. The type cache lookup has to be as much optimal as possible. > Using an array and relating sequential access to it, we avoid memory > allocations and deallocations 99.9% of the time. Also, quick access to > the single element (which we will have in real life almost all of the > time) is much faster than employing list machinery.
+1, List with zero elements has to be NIL. That means continuous allocations/deallocations. ------ Regards, Alexander Korotkov Supabase
