In Swift, when working with Combine, managing subscriptions is crucial for avoiding memory leaks. It's essential to cancel your subscriptions appropriately, either when they are no longer needed or within the appropriate lifecycle methods of your classes. Below is an example demonstrating how to correctly handle Combine subscriptions and avoid memory leaks.
import Combine
class DataFetcher {
private var cancellables = Set()
func fetchData() {
let publisher = Just("Hello, Combine!")
publisher
.sink { value in
print(value)
}
.store(in: &cancellables) // Store the subscription
}
deinit {
// Clean up subscriptions when the class instance is deallocated
cancellables.removeAll()
}
}
let fetcher = DataFetcher()
fetcher.fetchData()
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?