// Swift Example of avoiding unnecessary copies
class MyClass {
var data: [Int]
init(data: [Int]) {
self.data = data
}
}
func demo() {
let array1 = [1, 2, 3, 4, 5]
var instance1 = MyClass(data: array1)
// Directly using the data prevents copy
var instance2 = instance1
instance2.data[0] = 10 // Change won't affect instance1
print(instance1.data) // Output: [1, 2, 3, 4, 5]
print(instance2.data) // Output: [10, 2, 3, 4, 5]
}
demo()
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?