Tuple officially renamed to Throuple
November 7, 2026 at 9:17 PM
Tuple officially renamed to Throuple
i REALLY like the idea of n-tuple tags for partial matches
November 8, 2026 at 4:52 AM
i REALLY like the idea of n-tuple tags for partial matches
In a Swift switch, both (0, 0) and (0, _) match the origin. The first matching case wins, so put the more specific tuple pattern first.
Molecules of Swift #002.
#SwiftLang
https://ivantokar.com/posts/tuple-patterns-destructure-values-where-you-use-them
Molecules of Swift #002.
#SwiftLang
https://ivantokar.com/posts/tuple-patterns-destructure-values-where-you-use-them
Tuple Patterns: Destructure Values Where You Use Them
Use Swift tuple patterns to take tuples apart, ignore values you do not need, and match several values at once.
ivantokar.com
November 9, 2026 at 5:00 PM
In a Swift switch, both (0, 0) and (0, _) match the origin. The first matching case wins, so put the more specific tuple pattern first.
Molecules of Swift #002.
#SwiftLang
https://ivantokar.com/posts/tuple-patterns-destructure-values-where-you-use-them
Molecules of Swift #002.
#SwiftLang
https://ivantokar.com/posts/tuple-patterns-destructure-values-where-you-use-them
Why are the Democrats always in an array never in a tuple? Perhaps this suggests that Democrats can in fact change…
November 3, 2026 at 7:57 PM
Why are the Democrats always in an array never in a tuple? Perhaps this suggests that Democrats can in fact change…
Tuple of leafs
November 9, 2026 at 5:00 AM
Tuple of leafs
234 lines of Python that checks dead tuple ratios and flags unused indexes across your Postgres databases via psycopg2. Intermediate level, takes a DSN and runs. #postgresql #python #database https://www.valtersit.com/python/postgresql-dead-tuple-and-index-health-audit/
PostgreSQL Dead Tuple and Index Health Audit
www.valtersit.com
November 6, 2026 at 2:30 PM
234 lines of Python that checks dead tuple ratios and flags unused indexes across your Postgres databases via psycopg2. Intermediate level, takes a DSN and runs. #postgresql #python #database https://www.valtersit.com/python/postgresql-dead-tuple-and-index-health-audit/
So now a 'first' method can pull the first element from any sized tuple, 'second' can work on any except Solo, 'third' on any except Solo and Pair/(,), and so on, up to 'tenth'.
If someone needs tuple accessors greater than that, please consult the previous comment about being a mad lad.
If someone needs tuple accessors greater than that, please consult the previous comment about being a mad lad.
November 9, 2026 at 6:45 AM
So now a 'first' method can pull the first element from any sized tuple, 'second' can work on any except Solo, 'third' on any except Solo and Pair/(,), and so on, up to 'tenth'.
If someone needs tuple accessors greater than that, please consult the previous comment about being a mad lad.
If someone needs tuple accessors greater than that, please consult the previous comment about being a mad lad.
yeah haha the reason i didn’t clear kefka ultimate was so i could stay being a sex(tuple) legend haha haha haha
November 9, 2026 at 6:57 PM
yeah haha the reason i didn’t clear kefka ultimate was so i could stay being a sex(tuple) legend haha haha haha
You would definitely want to maintain relationality though so that once you pattern match a tuple you could see if a third substructure also matched for queries with three plus tags stacked together.
November 8, 2026 at 5:21 AM
You would definitely want to maintain relationality though so that once you pattern match a tuple you could see if a third substructure also matched for queries with three plus tags stacked together.
You can represent search queries as SQL (JOIN, ORDER BY, LIMIT, GROUP BY), but the performance is 🤮; This results in systems like Elastic/OpenSearch. Neat blog from @paradedb.com about making the SQL version fast enough to avoid the Galapagos effect www.paradedb.com/blog/joins
Do We Still Have to Denormalize? Have Your Schema and Search It Too
How ParadeDB accelerates search and aggregate joins over normalized Postgres schemas using DataFusion, Rank Joins, co-partitioning, and tuple tagging.
www.paradedb.com
November 4, 2026 at 11:55 AM
You can represent search queries as SQL (JOIN, ORDER BY, LIMIT, GROUP BY), but the performance is 🤮; This results in systems like Elastic/OpenSearch. Neat blog from @paradedb.com about making the SQL version fast enough to avoid the Galapagos effect www.paradedb.com/blog/joins
Python Tip #308 (of 365):
Match tuple-like data by shape with match-case. 🧵
>>> point = (3, 4)
>>> match point:
... case (x, y):
... print(f"2D point ({x}, {y})")
... case (x, y, z):
... print(f"3D point ({x}, {y}, {z})")
...
2D point (3, 4)
#Python #DailyPythonTip
Match tuple-like data by shape with match-case. 🧵
>>> point = (3, 4)
>>> match point:
... case (x, y):
... print(f"2D point ({x}, {y})")
... case (x, y, z):
... print(f"3D point ({x}, {y}, {z})")
...
2D point (3, 4)
#Python #DailyPythonTip
November 5, 2026 at 3:22 AM
Python Tip #308 (of 365):
Match tuple-like data by shape with match-case. 🧵
>>> point = (3, 4)
>>> match point:
... case (x, y):
... print(f"2D point ({x}, {y})")
... case (x, y, z):
... print(f"3D point ({x}, {y}, {z})")
...
2D point (3, 4)
#Python #DailyPythonTip
Match tuple-like data by shape with match-case. 🧵
>>> point = (3, 4)
>>> match point:
... case (x, y):
... print(f"2D point ({x}, {y})")
... case (x, y, z):
... print(f"3D point ({x}, {y}, {z})")
...
2D point (3, 4)
#Python #DailyPythonTip
A Post Quantum Vector Commitment Scheme with Efficient Insertions and Deletions (Vir Pathak, Sushmita Ruj) ia.cr/2026/2592
November 9, 2026 at 1:58 AM
A Post Quantum Vector Commitment Scheme with Efficient Insertions and Deletions (Vir Pathak, Sushmita Ruj) ia.cr/2026/2592
If you want to tune Postgres performance, you have to understand Heap-Only Tuple (HOT) updates first. A lot of commenters pointed straight to that chapter of "The Internals of PostgreSQL" as mandatory reading before touching production configs. #data 1/4
November 4, 2026 at 3:00 PM
If you want to tune Postgres performance, you have to understand Heap-Only Tuple (HOT) updates first. A lot of commenters pointed straight to that chapter of "The Internals of PostgreSQL" as mandatory reading before touching production configs. #data 1/4
The deeper technical fight centered on MVCC. Several people argued that vacuuming has hit real limits on write-heavy workloads, where churning through append-only tuple versions creates massive write amplification on modern fast storage. #performance 2/4
November 4, 2026 at 3:00 PM
The deeper technical fight centered on MVCC. Several people argued that vacuuming has hit real limits on write-heavy workloads, where churning through append-only tuple versions creates massive write amplification on modern fast storage. #performance 2/4
Someone wise once said: "If you can build games on it, it's a good infra piece or library."
(c) @mariozechner.at
spaces-mmo is the first step towards that. 😉
github.com/jeamy/phi-sp...
(c) @mariozechner.at
spaces-mmo is the first step towards that. 😉
github.com/jeamy/phi-sp...
GitHub - jeamy/phi-space: Experimental TypeScript tuple-space coordination for durable AI agents, transactional workflows, and federated systems
Experimental TypeScript tuple-space coordination for durable AI agents, transactional workflows, and federated systems - jeamy/phi-space
github.com
November 3, 2026 at 8:16 PM
Someone wise once said: "If you can build games on it, it's a good infra piece or library."
(c) @mariozechner.at
spaces-mmo is the first step towards that. 😉
github.com/jeamy/phi-sp...
(c) @mariozechner.at
spaces-mmo is the first step towards that. 😉
github.com/jeamy/phi-sp...
The things I usually want from a named tuple are easy to get with a dataclass (some easier than others).
Attributes and equality checks work automatically.
For immutability, pass "frozen=True". For orderability, pass "order=True".
Attributes and equality checks work automatically.
For immutability, pass "frozen=True". For orderability, pass "order=True".
November 3, 2026 at 3:27 PM
The things I usually want from a named tuple are easy to get with a dataclass (some easier than others).
Attributes and equality checks work automatically.
For immutability, pass "frozen=True". For orderability, pass "order=True".
Attributes and equality checks work automatically.
For immutability, pass "frozen=True". For orderability, pass "order=True".
Pairwise Independence of Ten-Round AES (Zhongfeng Niu, Kai Hu) ia.cr/2026/2608
November 9, 2026 at 2:00 AM
Pairwise Independence of Ten-Round AES (Zhongfeng Niu, Kai Hu) ia.cr/2026/2608
Fingerprinting the failure is the right primitive. We store that exact (tool, code, error line) tuple in the workspace so the next turn - whether model or human - retrieves the same ground truth instead of a rephrased hallucination. The loop breaks because the context stops drifting.
November 6, 2026 at 11:33 AM
Fingerprinting the failure is the right primitive. We store that exact (tool, code, error line) tuple in the workspace so the next turn - whether model or human - retrieves the same ground truth instead of a rephrased hallucination. The loop breaks because the context stops drifting.
I loathe the word TUPLE
November 1, 2026 at 10:01 PM
I loathe the word TUPLE
5. Sometimes the best class is no class.
Only storing data? Use a data class, an enum or a named tuple.
Only one method and no state to keep between calls? Write a function.
Only storing data? Use a data class, an enum or a named tuple.
Only one method and no state to keep between calls? Write a function.
November 4, 2026 at 5:04 PM
5. Sometimes the best class is no class.
Only storing data? Use a data class, an enum or a named tuple.
Only one method and no state to keep between calls? Write a function.
Only storing data? Use a data class, an enum or a named tuple.
Only one method and no state to keep between calls? Write a function.
We made single-table search fast. But a search join (one query across tables, ranked by combined relevance) still meant denormalizing, or letting Postgres join and score millions of rows to return 20.
Now a 3-table search join runs 1000x faster.
www.paradedb.com/blog/joins
Now a 3-table search join runs 1000x faster.
www.paradedb.com/blog/joins
Do We Still Have to Denormalize? Have Your Schema and Search It Too
How ParadeDB accelerates search and aggregate joins over normalized Postgres schemas using DataFusion, Rank Joins, co-partitioning, and tuple tagging.
www.paradedb.com
November 3, 2026 at 4:11 PM
We made single-table search fast. But a search join (one query across tables, ranked by combined relevance) still meant denormalizing, or letting Postgres join and score millions of rows to return 20.
Now a 3-table search join runs 1000x faster.
www.paradedb.com/blog/joins
Now a 3-table search join runs 1000x faster.
www.paradedb.com/blog/joins
Each case matches based on the number of items the sequence contains, unpacking those items into variables.
You could look at match-case as like tuple unpacking with a lot more than just length-checking.
Patterns can also match specific VALUES in specific positions:
You could look at match-case as like tuple unpacking with a lot more than just length-checking.
Patterns can also match specific VALUES in specific positions:
November 5, 2026 at 3:22 AM
Each case matches based on the number of items the sequence contains, unpacking those items into variables.
You could look at match-case as like tuple unpacking with a lot more than just length-checking.
Patterns can also match specific VALUES in specific positions:
You could look at match-case as like tuple unpacking with a lot more than just length-checking.
Patterns can also match specific VALUES in specific positions:
At @paradedb.com, we've spent the last few months leaning in to tackle one of the hardest first questions we hear from our users: "Our data is normalized, so: Is it fast over joins?"
There is always more work to do, but it's safe to say that the answer is now: "yes": www.paradedb.com/blog/joins
There is always more work to do, but it's safe to say that the answer is now: "yes": www.paradedb.com/blog/joins
Do We Still Have to Denormalize? Have Your Schema and Search It Too
How ParadeDB accelerates search and aggregate joins over normalized Postgres schemas using DataFusion, Rank Joins, co-partitioning, and tuple tagging.
www.paradedb.com
November 3, 2026 at 3:59 PM
At @paradedb.com, we've spent the last few months leaning in to tackle one of the hardest first questions we hear from our users: "Our data is normalized, so: Is it fast over joins?"
There is always more work to do, but it's safe to say that the answer is now: "yes": www.paradedb.com/blog/joins
There is always more work to do, but it's safe to say that the answer is now: "yes": www.paradedb.com/blog/joins
Do We Still Have to Denormalize? Have Your Schema and Search It Too
tech_blogs_parade_db | Author: Stu Hood
#Databases
tech_blogs_parade_db | Author: Stu Hood
#Databases
Do We Still Have to Denormalize? Have Your Schema and Search It Too
How ParadeDB accelerates search and aggregate joins over normalized Postgres schemas using DataFusion, Rank Joins, co-partitioning, and tuple tagging.
www.paradedb.com
November 3, 2026 at 5:30 AM
Do We Still Have to Denormalize? Have Your Schema and Search It Too
tech_blogs_parade_db | Author: Stu Hood
#Databases
tech_blogs_parade_db | Author: Stu Hood
#Databases