trilliwon

// Swift4
let image = UIImage(named: "sample")
let data = image?.pngData()
let data = image?.jpegData(compressionQuality: 0.9)
let uiImage: UIImage = UIImage(data: imageData)

// deprecated
// var imageData: Data = UIImagePNGRepresentation(image)

trilliwon

import Foundation
import UIKit

// Usage Examples
let shadowColor = Color.shadow.value
let shadowColorWithAlpha = Color.shadow.withAlpha(0.5)
let customColorWithAlpha = Color.custom(hexString: "#123edd", alpha: 0.25).value

enum Color {
    

trilliwon

import Foundation
import UIKit

// Usage Examples
let system12            = Font(.system, size: .standard(.h5)).instance
let robotoThin20        = Font(.installed(.RobotoThin), size: .standard(.h1)).instance
let robotoBlack14       = Font(.installed(.RobotoBlack), size: .standard(.h4)).instance
let helveticaLight13    = Font(.custom("Helvetica-Light"), size: .custom(13.0)).instance

struct Font {

trilliwon

import Foundation

func insertionSort(array: [Int]) -> [Int] {
	var array = array

	for index in 1..<array.count {
		let nextValue = array[index]
		var aux = index - 1

		while aux >= 0 && array[aux] > nextValue {

trilliwon

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
	<key>IDECodeSnippetCompletionPrefix</key>
	<string>trilliwon-screen-name</string>
	<key>IDECodeSnippetCompletionScopes</key>
	<array>
		<string>ClassImplementation</string>
	</array>

trilliwon

/* #Heap Sort

###Input :
- 첫 번째 라인에는 입력할 키의 갯수(1 ≤ N ≤ 100,000)와 정수 k를 입력합니다.(1 ≤ k ≤ 30)
- 다음 라인 부터 N개의 키를 입력 합니다.
 
###Output : 
- 첫 번째 라인은 힙에서 k개의 elements 감소하는 순서로 출력 합니다.
- 두 번째 라인은 힙에서 증가하는 순서로 k 개를 출력합니다.

trilliwon

import XCTest
@testable import Quicksort



class QuicksortTests: XCTestCase {
  
  //              RED
  //            /     \
  //       REFACTOR  GREEN

trilliwon

import Foundation


func quicksort<T: Comparable>(array: [T]) -> [T] {
  if array.count <= 1 { return array }
  let pivot: T = array[array.count/2]
  return quicksort(array: array.filter ({ $0 < pivot })) + array.filter ({ $0 == pivot }) + quicksort(array: array.filter ({ $0 > pivot }))
}

// http://www.slideshare.net/ssuserae280e/quicksort-in-swift

trilliwon

infix operator ???
infix operator ?->


// user.name ??? sendMessage()
// is euqual to 
// if let name = user.name {
//    sendMessage()
// }

trilliwon

public struct HashTable<Key: Hashable, Value> {
  fileprivate typealias Element = (key: Key, value: Value)
  fileprivate typealias Bucket = [Element]
  
  fileprivate var buckets: [Bucket]
  fileprivate(set) var count = 0
  
  public init(capacity: Int) {
    assert(capacity > 0)
    buckets = .init(repeating: [], count: capacity)