Re: Hashtable entry recycling algorithm in pg_stat_statements

"Alex Hunsaker" <badalex@gmail.com> writes:
> Its seems to me a linear list would make the "common" case where the
> query is already in the list but we need to update the stats slow.

No, the hashtable is still there for lookups.  The list would be a means
of determining which hashtable entry to release when we're out of space.
        regards, tom lane