Becca Royal-Gordon beccadax
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Sequence of 1, 2, 4 ... 64 | |
| induce(from: 1, to: 128, by: { $0 * 2 }) | |
| induce(from: 1, to: 128, by: { $0 *= 2 }) | |
| // Sequence of 1, 2, 4 ... 128 | |
| induce(from: 1, through: 128, by: { $0 * 2 }) | |
| induce(from: 1, through: 128, by: { $0 *= 2 }) | |
| // Sequence of 1, 2, 4 ... with arbitrary, calculated bound | |
| import Darwin |
praeclarum
/ ArrayDiff.swift
Last active
January 8, 2021 06:10
A generic diffing operation that can calculate the minimal steps needed to convert one array to another. It can be used to generate standard diffs, or it can be used more creatively to calculate minimal UI updates.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // | |
| // ArrayDiff.swift | |
| // | |
| // Created by Frank A. Krueger on 6/30/15. | |
| // Copyright © 2015 Krueger Systems, Inc. All rights reserved. | |
| // License: MIT http://opensource.org/licenses/MIT | |
| // | |
| import Foundation |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| require 'desk_api' | |
| require 'csv' | |
| # Create the CSV files | |
| cases = CSV.open('./cases.csv', 'wb') | |
| interactions = CSV.open('./interactions.csv', 'wb') | |
| # Add the headers to the CSV files | |
| cases << ['Case #', 'Subject', 'Description', 'Status'] | |
| interactions << ['Case #', 'Body', 'Created Date'] |