12a2a21083
full diff: https://github.com/google/uuid/compare/v1.1.2...v1.2.0 I did not switch to us the `uuid.NewString()` function; we are not currently using `uuid.New()`, probably because it can `panic` in case an invalid UUID is produced; in stead we are using `uuid.NewRandom()`, which is equivalent, but returns an error instead. Changes: - v1.2.0: Add NewString() This release introduces the NewString() function which is the equivalent of uuid.New().String(). - v1.1.5: Syntactic cleanup There are no code changes. A missing period was add to a godoc comment and the linter was told to not complain that the results of hash.Write() are ignored (the function cannot fail) - v1.1.4: Further error optimizations Do not allocate memory for errors (it is only one word) - v1.1.3: Optimize error reporting Optimize length of time it takes to discover an input is bad by no longer using fmt.Errorf, which is quite slow. It now uses a custom error type that formats the string when the Error method is called rather than when generating the error. Signed-off-by: Sebastiaan van Stijn <github@gone.nl>
52 lines
1.5 KiB
Go
52 lines
1.5 KiB
Go
// Copyright 2016 Google Inc. All rights reserved.
|
||
// Use of this source code is governed by a BSD-style
|
||
// license that can be found in the LICENSE file.
|
||
|
||
package uuid
|
||
|
||
import "io"
|
||
|
||
// New creates a new random UUID or panics. New is equivalent to
|
||
// the expression
|
||
//
|
||
// uuid.Must(uuid.NewRandom())
|
||
func New() UUID {
|
||
return Must(NewRandom())
|
||
}
|
||
|
||
// NewString creates a new random UUID and returns it as a string or panics.
|
||
// NewString is equivalent to the expression
|
||
//
|
||
// uuid.New().String()
|
||
func NewString() string {
|
||
return Must(NewRandom()).String()
|
||
}
|
||
|
||
// NewRandom returns a Random (Version 4) UUID.
|
||
//
|
||
// The strength of the UUIDs is based on the strength of the crypto/rand
|
||
// package.
|
||
//
|
||
// A note about uniqueness derived from the UUID Wikipedia entry:
|
||
//
|
||
// Randomly generated UUIDs have 122 random bits. One's annual risk of being
|
||
// hit by a meteorite is estimated to be one chance in 17 billion, that
|
||
// means the probability is about 0.00000000006 (6 × 10−11),
|
||
// equivalent to the odds of creating a few tens of trillions of UUIDs in a
|
||
// year and having one duplicate.
|
||
func NewRandom() (UUID, error) {
|
||
return NewRandomFromReader(rander)
|
||
}
|
||
|
||
// NewRandomFromReader returns a UUID based on bytes read from a given io.Reader.
|
||
func NewRandomFromReader(r io.Reader) (UUID, error) {
|
||
var uuid UUID
|
||
_, err := io.ReadFull(r, uuid[:])
|
||
if err != nil {
|
||
return Nil, err
|
||
}
|
||
uuid[6] = (uuid[6] & 0x0f) | 0x40 // Version 4
|
||
uuid[8] = (uuid[8] & 0x3f) | 0x80 // Variant is 10
|
||
return uuid, nil
|
||
}
|