Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1665 88.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1669 88.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1665 88.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1669 88.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1665 88.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1669 88.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1729 90.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1733 90.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1727 90.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1731 90.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1726 90.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1730 90.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1726 90.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1730 90.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1717 89.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1721 89.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1662 88.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1666 88.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a

Subsequences, permutations and shuffling . . . . . . . . . . . . . . . . . . . . . . 1662 88.4 Generators (creation and seeding) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1666 88.5 Hooking into the Random named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name: julia> map(x -> x^2 + 2x - 1, [1, 3, -1]) types in question, but then this set would not be extensible as Union-types cannot be altered after creation. However, such an extensible set can be programmed with a design pattern often referred to as a