# max Published articles for max. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Waiting for PostgreSQL 20 - Add min() and max() aggregate support for uuid. DevFeed: [Waiting for PostgreSQL 20 - Add min() and max() aggregate support for uuid.]() Original publisher: [Read original article]() Author: depesz Published: 2026-07-09T12:41:14Z Content type: article Language: en Sources: [select \* from depesz;]() Topics: [PostgreSQL](), [DateTime]() Tags: [aggregate](), [btree](), [max](), [min](), [order](), [pg20](), [postgresql](), [sort](), [uncategorized](), [uuid](), [uuid-extract-timestamp](), [waiting]() ### AI overview This article discusses a PostgreSQL patch adding min() and max() aggregate support for the uuid type. It explains that uuid is totally ordered through comparison operators and a btree operator class, and demonstrates the aggregates with UUID v7 and random UUIDs. ### Source excerpt On 1st of July 2026, Masahiko Sawada committed patch: Add min() and max() aggregate support for uuid. The uuid type already has a full set of comparison operators and a btree operator class, so it is totally ordered. min() and max() were the only common aggregates missing for it. Add the uuid_larger() and uuid_smaller() ... Continue reading "Waiting for PostgreSQL 20 - Add min() and max() aggregate support for uuid." ## Ruby 2.1 Garbage Collection: ready for production DevFeed: [Ruby 2.1 Garbage Collection: ready for production]() Original publisher: [Read original article]() Author: Sam Saffron Published: 2014-04-08T05:16:21Z Content type: article Language: en Sources: [Sam Saffron]() Topics: [Ruby](), [Rails]() Tags: [algorithm](), [garbage-collection](), [max](), [memory](), [rails](), [ruby]() ### AI overview This article examines Ruby 2.1's garbage-collection memory limits and responds to claims that Ruby's GC algorithm is fundamentally flawed. It explains how Ruby tracks allocations outside its heaps, describes dynamically growing limits with maximum caps, and notes that Ruby 2.1.1 did not behave as the expected safeguards suggested. ### Source excerpt The article "Ruby Garbage Collection: Still Not Ready for Production" has been making the rounds. In it we learned that our GC algorithm is flawed and were prescribed some rather drastic and dangerous workarounds. At the core it had one big demonstration: Run this on Ruby 2.1.1 and you will be out of memory soon: while true "a" * (1024 ** 2) end Malloc limits, Ruby and you From very early versions of Ruby we always tracked memory allocation. This is why I found FUD comments such as this troubling: the issue is that the Ruby GC is triggered on total number of objects, and not total amount of used memory This is clearly a misunderstanding of Ruby. In fact, the aforementioned article does nothing to mention memory allocation may trigger a GC. Historically Ruby was quite conservative issuing GCs based on the amount of memory allocated. Ruby keeps track of all memory allocated (using malloc) outside of the Ruby heaps between GCs. In Ruby 2.0, out-of-the-box every 8MB of allocations will result in a full GC. This number is way too small for almost any Rails app, which is why increasing RUBY_GC_MALLOC_LIMIT is one of the most cargo culted settings out there in the wild. Matz picked this tiny number years ago when it was a reasonable default, however it was not revised till Ruby 2.1 landed. For Ruby 2.1 Koichi decided to revamp this sub-system. The goal was to have defaults that work well for both scripts and web apps. Instead of having a single malloc limit for our app, we now have a starting point malloc limit that will dynamically grow every time we trigger a GC by exceeding the limit. To stop unbound growth of the limit we have max values set. We track memory allocations from 2 points in time: memory allocated outside Ruby heaps since last minor GC memory allocated since last major GC. At any point in time we can get a snapshot of the current situation with GC.stat: > GC.stat => {:count=>25, :heap_used=>263, :heap_length=>406, :heap_increment=>143, :heap_live_slot=>1068 ## Memcached: List all keys DevFeed: [Memcached: List all keys]() Original publisher: [Read original article]() Author: Graham King Published: 2009-10-20T16:50:30Z Content type: tutorial Language: en Sources: [Graham King]() Topics: [Memcached](), [Cache](), [Development]() Tags: [developer](), [guide](), [list](), [max](), [memcached](), [request](), [server](), [software]() ### AI overview A development-oriented tutorial explains how to inspect some keys stored in a Memcached instance by connecting to the server, obtaining slab IDs, and requesting limited cache dumps. It notes that Memcached generally cannot list every stored key, though inspecting a subset may be sufficient during development. ### Source excerpt "Unlocking Memcached's Hidden Treasures: A Developer's Guide"