bmitchelmore

extension Data {
    private static let hexDigits = Array("0123456789abcdef".utf8)
    var hex: String {
        var chars = [Unicode.UTF8.CodeUnit]()
        chars.reserveCapacity(2 * count)
        for byte in self {
            chars.append(Self.hexDigits[Int(byte >> 4)]) // byte / 16
            chars.append(Self.hexDigits[Int(byte & 15)]) // byte % 16
        }
        return String(decoding: chars, as: UTF8.self)

bmitchelmore

Keybase proof

I hereby claim:

• I am bmitchelmore on github.
• I am bmitchelmore (https://keybase.io/bmitchelmore) on keybase.
• I have a public key ASCfQyU4tXEf60pJOZb0z0FMuc1T9zOFMnLhS4q8vGqcvwo

To claim this, I am signing this object:

bmitchelmore

struct OrderedSet<T: Hashable> {
    private class Link {
        var previous: Link?
        var next: Link?
        var value: T
        init(value: T) {
            self.value = value
        }
    }
    

bmitchelmore

- (BOOL)textField:(UITextField *)textField shouldChangeCharactersInRange:(NSRange)range replacementString:(NSString *)string {
  NSInteger result = textField.text.length;
  result -= range.length;
  result += string.length;
  return result <= MAX_LENGTH;
}

bmitchelmore

var nums = [35, 25, 53, 3, 102, 203, 230, 1005];

// Figure out the number of binary digits we're dealing with
var k = Math.max.apply(null, nums.map(function(i) {
    return Math.ceil(Math.log(i)/Math.log(2));
}));

for (var d = 0; d < k; ++d) {
    for (var i = 0, p = 0, b = 1 << d, n = nums.length; i < n; ++i) {
        var o = nums[i];