From 6fccc9aa7c819947bbc3d663db71f3604c7cf7e6 Mon Sep 17 00:00:00 2001 From: Sergey Solodyagin Date: Tue, 2 Apr 2024 15:46:55 +0300 Subject: [PATCH] rename --- README.md | 10 ++++------ go.mod | 2 +- 2 files changed, 5 insertions(+), 7 deletions(-) diff --git a/README.md b/README.md index 31b886e..413b2b3 100644 --- a/README.md +++ b/README.md @@ -1,11 +1,10 @@ -fastxor ------ +## fastxor [![GoDoc](https://godoc.org/github.com/lukechampine/fastxor?status.svg)](https://godoc.org/github.com/lukechampine/fastxor) [![Go Report Card](http://goreportcard.com/badge/github.com/lukechampine/fastxor)](https://goreportcard.com/report/github.com/lukechampine/fastxor) ``` -go get github.com/lukechampine/fastxor +go get git.company.lan/gopkg/fastxor ``` Is there a gaping hole in your heart that can only be filled by xor'ing byte @@ -13,12 +12,11 @@ streams at 60GB/s? If so, you've come to the right place. `fastxor` is exactly what it sounds like: a package that xors bytes as fast as your CPU is capable of. For best results, use a CPU that supports a SIMD -instruction set like SSE or AVX. On other architectures, performance is much +instruction set like SSE or AVX. On other architectures, performance is much less impressive, but still faster than a naive byte-wise loop. I wrote this package to try my hand at writing Go assembly, so please scrutinize -my code and let me know how I could make it faster or cleaner! - +my code and let me know how I could make it faster or cleaner! # Benchmarks diff --git a/go.mod b/go.mod index 12304f4..ef54223 100644 --- a/go.mod +++ b/go.mod @@ -1,4 +1,4 @@ -module github.com/andoma-go/fastxor +module git.company.lan/gopkg/fastxor go 1.20