Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 773 43.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 789 43.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 773 43.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 789 43.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 773 43.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 789 43.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 808 44.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 824 44.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever = max - min gap (generic function with 1 method) julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 806 44.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 822 44.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 805 44.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 821 44.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 805 44.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 821 44.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 797 43.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813 43.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 690 42.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 703 42.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and

Dictionaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 690 42.7 Set-Like Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 703 42.8 Dequeues mathematical use. More precisely, the set of all finite-length strings S together with the string concatenation operator * forms a free monoid (S, *). The identity element of this set is the empty string, "". Whenever (y, x) : (x, y) julia> gap((min, max)) = max - min julia> gap(minmax(10, 2)) 8 Notice the extra set of parentheses in the definition of gap. Without those, gap would be a two-argument function, and