-
Notifications
You must be signed in to change notification settings - Fork 1.5k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
128 additions
and
13 deletions.
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
package httprouter | ||
|
||
import ( | ||
"reflect" | ||
"unsafe" | ||
) | ||
|
||
// StringToBytes converts string to byte slice without a memory allocation. | ||
func StringToBytes(s string) (b []byte) { | ||
sh := *(*reflect.StringHeader)(unsafe.Pointer(&s)) | ||
bh := (*reflect.SliceHeader)(unsafe.Pointer(&b)) | ||
bh.Data, bh.Len, bh.Cap = sh.Data, sh.Len, sh.Len | ||
return b | ||
} | ||
|
||
// BytesToString converts byte slice to string without a memory allocation. | ||
func BytesToString(s []byte) string { | ||
return *(*string)(unsafe.Pointer(&s)) | ||
} |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,96 @@ | ||
package httprouter | ||
|
||
import ( | ||
"bytes" | ||
"math/rand" | ||
"testing" | ||
"time" | ||
) | ||
|
||
var testString = "Albert Einstein: Logic will get you from A to B. Imagination will take you everywhere." | ||
var testBytes = []byte(testString) | ||
|
||
func rawBytesToStr(b []byte) string { | ||
return string(b) | ||
} | ||
|
||
func rawStrToBytes(s string) []byte { | ||
return []byte(s) | ||
} | ||
|
||
// go test -v | ||
|
||
func TestBytesToString(t *testing.T) { | ||
data := make([]byte, 1024) | ||
for i := 0; i < 100; i++ { | ||
rand.Read(data) | ||
if rawBytesToStr(data) != BytesToString(data) { | ||
t.Fatal("don't match") | ||
} | ||
} | ||
} | ||
|
||
const letterBytes = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ" | ||
const ( | ||
letterIdxBits = 6 // 6 bits to represent a letter index | ||
letterIdxMask = 1<<letterIdxBits - 1 // All 1-bits, as many as letterIdxBits | ||
letterIdxMax = 63 / letterIdxBits // # of letter indices fitting in 63 bits | ||
) | ||
|
||
var src = rand.NewSource(time.Now().UnixNano()) | ||
|
||
func RandStringBytesMaskImprSrc(n int) string { | ||
b := make([]byte, n) | ||
// A src.Int63() generates 63 random bits, enough for letterIdxMax characters! | ||
for i, cache, remain := n-1, src.Int63(), letterIdxMax; i >= 0; { | ||
if remain == 0 { | ||
cache, remain = src.Int63(), letterIdxMax | ||
} | ||
if idx := int(cache & letterIdxMask); idx < len(letterBytes) { | ||
b[i] = letterBytes[idx] | ||
i-- | ||
} | ||
cache >>= letterIdxBits | ||
remain-- | ||
} | ||
return string(b) | ||
} | ||
|
||
func TestStringToBytes(t *testing.T) { | ||
for i := 0; i < 100; i++ { | ||
s := RandStringBytesMaskImprSrc(64) | ||
if !bytes.Equal(rawStrToBytes(s), StringToBytes(s)) { | ||
t.Fatal("don't match") | ||
} | ||
} | ||
} | ||
|
||
// go test -v -run=none -bench=^BenchmarkBytesConv -benchmem=true | ||
|
||
func BenchmarkBytesConvBytesToStrRaw(b *testing.B) { | ||
b.ResetTimer() | ||
for i := 0; i < b.N; i++ { | ||
rawBytesToStr(testBytes) | ||
} | ||
} | ||
|
||
func BenchmarkBytesConvBytesToStr(b *testing.B) { | ||
b.ResetTimer() | ||
for i := 0; i < b.N; i++ { | ||
BytesToString(testBytes) | ||
} | ||
} | ||
|
||
func BenchmarkBytesConvStrToBytesRaw(b *testing.B) { | ||
b.ResetTimer() | ||
for i := 0; i < b.N; i++ { | ||
rawStrToBytes(testString) | ||
} | ||
} | ||
|
||
func BenchmarkBytesConvStrToBytes(b *testing.B) { | ||
b.ResetTimer() | ||
for i := 0; i < b.N; i++ { | ||
StringToBytes(testString) | ||
} | ||
} |
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