Chore: Remove one allocate per hash by using generics (algorand#5829)

PhearNet · Nov 17, 2023 · b359a5f · b359a5f
1 parent 7361679
commit b359a5f
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 3 deletions.
diff --git a/hashes_test.go b/hashes_test.go
@@ -53,7 +53,6 @@ func TestHashSum(t *testing.T) {
 
 	dgst := HashObj(TestingHashable{})
 	a.Equal(GenericHashObj(h, TestingHashable{}), dgst[:])
-
 }
 
 func TestEmptyHash(t *testing.T) {

diff --git a/util.go b/util.go
@@ -35,7 +35,7 @@ type Hashable interface {
 }
 
 // HashRep appends the correct hashid before the message to be hashed.
-func HashRep(h Hashable) []byte {
+func HashRep[H Hashable](h H) []byte {
 	hashid, data := h.ToBeHashed()
 	return append([]byte(hashid), data...)
 }
@@ -86,7 +86,7 @@ func Hash(data []byte) Digest {
 }
 
 // HashObj computes a hash of a Hashable object and its type
-func HashObj(h Hashable) Digest {
+func HashObj[H Hashable](h H) Digest {
 	return Hash(HashRep(h))
 }
-Original file line number
+Diff line change
@@ Expand Up / @@ -53,7 +53,6 @@ func TestHashSum(t *testing.T) { @@
     	dgst := HashObj(TestingHashable{})
     	a.Equal(GenericHashObj(h, TestingHashable{}), dgst[:])
     }
     func TestEmptyHash(t *testing.T) {
@@ Expand Down @@