# syntax

Syntax is the set of rules governing the structure and ordering of characters in correctly structured programming or markup code.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Introducing Smithy IDL 2.1

DevFeed: [Introducing Smithy IDL 2.1](<https://devfeed.tech/articles/introducing-smithy-idl-2-1-138146.md>)

Original publisher: [Read original article](<https://aws.amazon.com/blogs/developer/introducing-smithy-idl-2-1/>)

Author: Jordon Phillips

Published: 2026-11-17T00:14:08Z

Content type: release

Language: en

Sources: [AWS Developer Tools Blog](<https://devfeed.tech/sources/aws-developer-tools-blog.md>)

Topics: [syntax](<https://devfeed.tech/topics/syntax.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [announce](<https://devfeed.tech/tags/announce.md>), [announcements](<https://devfeed.tech/tags/announcements.md>), [aws-sdk](<https://devfeed.tech/tags/aws-sdk.md>), [collection](<https://devfeed.tech/tags/collection.md>), [developer-tools](<https://devfeed.tech/tags/developer-tools.md>), [features](<https://devfeed.tech/tags/features.md>), [literals](<https://devfeed.tech/tags/literals.md>), [smithy](<https://devfeed.tech/tags/smithy.md>)

### AI overview

Smithy IDL 2.1 adds inline list and map targets, tagged string literals, and ordinal shorthand for member indexes. Inline collections become ordinary synthetic shapes; their generated names may change, and converting named shapes can require updating external references. Inline collections do not support `@sparse` or `@uniqueItems`. Tags simplify regex, binary, hex, and timestamp values, but exist only in IDL and resolve to plain values in the AST. Index shorthand requires IDL 2.1 and the `smithy-protocol-traits` model on the build path; the `idx` metadata defines stable ordering but not wire encoding, and its effect depends on the protocol. Adoption is per file by changing `$version`; existing 1.0 and 2.0 models remain supported, and the JSON AST is unchanged.

### Source excerpt

Today, we are excited to announce Smithy IDL 2.1. With Smithy 2.1, you can use three new syntax features: inline collection declarations for lists and maps, tagged string literals for values that carry their own escaping rules, and a shorthand for declaring the wire order of a structure's members. Smithy is an open source Interface [...]

## tok: a textual concrete syntax of BPMN and DMN for humans and AI agents

DevFeed: [tok: a textual concrete syntax of BPMN and DMN for humans and AI agents](<https://devfeed.tech/articles/tok-a-textual-concrete-syntax-of-bpmn-and-dmn-for-humans-and-ai-agents-120273.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.07945>)

Author: Marek Deja

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [syntax](<https://devfeed.tech/topics/syntax.md>), [Parsing](<https://devfeed.tech/topics/parsing.md>), [agentic workflows](<https://devfeed.tech/topics/agentic-workflows.md>)

Tags: [1-5](<https://devfeed.tech/tags/1-5.md>), [1-7](<https://devfeed.tech/tags/1-7.md>), [2-2](<https://devfeed.tech/tags/2-2.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [applications](<https://devfeed.tech/tags/applications.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [automatic](<https://devfeed.tech/tags/automatic.md>), [business](<https://devfeed.tech/tags/business.md>), [business-process](<https://devfeed.tech/tags/business-process.md>), [concrete](<https://devfeed.tech/tags/concrete.md>), [context](<https://devfeed.tech/tags/context.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decision-model](<https://devfeed.tech/tags/decision-model.md>), [diagram](<https://devfeed.tech/tags/diagram.md>), [engine](<https://devfeed.tech/tags/engine.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

tok is a plain-text notation for BPMN 2.0.2 process models and DMN 1.5 decisions. A single engine checks documents against both standards, compiles them to XML with an automatic diagram, and serves language-model applications through the Model Context Protocol. In the reported study, tok used 2.2 times fewer tokens than the smallest of 893 BPMN XML files and 7.7 times fewer than the exported files as-is. Its checker signaled 98.2% of 1,411 injected faults, versus 85.8% for XML Schema with bpmnlint. Four models unfamiliar with tok produced valid tok for 85.7-100% of 87 process descriptions using a one-page reference; as agents with a lean skill and checker tool, they reached 97.6-100%. The abstract reports lower token use for tok than BPMN XML by the strongest model, while a tool-based reference-reading skill cost 1.7-2.8 times as many tokens as the lean skill. tok also imported every model discovered from simulated event logs, though only 44 of 47 logs fit their source models.

### Source excerpt

arXiv:2611.07945v1 Announce Type: cross Abstract: tok is a plain-text notation for Business Process Model and Notation (BPMN) 2.0.2 process models and Decision Model and Notation (DMN) 1.5 decisions. One engine checks a tok document against both standards, compiles the document to XML with an automatic diagram, and serves language-model applications through the Model Context Protocol. The paper classifies the notation as an alternative concrete syntax of the BPMN and DMN metamodels and reports one study. A tok model takes 2.2 times fewer tokens than the smallest BPMN XML of 893 files exported by 37 tools and 7.7 times fewer than the files as exported. The checker signals 98.2% of 1,411 injected faults, against 85.8% for the XML Schema with bpmnlint. Four language models new to tok write valid tok from a one-page reference for 85.7 to 100% of 87 process descriptions from two datasets and valid BPMN XML for every description, and the strongest model writes tok with 25% and 19% fewer tokens than BPMN XML. As agents with a lean skill and one checker tool, the models write valid tok for 97.6 to 100% of the descriptions, the strongest model spends 21% and 14% fewer tokens on tok than on BPMN XML, and a skill which sends the model to read the reference through a tool costs 1.7 to 2.8 times the tokens of the lean skill. Of 47 event logs simulated from public models, 44 fit their source models, and tok imports every model discovered from the logs.

## SynMOE: A Syntax-Aware MOE-Guided Approach for PEFT-Based Code Intelligence Learning

DevFeed: [SynMOE: A Syntax-Aware MOE-Guided Approach for PEFT-Based Code Intelligence Learning](<https://devfeed.tech/articles/synmoe-a-syntax-aware-moe-guided-approach-for-peft-based-code-intelligence-learning-118064.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06069>)

Author: Shuo Liu, Hao Ning, Jacky Keung, Zhen Yang, Xiao Yu, Xing Hu, Yicheng Sun

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [peft](<https://devfeed.tech/topics/peft.md>), [Mixture of Experts (MoE)](<https://devfeed.tech/topics/mixture-of-experts-moe.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [lora](<https://devfeed.tech/topics/lora.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [code-intelligence](<https://devfeed.tech/tags/code-intelligence.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [lora](<https://devfeed.tech/tags/lora.md>), [moe](<https://devfeed.tech/tags/moe.md>), [peft](<https://devfeed.tech/tags/peft.md>), [routing](<https://devfeed.tech/tags/routing.md>), [source-code](<https://devfeed.tech/tags/source-code.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

SynMOE uses syntax information to guide parameter-efficient fine-tuning for code intelligence. It extracts syntactic labels from source-code abstract syntax trees, aligns them with code-model input tokens, and feeds them into a mixture-of-experts module's routing decisions. The authors apply the approach to LoRA and $(IA)^3$ across three code intelligence tasks, reporting consistent improvements and performance comparable to or better than full fine-tuning with greater computational efficiency. The supplied abstract also says they examine ablations, hyperparameters, and low-resource settings, but provides no detailed results or task-specific comparisons.

### Source excerpt

arXiv:2611.06069v1 Announce Type: new Abstract: Parameter-Efficient Fine-Tuning (PEFT) has emerged as an important approach for adapting Language Models (LMs) in downstream tasks. However, in the domain of code intelligence, the performance of most PEFT methods relatively drops compared to Full fine-Tuning (FT), hindering their broader applicability. One of the main reasons is that current PEFT methods are generally based on assumptions about the low-rank nature or sparsity of parameter updates, lacking explicit modeling of code-related information. To tackle this limitation, we propose SynMOE, a syntax-aware MOE-guided approach for PEFT on code intelligence learning. Specifically, SynMOE contains two stages: syntactic information extraction and syntax-aware MOE-guided adaptation. It first obtains the syntactic labels of source code from Abstract Syntax Trees (ASTs), and then aligns the labels with the input tokens of code LMs. In the second stage, syntactic labels are integrated into the MOE module, participating in the routing decision of MOE for a more powerful syntactic-aware token representation. We evaluate the effectiveness of the proposed approach by applying it to two typical PEFT methods, LoRA and $(IA)^3$, across three diverse code intelligence tasks. Experimental results show that SynMOE achieves consistent and significant improvements. Even compared to FT, SynMOE achieves comparable or superior performance while being more computationally efficient. In addition, we also conduct ablation studies, hyperparameter analysis, and evaluation in the low-resource scenario to provide a comprehensive investigation of the proposed approach.

## The key syntax differences between MySQL and PostgreSQL - everything you should know

DevFeed: [The key syntax differences between MySQL and PostgreSQL - everything you should know](<https://devfeed.tech/articles/the-key-syntax-differences-between-mysql-and-postgresql-everything-you-should-know-101272.md>)

Original publisher: [Read original article](<https://www.red-gate.com/simple-talk/databases/the-key-syntax-differences-between-mysql-and-postgresql-everything-you-should-know/>)

Author: Aisha Bukar

Published: 2026-10-26T12:00:00Z

Content type: article

Language: en

Sources: [Simple Talk](<https://devfeed.tech/sources/simple-talk.md>)

Topics: [MySQL](<https://devfeed.tech/topics/mysql.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [data migrations](<https://devfeed.tech/topics/data-migrations.md>)

Tags: [aishabukar-mysql-postgresql](<https://devfeed.tech/tags/aishabukar-mysql-postgresql.md>), [database](<https://devfeed.tech/tags/database.md>), [database-administration](<https://devfeed.tech/tags/database-administration.md>), [databases](<https://devfeed.tech/tags/databases.md>), [featured](<https://devfeed.tech/tags/featured.md>), [fetch](<https://devfeed.tech/tags/fetch.md>), [limit](<https://devfeed.tech/tags/limit.md>), [mysql](<https://devfeed.tech/tags/mysql.md>), [postgresql](<https://devfeed.tech/tags/postgresql.md>), [sql](<https://devfeed.tech/tags/sql.md>), [sql-syntax](<https://devfeed.tech/tags/sql-syntax.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [t-sql-programming](<https://devfeed.tech/tags/t-sql-programming.md>)

### AI overview

MySQL-to-PostgreSQL migration requires checking behavior as well as SQL syntax. MySQL identifier backticks must be replaced with PostgreSQL double quotes, whose use makes names case-sensitive; renaming keyword conflicts may be easier to maintain. PostgreSQL offers sequence-backed SERIAL and SQL-standard IDENTITY in place of AUTO_INCREMENT, but neither automatically adds a uniqueness constraint; PostgreSQL RETURNING replaces separate retrieval with LAST_INSERT_ID(). Basic LIMIT and OFFSET work in both, while MySQL's LIMIT offset,count shorthand does not; PostgreSQL also supports FETCH FIRST. MySQL's INSERT IGNORE and ON DUPLICATE KEY UPDATE translate to PostgreSQL ON CONFLICT DO NOTHING or DO UPDATE. TRUNCATE differs more substantially: PostgreSQL supports rollback and explicit identity restart/continuation, while MySQL InnoDB TRUNCATE implicitly commits; foreign-key and cascade behavior also needs review.

### Source excerpt

Migrating from MySQL to PostgreSQL? Learn the key SQL syntax differences - identifier quoting, auto-increment, LIMIT vs FETCH FIRST, and more.... The post The key syntax differences between MySQL and PostgreSQL - everything you should know appeared first on Simple Talk.

## Python Program Lexical Structure

DevFeed: [Python Program Lexical Structure](<https://devfeed.tech/articles/python-program-lexical-structure-95798.md>)

Original publisher: [Read original article](<https://realpython.com/python-program-structure/>)

Author: John Sturtz

Published: 2026-10-22T14:00:00Z

Content type: tutorial

Language: en

Sources: [Real Python](<https://devfeed.tech/sources/real-python.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [execution](<https://devfeed.tech/topics/execution.md>), [Exception](<https://devfeed.tech/topics/exception.md>), [Variable](<https://devfeed.tech/topics/variable.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [22](<https://devfeed.tech/tags/22.md>), [3](<https://devfeed.tech/tags/3.md>), [about](<https://devfeed.tech/tags/about.md>), [academic](<https://devfeed.tech/tags/academic.md>), [added](<https://devfeed.tech/tags/added.md>), [all](<https://devfeed.tech/tags/all.md>), [allowed](<https://devfeed.tech/tags/allowed.md>), [also](<https://devfeed.tech/tags/also.md>), [alter](<https://devfeed.tech/tags/alter.md>), [am](<https://devfeed.tech/tags/am.md>), [applications](<https://devfeed.tech/tags/applications.md>), [area](<https://devfeed.tech/tags/area.md>), [blocks](<https://devfeed.tech/tags/blocks.md>), [elements](<https://devfeed.tech/tags/elements.md>), [make](<https://devfeed.tech/tags/make.md>), [program](<https://devfeed.tech/tags/program.md>), [python](<https://devfeed.tech/tags/python.md>), [structure](<https://devfeed.tech/tags/structure.md>), [up](<https://devfeed.tech/tags/up.md>)

### AI overview

Python statements usually end at a newline, but long statements can span lines through implicit continuation inside unmatched parentheses, brackets, or braces--a PEP 8 preferred approach--or explicit continuation with a final backslash, which cannot have trailing whitespace or a comment. PEP 8 recommends keeping lines to 79 characters, discourages semicolon-separated statements, and favors readable whitespace. Hash comments run to the line's end; Python has no dedicated block-comment syntax, and PEP 8 advises against using standalone triple-quoted strings as block comments because of docstrings. Whitespace is often optional between clearly distinct tokens, but required to separate identifiers and keywords. Leading indentation is significant and determines statement grouping; unexpected indentation raises an error. In the REPL, a bare expression displays its value, while the same expression alone in a script produces no output.

### Source excerpt

Dig into the Python program structure: the syntactic elements that make up statements, and how statements group into larger blocks.

## Quiz: When Do You Use an Ellipsis in Python?

DevFeed: [Quiz: When Do You Use an Ellipsis in Python?](<https://devfeed.tech/articles/quiz-when-do-you-use-an-ellipsis-in-python-60328.md>)

Original publisher: [Read original article](<https://realpython.com/quizzes/python-ellipsis/>)

Author: Real Python

Published: 2026-09-26T12:00:00Z

Content type: tutorial

Language: en

Sources: [Real Python](<https://devfeed.tech/sources/real-python.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [test](<https://devfeed.tech/topics/test.md>), [NumPy](<https://devfeed.tech/topics/numpy.md>), [Tutorial](<https://devfeed.tech/topics/tutorial.md>), [object](<https://devfeed.tech/topics/object.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [python](<https://devfeed.tech/tags/python.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [test](<https://devfeed.tech/tags/test.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

An interactive six-question quiz tests understanding of Python's Ellipsis, including its use as a stub placeholder, in type hints, and in NumPy slicing. It provides a score at the end.

### Source excerpt

Test your understanding of Python's Ellipsis. Practice using three dots as a placeholder, in type hints, and in NumPy slicing.

## Paperless-ngx 3.2.0: Smarter Search, Share Link Management, and More

DevFeed: [Paperless-ngx 3.2.0: Smarter Search, Share Link Management, and More](<https://devfeed.tech/articles/paperless-ngx-3-2-0-smarter-search-share-link-management-and-more-57543.md>)

Original publisher: [Read original article](<https://selfhostlab.io/paperless-ngx-3-2-0-smarter-search-share-links/>)

Author: Christian Rakoot

Published: 2026-09-21T16:11:51Z

Content type: release

Language: en

Sources: [Self Host Lab](<https://devfeed.tech/sources/self-host-lab.md>)

Topics: [Self-hosted](<https://devfeed.tech/topics/self-hosted.md>), [Tool](<https://devfeed.tech/topics/tool.md>), [Query (disambiguation)](<https://devfeed.tech/topics/query.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [interface](<https://devfeed.tech/topics/interface.md>), [Environment Variables](<https://devfeed.tech/topics/environment-variables.md>), [file](<https://devfeed.tech/topics/file.md>)

Tags: [homelab](<https://devfeed.tech/tags/homelab.md>), [it](<https://devfeed.tech/tags/it.md>), [news](<https://devfeed.tech/tags/news.md>), [news-personal-cloud](<https://devfeed.tech/tags/news-personal-cloud.md>), [paperless-ngx](<https://devfeed.tech/tags/paperless-ngx.md>), [personal-cloud](<https://devfeed.tech/tags/personal-cloud.md>), [search](<https://devfeed.tech/tags/search.md>), [self-hosted](<https://devfeed.tech/tags/self-hosted.md>), [update](<https://devfeed.tech/tags/update.md>), [version](<https://devfeed.tech/tags/version.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

### AI overview

Paperless-ngx 3.2.0 is a release focused on search and document sharing. It adds centralized share-link management and bundles, native fuzzy matching in parsed queries, configurable regex timeouts, duplicate filtering, interface customization, environment-variable visibility in the Config UI, and other workflow improvements.

### Source excerpt

Paperless-ngx 3.2.0 landed on September 19, 2026, and it's a bigger release than the version number suggests. Where 3.1.0 (out August 27) focused on AI-assisted workflow actions and document versioning, this update goes after something more fundamental for anyone running the tool at scale: how you actually find the document you're looking for. The release [...]

## yocto-kiss: updated to the Wrynose Yocto LTS release

DevFeed: [yocto-kiss: updated to the Wrynose Yocto LTS release](<https://devfeed.tech/articles/yocto-kiss-updated-to-the-wrynose-yocto-lts-release-53000.md>)

Original publisher: [Read original article](<https://bootlin.com/blog/yocto-kiss-updated-to-the-wrynose-yocto-lts-release/>)

Author: Köry Maincent

Published: 2026-08-24T16:47:04Z

Content type: release

Language: en

Sources: [Bootlin](<https://devfeed.tech/sources/bootlin.md>)

Topics: [releases](<https://devfeed.tech/topics/releases.md>), [structure](<https://devfeed.tech/topics/structure.md>), [version](<https://devfeed.tech/topics/version.md>), [maintenance](<https://devfeed.tech/topics/maintenance.md>), [Linux](<https://devfeed.tech/topics/linux.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [deprecated](<https://devfeed.tech/topics/deprecated.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [deprecated](<https://devfeed.tech/tags/deprecated.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [layer](<https://devfeed.tech/tags/layer.md>), [linux](<https://devfeed.tech/tags/linux.md>), [meta-kiss](<https://devfeed.tech/tags/meta-kiss.md>), [project](<https://devfeed.tech/tags/project.md>), [release](<https://devfeed.tech/tags/release.md>), [technical](<https://devfeed.tech/tags/technical.md>), [updated](<https://devfeed.tech/tags/updated.md>), [wrynose](<https://devfeed.tech/tags/wrynose.md>), [yocto](<https://devfeed.tech/tags/yocto.md>), [yocto-kiss](<https://devfeed.tech/tags/yocto-kiss.md>)

### AI overview

Bootlin announces an update to yocto-kiss, a minimal Yocto/OpenEmbedded reference setup, for the Wrynose Yocto LTS release version 6.0. The update migrates its distro and BSP layers, adds changes including Linux 7.0 and sysvinit, and maintains support for multiple boards and architectures.

### Source excerpt

We are pleased to announce that yocto-kiss, our minimal but realistic Yocto/OpenEmbedded reference setup, has been updated to the latest Wrynose Yocto LTS release (version 6.0). Following the addition of ZynqMP support and the move to a cleaner multi-layer architecture earlier this year, this update keeps the project aligned with the current Yocto LTS and ... Continue reading "yocto-kiss: updated to the Wrynose Yocto LTS release"

## Python: fix TypeError: NamedTuple() got an unexpected keyword argument

DevFeed: [Python: fix TypeError: NamedTuple() got an unexpected keyword argument](<https://devfeed.tech/articles/python-fix-typeerror-namedtuple-got-an-unexpected-keyword-argument-51097.md>)

Original publisher: [Read original article](<https://adamj.eu/tech/2026/08/13/python-fix-typeerror-namedtuple-got-an-unexpected-keyword-argument/>)

Author: Adam Johnson

Published: 2026-08-12T23:00:00Z

Content type: tutorial

Language: en

Sources: [Adam Johnson](<https://devfeed.tech/sources/adam-johnson.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [Code](<https://devfeed.tech/topics/code.md>), [deprecated](<https://devfeed.tech/topics/deprecated.md>), [implementation](<https://devfeed.tech/topics/implementation.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [version](<https://devfeed.tech/topics/version.md>)

Tags: [classes](<https://devfeed.tech/tags/classes.md>), [code](<https://devfeed.tech/tags/code.md>), [deprecated](<https://devfeed.tech/tags/deprecated.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [python](<https://devfeed.tech/tags/python.md>), [release-notes](<https://devfeed.tech/tags/release-notes.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [version](<https://devfeed.tech/tags/version.md>)

### AI overview

This tutorial explains that the undocumented keyword-argument form of Python's NamedTuple was deprecated and removed in Python 3.15. It shows the supported class-based and functional alternatives and notes that Ruff can rewrite the deprecated form to class syntax.

### Source excerpt

Take this code, defining a small NamedTuple with a keyword argument per field: from typing import NamedTuple Point = NamedTuple("Point", x=int, y=int) Run it on Python 3.13 or 3.14, and you'll see: $ python3.14 example.py /.../example.py:3: DeprecationWarning: Creating NamedTuple classes using keyword ...

## GitHub Actions Self-Repository Syntax: Reference Your Own Actions at the Running Commit

DevFeed: [GitHub Actions Self-Repository Syntax: Reference Your Own Actions at the Running Commit](<https://devfeed.tech/articles/github-actions-self-repository-syntax-reference-your-own-actions-at-the-running-commit-56111.md>)

Original publisher: [Read original article](<https://www.developersdigest.tech/blog/github-actions-self-repository-syntax>)

Author: Developers Digest

Published: 2026-07-31T00:00:00Z

Content type: article

Language: en

Sources: [Developers Digest](<https://devfeed.tech/sources/developers-digest.md>)

Topics: [GitHub Actions](<https://devfeed.tech/topics/github-actions.md>), [GitHub](<https://devfeed.tech/topics/github.md>), [Repository](<https://devfeed.tech/topics/repository.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [ci-cd](<https://devfeed.tech/tags/ci-cd.md>), [commit](<https://devfeed.tech/tags/commit.md>), [github](<https://devfeed.tech/tags/github.md>), [github-actions](<https://devfeed.tech/tags/github-actions.md>), [news](<https://devfeed.tech/tags/news.md>), [repository](<https://devfeed.tech/tags/repository.md>), [security](<https://devfeed.tech/tags/security.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

### AI overview

This article explains a GitHub Actions $/ prefix that references a same-repository action or reusable workflow at the exact running commit without requiring checkout. It addresses SHA-pinning challenges for repository-owned actions under enterprise policies.

### Source excerpt

GitHub Actions added a $/ prefix that resolves a same-repository action or reusable workflow at the exact commit being run, with no checkout. It fixes the pinning trap that made enterprise SHA-pinning policies hard to satisfy for a repo's own actions.

## Clojure 1.13.0-alpha4

DevFeed: [Clojure 1.13.0-alpha4](<https://devfeed.tech/articles/clojure-1-13-0-alpha4-49799.md>)

Original publisher: [Read original article](<https://clojure.org/news/2026/07/14/clojure-1-13-alpha4>)

Published: 2026-07-14T00:00:00Z

Content type: release

Language: en

Sources: [Clojure News](<https://devfeed.tech/sources/clojure-news.md>)

Topics: [Clojure](<https://devfeed.tech/topics/clojure.md>), [destructuring](<https://devfeed.tech/topics/destructuring.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [version](<https://devfeed.tech/topics/version.md>)

Tags: [addition](<https://devfeed.tech/tags/addition.md>), [cli](<https://devfeed.tech/tags/cli.md>), [clojure](<https://devfeed.tech/tags/clojure.md>), [destructuring](<https://devfeed.tech/tags/destructuring.md>), [download](<https://devfeed.tech/tags/download.md>), [error](<https://devfeed.tech/tags/error.md>), [introduced](<https://devfeed.tech/tags/introduced.md>), [nested-maps](<https://devfeed.tech/tags/nested-maps.md>), [programming](<https://devfeed.tech/tags/programming.md>), [repl](<https://devfeed.tech/tags/repl.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [version](<https://devfeed.tech/tags/version.md>)

### AI overview

Clojure 1.13.0-alpha4 introduces changes to map destructuring syntax, including revised key handling, key-to-value mappings, a new :defaults directive, and deeper :select behavior for nested maps. The release also includes changes to nil-value filtering and exception categorization.

### Source excerpt

Clojure 1.13.0-alpha4 is now available! Find download and usage information on the Downloads page. Destructuring changes and additions Idents after & in :keys!/syms!/strs!/:keys/syms/strs must now be actual keys, not binding symbols. This is a change in syntax since alpha3. Note that symbol keys should be quoted as unadorned symbols are binding symbols. :or now accepts key->val mappings in addition to binding->val. Added a new :defaults name directive at top level to bind name to a map of defaults, key->val. Binding symbols in the :or map are transformed to the key value in the :defaults map. :defaults without :or is an error. :select name, introduced in alpha3, now selects deeply, through nested maps, and fills in values for missing keys from :or. The :select map contains all keys mentioned anywhere in the binding form. CLJ-2964 :select directive in map destructuring CLJ-2966 :defaults directive in map destructuring CLJ-2967 tests for nested destructuring Other changes since Clojure 1.13.0-alpha3 Added clojure.core/some-vals, a predicative filter of nil map values CLJ-2870 Exception phase during top-level eval is miscategorized Try it out Update your deps.edn :deps with: org.clojure/clojure {:mvn/version "1.13.0-alpha4"} Start a REPL with the Clojure CLI (any version) with: clj -Sdeps '{:deps {org.clojure/clojure {:mvn/version "1.13.0-alpha4"}}}

## Kotlin 2.4 Brings Swift-Style Collection Syntax \[\]

DevFeed: [Kotlin 2.4 Brings Swift-Style Collection Syntax \[\]](<https://devfeed.tech/articles/kotlin-2-4-brings-swift-style-collection-syntax-25983.md>)

Original publisher: [Read original article](<https://proandroiddev.com/kotlin-2-4-brings-swift-style-collection-syntax-0ab7097aa166?source=rss-711ab22c5c77------2>)

Author: Nav Singh

Published: 2026-06-04T16:32:23Z

Content type: tutorial

Language: en

Sources: [Nav Singh](<https://devfeed.tech/sources/stories-by-nav-singh-on-medium.md>)

Topics: [Kotlin](<https://devfeed.tech/topics/kotlin.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [Gradle](<https://devfeed.tech/topics/gradle.md>)

Tags: [array](<https://devfeed.tech/tags/array.md>), [collection](<https://devfeed.tech/tags/collection.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [kotlin-standard-library](<https://devfeed.tech/tags/kotlin-standard-library.md>), [literals](<https://devfeed.tech/tags/literals.md>), [new-features](<https://devfeed.tech/tags/new-features.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

Kotlin 2.4 introduces experimental collection literals, allowing bracket syntax such as `["Joe", "Alice"]` in place of `listOf()` or `mutableListOf()`. The excerpt says the feature requires opting in with the `-Xcollection-literals` compiler option and that its syntax or behavior may change. With an explicit `MutableList<String>` type, the example initializes a mutable list. For an inferred type, the excerpt cites documentation saying the compiler defaults to `List` when it cannot infer more, but reports that a screenshot appears to show `Array`; it does not resolve that discrepancy.

### Source excerpt

Image generated using Perplexity In Kotlin 2.4, collection literals are introduced, making collection initialization more concise and readable. To define collections, we no longer need to use functions like listOf() or mutableListOf(). This reduces boilerplate and makes intent clearer at a glance, especially when working with simple, static data. It's currently an experimental feature. We need to opt in, and the syntax or behavior may evolve in future releases. Add the Xcollection-literals compiler option to the build file kotlin { jvmToolchain(21) compilerOptions { freeCompilerArgs.add("-Xcollection-literals") } }Code samples Bracket syntax [] + explicit declaration // Mutable list with explicit type declaration // val plFNames: MutableList<String> = mutableListOf("Joe", "Alice") // Mutable list with brackets syntax val plFNames: MutableList<String> = ["Joe", "Alice"] println(plFNames) // ["Joe", "Alice" ] Bracket syntax [] + type inference As per docs:Compiler defaults to List if it lacks sufficient information to infer the collection type.But it seems like Array as we can see in the screenshot 📸 👇 val plFNames = ["Joe", "Alice"] println(plFNames) // ["Joe", "Alice" ]Screenshot type inference -- typeReferences What's new in Kotlin 2.4.0 | Kotlin Kotlin 2.4 Brings Swift-Style Collection Syntax [] was originally published in ProAndroidDev on Medium, where people are continuing the conversation by highlighting and responding to this story.

## Waiting for PostgreSQL 19 - Add support for EXCEPT TABLE in ALTER PUBLICATION.

DevFeed: [Waiting for PostgreSQL 19 - Add support for EXCEPT TABLE in ALTER PUBLICATION.](<https://devfeed.tech/articles/waiting-for-postgresql-19-add-support-for-except-table-in-alter-publication-33683.md>)

Original publisher: [Read original article](<https://www.depesz.com/2026/03/26/waiting-for-postgresql-19-add-support-for-except-table-in-alter-publication/>)

Author: depesz

Published: 2026-03-26T11:46:24Z

Content type: article

Language: en

Sources: [select \* from depesz;](<https://devfeed.tech/sources/select-from-depesz.md>)

Topics: [PostgreSQL](<https://devfeed.tech/topics/postgresql.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [alter](<https://devfeed.tech/tags/alter.md>), [commit](<https://devfeed.tech/tags/commit.md>), [except](<https://devfeed.tech/tags/except.md>), [logical](<https://devfeed.tech/tags/logical.md>), [pg19](<https://devfeed.tech/tags/pg19.md>), [postgresql](<https://devfeed.tech/tags/postgresql.md>), [publication](<https://devfeed.tech/tags/publication.md>), [replication](<https://devfeed.tech/tags/replication.md>), [table](<https://devfeed.tech/tags/table.md>), [uncategorized](<https://devfeed.tech/tags/uncategorized.md>), [waiting](<https://devfeed.tech/tags/waiting.md>)

### AI overview

This article discusses a PostgreSQL 19 patch adding EXCEPT TABLE support to ALTER PUBLICATION. The change allows modifying a publication's table exclusion list, though the example notes that specifying an exclusion for one publication replaced its previous exclusion list.

### Source excerpt

On 20th of March 2026, Amit Kapila committed patch: Add support for EXCEPT TABLE in ALTER PUBLICATION. Following commit fd366065e0, which added EXCEPT TABLE support to CREATE PUBLICATION, this commit extends ALTER PUBLICATION to allow modifying the exclusion list. New Syntax: ALTER PUBLICATION name SET publication_all_object [, ... ] where publication_all_object is ... Continue reading "Waiting for PostgreSQL 19 - Add support for EXCEPT TABLE in ALTER PUBLICATION."

## What Happens to an SQL Query?

DevFeed: [What Happens to an SQL Query?](<https://devfeed.tech/articles/what-happens-to-an-sql-query-34693.md>)

Original publisher: [Read original article](<https://newsletter.systemdesigncodex.com/p/what-happens-to-an-sql-query>)

Author: Saurabh Dashora

Published: 2026-03-04T03:14:28Z

Content type: tutorial

Language: en

Sources: [System Design Codex](<https://devfeed.tech/sources/system-design-codex.md>)

Topics: [SQL](<https://devfeed.tech/topics/sql.md>), [Database](<https://devfeed.tech/topics/database.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [database](<https://devfeed.tech/tags/database.md>), [diagram](<https://devfeed.tech/tags/diagram.md>), [errors](<https://devfeed.tech/tags/errors.md>), [execution](<https://devfeed.tech/tags/execution.md>), [locks](<https://devfeed.tech/tags/locks.md>), [rollback](<https://devfeed.tech/tags/rollback.md>), [sql](<https://devfeed.tech/tags/sql.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

This tutorial explains how an SQL query moves through a database. It covers transport and access checks, parsing and optimization into an execution plan, execution through the storage engine, and supporting components such as transactions, locks, buffering, and recovery.

### Source excerpt

The Journey Through the DB

## The LDAP Whitespace Problem | Huntress

DevFeed: [The LDAP Whitespace Problem | Huntress](<https://devfeed.tech/articles/the-ldap-whitespace-problem-huntress-54453.md>)

Original publisher: [Read original article](<https://www.huntress.com/blog/ldap-active-directory-detection-part-two>)

Author: Andrew Schwartz

Published: 2025-12-30T06:00:00Z

Content type: tutorial

Language: en

Sources: [Huntress Blog](<https://devfeed.tech/sources/huntress-blog.md>)

Topics: [LDAP](<https://devfeed.tech/topics/ldap.md>), [active directory](<https://devfeed.tech/topics/active-directory.md>), [Logging](<https://devfeed.tech/topics/logging.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [active-directory](<https://devfeed.tech/tags/active-directory.md>), [detection](<https://devfeed.tech/tags/detection.md>), [event](<https://devfeed.tech/tags/event.md>), [ldap](<https://devfeed.tech/tags/ldap.md>), [logging](<https://devfeed.tech/tags/logging.md>), [logs](<https://devfeed.tech/tags/logs.md>), [production](<https://devfeed.tech/tags/production.md>), [red-team](<https://devfeed.tech/tags/red-team.md>), [rules](<https://devfeed.tech/tags/rules.md>)

### AI overview

This deep dive explains why LDAP detection rules can fail in production: Active Directory transforms LDAP queries before logging them in Event 1644, producing inconsistent whitespace and bitwise syntax. It discusses targeting the transformed log representation rather than the original OID syntax.

### Source excerpt

Your LDAP detection rules work in the lab but fail in production. Here's why Event 1644 whitespace variations break your Sigma rules and how to fix them.

## Text-To-Alert: Create Alerts From Natural Language

DevFeed: [Text-To-Alert: Create Alerts From Natural Language](<https://devfeed.tech/articles/text-to-alert-create-alerts-from-natural-language-44871.md>)

Original publisher: [Read original article](<https://www.netdata.cloud/blog/ai-alerts/>)

Published: 2025-12-18T00:00:00Z

Content type: release

Language: en

Sources: [Netdata](<https://devfeed.tech/sources/blog-on-netdata.md>)

Topics: [Monitoring](<https://devfeed.tech/topics/monitoring.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Prompt Engineering](<https://devfeed.tech/topics/prompt-engineering.md>), [configuration](<https://devfeed.tech/topics/configuration.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [site-reliability-engineering](<https://devfeed.tech/topics/site-reliability-engineering.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [troubleshoot](<https://devfeed.tech/tags/troubleshoot.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

### AI overview

Netdata introduces AI-assisted alert configuration that lets users create alerts from natural-language prompts, understand existing alerts in English, and receive alert suggestions for metrics, charts, and use cases.

### Source excerpt

Netdata has an incredibly powerful alerting engine. But this can sometimes be a double-edged sword: the flexibility to build incredibly specific, intelligent alerts is immense, but mastering its syntax can feel like learning a new language. We've heard this from so many of you. You tell us that configuring alerts is often the steepest part of the learning curve, a task that falls to the one "Netdata expert" on the team who has spent the time digging through the documentation.

## My wishlist for PHP in 2026

DevFeed: [My wishlist for PHP in 2026](<https://devfeed.tech/articles/my-wishlist-for-php-in-2026-44166.md>)

Original publisher: [Read original article](<https://stitcher.io/blog/my-wishlist-for-php-in-2026>)

Author: Brent

Published: 2025-10-29T00:00:00Z

Content type: opinion

Language: en

Sources: [Stitcher](<https://devfeed.tech/sources/stitcher-io.md>)

Topics: [PHP](<https://devfeed.tech/topics/php.md>), [generic programming](<https://devfeed.tech/topics/generic-programming.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [version](<https://devfeed.tech/topics/version.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [generics](<https://devfeed.tech/tags/generics.md>), [php](<https://devfeed.tech/tags/php.md>), [rust](<https://devfeed.tech/tags/rust.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [wishlist](<https://devfeed.tech/tags/wishlist.md>)

### AI overview

An opinion piece outlining a wishlist for PHP, including generics and opt-in PHP editions that could allow experimental or backward-incompatible features within selected namespaces or codebases.

### Source excerpt

Read the full post on https://stitcher.io/blog/my-wishlist-for-php-in-2026

## Parsing: How Ruby Understands Your Code

DevFeed: [Parsing: How Ruby Understands Your Code](<https://devfeed.tech/articles/parsing-how-ruby-understands-your-code-31806.md>)

Original publisher: [Read original article](<https://patshaughnessy.net/2025/10/27/parsing-how-ruby-understands-your-code>)

Author: Pat Shaughnessy

Published: 2025-10-27T00:00:00Z

Content type: article

Language: en

Sources: [Pat Shaughnessy](<https://devfeed.tech/sources/pat-shaughnessy.md>)

Topics: [Parsing](<https://devfeed.tech/topics/parsing.md>), [Ruby](<https://devfeed.tech/topics/ruby.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [tokenization](<https://devfeed.tech/topics/tokenization.md>), [Code](<https://devfeed.tech/topics/code.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [code](<https://devfeed.tech/tags/code.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [ruby](<https://devfeed.tech/tags/ruby.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [tokenization](<https://devfeed.tech/tags/tokenization.md>), [updating-ruby-under-a-microscope](<https://devfeed.tech/tags/updating-ruby-under-a-microscope.md>)

### AI overview

This excerpt explains how Ruby parses source code after tokenization. It describes syntax matching, recursive parsing of subexpressions, and syntax errors when no pattern matches.

### Source excerpt

I've started working on a new edition of Ruby Under a Microscope that covers Ruby 3.x. I'm working on this in my spare time, so it will take a while. Leave a comment or drop me a line and I'll email you when it's finished. Update

## C++ Templates: How to Iterate through std::tuple: C++26 Packs and Expansion Statements

DevFeed: [C++ Templates: How to Iterate through std::tuple: C++26 Packs and Expansion Statements](<https://devfeed.tech/articles/c-templates-how-to-iterate-through-std-tuple-c-26-packs-and-expansion-statements-53317.md>)

Original publisher: [Read original article](<https://www.cppstories.com/2025/tuple-iteration-cpp26/>)

Published: 2025-10-12T00:00:00Z

Content type: tutorial

Language: en

Sources: [C++ Stories](<https://devfeed.tech/sources/c-stories.md>)

Topics: [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [iteration](<https://devfeed.tech/topics/iteration.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [c-plus-plus-23](<https://devfeed.tech/tags/c-plus-plus-23.md>), [code](<https://devfeed.tech/tags/code.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [templates](<https://devfeed.tech/tags/templates.md>)

### AI overview

A tutorial on C++26 techniques for iterating over and transforming tuples. It explains structured binding packs and expansion statements, showing how they replace older index_sequence and std::apply approaches with simpler compile-time code.

### Source excerpt

In part 1 of this mini-series, we looked at the basics of iterating over a std::tuple using index_sequence and fold expressions. In part 2, we simplified things with std::apply and even created helpers like for_each_tuple and transform_tuple. So far, we used C++ features up to C++20/23... but now, in C++26, we finally get language-level tools that make tuple iteration straightforward and expressive. In this article, we'll explore two new techniques: Structured bindings can introduce a pack - P1061 - turn a tuple into a pack of variables. Expansion statements P1306 - the ultimate "compile-time loop" syntax. Structured binding packs Structured bindings have been around since C++17, but in C++26 they gained the ability to introduce packs. That means you can bind an arbitrary number of elements without spelling each out. For example: auto [head, ...rest] = std::tuple{1, 2, 3, 4}; // head == 1, rest... expands to (2, 3, 4) This feature gives us a way to expand tuples into parameter packs, and once we have a pack, we can use fold expressions and other familiar template techniques. Printing a tuple We can bind all elements of a tuple into a pack and then fold over it: #include <tuple> #include <iostream> #include <utility> template <typename Tuple> void print_tuple(const Tuple& t) { const auto& [...xs] = t; bool first = true; std::cout << "("; ((std::cout << (std::exchange(first, false) ? "" : ", ") << xs), ...); std::cout << ")"; } int main() { print_tuple(std::make_tuple(1, 2.2, "hello")); } See at Compiler Explorer This is a direct replacement for our old index_sequence or std::apply approaches - now written in plain C++26. (Of course, you can easily update it to work with std::print) Transforming a tuple We can also apply a transformation and create a new tuple: template <typename Tuple, typename Fn> auto transform_tuple(const Tuple& t, Fn&& fn) { const auto& [...xs] = t; return std::make_tuple(fn(xs)...); } std::tuple tp{1, 2, 3}; auto doubled = transform_tuple(tp, [](a

## A Lean Syntax Primer

DevFeed: [A Lean Syntax Primer](<https://devfeed.tech/articles/a-lean-syntax-primer-36158.md>)

Original publisher: [Read original article](<https://overreacted.io/a-lean-syntax-primer/>)

Published: 2025-09-02T00:00:00Z

Content type: tutorial

Language: en

Sources: [Dan Abramov](<https://devfeed.tech/sources/dan-abramov.md>)

Topics: [Lean](<https://devfeed.tech/topics/lean.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [learn](<https://devfeed.tech/tags/learn.md>), [programming](<https://devfeed.tech/tags/programming.md>), [syntax](<https://devfeed.tech/tags/syntax.md>), [types](<https://devfeed.tech/tags/types.md>)

### AI overview

An opinionated introduction to Lean syntax covering definitions, assignment and comparison syntax, type inference, explicit type annotations, natural numbers, integers, and running code in the online playground or VS Code. It also introduces the distinction between executing Lean code and proving facts about it.

### Source excerpt

Programming with proofs.

## Structured bindings in C++17, 8 years later

DevFeed: [Structured bindings in C++17, 8 years later](<https://devfeed.tech/articles/structured-bindings-in-c-17-8-years-later-53315.md>)

Original publisher: [Read original article](<https://www.cppstories.com/2025/structured-bindings-cpp26-updates/>)

Published: 2025-08-31T00:00:00Z

Content type: article

Language: en

Sources: [C++ Stories](<https://devfeed.tech/sources/c-stories.md>)

Topics: [C](<https://devfeed.tech/topics/c.md>), [Code](<https://devfeed.tech/topics/code.md>), [iteration](<https://devfeed.tech/topics/iteration.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [object](<https://devfeed.tech/topics/object.md>)

Tags: [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [code](<https://devfeed.tech/tags/code.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [iteration](<https://devfeed.tech/tags/iteration.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

An article explaining C++ structured bindings, including their use with maps, the underlying syntax, compiler behavior, and examples from real code. It also discusses additions planned for C++26.

### Source excerpt

Structured binding is a C++17 feature that allows you to bind multiple variables to the elements of a structured object, such as a tuple or struct. This can make your code more concise and easier to read, especially when working with complex data structures. On this blog, we already covered this functionality, but we'll talk about some good C++26 additions and real code use cases. Iterating through maps An excellent demonstration of structured bindings is an iteration through a map object. If you have a std::map of elements, you might know that internally, they are stored as pairs of <const Key, ValueType>. Now, when you iterate through elements, you can do: for (const auto& elem : myMap) { ... } You need to write elem.first and elem.second to refer to the key and the value. std::map<KeyType, ValueType> myMap = getMap(); // C++14: for (const auto& elem : myMap) { // elem.first - is the key // elem.second - is the value } One of the coolest use cases of structured binding is that we can use it inside a range-based for loop: // C++17: for (const auto& [key,val] : myMap) { // use key/value directly } In the above example, we bind to a pair of [key, val] so we can use those names in the loop. Before C++17, you had to operate on an iterator from the map - which returns a pair <first, second>. Using the real names key/value is more expressive. The above technique can be used in the following example: #include <map> #include <iostream> int main() { const std::map<std::string, int> mapCityPopulation { { "Beijing", 21'707'000 }, { "London", 8'787'892 }, { "New York", 8'622'698 } }; for (const auto&[city, population] : mapCityPopulation) std::cout << city << ": " << population << '\n'; } Run @Compiler Explorer In the loop body, you can safely use the city and population variables. The Syntax The basic syntax for structured bindings is as follows: auto [a, b, c, ...] = expression; auto [a, b, c, ...] { expression }; auto [a, b, c, ...] ( expression ); The compiler introduces a

## Clojure 1.12.2

DevFeed: [Clojure 1.12.2](<https://devfeed.tech/articles/clojure-1-12-2-49754.md>)

Original publisher: [Read original article](<https://clojure.org/news/2025/08/25/clojure-1-12-2>)

Published: 2025-08-25T00:00:00Z

Content type: release

Language: en

Sources: [Clojure News](<https://devfeed.tech/sources/clojure-news.md>)

Topics: [Clojure](<https://devfeed.tech/topics/clojure.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [syntax](<https://devfeed.tech/topics/syntax.md>)

Tags: [avoid](<https://devfeed.tech/tags/avoid.md>), [clojure](<https://devfeed.tech/tags/clojure.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [download](<https://devfeed.tech/tags/download.md>), [error](<https://devfeed.tech/tags/error.md>), [programming](<https://devfeed.tech/tags/programming.md>), [refs](<https://devfeed.tech/tags/refs.md>), [serialization](<https://devfeed.tech/tags/serialization.md>)

### AI overview

A release announcement for Clojure 1.12.2 lists compiler syntax-error handling, a Ref transaction optimization, and changes to LazySeq and Iterate serialization behavior.

### Source excerpt

Clojure 1.12.2 is now available! Find download and usage information on the Downloads page. CLJ-2914 - Compiler - syntax error if qualified instance method expression is missing instance CLJ-1798 - Refs - avoid creating RetryEx in LockingTransaction on every transaction CLJ-2916 - LazySeq - realize before serializing and do not serialize IFn CLJ-2917 - Iterate - de/serialization no longer supported, throw

## An Interactive Guide to SVG Paths

DevFeed: [An Interactive Guide to SVG Paths](<https://devfeed.tech/articles/an-interactive-guide-to-svg-paths-45244.md>)

Original publisher: [Read original article](<https://www.joshwcomeau.com/svg/interactive-guide-to-paths/>)

Author: Josh W. Comeau

Published: 2025-08-18T13:30:00Z

Content type: tutorial

Language: en

Sources: [Josh Comeau's blog](<https://devfeed.tech/sources/josh-comeau-s-blog.md>)

Topics: [SVG](<https://devfeed.tech/topics/svg.md>), [Tutorial](<https://devfeed.tech/topics/tutorial.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [Graphics](<https://devfeed.tech/topics/graphics.md>)

Tags: [browser](<https://devfeed.tech/tags/browser.md>), [guide](<https://devfeed.tech/tags/guide.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [svg](<https://devfeed.tech/tags/svg.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

An interactive tutorial explaining SVG path syntax and commands, including how move, line, and arc instructions create curved and other shapes. It builds intuition through visualizations and examples.

### Source excerpt

SVG gives us many different primitives to work with, but by far the most powerful is the element. Unfortunately, it's also the most inscrutable, with its compact Regex-style syntax. In this tutorial, we'll demystify this infamous element and see some of the cool things we can do with it!

## clamp / median / range

DevFeed: [clamp / median / range](<https://devfeed.tech/articles/clamp-median-range-36218.md>)

Original publisher: [Read original article](<https://dotat.at/@/2025-07-02-cmp.html>)

Published: 2025-07-02T01:33:08Z

Content type: article

Language: en

Sources: [Tony Finch](<https://devfeed.tech/sources/tony-finch-s-blog.md>)

Topics: [Programming](<https://devfeed.tech/topics/programming.md>), [Code](<https://devfeed.tech/topics/code.md>), [function](<https://devfeed.tech/topics/function.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [iteration](<https://devfeed.tech/topics/iteration.md>)

Tags: [article](<https://devfeed.tech/tags/article.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [function](<https://devfeed.tech/tags/function.md>), [languages](<https://devfeed.tech/tags/languages.md>), [sequence](<https://devfeed.tech/tags/sequence.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

The article explores stylistic conventions for comparison operators, including chained comparisons, ordering values from least to greatest, and arranging clamp arguments to match that order. It then considers median-of-three implementations that are insensitive to argument order and proposes a speculative range syntax for pattern matching, iteration, and slicing.

### Source excerpt

Here are a few tangentially-related ideas vaguely near the theme of comparison operators. comparison style clamp style clamp is median clamp in range range style style clash? comparison style Some languages such as BCPL, Icon, Python have chained comparison operators, like if min <= x <= max: ... In languages without chained comparison, I like to write comparisons as if they were chained, like, if min <= x && x <= max { // ... } A rule of thumb is to prefer less than (or equal) operators and avoid greater than. In a sequence of comparisons, order values from (expected) least to greatest. clamp style The clamp() function ensures a value is between some min and max, def clamp(min, x, max): if x < min: return min if max < x: return max return x I like to order its arguments matching the expected order of the values, following my rule of thumb for comparisons - and the description of what clamp() does. (I used this flavour of clamp() in my article about GCRA.) But I seem to be unusual in this preference, based on a few examples I have seen recently. clamp is median Last month, Fabian Giesen pointed out a way to resolve this difference of opinion: A function that returns the median of three values is equivalent to a clamp() function that doesn't care about the order of its arguments. This version is written so that it returns NaN if any of its arguments is NaN. (When an argument is NaN, both of its comparisons will be false.) fn med3(a: f64, b: f64, c: f64) -> f64 { match (a <= b, b <= c, c <= a) { (false, false, false) => f64::NAN, (false, false, true) => b, // a > b > c (false, true, false) => a, // c > a > b (false, true, true) => c, // b <= c <= a (true, false, false) => c, // b > c > a (true, false, true) => a, // c <= a <= b (true, true, false) => b, // a <= b <= c (true, true, true) => b, // a == b == c } } When two of its arguments are constant, med3() should compile to the same code as a simple clamp(); but med3()'s misuse-resistance comes at a small cost when t

[Next page](<https://devfeed.tech/topics/syntax.md?cursor=WyIyMDI1LTA3LTAyVDAxOjMzOjA4KzAwOjAwIiwgIjE3ZjI4NTI4LTVhYjctNGRkZS1hYWIwLTUxYmMzMzUyZTY4MSJd>)