Sets

Sets in Pascal

Explore Pascal's native set type — union, intersection, difference, and membership testing over ordinal values.

Lists, Sets, and Maps

Master Apex's three core collection types — ordered Lists, unique Sets, and key-value Maps — and when to use each for bulk-safe, governor-limit-friendly code.

gawk Extensions

Survey the features GNU awk adds over POSIX AWK — gensub, true multidimensional arrays, asort, IGNORECASE, time and networking functions, and the C extension A…

Lists, Sets, and Maps

Learn Dart's three core collection types, List, Set, and Map, and when to use each for ordered sequences, unique elements, and key-value lookups.

Maps and Sets

Understand Scala's Map and Set collections - how they guarantee unique keys and elements, the difference between immutable and mutable variants, and their core…

VM Scale Sets

Azure Virtual Machine Scale Sets let you deploy and manage a group of identical, load-balanced VMs that automatically grow or shrink based on demand.

Replica Sets Explained

How MongoDB replica sets provide high availability through automatic failover, elections, and data redundancy across primary and secondary nodes.

Sets in Redis

Explore Redis Sets as unordered collections of unique strings, covering membership checks, set algebra like intersection and union, and randomized sampling.

Sorted Sets in Redis

Master Redis Sorted Sets, where every unique member carries a floating-point score, enabling leaderboards, priority queues, and range-based queries by rank or…

Sets in Python

An unordered collection of unique, hashable elements in Python, covering set creation, operations, and the no-order/no-duplicates gotcha.

Dictionaries and Sets in Swift

Understand Swift's key-value dictionaries and unique-element sets, including how Hashable powers both.

Union-Find and Disjoint Sets

A near-constant-time data structure for tracking disjoint sets, essential for cycle detection and Kruskal's MST.

Dictionaries and Sets

Learn how Dictionary<TKey,TValue> and HashSet<T> use hashing for near-constant-time lookups, and how to use them correctly with custom key types.