therealbnut

[alias]
  swap-last-two-commits = "!f() {\n\
    set -eu \n\
    if [ ! -z \"`git diff HEAD`\" ]; then \n\
      echo \"Found uncommited changes... exiting.\" 1>&2 \n\
      exit 1 \n\
    fi \n\
    HEAD_0=\"$(git rev-parse --verify HEAD)\" \n\
    HEAD_1=\"$(git rev-parse --verify HEAD~1)\" \n\
    echo \"swapping ${HEAD_0} and ${HEAD_1}\" \n\

therealbnut

import Nimble
import Quick

public func errorOf<T>(expression: () throws -> T?) -> ErrorType? {
    do {
        try expression()
    }
    catch {
        return error
    }

therealbnut

//
//  NSArray+MergeSorted.h
//  NSArray Merge Sorted Category
//
//  Created by Andrew Bennett on 31/05/12.
//  Copyright (c) 2012 Andrew Bennett. All rights reserved.
//

#import <Foundation/Foundation.h>

therealbnut

public struct SourceLocation: CustomDebugStringConvertible {
    init(file: String = __FILE__, line: Int = __LINE__, column: Int = __COLUMN__, function: String = __FUNCTION__) {
        self.file = file
        self.line = line
        self.column = column
        self.function = function
    }

    public let file: String
    public let line: Int

therealbnut

guard let response = readLine(stripNewline: true) else {
    fatalError("Expecting input!")
}
let withoutSpaces = response.characters.filter { $0 != " " }

let length  = withoutSpaces.count
let minRows = Int(floor(sqrt(Double(length))))
let columns = minRows * minRows >= length ? minRows : minRows + 1

var output = ""

therealbnut

#!/usr/bin/env bash
set -eu

removeLines() {
  for i in $(seq ${1}); do 
    echo -en "\r\033[A\033[1K"
  done
}

echo -e "first line\nmuch longer second line - enough to wrap maybe"

therealbnut

// Output: 
// AnyPokemon<🔥>(Ponyta())
// AnyPokemon<🔥>(Charmander())

protocol Pokemon {
  associatedtype Power
  mutating func attack() -> Power
}

struct Pikachu: Pokemon {

therealbnut

// Using XCode 7.3.1 (it's all I had at the time)

extension MutableCollectionType where Generator.Element: Comparable {
    mutating func selectionSortInPlace() {
        for currentIndex in self.startIndex ..< self.endIndex {
            guard let (minIndex, minElement) = zip((currentIndex ..< self.endIndex), self.suffixFrom(currentIndex))
                .minElement({ lhs, rhs in (lhs.1 as! Generator.Element) < (rhs.1 as! Generator.Element) })
            else {
                continue
            }

therealbnut

// Using XCode 7.3.1 (it's all I had at the time)

extension MutableCollectionType where Generator.Element == SubSequence.Generator.Element {
    mutating func selectionSort(isOrderedBefore compare: (Generator.Element, Generator.Element) throws -> Bool) rethrows {
        for currentIndex in self.startIndex ..< self.endIndex {
            // (index,element) pairs after the current index
            let pairs = zip(currentIndex ..< self.endIndex, self.suffixFrom(currentIndex)).lazy
            
            // the pair with the minimum element
            let pair = try pairs.minElement({ try compare($0.1, $1.1) })

therealbnut

import DiskArbitration

extension URL {
  var volumeUUID: String? {
    guard self.isFileURL, let session = DASessionCreate(nil) else {
      return nil
    }

    var fsStats = statfs()
    guard statfs(self.path, &fsStats) == 0,