File tree Expand file tree Collapse file tree 3 files changed +11
-14
lines changed Expand file tree Collapse file tree 3 files changed +11
-14
lines changed Original file line number Diff line number Diff line change @@ -13,12 +13,12 @@ extension Deque: ExpressibleByArrayLiteral {
13
13
/// Creates a new deque from the contents of an array literal.
14
14
///
15
15
/// Do not call this initializer directly. It is used by the compiler when
16
- /// you use an array literal. Instead, create a new set using an array
16
+ /// you use an array literal. Instead, create a new deque using an array
17
17
/// literal as its value by enclosing a comma-separated list of values in
18
- /// square brackets. You can use an array literal anywhere a set is expected
18
+ /// square brackets. You can use an array literal anywhere a deque is expected
19
19
/// by the type context.
20
20
///
21
- /// - Parameter elements: A variadic list of elements of the new set .
21
+ /// - Parameter elements: A variadic list of elements of the new deque .
22
22
@inlinable
23
23
@inline ( __always)
24
24
public init ( arrayLiteral elements: Element ... ) {
Original file line number Diff line number Diff line change @@ -13,17 +13,14 @@ extension OrderedDictionary: ExpressibleByDictionaryLiteral {
13
13
/// Creates a new ordered dictionary from the contents of a dictionary
14
14
/// literal.
15
15
///
16
- /// Duplicate elements in the literal are allowed, but the resulting
17
- /// set will only contain the first occurrence of each.
18
- ///
19
16
/// Do not call this initializer directly. It is used by the compiler when you
20
17
/// use a dictionary literal. Instead, create a new ordered dictionary using a
21
18
/// dictionary literal as its value by enclosing a comma-separated list of
22
- /// values in square brackets. You can use an array literal anywhere a set is
23
- /// expected by the type context.
19
+ /// key-value pairs in square brackets. You can use a dictionary literal
20
+ /// anywhere an ordered dictionary is expected by the type context.
24
21
///
25
22
/// - Parameter elements: A variadic list of key-value pairs for the new
26
- /// dictionary.
23
+ /// ordered dictionary.
27
24
///
28
25
/// - Complexity: O(`elements.count`) if `Key` implements
29
26
/// high-quality hashing.
Original file line number Diff line number Diff line change 12
12
extension OrderedSet : ExpressibleByArrayLiteral {
13
13
/// Creates a new ordered set from the contents of an array literal.
14
14
///
15
- /// Duplicate elements in the literal are allowed, but the resulting
15
+ /// Duplicate elements in the literal are allowed, but the resulting ordered
16
16
/// set will only contain the first occurrence of each.
17
17
///
18
18
/// Do not call this initializer directly. It is used by the compiler when
19
- /// you use an array literal. Instead, create a new set using an array
19
+ /// you use an array literal. Instead, create a new ordered set using an array
20
20
/// literal as its value by enclosing a comma-separated list of values in
21
- /// square brackets. You can use an array literal anywhere a set is expected
22
- /// by the type context.
21
+ /// square brackets. You can use an array literal anywhere an ordered set is
22
+ /// expected by the type context.
23
23
///
24
- /// - Parameter elements: A variadic list of elements of the new set.
24
+ /// - Parameter elements: A variadic list of elements of the new ordered set.
25
25
///
26
26
/// - Complexity: O(`elements.count`) if `Element` implements
27
27
/// high-quality hashing.
You can’t perform that action at this time.
0 commit comments