cfilipov

/*:
## Phone Words

Generate a collection of words that can be represented by a given phone number. If a phone number contains the digits `1` or `0` then split up the phone number and find the words for each of the substrings as long as each substring has more than one digit. Non-keypad characters can be ignored. Optionally, filter out words so that only dictionary words are present in the result.

    ╔═════╦═════╦═════╗
    ║  1  ║  2  ║  3  ║
    ║     ║ abc ║ def ║
    ╠═════╬═════╬═════╣
    ║  4  ║  5  ║  6  ║

cfilipov

/*: 
## Phone Words

Generate a collection of words that can be represented by a given phone number. If a phone number contains the digits `1` or `0` then split up the phone number and find the words for each of the substrings as long as each substring has more than one digit. Non-keypad characters can be ignored. Optionally, filter out words so that only dictionary words are present in the result.

    ╔═════╦═════╦═════╗
    ║  1  ║  2  ║  3  ║
    ║     ║ abc ║ def ║
    ╠═════╬═════╬═════╣
    ║  4  ║  5  ║  6  ║

cfilipov

import Darwin

infix operator ** { associativity left precedence 151 }
func **(x: Int, n: Int) -> Int {
    if n == 0 { return 1 }
    var p = abs(x)
    for _ in 1..<n {
        p *= abs(x)
    }

cfilipov

Just playing around with ASCII/Unicode art

 ▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁
▕          ░|  ░░░░|  ░|  ░|          ░|          ░|         ░|        ░░▏
▕░░░|  ░░░░░|  ░░░░|  ░|  ░░░░░|  ░░░░░░░░░|  ░░░░░|  ░░░░░░░░|  |░░░░  ░▏
▕░░░|  ░░░░░|  ░░░░|  ░|  ░░░░░|  ░░░░░░░░░|  ░░░░░|  ░░░░░░░░|  |░░░░░  ▏
▕░░░|  ░░░░░|  ░░ ░|  ░|  ░░░░░|  ░░░░░░░░░|  ░░░░░|       ░░░|         ░▏
▕▒▒▒|  ▒▒▒▒▒|  ▒|  |  ▒|  ▒▒▒▒▒|  ▒▒▒▒▒▒▒▒▒|  ▒▒▒▒▒|  ▒▒▒▒▒▒▒▒|  ▒▒|  ▒▒▒▏
▕▓▓▓|  ▓▓▓▓▓|    ▓    ▓|  ▓▓▓▓▓|  ▓▓▓▓▓▓▓▓▓|  ▓▓▓▓▓|  ▓▓▓▓▓▓▓▓|  ▓▓▓|  ▓▓▏
▕███| █████| ████| █| █████| █████████| █████| █| ████| █▏ 

cfilipov

Insert Interval Problem in Swift

I was working on this problem and wondered how it would look in Swift.

Given an array of non-overlapping and sorted intervals, insert a new interval into the array and merge with existing intervals if necessary.

For example, given intervals:

  [(1,3), (6,9)]

>

cfilipov

import Foundation

protocol GraphTraversable {
    typealias GraphType : Hashable
    var nodes: [GraphType] { get }
}

enum Status {
    case Continue
    case Stop

cfilipov

// Inspired [copied] from: http://pastie.org/pastes/4855500#7-8,11-13

#import "WakeHelper.h"
#import <mach/mach.h>
#import <dlfcn.h>

#define SB_SERVICES_PATH "/System/Library/PrivateFrameworks/SpringBoardServices.framework/SpringBoardServices"

typedef mach_port_t sig_SBSSpringBoardServerPort();
typedef mach_error_t sig_SBSetApplicationNextWakeDate(mach_port_t sbsPort, double wakeTime, int flags);