Commit 9567b4e

committed

Doc updates

1 parent e56ff3a commit 9567b4eCopy full SHA for 9567b4e

File tree

-6

lines changed

EntropyString.playground/Pages
- Secure Bytes.xcplaygroundpage
  - Contents.swift
- TLDR2.xcplaygroundpage
  - Contents.swift
EntropyString.podspec
README.md

-6

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`//:`
`8`	`8`	//: You may, of course, want feedback as to when or if `SecRandomCopyBytes` fails. `RandomString.entropy(of:using:secRand)` provides an additional `inout` parameter that acts as a flag should a `SecRandomCopyBtyes` call fail.
`9`	`9`	`//:`
`10`		-//: On Linux OSes, `EntropyString` always uses `arc4random_buf`. The `secRand` parameter in the `RandomString.entropy(of:using:secRand)` is ignored.
	`10`	+//: On Linux, `EntropyString` always uses `arc4random_buf`. The `secRand` parameter is ignored.
`11`	`11`	`//:`
`12`	`12`	`import EntropyString`
`13`	`13`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -11,7 +11,7 @@`
`11`	`11`	`//: - You need to a total of _N_ strings with a risk _1/n_ of repeat.`
`12`	`12`	`//: - The characters are arbitrary.`
`13`	`13`	//: - You need `EntropyString`.
`14`		`-//: ##### In a million strings, a 1 in a billion chance of a repeat (using 32 possible characters):`
	`14`	`+//: ##### Base 32 character string with a 1 in a million chance of a repeat a billion strings:`
`15`	`15`	`import EntropyString`
`16`	`16`
`17`	`17`	`let random = Random()`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`Pod::Spec.new do \|s\|`
`4`	`4`	`s.name = "EntropyString"`
`5`		`- s.version = "1.2.3"`
	`5`	`+ s.version = "2.0.0"`
`6`	`6`	`s.summary = "Efficiently generate cryptographically strong random strings of specified entropy from various character sets."`
`7`	`7`
`8`	`8`	`s.description = <<-DESC`

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,6 @@ Efficiently generate cryptographically strong random strings of specified entrop`
`47`	`47`
`48`	`48`	```ruby
`49`	`49`	`use_frameworks!`
`50`		`-`
`51`	`50`	`pod 'EntropyString', '~> 1.0.0'`
`52`	`51`	```
`53`	`52`
@@ -446,7 +445,7 @@ As described in [Efficiency](#Efficiency), `EntropyString` uses an underlying ar
`446`	`445`
`447`	`446`	You may, of course, want feedback as to when or if `SecRandomCopyBytes` fails. `RandomString.entropy(of:using:secRand)` provides an additional `inout` parameter that acts as a flag should a `SecRandomCopyBytes` call fail.
`448`	`447`
`449`		-On Linux OSes, `EntropyString` always uses `arc4random_buf`. The `secRand` parameter in the `RandomString.entropy(of:using:secRand)`is ignored.
	`448`	+On Linux OSes, `EntropyString` always uses `arc4random_buf`. The `secRand` parameter is ignored.
`450`	`449`
`451`	`450`
`452`	`451`	```swift
`@@ -521,7 +520,7 @@ Note the number of bytes needed is dependent on the number of characters in our`
`521`	`520`	`- The characters are arbitrary.`
`522`	`521`	- You need `EntropyString`.
`523`	`522`
`524`		`-##### In a million strings, a 1 in a billion chance of a repeat (using 32 possible characters):`
	`523`	`+##### Base 32 character string with a 1 in a million chance of a repeat a billion strings:`
`525`	`524`	```swift
`526`	`525`	`import EntropyString`
`527`	`526`

Comments

(0)