# Set Published articles for Set. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Subscription Payment Gateway: How to Pick One for Your SaaS DevFeed: [Subscription Payment Gateway: How to Pick One for Your SaaS]() Original publisher: [Read original article]() Author: Ayush Agarwal Published: 2026-06-09T00:00:00Z Content type: comparison Language: en Sources: [Dodo Payments Blog]() Topics: [Software as a service](), [stripe]() Tags: [buyers-guide](), [cancellation](), [features](), [geography](), [guide](), [merchant-of-record](), [payment-gateway](), [payments](), [retry](), [saas](), [set](), [stripe](), [subscription](), [subscriptions](), [webhooks]() ### AI overview A buyer's guide to subscription payment gateways for SaaS. It explains the minimum capabilities gateways need, including recurring charges, secure credential storage, retry logic, credential updates, and webhooks, then compares pure gateways, PSPs with native subscription billing, and merchant-of-record platforms. ### Source excerpt Subscription payment gateway buyers guide for SaaS founders. What features matter, how PSPs differ from MoRs, and how to evaluate by stage and geography. ## Hono + Cloudflare Workers: How to Process Payments at the Edge DevFeed: [Hono + Cloudflare Workers: How to Process Payments at the Edge]() Original publisher: [Read original article]() Author: Ayush Agarwal Published: 2026-03-27T00:00:00Z Content type: tutorial Language: en Sources: [Dodo Payments Blog]() Topics: [Cloudflare Workers](), [Workers](), [Hono](), [Latency](), [Back end](), [Scalability](), [Architecture & Design](), [Software as a service]() Tags: [cloudflare-workers](), [developer-tools](), [edge-computing](), [how-to](), [latency](), [payments](), [performance](), [platform](), [set](), [subscriptions](), [webhooks](), [workers]() ### AI overview This guide explains how to build a globally distributed payment system with Hono and Cloudflare Workers. It covers the benefits of edge-first payment processing, environment setup, and integration with Dodo Payments through a Hono adapter, including checkout, subscriptions, and webhooks. ### Source excerpt Build a high-performance, globally distributed payment system using Hono and Cloudflare Workers. Learn how to integrate Dodo Payments at the edge. ## vimrc: settings based on terminal background DevFeed: [vimrc: settings based on terminal background]() Original publisher: [Read original article]() Published: 2025-09-05T17:22:45Z Content type: tutorial Language: en Sources: [Signs of Triviality]() Topics: [Syntax Highlighting](), [Terminal]() Tags: [based](), [highlighting](), [how-to](), [set](), [settings](), [syntax](), [syntax-highlighting](), [terminal]() ### AI overview A tutorial on configuring Vim syntax-highlighting colorschemes based on the current terminal background. ### Source excerpt How to set e.g., syntax highlighting colorschemes based on the current terminal's background. ## Tabletop Games Based on Math Problems DevFeed: [Tabletop Games Based on Math Problems]() Original publisher: [Read original article]() Published: 2024-03-09T04:06:19Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [math](), [Mathematics](), [Math and Logic](), [Hugo](), [LaTeX](), [WordPress]() Tags: [card-games](), [color](), [games](), [math](), [mathematics](), [problems](), [projective-plane](), [set](), [tabletop-games](), [unique](), [value](), [vector]() ### AI overview A short list of tabletop games whose mechanics are directly based on nontrivial mathematical structures or problems. It discusses games including SET and Spot It!, along with related questions in finite geometry, vector spaces, and combinatorics. ### Source excerpt There's a family of tabletop games that are based directly on a nontrivial mathematics problem. As a casual and fun way to inaugurate my new blog (migrated from Wordpress to Hugo, after my work on getting better LaTeX mathmode support in Hugo), I thought I'd write a short listicle about them, so that I have a place to add more as I find them, as well as give the shortest canonical description of the associated math problem. ## This Week at Zed Industries: #5 DevFeed: [This Week at Zed Industries: #5]() Original publisher: [Read original article]() Author: Max Brunsfeld Published: 2023-06-02T00:00:00Z Content type: article Language: en Sources: [Zed Industries - Blog]() Topics: [ui](), [App](), [dashboards](), [issue tracker](), [systems]() Tags: [app](), [features](), [issue-tracker](), [layout](), [os](), [screen](), [set](), [view]() ### AI overview Zed's weekly update covers the release of Zed 0.88, including a redesigned panel system and a zoom feature. It also describes crash problems after release, three patches issued to address them, new crash dashboards, and ongoing work on LSP server detection. ### Source excerpt Panels, panels, and more panels... ## Making unwinding through JIT-ed code scalable - Optimistic Lock Coupling DevFeed: [Making unwinding through JIT-ed code scalable - Optimistic Lock Coupling]() Original publisher: [Read original article]() Author: Thomas Neumann (noreply@blogger.com) Published: 2022-06-26T08:52:00Z Content type: article Language: en Sources: [Database Architects]() Topics: [Exception](), [Data structures](), [Concurrency]() Tags: [code](), [data-structure](), [exception](), [exception-handling](), [locking](), [mutex](), [performance](), [set]() ### AI overview The article explains a scalable approach to unwinding through JIT-ed code using a read-optimized B-tree with optimistic lock coupling. Writers use conventional exclusive lock coupling, while readers use version locks and validate their reads so they can run in parallel when writes are uncommon. ### Source excerpt This article is part of the series about scalable unwinding that starts here. When thinking about exception handling it is reasonable to assume that we will have far more unwinding requests than changes to the unwinding tables. In our setup, the tables only change when JITed code is added to or removed from the program. That is always expensive to begin with due the mprotect calls, TLB shootdowns, etc. Thus we can safely assume that we will have at most a few hundred updates per second even in extreme cases, probably far less. Lookups however can easily reach thousands or even millions per second, as we do one lookup per frame. This motivates us to use a read-optimized data structure, a b-tree with optimistic lock coupling: Writers use traditional lock coupling (lock parent node exclusive, lock child node exclusive, release parent node, lock child of child, etc.), which works fine as long as there is not too much contention. Readers however have to do something else, as we expect thousands of them. One might be tempted to use a rw-lock for readers, but that does not help. Locking an rw-lock in shared mode causes an atomic write, which makes the threads fight over the cache line of the lock even if there is no (logical) contention. Instead, we use version locks, where readers do no write at all: // Common logic for version locks struct version_lock { // The lock itself. The lowest bit indicates an exclusive lock, // the second bit indicates waiting threads. All other bits are // used as counter to recognize changes. // Overflows are okay here, we must only prevent overflow to the // same value within one lock_optimistic/validate // range. Even on 32 bit platforms that would require 1 billion // frame registrations within the time span of a few assembler // instructions. uintptr_t version_lock; }; #ifdef __GTHREAD_HAS_COND // We should never get contention within the tree as it rarely changes. // But if we ever do get contention we use these for waiting static __gthre ## Collections: Lists and Sets DevFeed: [Collections: Lists and Sets]() Original publisher: [Read original article]() Author: author@typealias.com (Dave Leeds) Published: 2022-04-18T00:00:00Z Content type: tutorial Language: en Sources: [Dave Leeds on Kotlin - typealias.com]() Topics: [Kotlin](), [Code](), [Learning]() Tags: [code](), [collection-operations](), [collections](), [filter](), [foreach](), [introduction](), [kotlin](), [learn-to-program](), [learning](), [list](), [map](), [programming](), [set]() ### AI overview A Kotlin tutorial introduces collections by explaining how to group values and begins demonstrating lists and sets through a book-list example. ### Source excerpt So far, we've only worked with variables as individual values. Writing Kotlin becomes so much more interesting once we start putting values together in such a way that we can work with them as a collection. To learn about collections, let's visit Libby, a bright young lady who's always got a book nearby! Let's put things together! Libby is a voracious reader. She's always on the lookout for a great novel, so whenever someone tells her about a good book, she jots down the title on a list that she keeps on a sheet of paper. ## New Property Sheet and JavaDocs DevFeed: [New Property Sheet and JavaDocs]() Original publisher: [Read original article]() Author: Steve Hannah Published: 2022-04-06T00:00:00Z Content type: release Language: en Sources: [CodeName One]() Topics: [Development](), [Tooling](), [ide](), [debugging]() Tags: [context](), [debugging](), [dependencies](), [development](), [intellij](), [new-features](), [set](), [toolbar]() ### AI overview The article announces a new read-only property sheet, JavaDocs access, property filtering, and a revalidation command in the simulator to improve component inspection and layout debugging. ### Source excerpt We have added a new property sheet and a JavaDocs button to the toolbar of the Properties panel. ## Better unit tests with Parameterized testing 📈 DevFeed: [Better unit tests with Parameterized testing 📈]() Original publisher: [Read original article]() Author: Sergio Sastre Florez Published: 2021-05-31T06:30:38Z Content type: tutorial Language: en Sources: [Sergio's little tech corner]() Topics: [Testing](), [Kotlin](), [Java](), [passwords]() Tags: [android-app-development](), [best-practices](), [data](), [java](), [kotlin](), [password](), [self-improvement](), [set](), [tdd](), [test](), [testing](), [tests](), [unit-testing](), [unit-tests](), [verify](), [writing]() ### AI overview This tutorial explains how parameterized or data-driven tests can improve unit-test quantity and quality. Using a password validator as an example, it discusses testing multiple inputs and expected outputs in JUnit 5 with Kotlin, with applicability to Java. ### Source excerpt While writing Unit Tests, we often verify that given an input, the output of the method under test is the one expected. When you execute the same test with a different set of inputs and expected outputs several times, you come up with Data Driven Tes... ## Collection like objects in python DevFeed: [Collection like objects in python]() Original publisher: [Read original article]() Published: 2020-04-15T00:00:00Z Content type: tutorial Language: en Sources: [Paweł Chudzik]() Topics: [Python](), [Programming](), [Protocol (disambiguation)](), [Code]() Tags: [behavior](), [class](), [collections](), [dsl](), [functional](), [list](), [programming-language](), [protocol](), [python](), [set](), [slices]() ### AI overview A tutorial on implementing Python collection-like objects using the collections protocol. It discusses slices and methods such as __getitem__, __setitem__, __delitem__, __iter__, __contains__, and __missing__, including how they support collection behavior and domain-specific language extensions. ### Source excerpt Collections are an important part of every programming language. In python, there is a couple of built-in collections like list, set, dictionary but I'm not going to dig into them now. In this post, I'll explore what it takes to implement collection like objects on your own using collections protocol. Read more ## Writing Consistent Tools DevFeed: [Writing Consistent Tools]() Original publisher: [Read original article]() Published: 2019-02-20T22:13:02Z Content type: article Language: en Sources: [Signs of Triviality]() Topics: [Tool](), [Unix]() Tags: [set](), [simple](), [tools](), [unix](), [writing]() ### AI overview The article presents simple guidelines for writing consistent Unix tools. ### Source excerpt A set of simple guidelines to write consistent unix tools. ## A parlor trick for SET DevFeed: [A parlor trick for SET]() Original publisher: [Read original article]() Published: 2018-03-25T09:51:34Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [math](), [color]() Tags: [color](), [finite-fields](), [game](), [invariant](), [linear-algebra](), [math](), [mathematics](), [set](), [technical]() ### AI overview This mathematical article presents a parlor trick for the card game SET. By modeling cards as vectors in the finite vector space F₃⁴, it explains why the remaining visible board uniquely determines the final undealt card when all previously claimed sets were valid. ### Source excerpt Tai-Danae Bradley is one of the hosts of PBS Infinite Series, a delightful series of vignettes into fun parts of math. The video below is about the same of SET, a favorite among mathematicians. Specifically, Tai-Danae explains how SET cards lie in (using more technical jargon) a vector space over a finite field, and that valid sets correspond to lines. If you don't immediately know how this would work, watch the video. ## Find The Missing Integer DevFeed: [Find The Missing Integer]() Original publisher: [Read original article]() Author: Dimitri Fontaine PostgreSQL Major Contributor; Author Published: 2017-05-30T17:56:54Z Content type: article Language: en Sources: [Dimitri Fontaine]() Topics: [Algorithm](), [math](), [Common Lisp](), [Computer science](), [Lisp](), [Python](), [Data structures]() Tags: [algorithm](), [complexity](), [data-structure](), [lisp](), [math](), [python](), [set](), [sorting]() ### AI overview The article examines ways to find missing elements in a list. It contrasts sorting and the Gauss-sum method for one missing integer with set difference, which can handle multiple missing entries and arbitrary data types in Common Lisp and Python. ### Source excerpt A recent interview question that I had to review was spelled like this: Find missing int element into array 1..100 Of course at first read I got it wrong, you have only one integer to look for into the array. So while the obvious idea was to apply classic sorting techniques and minimize array traversal to handle complexity (time and space), it turns out there's a much simpler way to do it if you remember your math lessons from younger. But is it that much simpler? ## Automatic Caching DevFeed: [Automatic Caching]() Original publisher: [Read original article]() Author: Shai Almog Published: 2016-12-14T00:00:00Z Content type: release Language: en Sources: [CodeName One]() Topics: [Caching](), [HTTP](), [web applications]() Tags: [caching](), [experimental](), [http](), [server](), [set]() ### AI overview The article announces an experimental automatic caching feature for connection requests. It supports four caching modes--OFF, SMART, MANUAL, and OFFLINE--configurable globally or per request, and describes related cache retrieval, callbacks, and purging methods. ### Source excerpt Caching server data locally is a huge part of the advantage a native app has over a web app. Normally this is non-trivial as it requires a delicate balance especially if you want to test the server resource for changes. HTTP provides two ways to do that the ETag and Last-Modified. While both are great they are non-trivial to use and by no definition seamless. We just added an experimental feature to connection request that allows you to set the caching mode to one of 4 states either globally or per connection request: ## MySQL - reset root password DevFeed: [MySQL - reset root password]() Original publisher: [Read original article]() Author: Tom Published: 2015-12-28T00:00:00Z Content type: tutorial Language: en Sources: [Tomasz Gągor]() Topics: [MySQL](), [passwords](), [Databases](), [configuration]() Tags: [configuration](), [credentials](), [linux](), [localhost](), [mariadb](), [mysql](), [password](), [percona](), [root](), [set]() ### AI overview A tutorial explaining how to reset a MySQL user password, including the root password, by stopping MySQL, using an init file with a SET PASSWORD command, starting the server with that file, and then deleting it. ### Source excerpt It will happen from time to time, that you're on alien machine and have to brutally update things in db without knowing credentials. Example is for root (quite secure candidate to change because it shouldn't be used in app 😃 ) but will work for any user. shutdown db service mysql stop create text file with command like this (update user accordingly) ex. in /tmp/pwchange.txt SET PASSWORD FOR "root"@"localhost" = PASSWORD("HereYourNewPassword"); start mysqld with --init-file param mysqld_safe --init-file=/tmp/pwchange.txt sometimes you may require to point configuration file ex. --defaults-file=/etc/mysql/my.cnf ## Functional Android (II): Collection operations in Kotlin DevFeed: [Functional Android (II): Collection operations in Kotlin]() Original publisher: [Read original article]() Published: 2015-09-29T00:00:00Z Content type: tutorial Language: en Sources: [Antonio Leiva]() Topics: [Kotlin](), [Android](), [Development]() Tags: [collection](), [collection-operations](), [collections](), [functional](), [iterable](), [kotlin](), [language](), [list](), [set](), [standard-library]() ### AI overview This tutorial explains Kotlin collection types and the functional operations available for working with them. It covers interfaces and mutable variants including Iterable, Collection, List, Set, and Map, with examples intended to help developers choose appropriate collection operations. ### Source excerpt Everything Android, Kotlin and other random topics ## Conditional (Partitioned) Probability -- A Primer DevFeed: [Conditional (Partitioned) Probability -- A Primer]() Original publisher: [Read original article]() Published: 2013-03-28T13:36:09Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [math](), [function]() Tags: [bayes-theorem](), [conditional-probability](), [mathematics](), [partitions](), [primer](), [probability-theory](), [random-variables](), [set](), [theory]() ### AI overview A mathematically rigorous primer on conditional probability. It reviews finite probability spaces, probability mass functions, events, random variables, and partitions as tools for decomposing events and variables and reasoning about total probability. ### Source excerpt One of the main areas of difficulty in elementary probability, and one that requires the highest levels of scrutiny and rigor, is conditional probability. The ideas are simple enough: that we assign probabilities relative to the occurrence of some event. But shrewd applications of conditional probability (and in particular, efficient ways to compute conditional probability) are key to successful applications of this subject. This is the basis for Nate Silver's success, the logical flaws of many a political pundit, and the ability for a robot to tell where it is in an environment. ## Set Theory--A Primer DevFeed: [Set Theory--A Primer]() Original publisher: [Read original article]() Published: 2011-07-09T18:14:59Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Mathematics](), [Math and Logic]() Tags: [axiom-of-choice](), [bijections](), [cardinality](), [countability](), [example](), [functions](), [mathematics](), [numbers](), [power-set](), [primer](), [set](), [set-theory](), [symbols](), [theory](), [variable]() ### AI overview This primer introduces set theory by defining sets, elements, membership, cardinality, notation, and several ways to construct sets. It uses numerical examples and introduces natural numbers, integers, and rational numbers while noting that unrestricted operations can lead to paradoxes. ### Source excerpt It's often that a student's first exposure to rigorous mathematics is through set theory, as originally studied by Georg Cantor. This means we will not treat set theory axiomatically (as in ZF set theory), but rather we will take the definition of a set for granted, and allow any operation to be performed on a set. This will be clear when we present examples, and it will be clear why this is a bad idea when we present paradoxes. ## The Odds of Finding a Set in The Card Game SET DevFeed: [The Odds of Finding a Set in The Card Game SET]() Original publisher: [Read original article]() Published: 2010-04-28T00:00:00Z Content type: article Language: en Sources: [Peter Norvig]() Topics: [math](), [Simulation]() Tags: [card](), [color](), [game](), [number](), [results](), [set](), [simulation]() ### AI overview An analysis of why the odds of finding no SET in the card game SET change during play. A simulation shows that the chances differ substantially between a freshly dealt layout and layouts reached after SETs are repeatedly removed and replaced, suggesting the instruction booklet's odds do not describe the course of an actual game. ### Source excerpt Correcting an error in the instruction booklet for the card game SET