I have developed applications for iOS since iOS 3, as a hobby, in academia and professionally. During my tenure as an engineering lead, I had the pleasure to help teams succeed, building a strong engineering culture along the way.
My list of competences include:
As a side effect of SE-0110 tuple unsplating was removed from the language.
While this claims to make tooling like the type checker faster, it deals quite a blow to expressivity.
Filterting dictionaries is just an example and maybe not the best. However I hope the point gets across. Let's compare to other languages.
Examples of pattern matching in closure parameters:
| public extension FileManager { | |
| /// This method calculates the accumulated size of a directory on the volume in bytes. | |
| /// | |
| /// As there's no simple way to get this information from the file system it has to crawl the entire hierarchy, | |
| /// accumulating the overall sum on the way. The resulting value is roughly equivalent with the amount of bytes | |
| /// that would become available on the volume if the directory would be deleted. | |
| /// | |
| /// - note: There are a couple of oddities that are not taken into account (like symbolic links, meta data of | |
| /// directories, hard links, ...). |
| # @example | |
| # | |
| # rake hlint:install[2.0.9] | |
| namespace :hlint do | |
| desc "Download and install hlint" | |
| task :install, :version do |task, args| | |
| REPO = "https://github.com/ndmitchell/hlint" | |
| VERSION = args[:version].to_s |
| import Foundation | |
| public struct Bar: Codable { | |
| let value: String | |
| public init(bar: Bar) { | |
| self.value = bar.value | |
| } |
| import Foundation | |
| public struct CaseInsensitiveString: Codable { | |
| let value: String | |
| public init(caseInsensitiveString: CaseInsensitiveString) { | |
| self.value = caseInsensitiveString.value | |
| } |
| @dynamicMemberLookup | |
| struct Color { | |
| subscript(dynamicMember member: String) -> UIColor { | |
| guard let intValue = Int(member.dropFirst().dropFirst(), radix: 16) else { return .black } | |
| return UIColor(hexValue: intValue) | |
| } | |
| public struct PrefixTrie<Key: Collection, Value> where Key.Element: Hashable { | |
| internal class Node { | |
| var value: Value? | |
| var step: Key.Element? | |
| var next = [Key.Element: Node]() | |
| var parent: Node? | |
| init(value: Value?, step: Key.Element? = nil, parent: Node? = nil) { | |
| self.value = value | |
| self.parent = parent |
$ git credential-osxkeychain erase
host=github.com
protocol=https
> [Press Return]
| extension UUID { | |
| init(numbers: (UInt64, UInt64)) { | |
| var firstNumber = numbers.0 | |
| var secondNumber = numbers.1 | |
| let firstData = Data(bytes: &firstNumber, count: MemoryLayout<UInt64>.size) | |
| let secondData = Data(bytes: &secondNumber, count: MemoryLayout<UInt64>.size) | |
| let bytes = [UInt8](firstData) + [UInt8](secondData) | |
| let tuple: uuid_t = (bytes[0], bytes[1], bytes[2], bytes[3], |