@@ -740,7 +740,6 @@ extension ContiguousArray: RangeReplaceableCollection {
740
740
741
741
@inlinable
742
742
@_semantics ( " array.make_mutable " )
743
- @_effects ( notEscaping self.** )
744
743
internal mutating func _makeUniqueAndReserveCapacityIfNotUnique( ) {
745
744
if _slowPath ( !_buffer. beginCOWMutation ( ) ) {
746
745
_createNewBuffer ( bufferIsUnique: false ,
@@ -751,7 +750,6 @@ extension ContiguousArray: RangeReplaceableCollection {
751
750
752
751
@inlinable
753
752
@_semantics ( " array.mutate_unknown " )
754
- @_effects ( notEscaping self.** )
755
753
internal mutating func _reserveCapacityAssumingUniqueBuffer( oldCount: Int ) {
756
754
// Due to make_mutable hoisting the situation can arise where we hoist
757
755
// _makeMutableAndUnique out of loop and use it to replace
@@ -774,7 +772,6 @@ extension ContiguousArray: RangeReplaceableCollection {
774
772
775
773
@inlinable
776
774
@_semantics ( " array.mutate_unknown " )
777
- @_effects ( notEscaping self.** )
778
775
internal mutating func _appendElementAssumeUniqueAndCapacity(
779
776
_ oldCount: Int ,
780
777
newElement: __owned Element
@@ -808,7 +805,6 @@ extension ContiguousArray: RangeReplaceableCollection {
808
805
/// - Complexity: O(1) on average, over many calls to `append(_:)` on the
809
806
/// same array.
810
807
@inlinable
811
- @_effects ( notEscaping self. value**)
812
808
@_semantics ( " array.append_element " )
813
809
public mutating func append( _ newElement: __owned Element) {
814
810
// Separating uniqueness check and capacity check allows hoisting the
@@ -837,7 +833,6 @@ extension ContiguousArray: RangeReplaceableCollection {
837
833
/// `newElements`, over many calls to `append(contentsOf:)` on the same
838
834
/// array.
839
835
@_alwaysEmitIntoClient
840
- @_effects ( notEscaping self. value**)
841
836
@_semantics ( " array.append_contentsOf " )
842
837
public mutating func append(
843
838
contentsOf newElements: __owned some Collection < Element >
@@ -882,7 +877,6 @@ extension ContiguousArray: RangeReplaceableCollection {
882
877
/// `newElements`, over many calls to `append(contentsOf:)` on the same
883
878
/// array.
884
879
@inlinable
885
- @_effects ( notEscaping self. value**)
886
880
@_semantics ( " array.append_contentsOf " )
887
881
public mutating func append< S: Sequence > ( contentsOf newElements: __owned S)
888
882
where S. Element == Element {
@@ -945,7 +939,6 @@ extension ContiguousArray: RangeReplaceableCollection {
945
939
}
946
940
947
941
@inlinable
948
- @_effects ( notEscaping self. value**)
949
942
@_semantics ( " array.reserve_capacity_for_append " )
950
943
internal mutating func reserveCapacityForAppend( newElementsCount: Int ) {
951
944
// Ensure uniqueness, mutability, and sufficient storage. Note that
0 commit comments