# Collections

Collections are programming constructs and frameworks for grouping, storing, retrieving, and manipulating multiple elements as a single unit.

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

## Fluent Interface in C - Look ma, no this!

DevFeed: [Fluent Interface in C - Look ma, no this!](<https://devfeed.tech/articles/fluent-interface-in-c-look-ma-no-this-141042.md>)

Original publisher: [Read original article](<http://opensource.googleblog.com/2026/11/fluent-interface-in-c-look-ma-no-this.html>)

Author: Google Open Source (noreply@blogger.com)

Published: 2026-11-17T19:30:00Z

Content type: article

Language: en

Sources: [Google Open Source Blog](<https://devfeed.tech/sources/google-open-source-blog.md>)

Topics: [Object-oriented programming (OOP)](<https://devfeed.tech/topics/oop.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [object](<https://devfeed.tech/topics/object.md>), [Boilerplate](<https://devfeed.tech/topics/boilerplate.md>)

Tags: [array](<https://devfeed.tech/tags/array.md>), [automatic](<https://devfeed.tech/tags/automatic.md>), [boilerplate](<https://devfeed.tech/tags/boilerplate.md>), [buffer](<https://devfeed.tech/tags/buffer.md>), [c](<https://devfeed.tech/tags/c.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [call](<https://devfeed.tech/tags/call.md>), [chaining](<https://devfeed.tech/tags/chaining.md>), [cleanup](<https://devfeed.tech/tags/cleanup.md>), [collections](<https://devfeed.tech/tags/collections.md>), [collector](<https://devfeed.tech/tags/collector.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [data](<https://devfeed.tech/tags/data.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [developer-tools](<https://devfeed.tech/tags/developer-tools.md>), [expression](<https://devfeed.tech/tags/expression.md>), [fluent](<https://devfeed.tech/tags/fluent.md>), [functions](<https://devfeed.tech/tags/functions.md>), [interface](<https://devfeed.tech/tags/interface.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [programming-languages](<https://devfeed.tech/tags/programming-languages.md>), [this](<https://devfeed.tech/tags/this.md>)

### AI overview

The `iso-c-chaining` demonstration library uses standard C mechanisms to provide fluent chains and automatic cleanup of temporary objects. Each type places a shared `ChGenericEl` structure first, enabling generic operations such as serialization and deletion; per-type `self()` pointers track the active object, while an intrusive stack restores the outer container after nested chains. Reference counts start at zero: consuming methods can free unowned temporaries, containers claim values by incrementing the count, and `ch_release()` frees objects when their last reference is gone. Callers use `$(obj)` to bind existing objects into a chain and `->$$` to retain a result. The excerpt also describes typed arrays backed by contiguous raw buffers to avoid per-element function pointers. Examples include nested maps, SQLite query results serialized by an HTTP server, and vector operations. The library is presented as an ISO C89 demonstration; `_Thread_local` can make the stack thread-specific in C11.

### Source excerpt

by Daniel Miller, AI4SQL Team Can C be Object Oriented? Yes! Object-oriented languages like Python, Java, Rust, or C++ offer native object methods and automatic object lifetime cleanup, enabling chain operations on data structures, so you can call obj->a()->b()->c() and each method knows what it's working on. These fluent interfaces are common to many libraries that streamline configuration and reduce boilerplate. Let's take a look at an example: ChSlice *mid = ch_new_String("One_Two_Three_Four") ->append("_Five_Six") ->split("_") ->sub_slice(1, 4); puts(mid->generic.to_chars()); /* ["Two","Three","Four","Five"] */ ch_release(mid); This chain of functions takes a string, appends it to another string, splits it into an array, and slices the array in one chain of function calls. It's a pretty basic demonstration of using fluent interfaces for building a data structure with method chaining. But if I told you this was plain ANSI-C, you would think I committed a preprocessor felony and leaked three heap allocations along the way. And there are two big reasons why: There are no objects in C. No member variables or methods. No this or self to reference your object's data. The function append("_Five_Six") has no attached state, seeing only a single string literal and whatever is global. There is no garbage collector. In standard C, chaining heap allocations together without saving each intermediate pointer to a variable and freeing it by hand inevitably results in a memory leak. Manipulating strings and collections in C usually means threading state through standalone functions (str_append(s, ...)), holding onto every intermediate pointer, and freeing each temporary buffer by hand. We built iso-c-chaining to explore how far we could push fluent method chaining and automatic temporary cleanup using only standard ISO C. Here is how the library appends to a string, splits it on a delimiter, and takes a sub-slice of the resulting array in a single expression. This code does exa

## New in Symfony 8.2: Polymorphic Form Collections

DevFeed: [New in Symfony 8.2: Polymorphic Form Collections](<https://devfeed.tech/articles/new-in-symfony-8-2-polymorphic-form-collections-114922.md>)

Original publisher: [Read original article](<https://symfony.com/blog/new-in-symfony-8-2-polymorphic-form-collections>)

Author: Javier Eguiluz

Published: 2026-11-03T08:17:00Z

Content type: article

Language: en

Sources: [Symfony](<https://devfeed.tech/sources/symfony-blog.md>)

Topics: [Symfony](<https://devfeed.tech/topics/symfony.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [collections](<https://devfeed.tech/tags/collections.md>), [form](<https://devfeed.tech/tags/form.md>), [symfony](<https://devfeed.tech/tags/symfony.md>)

### AI overview

Symfony 8.2 adds PolymorphicCollectionType for collections whose entries use different form types. Configure `entry_types` and an `entry_type_provider`; the provider selects types from model data and, for browser-added rows, submitted data. With `allow_add`, Symfony renders a prototype for each type as a `data-prototype-<name>` attribute. `entry_options`, `prototype_options` and `prototype_data` are keyed by entry name. The new `entry_name` option for CollectionType and PolymorphicCollectionType identifies forms by a property path or callable instead of collection position, preventing submitted rows from being applied to a different entry if ordering changes. It changes form names, not collection keys or data. For added rows, use names that cannot match existing entries: a matching name updates the existing entry, and numeric counters can collide with IDs.

### Source excerpt

The CollectionType field is the standard way of editing a list of items in a Symfony form, but it has two limitations: all its entries must use the same form type, and submitted rows are matched to entries by their position in the collection. Symfony 8.2...

## Quiz: Python's collections: A Buffet of Specialized Data Types

DevFeed: [Quiz: Python's collections: A Buffet of Specialized Data Types](<https://devfeed.tech/articles/quiz-python-s-collections-a-buffet-of-specialized-data-types-64543.md>)

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

Author: Real Python

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

Content type: tutorial

Language: en

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

Topics: [Collections](<https://devfeed.tech/topics/collections.md>), [Python](<https://devfeed.tech/topics/python.md>)

Tags: [collections](<https://devfeed.tech/tags/collections.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

An interactive nine-question quiz tests knowledge of Python's collections module, including namedtuple, deque, defaultdict, OrderedDict, Counter, ChainMap, and wrapper classes. It awards one point per correct answer and provides a final score.

### Source excerpt

Check your understanding of Python's collections module and the specialized container data types it provides, from namedtuple to ChainMap.

## After 40 Years, Microsoft Excel Will Add Single-Cell Lists and Arrays

DevFeed: [After 40 Years, Microsoft Excel Will Add Single-Cell Lists and Arrays](<https://devfeed.tech/articles/after-40-years-microsoft-excel-will-add-single-cell-lists-and-arrays-60460.md>)

Original publisher: [Read original article](<https://slashdot.org/story/26/09/26/0227226/after-40-years-microsoft-excel-will-add-single-cell-lists-and-arrays>)

Author: EditorDavid

Published: 2026-09-26T20:34:00Z

Content type: news

Language: en

Sources: [Slashdot](<https://devfeed.tech/sources/slashdot.md>)

Topics: [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [dynamic-arrays](<https://devfeed.tech/tags/dynamic-arrays.md>), [excel](<https://devfeed.tech/tags/excel.md>), [filter](<https://devfeed.tech/tags/filter.md>), [functions](<https://devfeed.tech/tags/functions.md>), [microsoft](<https://devfeed.tech/tags/microsoft.md>), [microsoft-excel](<https://devfeed.tech/tags/microsoft-excel.md>)

### AI overview

Microsoft Excel is adding in-cell lists and native arrays, including nested arrays. Users can filter individual list items, use list values in calculations, and keep spilling formula results in one cell. New HAS functions test whether arrays contain specified values.

### Source excerpt

Microsoft's senior product manager for Excel acknowledges that "Throughout Excel's 40-year history, you've only been able to put one value per cell." But that's now changing with arrays in cells (as well as nested arrays) and lists. "You can create a list by selecting Insert > List or pressing Ctrl+J, then typing or pasting items separated by commas or semicolons, depending on your regional settings. Selecting the icon in the cell shows the individual values..." "With lists, you can filter by one or more individual items instead of whole text entries. Referencing a list returns all its values for calculations. For example, =B2 spills those values into separate cells..." "For the first time in Excel, arrays can exist natively in cells as values or as formula results. They can be any size or shape and can even contain other arrays. You can now keep the result of any spilling formula in a single cell by "wrapping" the formula body with braces { }." "Since the introduction of dynamic arrays, array results have spilled across cells -- for example ={1;2;3}. Wrapping the original array with braces creates a 1x1 array around it, so instead of spilling to multiple cells, the array stays in a single cell. Braces have long been used to describe arrays in Excel and this extends that behavior by allowing multiple layers of braces. This gives you more flexibility when building spreadsheets. Instead of leaving room for a formula to spill, you can keep the result in one cell." "Arrays can now also 'nest' inside other arrays... Previously, a formula that produced an array of arrays would return a truncated result or #CALC! error. Now, supported formulas return the complete nested result... FLATTEN(array, [pad_value], [levels]) simplifies nested arrays by removing one or more levels of nesting..." Three HAS functions check whether values are in an array: -- HAS(array, value) returns TRUE if value appears anywhere in array, and FALSE otherwise. -- HASANY(array, values) returns TRUE if an

## The Java Compiler That Became Its Own Test Case

DevFeed: [The Java Compiler That Became Its Own Test Case](<https://devfeed.tech/articles/the-java-compiler-that-became-its-own-test-case-59175.md>)

Original publisher: [Read original article](<https://www.codenameone.com/blog/parparvm-compiles-itself/>)

Author: Shai Almog

Published: 2026-09-24T00:00:00Z

Content type: article

Language: en

Sources: [CodeName One](<https://devfeed.tech/sources/codename-one.md>)

Topics: [Compiler](<https://devfeed.tech/topics/compiler.md>), [Java](<https://devfeed.tech/topics/java.md>), [Code](<https://devfeed.tech/topics/code.md>), [C](<https://devfeed.tech/topics/c.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Exception](<https://devfeed.tech/topics/exception.md>)

Tags: [c](<https://devfeed.tech/tags/c.md>), [code](<https://devfeed.tech/tags/code.md>), [collections](<https://devfeed.tech/tags/collections.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [exception](<https://devfeed.tech/tags/exception.md>), [java](<https://devfeed.tech/tags/java.md>)

### AI overview

ParparVM, a Java-to-C translator, is now self-hosting and can compile its own translator into a native executable. The process exposes runtime and reproducibility issues, including differences from JVM output, invalid C labels, and unstable declaration ordering.

### Source excerpt

Self-hosting turns ParparVM into a demanding test of its own runtime and generated output.

## 100 Exercises to Learn Rust, Updated

DevFeed: [100 Exercises to Learn Rust, Updated](<https://devfeed.tech/articles/100-exercises-to-learn-rust-updated-58813.md>)

Original publisher: [Read original article](<https://blog.jetbrains.com/rust/2026/09/23/100-exercises-to-learn-rust/>)

Author: Daria Kolodzey

Published: 2026-09-23T12:25:01Z

Content type: tutorial

Language: en

Sources: [JetBrains](<https://devfeed.tech/sources/the-jetbrains-blog.md>)

Topics: [Rust](<https://devfeed.tech/topics/rust.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [rustrover](<https://devfeed.tech/topics/rustrover.md>), [Concurrency](<https://devfeed.tech/topics/concurrency.md>), [Error Handling](<https://devfeed.tech/topics/error-handling.md>), [ide](<https://devfeed.tech/topics/ide.md>), [REST API](<https://devfeed.tech/topics/rest-api.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [pattern matching](<https://devfeed.tech/topics/pattern-matching.md>)

Tags: [asynchronous](<https://devfeed.tech/tags/asynchronous.md>), [course](<https://devfeed.tech/tags/course.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [error-handling](<https://devfeed.tech/tags/error-handling.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [jetbrains-academy](<https://devfeed.tech/tags/jetbrains-academy.md>), [learn](<https://devfeed.tech/tags/learn.md>), [learn-rust](<https://devfeed.tech/tags/learn-rust.md>), [learning-courses](<https://devfeed.tech/tags/learning-courses.md>), [lifetimes](<https://devfeed.tech/tags/lifetimes.md>), [pattern-matching](<https://devfeed.tech/tags/pattern-matching.md>), [plugin](<https://devfeed.tech/tags/plugin.md>), [programming](<https://devfeed.tech/tags/programming.md>), [programming-language](<https://devfeed.tech/tags/programming-language.md>), [rest-api](<https://devfeed.tech/tags/rest-api.md>), [rust](<https://devfeed.tech/tags/rust.md>), [rust-course](<https://devfeed.tech/tags/rust-course.md>), [rustrover](<https://devfeed.tech/tags/rustrover.md>)

### AI overview

JetBrains has updated its free JetBrains Academy course, 100 Exercises to Learn Rust. The exercise-based course uses a ticket management system to teach Rust concepts including ownership, borrowing, traits, pattern matching, error handling, collections, lifetimes, threads, channels, and futures. It runs inside RustRover with tests attached to each exercise.

### Source excerpt

100 Exercises to Learn Rust is our adaptation of Mainmatter's course of the same name, written by Luca Palmieri, Principal Engineering Consultant at Mainmatter, and it has just received its biggest update since we released it a year ago. Palmieri has been writing Rust since 2018, first at TrueLayer and then at AWS, and he [...]

## Manage multiple items easily with the new action bar

DevFeed: [Manage multiple items easily with the new action bar](<https://devfeed.tech/articles/manage-multiple-items-easily-with-the-new-action-bar-50420.md>)

Original publisher: [Read original article](<https://bitwarden.com/blog/manage-multiple-items-easily-with-the-new-action-bar/>)

Published: 2026-09-01T00:00:00Z

Content type: release

Language: en

Sources: [The Bitwarden Blog](<https://devfeed.tech/sources/the-bitwarden-blog.md>)

Topics: [Collections](<https://devfeed.tech/topics/collections.md>), [Users](<https://devfeed.tech/topics/users.md>)

Tags: [bitwarden](<https://devfeed.tech/tags/bitwarden.md>), [change](<https://devfeed.tech/tags/change.md>), [collections](<https://devfeed.tech/tags/collections.md>), [desktop](<https://devfeed.tech/tags/desktop.md>), [password-manager](<https://devfeed.tech/tags/password-manager.md>), [personal](<https://devfeed.tech/tags/personal.md>), [product-updates](<https://devfeed.tech/tags/product-updates.md>), [update](<https://devfeed.tech/tags/update.md>)

### AI overview

Bitwarden has added a new action bar to its web and desktop apps. The bar provides context-sensitive actions for managing multiple vault items, including assigning items to collections, deleting, archiving, and editing collection access.

### Source excerpt

When selecting multiple items in the vault, you can quickly assign them to a collection, archive them, and more!

## Hands-on with the WordPress 7.1 Icon Registration API

DevFeed: [Hands-on with the WordPress 7.1 Icon Registration API](<https://devfeed.tech/articles/hands-on-with-the-wordpress-7-1-icon-registration-api-44843.md>)

Original publisher: [Read original article](<https://developer.wordpress.org/news/2026/08/hands-on-with-the-wordpress-7-1-icon-registration-api/>)

Author: Justin Tadlock

Published: 2026-08-18T20:44:17Z

Content type: tutorial

Language: en

Sources: [WordPress](<https://devfeed.tech/sources/wordpress-developer-blog.md>)

Topics: [WordPress](<https://devfeed.tech/topics/wordpress.md>), [API](<https://devfeed.tech/topics/api.md>), [Icons](<https://devfeed.tech/topics/icons.md>), [SVG](<https://devfeed.tech/topics/svg.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [code](<https://devfeed.tech/tags/code.md>), [collections](<https://devfeed.tech/tags/collections.md>), [common-apis](<https://devfeed.tech/tags/common-apis.md>), [extenders](<https://devfeed.tech/tags/extenders.md>), [functions](<https://devfeed.tech/tags/functions.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [icons](<https://devfeed.tech/tags/icons.md>), [markup](<https://devfeed.tech/tags/markup.md>), [plugins](<https://devfeed.tech/tags/plugins.md>), [svg](<https://devfeed.tech/tags/svg.md>), [themes](<https://devfeed.tech/tags/themes.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>), [wordpress](<https://devfeed.tech/tags/wordpress.md>)

### AI overview

A practical tutorial on using the public WordPress 7.1 Icon Registration API to create custom icon collections and register individual icons, including SVG markup or file-based icons.

### Source excerpt

WordPress 7.1 introduces a public API for custom icons. Discover how to register collections and render SVGs easily with this complete, practical tutorial.

## Qdrant 1.19 - TurboQuant Datatype & Memory Tiers

DevFeed: [Qdrant 1.19 - TurboQuant Datatype & Memory Tiers](<https://devfeed.tech/articles/qdrant-1-19-turboquant-datatype-memory-tiers-46702.md>)

Original publisher: [Read original article](<https://qdrant.tech/blog/qdrant-1.19.x/>)

Author: info@qdrant.tech (Andrey Vasnetsov)

Published: 2026-08-05T01:00:00Z

Content type: release

Language: en

Sources: [Qdrant Blog on Qdrant - Vector Search Engine](<https://devfeed.tech/sources/qdrant-blog-on-qdrant-vector-search-engine.md>)

Topics: [Qdrant](<https://devfeed.tech/topics/qdrant.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [cloud-infrastructure](<https://devfeed.tech/topics/cloud-infrastructure.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [bert](<https://devfeed.tech/tags/bert.md>), [bm25](<https://devfeed.tech/tags/bm25.md>), [compression](<https://devfeed.tech/tags/compression.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [fasttext](<https://devfeed.tech/tags/fasttext.md>), [hnsw](<https://devfeed.tech/tags/hnsw.md>), [image-search](<https://devfeed.tech/tags/image-search.md>), [knn-algorithm](<https://devfeed.tech/tags/knn-algorithm.md>), [matching](<https://devfeed.tech/tags/matching.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [precision](<https://devfeed.tech/tags/precision.md>), [qdrant](<https://devfeed.tech/tags/qdrant.md>), [quantization](<https://devfeed.tech/tags/quantization.md>), [recommender-system](<https://devfeed.tech/tags/recommender-system.md>), [saas](<https://devfeed.tech/tags/saas.md>), [simaes-networks](<https://devfeed.tech/tags/simaes-networks.md>), [similarity](<https://devfeed.tech/tags/similarity.md>), [storage](<https://devfeed.tech/tags/storage.md>), [transformer](<https://devfeed.tech/tags/transformer.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>), [vector-search-engine](<https://devfeed.tech/tags/vector-search-engine.md>), [vectors](<https://devfeed.tech/tags/vectors.md>), [word2vec](<https://devfeed.tech/tags/word2vec.md>)

### AI overview

Qdrant 1.19 introduces the Turbo4 datatype, which stores vectors as 4-bit TurboQuant representations without retaining full-precision copies, reducing storage by up to nine times. The release also adds unified memory tiers, tenant-specific IDF statistics, filtering improvements, and Web UI enhancements.

### Source excerpt

Qdrant 1.19.0 is out! Let's look at the main features for this version: TurboQuant Datatype: A new storage format that compresses vectors to four bits without keeping their original full-precision representation, reducing storage by up to nine times compared to TurboQuant quantization. Memory Tiers: A single memory parameter unifies per-component memory tier placement, with three tiers: pinned, cached, and cold. Per-Tenant IDF Statistics: Narrow the IDF corpus to a specific tenant so term rarity reflects that tenant's vocabulary rather than the whole dataset, improving BM25 scoring in multi-tenant deployments.

## How to join or concat ranges, C++26

DevFeed: [How to join or concat ranges, C++26](<https://devfeed.tech/articles/how-to-join-or-concat-ranges-c-26-53313.md>)

Original publisher: [Read original article](<https://www.cppstories.com/2025/join_concat_ranges/>)

Published: 2026-05-16T00: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>), [Collections](<https://devfeed.tech/topics/collections.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>), [collections](<https://devfeed.tech/tags/collections.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [lazy](<https://devfeed.tech/tags/lazy.md>)

### AI overview

A tutorial comparing C++ range adaptors for concatenating and flattening collections: concat_view from C++26, join_view from C++20, and join_with_view from C++23. It explains their behavior, supported operations, lazy evaluation, and practical examples.

### Source excerpt

Modern C++ continuously improves its range library to provide more expressive, flexible, and efficient ways to manipulate collections. Usually, when you wanted to concatenate or flatten ranges, you'd use raw loops or custom algorithms. With C++'s range adaptors, we now have an elegant and efficient way to process collections lazily without unnecessary allocations. In this post, we will explore three powerful range adaptors introduced in different C++ standards: std::ranges::concat_view (C++26) std::ranges::join_view (C++20) std::ranges::join_with_view (C++23) Let's break down their differences, use cases, and examples. Updated in May 2026: added from_range construction options. std::ranges::concat_view (C++26) The concat_view allows you to concatenate multiple independent ranges into a single sequence. Unlike join_view, it does not require a range of ranges-it simply merges the given ranges sequentially while preserving their structure. In short: Takes multiple independent ranges as arguments. Supports random access if all underlying ranges support it. Allows modification if underlying ranges are writable. Lazy evaluation: No additional memory allocations. See the example: #include <print> #include <ranges> #include <vector> #include <array> int main() { std::vector<std::string> v1{"world", "hi"}; std::vector<std::string> v2 { "abc", "xyz" }; std::string arr[]{"one", "two", "three"}; auto v1_rev = v1 | std::views::reverse; auto concat = std::views::concat(v1_rev, v2, arr); concat[0] = "hello"; // access and write for (auto& elem : concat) std::print("{} ", elem); } See at @Compiler Explorer The output: hello world abc xyz one two three The example below shows how to concatenate three ranges, v1 is reversed and then combined with v2 and arr. Notice that we can also access the value at position 0 and update it. And a bit more complex example: #include <print> #include <ranges> #include <vector> #include <list> #include <string> struct Transaction { std::string type; d

## Collection Literals in Kotlin

DevFeed: [Collection Literals in Kotlin](<https://devfeed.tech/articles/collection-literals-in-kotlin-39251.md>)

Original publisher: [Read original article](<https://kt.academy/article/collection-literals>)

Published: 2026-05-04T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [Kotlin](<https://devfeed.tech/topics/kotlin.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [IntelliJ IDEA](<https://devfeed.tech/topics/intellij-idea.md>), [Gradle](<https://devfeed.tech/topics/gradle.md>)

Tags: [collection](<https://devfeed.tech/tags/collection.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [feature](<https://devfeed.tech/tags/feature.md>), [gradle](<https://devfeed.tech/tags/gradle.md>), [intellij-idea](<https://devfeed.tech/tags/intellij-idea.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [new-feature](<https://devfeed.tech/tags/new-feature.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

### AI overview

This tutorial explains Kotlin collection literals, an experimental feature that uses square brackets to create lists, sets, and custom collections. It covers usage examples, compiler requirements, current IntelliJ IDEA limitations, and the expected future support.

### Source excerpt

The new feature in Kotlin that allows for concise and expressive collection creation.

## San Diego C++ Meetup #83: February 2026 Edition

DevFeed: [San Diego C++ Meetup #83: February 2026 Edition](<https://devfeed.tech/articles/san-diego-c-meetup-83-february-2026-edition-51144.md>)

Original publisher: [Read original article](<https://vorbrodt.blog/2026/02/11/san-diego-c-meetup-83-february-2026-edition/>)

Author: Kobi

Published: 2026-02-12T02:58:57Z

Content type: article

Language: en

Sources: [Vorbrodt's C++ Blog](<https://devfeed.tech/sources/vorbrodt-s-c-blog.md>)

Topics: [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Polymorphism](<https://devfeed.tech/topics/polymorphism.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [announcement](<https://devfeed.tech/tags/announcement.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [community](<https://devfeed.tech/tags/community.md>), [deep-dive](<https://devfeed.tech/tags/deep-dive.md>), [detection](<https://devfeed.tech/tags/detection.md>), [developers](<https://devfeed.tech/tags/developers.md>), [kobi](<https://devfeed.tech/tags/kobi.md>), [meetup](<https://devfeed.tech/tags/meetup.md>), [san-diego](<https://devfeed.tech/tags/san-diego.md>), [san-diego-c-plus-plus-meetup](<https://devfeed.tech/tags/san-diego-c-plus-plus-meetup.md>), [technical](<https://devfeed.tech/tags/technical.md>)

### AI overview

A recap of the 83rd San Diego C++ Meetup covering a presentation on hidden dangers in static polymorphism, including object slicing with CRTP and std::tuple. It also describes safer modern C++ approaches such as concepts, std::variant, std::visit, std::apply, and variadic templates, alongside the community's move from Meetup.com to Luma.

### Source excerpt

Last night we held our 83rd San Diego C++ Meetup. It was a fantastic evening filled with deep technical discussions and a significant announcement regarding the future of our community infrastructure. The Big Announcement: Moving to Luma The biggest news from this meeting is that we are officially moving away from Meetup.com. To streamline our [...]

## Python Updates: Immutable Mappings, Comprehension Unpacking, and the Rust-in-CPython Debate

DevFeed: [Python Updates: Immutable Mappings, Comprehension Unpacking, and the Rust-in-CPython Debate](<https://devfeed.tech/articles/what-s-up-python-rust-in-cpython-immutable-dicts-unpacking-in-comprehensions-53168.md>)

Original publisher: [Read original article](<https://www.bitecode.dev/p/whats-up-python-rust-in-cpython-immutable>)

Author: Bite Code!

Published: 2025-12-08T17:35:07Z

Content type: opinion

Language: en

Sources: [Bite code!](<https://devfeed.tech/sources/bite-code.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Rust](<https://devfeed.tech/topics/rust.md>), [Concurrency](<https://devfeed.tech/topics/concurrency.md>)

Tags: [collections](<https://devfeed.tech/tags/collections.md>), [concurrency](<https://devfeed.tech/tags/concurrency.md>), [python](<https://devfeed.tech/tags/python.md>), [rust](<https://devfeed.tech/tags/rust.md>)

### AI overview

A commentary roundup covering a new proposal for an immutable mapping type in Python, accepted unpacking in comprehensions planned for Python 3.15, and an ongoing debate about introducing Rust into CPython.

### Source excerpt

November, 2025

## Qdrant 1.13 - GPU Indexing, Strict Mode & New Storage Engine

DevFeed: [Qdrant 1.13 - GPU Indexing, Strict Mode & New Storage Engine](<https://devfeed.tech/articles/qdrant-1-13-gpu-indexing-strict-mode-new-storage-engine-46696.md>)

Original publisher: [Read original article](<https://qdrant.tech/blog/qdrant-1.13.x/>)

Author: info@qdrant.tech (Andrey Vasnetsov)

Published: 2025-01-23T08:00:00Z

Content type: release

Language: en

Sources: [Qdrant Blog on Qdrant - Vector Search Engine](<https://devfeed.tech/sources/qdrant-blog-on-qdrant-vector-search-engine.md>)

Topics: [GPU](<https://devfeed.tech/topics/gpu.md>), [Qdrant](<https://devfeed.tech/topics/qdrant.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [cloud-infrastructure](<https://devfeed.tech/topics/cloud-infrastructure.md>)

Tags: [accelerated](<https://devfeed.tech/tags/accelerated.md>), [amd](<https://devfeed.tech/tags/amd.md>), [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [bert](<https://devfeed.tech/tags/bert.md>), [compression](<https://devfeed.tech/tags/compression.md>), [docker-image](<https://devfeed.tech/tags/docker-image.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [fasttext](<https://devfeed.tech/tags/fasttext.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [hnsw](<https://devfeed.tech/tags/hnsw.md>), [image-search](<https://devfeed.tech/tags/image-search.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [intel](<https://devfeed.tech/tags/intel.md>), [knn-algorithm](<https://devfeed.tech/tags/knn-algorithm.md>), [matching](<https://devfeed.tech/tags/matching.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [qdrant](<https://devfeed.tech/tags/qdrant.md>), [recommender-system](<https://devfeed.tech/tags/recommender-system.md>), [saas](<https://devfeed.tech/tags/saas.md>), [simaes-networks](<https://devfeed.tech/tags/simaes-networks.md>), [similarity](<https://devfeed.tech/tags/similarity.md>), [storage](<https://devfeed.tech/tags/storage.md>), [transformer](<https://devfeed.tech/tags/transformer.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>), [vector-search-engine](<https://devfeed.tech/tags/vector-search-engine.md>), [vectors](<https://devfeed.tech/tags/vectors.md>), [word2vec](<https://devfeed.tech/tags/word2vec.md>)

### AI overview

Qdrant 1.13.0 introduces GPU-accelerated HNSW indexing across NVIDIA, AMD, and Intel GPUs, along with strict mode, HNSW graph compression, named vector filtering, and custom storage. The release reports faster indexing and supports multi-GPU workloads and preconfigured Docker images.

### Source excerpt

Qdrant 1.13.0 is out! Let's look at the main features for this version: GPU Accelerated Indexing: Fast HNSW indexing with architecture-free GPU support. Strict Mode: Enforce operation restrictions on collections for enhanced control. HNSW Graph Compression: Reduce storage use via HNSW Delta Encoding. Named Vector Filtering: New has_vector filtering condition for named vectors. Custom Storage: For constant-time reads/writes of payloads and sparse vectors. GPU Accelerated Indexing We are making it easier for you to handle even the most demanding workloads.

## Effective Kotlin Item 60: Use appropriate collection types

DevFeed: [Effective Kotlin Item 60: Use appropriate collection types](<https://devfeed.tech/articles/effective-kotlin-item-60-use-appropriate-collection-types-39273.md>)

Original publisher: [Read original article](<https://kt.academy/article/ek-collection-types>)

Published: 2023-12-04T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [Kotlin](<https://devfeed.tech/topics/kotlin.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>)

Tags: [collections](<https://devfeed.tech/tags/collections.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [thread](<https://devfeed.tech/tags/thread.md>), [time-complexity](<https://devfeed.tech/tags/time-complexity.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

### AI overview

This Kotlin article explains the contracts and implementation considerations of lists, sets, and maps. It focuses on how underlying data structures, mutability, thread safety, and array-based list growth affect collection performance and operation time complexity.

### Source excerpt

Using non-standard collection types to improve performance in Kotlin.

## Building Tag and Archive Indexes in Eleventy

DevFeed: [Building Tag and Archive Indexes in Eleventy](<https://devfeed.tech/articles/11ty-index-all-the-things-52145.md>)

Original publisher: [Read original article](<https://lea.verou.me/blog/2023/11ty-indices/>)

Author: Lea Verou

Published: 2023-07-19T00:00:00Z

Content type: tutorial

Language: en

Sources: [Lea Verou's blog](<https://devfeed.tech/sources/lea-verou-s-blog.md>)

Topics: [Eleventy](<https://devfeed.tech/topics/eleventy.md>), [migration](<https://devfeed.tech/topics/migration.md>), [Information Architecture](<https://devfeed.tech/topics/information-architecture.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Template](<https://devfeed.tech/topics/template.md>), [data](<https://devfeed.tech/topics/data.md>)

Tags: [11ty](<https://devfeed.tech/tags/11ty.md>), [blog](<https://devfeed.tech/tags/blog.md>), [collections](<https://devfeed.tech/tags/collections.md>), [css](<https://devfeed.tech/tags/css.md>), [data](<https://devfeed.tech/tags/data.md>), [eleventy](<https://devfeed.tech/tags/eleventy.md>), [information-architecture](<https://devfeed.tech/tags/information-architecture.md>), [meta](<https://devfeed.tech/tags/meta.md>), [migration](<https://devfeed.tech/tags/migration.md>), [template](<https://devfeed.tech/tags/template.md>)

### AI overview

A tutorial on using Eleventy pagination, collections, templates, and Nunjucks to build tag pages and indexes, while preserving usable URLs and accessible ordering.

### Source excerpt

This is a second spinoff post in the migration saga of this blog from WordPress to 11ty. On good URLs It was important to me to have good, RESTful, usable, hackable URLs. While a lot of that is easy and comes for free, following this principle with Eleventy proved quite hard: URLs that are "hackable" to allow users to move to higher levels of the information architecture by hacking off the end of the URL What does this mean in practice? It means it's not enough if tags/foo/ shows all posts tagged "foo", tags/ should also show all tags. Similarly, it's not enough if /blog/2023/04/private-fields-considered-harmful/ links to the corresponding blog post, but also: /blog/2023/04/ should show all posts from April 2023 /blog/2023/ should show all posts from 2023 /blog/ should show all posts Eleventy "Pagination" Primer Eleventy has a pagination feature, which actually does a lot more than pagination: it's used every time you want to generate several pages from a single template by chunking object keys and using them in permalinks. One of the most common non-pagination use cases for it is tag pages. The typical /tags/tagname/ page is generated by a deceptively simple template: --- pagination: data: collections size: 1 alias: tag filter: ["blog", "all"] permalink: /blog/tags/{{ tag }}/ override:tags: [] eleventyComputed: title: "{{ collections[ tag ].length | pluralize('post') }} on {{ tag | format_tag }}" --- {% set taglist = collections[ tag ] | reverse %} {# ... Loop over taglist here ... #} That was it, then you just loop over taglist (or collections[ tag ] | reverse directly) to template the posts under each tag in reverse chronological order. Simple, right? But what about the indices? As it currently stands, visiting /blog/tags/ will just produce a 404. Index of all tags Creating an index of all tags only involves a single page, so it does not involve contorting the pagination feature to mind-bending levels, like the rest of this post. However, we need to do some proce

## Clojure 1.12.0-alpha1

DevFeed: [Clojure 1.12.0-alpha1](<https://devfeed.tech/articles/clojure-1-12-0-alpha1-49571.md>)

Original publisher: [Read original article](<https://clojure.org/news/2022/06/30/clojure1-12-alpha1>)

Published: 2022-06-30T00: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>), [Code](<https://devfeed.tech/topics/code.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [function](<https://devfeed.tech/topics/function.md>), [interface](<https://devfeed.tech/topics/interface.md>), [Java](<https://devfeed.tech/topics/java.md>)

Tags: [changes](<https://devfeed.tech/tags/changes.md>), [clojure](<https://devfeed.tech/tags/clojure.md>), [code](<https://devfeed.tech/tags/code.md>), [collections](<https://devfeed.tech/tags/collections.md>), [functions](<https://devfeed.tech/tags/functions.md>), [interface](<https://devfeed.tech/tags/interface.md>), [programming](<https://devfeed.tech/tags/programming.md>), [serialization](<https://devfeed.tech/tags/serialization.md>), [version](<https://devfeed.tech/tags/version.md>)

### AI overview

Clojure 1.12.0-alpha1 introduces stricter var interning behavior, more efficient collection dropping and partitioning, new partitioning functions, and explicit Java serialization identifiers to preserve compatibility where necessary.

### Source excerpt

Today we are releasing Clojure 1.12.0-alpha1 and we would encourage you to try it and give us your feedback! Var interning policy Interning a var in a namespace (vs aliasing) must create a stable reference that is never displaced, so that all references to an interned var get the same object. There were some cases where interned vars could get displaced and those have been tightened up in 1.12.0-alpha1. If you encounter this situation, you'll see a warning like "REJECTED: attempt to replace interned var #'some-ns/foo with #'other-ns/foo in some-ns, you must ns-unmap first". This addressses the root cause of an issue encountered with Clojure 1.11.0, which added new functions to clojure.core (particularly abs). Compiled code from an earlier version of Clojure with var names that matched the newly added functions in clojure.core would be unbound when loaded in a 1.11.0 runtime (more details in a future blog post). In addition to CLJ-2711, we rolled back a previous fix in this area (CLJ-1604). Efficient drop and partition for persistent or algorithmic collections Partitioning of a collection uses a series of takes (to build a partition) and drops (to skip past that partition). CLJ-2713 adds a new internal interface (IDrop) indicating that a collection can drop more efficiently than sequential traversal, and implements that for persistent collections and algorithmic collections like range and repeat. These optimizations are used in drop, nthrest, and nthnext. Additionally, there are new functions partitionv, partitionv-all, and splitv-at that are more efficient than their existing counterparts and produce vector partitions instead of realized seq partitions. You can read more detail in the Efficient Partitioning blog post. Serialization changes CLJ-1327 explicitly sets the Java serialization identifier for the classes in Clojure that implement Java serialization. In Clojure 1.11.0 this changed for two classes unnecessarily and we reverted those changes in Clojure 1.11.1

## Collections: Maps

DevFeed: [Collections: Maps](<https://devfeed.tech/articles/collections-maps-25060.md>)

Original publisher: [Read original article](<https://typealias.com/start/kotlin-maps/>)

Author: author@typealias.com (Dave Leeds)

Published: 2022-05-04T00:00:00Z

Content type: article

Language: en

Sources: [Dave Leeds on Kotlin - typealias.com](<https://devfeed.tech/sources/dave-leeds-on-kotlin-typealias-com.md>)

Topics: [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [associate](<https://devfeed.tech/tags/associate.md>), [association](<https://devfeed.tech/tags/association.md>), [collections](<https://devfeed.tech/tags/collections.md>), [groupby](<https://devfeed.tech/tags/groupby.md>), [introduction](<https://devfeed.tech/tags/introduction.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [learn-to-program](<https://devfeed.tech/tags/learn-to-program.md>), [map](<https://devfeed.tech/tags/map.md>), [maps](<https://devfeed.tech/tags/maps.md>), [pair](<https://devfeed.tech/tags/pair.md>), [programming](<https://devfeed.tech/tags/programming.md>)

### AI overview

The excerpt introduces Kotlin maps as collections that hold associations between values, like a table mapping hardware to the tool used for it (for example, a nail to a hammer). It begins showing how to represent one association with a class whose constructor takes two objects of any types, but the class name is omitted in the supplied text.

### Source excerpt

In the last chapter, we saw how collections, such as lists and sets, can be used to do things that couldn't be done easily with separate, individual variables. In this chapter, we're going to look at another kind of collection--a map, which can hold many associations between values. Let's check it out! The Right Tool for the Job "You gotta use the right tool for the job." That's what Mr. Patchwell taught his young son, Jack, who was just starting to learn how to become a handyman like his old man.

## Joining Collections in MongoDB with .NET Core and an Aggregation Pipeline

DevFeed: [Joining Collections in MongoDB with .NET Core and an Aggregation Pipeline](<https://devfeed.tech/articles/joining-collections-in-mongodb-with-net-core-and-an-aggregation-pipeline-21813.md>)

Original publisher: [Read original article](<https://www.thepolyglotdeveloper.com/blog/2022/03/joining-collections-mongodb-dotnet-core-aggregation-pipeline/>)

Author: Nic Raboy

Published: 2022-03-02T14:00:00Z

Content type: tutorial

Language: en

Sources: [Nic Raboy](<https://devfeed.tech/sources/nic-raboy.md>)

Topics: [MongoDB](<https://devfeed.tech/topics/mongodb.md>), [.NET](<https://devfeed.tech/topics/net.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [aggregation](<https://devfeed.tech/tags/aggregation.md>), [api](<https://devfeed.tech/tags/api.md>), [application](<https://devfeed.tech/tags/application.md>), [atlas](<https://devfeed.tech/tags/atlas.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [collection](<https://devfeed.tech/tags/collection.md>), [collections](<https://devfeed.tech/tags/collections.md>), [console](<https://devfeed.tech/tags/console.md>), [core](<https://devfeed.tech/tags/core.md>), [crud](<https://devfeed.tech/tags/crud.md>), [csharp](<https://devfeed.tech/tags/csharp.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [dotnet](<https://devfeed.tech/tags/dotnet.md>), [join](<https://devfeed.tech/tags/join.md>), [model](<https://devfeed.tech/tags/model.md>), [mongodb](<https://devfeed.tech/tags/mongodb.md>), [movies](<https://devfeed.tech/tags/movies.md>), [net](<https://devfeed.tech/tags/net.md>), [net-core](<https://devfeed.tech/tags/net-core.md>), [network](<https://devfeed.tech/tags/network.md>), [nosql](<https://devfeed.tech/tags/nosql.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>)

### AI overview

The tutorial introduces joining data from MongoDB collections with aggregation pipelines in a .NET Core application. Its setup uses MongoDB Atlas, .NET Core 6+, the sample data sets, the `sample_mflix` database and `movies` collection, plus a custom `playlist` collection. The excerpt highlights that relevant fields and values across the collections are strings, but does not include the pipeline implementation or its results.

### Source excerpt

If you've been keeping up with my .NET Core series on MongoDB, you'll remember that we explored creating a simple console application as well as building a RESTful API with basic CRUD support. In both... The post Joining Collections in MongoDB with .NET Core and an Aggregation Pipeline appeared first on MongoDB.

## Effective Kotlin Item 56: Consider using groupingBy instead of groupBy

DevFeed: [Effective Kotlin Item 56: Consider using groupingBy instead of groupBy](<https://devfeed.tech/articles/effective-kotlin-item-56-consider-using-groupingby-instead-of-groupby-39280.md>)

Original publisher: [Read original article](<https://kt.academy/article/ek-grouping>)

Published: 2021-10-11T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [groupby](<https://devfeed.tech/topics/groupby.md>), [Kotlin](<https://devfeed.tech/topics/kotlin.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [performance-optimization](<https://devfeed.tech/topics/performance-optimization.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [collections](<https://devfeed.tech/tags/collections.md>), [groupby](<https://devfeed.tech/tags/groupby.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [performance](<https://devfeed.tech/tags/performance.md>), [standard-library](<https://devfeed.tech/tags/standard-library.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

### AI overview

This tutorial explains how Kotlin's groupBy and groupingBy functions organize elements from an iterable by key. It describes groupBy as the simpler option that creates collections for each key, while groupingBy can reduce work and memory use in performance-critical code by processing groups through operations such as counting and aggregation.

### Source excerpt

What Grouping is, and how groupingBy instead of groupBy can be a performance optimization.

## Effective Kotlin Item 54: Prefer Sequences for big collections with more than one processing step

DevFeed: [Effective Kotlin Item 54: Prefer Sequences for big collections with more than one processing step](<https://devfeed.tech/articles/effective-kotlin-item-54-prefer-sequences-for-big-collections-with-more-than-one-processing-step-39290.md>)

Original publisher: [Read original article](<https://kt.academy/article/ek-sequence>)

Published: 2021-09-20T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [Sequences](<https://devfeed.tech/topics/sequences.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [.NET](<https://devfeed.tech/topics/net.md>)

Tags: [collections](<https://devfeed.tech/tags/collections.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [lazy](<https://devfeed.tech/tags/lazy.md>), [order-of-operations](<https://devfeed.tech/tags/order-of-operations.md>), [sequences](<https://devfeed.tech/tags/sequences.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

### AI overview

This article explains the difference between Kotlin collection and sequence processing. Sequences are lazy: intermediate operations build a processing chain, and calculations occur during terminal operations. The article discusses their element-by-element ordering, reduced processing work, support for infinite sequences, and avoidance of intermediate collections.

### Source excerpt

What the difference between list and sequence processing is, and when each should be preferred.

## Clojure 1.7 is now available

DevFeed: [Clojure 1.7 is now available](<https://devfeed.tech/articles/clojure-1-7-is-now-available-49489.md>)

Original publisher: [Read original article](<https://clojure.org/news/2015/06/30/clojure-17>)

Published: 2015-06-30T00: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>), [Code](<https://devfeed.tech/topics/code.md>), [multiplatform](<https://devfeed.tech/topics/multiplatform.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [ClojureScript](<https://devfeed.tech/topics/clojurescript.md>), [Concurrency](<https://devfeed.tech/topics/concurrency.md>)

Tags: [1-7](<https://devfeed.tech/tags/1-7.md>), [2015](<https://devfeed.tech/tags/2015.md>), [aggregates](<https://devfeed.tech/tags/aggregates.md>), [clojure](<https://devfeed.tech/tags/clojure.md>), [core-async](<https://devfeed.tech/tags/core-async.md>), [portable](<https://devfeed.tech/tags/portable.md>), [programming](<https://devfeed.tech/tags/programming.md>)

### AI overview

A release announcement for Clojure 1.7 covering transducers, reader conditionals, and portable Clojure support. The release adds composable transformations that work across collections, streams, channels, and other contexts, along with the .cljc file extension for shared Clojure and ClojureScript code.

### Source excerpt

We are pleased to announce the release of Clojure 1.7. The two headline features for 1.7 are transducers and reader conditionals. Also see the complete list of all changes since Clojure 1.6 for more details. Transducers Transducers are composable algorithmic transformations. They are independent from the context of their input and output sources and specify only the essence of the transformation in terms of an individual element. Because transducers are decoupled from input or output sources, they can be used in many different processes - collections, streams, channels, observables, etc. Transducers compose directly, without awareness of input or creation of intermediate aggregates. Many existing sequence functions now have a new arity (one fewer argument than before). This arity will return a transducer that represents the same logic but is independent of lazy sequence processing. Functions included are: map, mapcat, filter, remove, take, take-while, drop, drop-while, take-nth, replace, partition-by, partition-all, keep, keep-indexed, map-indexed, distinct, and interpose. Additionally some new transducer functions have been added: cat, dedupe, and random-sample. Transducers can be used in several new or existing contexts: into - to collect the results of applying a transducer sequence - to incrementally compute the result of a transducer transduce - to immediately compute the result of a transducer eduction - to delay computation and recompute each time core.async - to apply a transducer while values traverse a channel Portable Clojure and Reader Conditionals It is now common to see a library or application targeting multiple Clojure platforms with a single codebase. Clojure 1.7 introduces a new extension (.cljc) for files that can be loaded by Clojure and ClojureScript (and other Clojure platforms). There will often be some parts of the code that vary between platforms. The primary mechanism for dealing with platform-specific code is to isolate that code into a mi

## Methods of Proof -- Diagonalization

DevFeed: [Methods of Proof -- Diagonalization](<https://devfeed.tech/articles/methods-of-proof-diagonalization-40384.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/06/08/methods-of-proof-diagonalization/>)

Published: 2015-06-08T09:00:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>), [Collections](<https://devfeed.tech/topics/collections.md>)

Tags: [bijections](<https://devfeed.tech/tags/bijections.md>), [cardinality](<https://devfeed.tech/tags/cardinality.md>), [diagonalization](<https://devfeed.tech/tags/diagonalization.md>), [halting-problem](<https://devfeed.tech/tags/halting-problem.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [methods-of-proof](<https://devfeed.tech/tags/methods-of-proof.md>), [turing-machines](<https://devfeed.tech/tags/turing-machines.md>), [uncountability](<https://devfeed.tech/tags/uncountability.md>)

### AI overview

This tutorial introduces diagonalization as an advanced method of mathematical proof. It explains the table-and-diagonal construction and presents the theorem that no bijection exists between the natural numbers and the real numbers.

### Source excerpt

A while back we featured a post about why learning mathematics can be hard for programmers, and I claimed a major issue was not understanding the basic methods of proof (the lingua franca between intuition and rigorous mathematics). I boiled these down to the "basic four," direct implication, contrapositive, contradiction, and induction. But in mathematics there is an ever growing supply of proof methods. There are books written about the "probabilistic method," and I recently went to a lecture where the "linear algebra method" was displayed.

## Iterating Over Slices In Go

DevFeed: [Iterating Over Slices In Go](<https://devfeed.tech/articles/iterating-over-slices-in-go-22071.md>)

Original publisher: [Read original article](<https://www.ardanlabs.com/blog/2013/09/iterating-over-slices-in-go.html>)

Published: 2013-09-23T00:00:00Z

Content type: article

Language: en

Sources: [William Kennedy](<https://devfeed.tech/sources/william-kennedy.md>)

Topics: [Go Language](<https://devfeed.tech/topics/go-language.md>), [Collections](<https://devfeed.tech/topics/collections.md>), [Functional programming](<https://devfeed.tech/topics/functional-programming.md>)

Tags: [ardan-labs](<https://devfeed.tech/tags/ardan-labs.md>), [blog](<https://devfeed.tech/tags/blog.md>), [functional](<https://devfeed.tech/tags/functional.md>), [functional-programming](<https://devfeed.tech/tags/functional-programming.md>), [go](<https://devfeed.tech/tags/go.md>), [go-programming](<https://devfeed.tech/tags/go-programming.md>), [golang](<https://devfeed.tech/tags/golang.md>), [imperative](<https://devfeed.tech/tags/imperative.md>), [mongodb](<https://devfeed.tech/tags/mongodb.md>), [pointers](<https://devfeed.tech/tags/pointers.md>), [programming](<https://devfeed.tech/tags/programming.md>), [slices](<https://devfeed.tech/tags/slices.md>)

### AI overview

The author recommends using pointers in Go when safe and practical, while deciding case by case whether to pass an object's address or a copy. Pointers can ease memory constraints and may improve performance, but shared access can create synchronization issues. Go passes values by value in either case: that value may be an address or an object copy. The excerpt also points readers to two Ardan Labs posts for learning about slices; it does not include their contents.

### Source excerpt

Slices are used everywhere in my code. If I am working with data from MongoDB, it is stored in a slice. If I need to keep track of a collection of problems after running an operation, it is stored in a slice. If you don't understand how slices work yet or have been avoiding them like I did when I started, read these two posts to learn more. External resource on ardanlabs.com: https://www.ardanlabs.com/blog/2013/08/understanding-slices-in-go-programming.html External resource on ardanlabs.com: https://www.ardanlabs.com/blog/2013/08/collections-of-unknown-length-in-go.html

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