Sort NSArray with sortedArrayUsingComparator Sort NSArray with sortedArrayUsingComparator swift swift

Sort NSArray with sortedArrayUsingComparator


You can either use Swift's built in sort functions or, since a Swift array is bridged to NSArray you can call sortedArrayUsingComparator from swift directly.

Using Swift's sorted function:

var sortedArray = sorted(persons) {    (obj1, obj2) in    // The downcast to Person is only needed if persons is an NSArray or a Swift Array of AnyObjects    let p1 = obj1 as Person    let p2 = obj2 as Person    return p1.name < p2.name}

Or, using NSArray's sortedArrayUsingComparator:

var sortedArray = persons.sortedArrayUsingComparator {    (obj1, obj2) -> NSComparisonResult in    let p1 = obj1 as Person    let p2 = obj2 as Person    let result = p1.name.compare(p2.name)    return result}


There's no need to avoid Swift Array.

It's bridged in both directions with NSArray, so for more type-safe code it's best to do your work with Swift arrays and bridge only when needed for interoperating with ObjC APIs. (And in most imported APIs, Swift automatically converts NSArray to [AnyObject], so you don't even need to bridge very often.)

Assuming the persons array is an [AnyObject] you got from other API, you can cut down on the amount of type casting relative to other answers by casting the array first:

let sortedPersons = sorted(persons as [Person]) { $0.name < $1.name }// sortedPersons has inferred type [Person]

Also, since you're using a comparator block only to sort on a specific property of your Person class, you might do better to use sort descriptors:

let sortedPersons = (persons as NSArray).sortedArrayUsingDescriptors([    NSSortDescriptor(key: "name", ascending: true)])

(The persons as NSArray part may not be necessary if persons came from an ObjC API.)

Depending on how the Person class is implemented, sorting with descriptors can produce a more efficient sort on the backend. For example, if it's a Core Data managed object, sorting with descriptors might produce a SQL query that executes fast in the database and uses little memory, while sorting with a comparator closure requires instantiating every object from the database just to evaluate the closure against each.


So try just write the same with Swift:

var sortedArray:NSArray = persons.sortedArrayUsingComparator(){(p1:AnyObject!, p2:AnyObject!) -> NSComparisonResult in    if (p1 as Person).name > (p2 as Person).name {       return NSComparisonResult.OrderedDescending    }    if (p1 as Person).name < (p2 as Person).name {        return NSComparisonResult.OrderedAscending    }    return NSComparisonResult.OrderedAscending }

Test (Playground):

class Person{  var name:String?}var p1:Person = Person()p1.name = "a"    var p3:Person = Person()p3.name = "c"var p2:Person = Person()p2.name = "b"var persons:NSArray = [p1,p3,p2]var sortedArray:NSArray = persons.sortedArrayUsingComparator(){    (p1:AnyObject!, p2:AnyObject!) -> NSComparisonResult in    if (p1 as Person).name > (p2 as Person).name {       return NSComparisonResult.OrderedDescending    }    if (p1 as Person).name < (p2 as Person).name {        return NSComparisonResult.OrderedAscending    }    return NSComparisonResult.OrderedAscending    }for item:AnyObject in sortedArray{    println((item as Person).name)}

Output:

Optional("a")Optional("b")Optional("c")