Alk*_*Alk 13 arrays duplicates nsobject ios swift
我有一个自定义类定义如下:
class DisplayMessage : NSObject {
var id : String?
var partner_image : UIImage?
var partner_name : String?
var last_message : String?
var date : NSDate?
}
Run Code Online (Sandbox Code Playgroud)
现在我有一个数组myChats = [DisplayMessage]?.该id字段对于每个DisplayMessage对象都是唯一的.我需要检查我的数组并从中删除所有重复项,基本上确保数组中的所有对象都具有唯一性id.我已经看到了一些使用的解决方案NSMutableArray,Equatable但是我不确定如何在这里进行调整; 我也知道,Array(Set(myChats))这似乎不适用于自定义对象数组.
Cip*_*rau 27
这是一个Array扩展,用于根据给定的键返回唯一的对象列表:
extension Array {
func unique<T:Hashable>(map: ((Element) -> (T))) -> [Element] {
var set = Set<T>() //the unique list kept in a Set for fast retrieval
var arrayOrdered = [Element]() //keeping the unique list of elements but ordered
for value in self {
if !set.contains(map(value)) {
set.insert(map(value))
arrayOrdered.append(value)
}
}
return arrayOrdered
}
}
Run Code Online (Sandbox Code Playgroud)
为你的例子做:
let uniqueMessages = messages.unique{$0.id ?? ""}
Run Code Online (Sandbox Code Playgroud)
das*_*ght 14
您可以使用一组字符串来完成它,如下所示:
var seen = Set<String>()
var unique = [DisplayMessage]
for message in messagesWithDuplicates {
if !seen.contains(message.id!) {
unique.append(message)
seen.insert(message.id!)
}
}
Run Code Online (Sandbox Code Playgroud)
我们的想法是保留一组我们到目前为止看到的所有ID,遍历循环中的所有项目,并添加我们尚未看到的ID.
nig*_*ill 13
这是一个Array基于 a 返回唯一对象列表的扩展keyPath:
extension Array {
func uniques<T: Hashable>(by keyPath: KeyPath<Element, T>) -> [Element] {
return reduce([]) { result, element in
let alreadyExists = (result.contains(where: { $0[keyPath: keyPath] == element[keyPath: keyPath] }))
return alreadyExists ? result : result + [element]
}
}
}
Run Code Online (Sandbox Code Playgroud)
用法:
myChats.uniques(by: \.id)
Run Code Online (Sandbox Code Playgroud)
使用基于给定键的相等比较,创建一个免费的重复版本的 Array
public extension Sequence {
public func uniq<Id: Hashable >(by getIdentifier: (Iterator.Element) -> Id) -> [Iterator.Element] {
var ids = Set<Id>()
return self.reduce([]) { uniqueElements, element in
if ids.insert(getIdentifier(element)).inserted {
return uniqueElements + CollectionOfOne(element)
}
return uniqueElements
}
}
public func uniq<Id: Hashable >(by keyPath: KeyPath<Iterator.Element, Id>) -> [Iterator.Element] {
return self.uniq(by: { $0[keyPath: keyPath] })
}
}
public extension Sequence where Iterator.Element: Hashable {
var uniq: [Iterator.Element] {
return self.uniq(by: { (element) -> Iterator.Element in
return element
})
}
}
Run Code Online (Sandbox Code Playgroud)
用法
let numbers = [1,2,3,4,5,6,7,1,1,1,]
let cars = [Car(id:1), Car(id:1), Car(id:2)]
numbers.uniq
cars.uniq(by: { $0.id})
cars.uniq(by: \Car.id)
cars.uniq(by: \.id)
Run Code Online (Sandbox Code Playgroud)