Dart Set

// Set literal with type inference
var primaryColors = {'red', 'green', 'blue'}; // Inferred as Set<String>

// Explicitly typed Set literal
Set<int> fibonacci = {1, 2, 3, 5, 8};

// Creating an empty Set
var emptySet = <String>{}; 
Set<double> anotherEmptySet = {};

// Anti-pattern: This creates a Map, not a Set
var notASet = {}; 

var nodes = <String>{'A', 'B'};

// Addition
nodes.add('C');           // Returns true (added)
nodes.add('A');           // Returns false (duplicate, ignored)
nodes.addAll({'D', 'E'}); // Adds multiple elements

// Removal
nodes.remove('B');        // Returns true if element existed and was removed
nodes.clear();            // Empties the set

// Lookup
bool exists = nodes.contains('C');

var setA = {1, 2, 3, 4};
var setB = {3, 4, 5, 6};

// Union: Combines all unique elements from both sets
// Result: {1, 2, 3, 4, 5, 6}
var union = setA.union(setB);

// Intersection: Yields elements present in both sets
// Result: {3, 4}
var intersection = setA.intersection(setB);

// Difference: Yields elements in setA that are not in setB
// Result: {1, 2}
var difference = setA.difference(setB);

import 'dart:collection';

// HashSet: Unordered. Iteration order is not guaranteed. 
// Marginally faster than LinkedHashSet as it doesn't maintain pointers for insertion order.
var hashSet = HashSet<int>();

// SplayTreeSet: A self-balancing binary search tree. 
// Elements are iterated in sorted order according to their `compareTo` method 
// or a provided Comparator. Operations are O(log n).
var treeSet = SplayTreeSet<int>();

var baseConfig = {'host', 'port'};
bool includeAuth = true;

var finalConfig = <String>{
  ...baseConfig,
  if (includeAuth) 'credentials',
  for (var i = 1; i <= 3; i++) 'node_$i'
};
// Result: {'host', 'port', 'credentials', 'node_1', 'node_2', 'node_3'}