michaeleisel

#!/usr/bin/ruby

raise "Usage: ./args.rb <path to executable>" unless ARGV.size == 1

new_seg_name = "__MY_TEXT"

binary = ARGV.first

sect_regex = /\s*Section (\S+)/
sects = `xcrun size -x -l -m #{binary}`.split("\n").drop_while do |line|

michaeleisel

#!/usr/bin/ruby

def try(cmd)
  puts cmd
  success = system(cmd)
  raise unless success
end

def current_commit()
  `git rev-parse head`.chomp

michaeleisel

#!/usr/bin/ruby

def try(cmd)
  puts cmd
  success = system(cmd)
  raise unless success
end

def current_commit()
  `git rev-parse head`.chomp

michaeleisel

Here's the license (it's the MIT license) that applies to all of my public gists:

Copyright Michael Eisel

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERW

michaeleisel

func f() {
        let max = range.product(range).maxWith { (topRow, leftCol) -> (Int) in
            return (0..<3).product(0..<3).map { rowOffset, colOffset in // (rowOffset: Int, colOffset: Int) -> (Int) in
                return scores[topRow + rowOffset][leftCol + colOffset]
            }.reduce(0, +)
        }
}

michaeleisel

postfix operator ~
public postfix func ~<T>(lhs: (T, T)) -> [T] {
    return [lhs.0, lhs.1]
}

func go() {
  (0, 0)~ // '~' is not a postfix unary operator
}

michaeleisel

public extension Sequence {
    public func mySequence() -> AnySequence<Element> {
        return AnySequence { () -> AnyIterator<Element> in
            var iterator = self.makeIterator()
            return AnyIterator {
                return iterator.next()
            }
        }
    }
}

michaeleisel

    func checkIteratorState<T: Sequence, T.Element: Equatable>(sequence: T) {
        var iterator1 = sequence.makeIterator()
        var iterator2 = sequence.makeIterator()
        // test equality
    }

michaeleisel

extension Equatable where Self: Sequence {
    public static func == (lhs: Sequence<Element>, rhs: Sequence<Element>) -> Bool {
        return elementsEqual(lhs, rhs)
    }
}

michaeleisel

struct ReductionsSequence<Base: Sequence, T>: Sequence, IteratorProtocol {
    typealias Element = T

    private var iterator: AnyIterator<Base.Element>
    private var current: T
    private let reducer: (T, Base.Element) -> T

    init(sequence: Base, initialValue: T, reducer: @escaping (T, Base.Element) -> T) {
        iterator = AnyIterator(sequence.makeIterator())
        self.reducer = reducer