This file contains hidden or 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
| // !$*UTF8*$! | |
| { | |
| archiveVersion = 1; | |
| classes = { | |
| }; | |
| objectVersion = 46; | |
| objects = { | |
| /* Begin PBXBuildFile section */ | |
| 80EACA902134D2AC0012AD77 /* NotificationService.swift in Sources */ = {isa = PBXBuildFile; fileRef = 80EACA8F2134D2AC0012AD77 /* NotificationService.swift */; }; |
This file contains hidden or 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
| ActiveRecord cheat sheet / EXAMPLES | |
| INSTALL | |
| ======= | |
| $ gem install activerecord | |
| in GEMFILE: gem ‘activerecord’ | |
| REQUIRE | |
| ======= | |
| require ‘active_record’ |
This file contains hidden or 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
| <!DOCTYPE HTML> | |
| <html> | |
| <head> | |
| <style> | |
| body { | |
| margin: 0px; | |
| padding: 0px; | |
| } | |
| </style> | |
| </head> |
This file contains hidden or 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
| var bases = require('bases'); | |
| var crypto = require('crypto'); | |
| // Returns a base-62 (alphanumeric only) string of the given length: | |
| function randomStr(length) { | |
| // We generate a random number in a space at least as big as 62^length, | |
| // and if it's too big, we just retry. This is still statistically O(1) | |
| // since repeated probabilities less than one converge to zero. Hat-tip to | |
| // a Google interview for teaching me this technique! ;) |