I have a very large structure, which I want to ensure is not copied needlessly. How can I make a copy-on-write container for it?
可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效,请关闭广告屏蔽插件后再试):
问题:
回答1:
A copy-on-write is usually a struct
wrapper over some backing object.
public final class MutableHeapStore<T>: NonObjectiveCBase
{
public typealias Storage = T
public private(set) var storage: Storage
public init(storage: Storage)
{
self.storage = storage
}
}
public struct COW<T>
{
public typealias Storage = MutableHeapStore<T>
public typealias Value = T
public var storage: Storage
public init(storage: Storage)
{
self.storage = storage
}
public var value: Value
{
get
{
return storage.storage
}
set
{
if isUniquelyReferenced(&storage)
{
storage.storage = newValue
}
else
{
storage = Storage(storage: newValue)
}
}
}
public init(_ value: Value)
{
self.init(storage: Storage(storage: value))
}
}
extension COW: CustomStringConvertible
{
public var description: String
{
return String(value)
}
}
The trick lies in asserting isUniquelyReferenced
every time the boxed value is mutated. If the underlying storage object is singly referenced, nothing is to be done. However if another reference exists, one must create a new storage.
Is this code thread-safe? It is exactly as safe as any other value type, e.g. Int
or Bool
.
回答2:
Here's a bit simpler example.
struct COWExample1<T> {
private var box = Box<[T]>(value: [T]())
var count: Int {
return box.value.count
}
mutating func append(e: T) {
ensureBoxUniqueRefed()
box.value.append(e)
}
private mutating func ensureBoxUniqueRefed() {
if isUniquelyReferencedNonObjC(&box) == false {
box = box.duplicated()
}
}
}
private final class Box<T> {
var value: T
init(value: T) {
self.value = value
}
func duplicated() -> Box<T> {
return Box(value: value)
}
}
回答3:
The previous answers aren't wrong, but there's a much simpler way. The Swift team has a list of performance tips, and they say:
The easiest way to implement copy-on-write is to compose existing copy-on-write data structures, such as Array.
It doesn't get much simpler than that!