airspeedswift

func sortedSet<S: RangeReplaceableCollectionType where S.Generator.Element: Comparable>(seq:S, obj:S)-> [S.Generator.Element] {
    let s = reduce(seq, obj){
        ac, x in contains(ac,x) ? ac : ac + [x]
    }
    let set = sorted(s){$0<$1}
    return set
}

func insert<S:RangeReplaceableCollectionType, I: SignedIntegerType where I == S.Index.Distance, S.Generator.Element: Equatable>(inout seq:S, ins:S, ind:I) {
    // use of abs() prevents a negative value causing the insertIndex to be before the startIndex

airspeedswift

import KeychainAPI

let keychain: Keychain = Keychain(service: "com.secondgear.myapp", accessibility: Accessibility.WhenUnlocked)
let userAccount = Account(userName: "justinw@me.com", secret: "lovesecretsexgod")
keychain.add(userAccount)


if let fetchedAccount = keychain.accountFor("justinw@me.com")
{
    fetchedAccount.secret = "newpassword"

airspeedswift

func measure(title: String?, call: () -> Void) {
  let startTime = CACurrentMediaTime()
  call()
  let endTime = CACurrentMediaTime()
  if let title = title {
    print("\(title): ")
  }
  println("Time - \(endTime - startTime)")
}

airspeedswift

// adapted from original, which was (c) 2015 Nate Cook, licensed under the MIT license
//
// Fisher-Yates shuffle as protocol extensions

import Darwin

extension CollectionType where Index: RandomAccessIndexType {
    /// Return a copy of `self` with its elements shuffled
    func shuffle() -> [Generator.Element] {
        var list = Array(self)