impove description

Author: begmaroman

README.md

@@ -105,4 +105,40 @@ if ok := trie.Delete(key, newVal); !ok {
 	// data not deleted
 }
 
-```
+```
+    
+6. Get hash of the trie:
+    
+```go
+// initialize data
+key := []byte("key")
+val := []byte("val")
+
+// create new trie and try add key/value pair
+trie := mpt.NewEmptyTrie()
+if ok := trie.Put(key, val); !ok {
+	// key/pair not added
+}
+
+// some logic...
+
+// try to get hash of the trie
+h, err := trie.Hash()
+if err != nil {
+	// error while hash calculation
+}
+
+fmt.Println("hash of the trie:", h)
+
+```
+
+## Benchmarks
+
+|Name|Iterations|Time|Description|
+|----|----------|----|-----------|
+|BenchmarkTrie_Get/FromFullTrie100000-4|1000000|3463 ns/op|Get data from the tree which have 100000 key/value pairs|
+|BenchmarkTrie_Get/FromEmptyTrie-4|1000000|1262 ns/op|Get data from the empty tree|
+|BenchmarkTrie_Put/ToFullTrie100000-4|3000000|513 ns/op|Put data to the tree which have 100000 key/value pairs|
+|BenchmarkTrie_Put/ToEmptyTrie-4|3000000|524 ns/op|Put data to empty tree|
+|BenchmarkTrie_Update/FullTrie100000-4|1000000|3083 ns/op|Update data in the tree which have 100000 key/value pairs|
+|BenchmarkTrie_Update/EmptyTrie-4|2000000|674 ns/op|Update data in empty tree|

trie_test.go

@@ -339,9 +339,51 @@ func BenchmarkTrie_Put(b *testing.B) {
 
 	preparedExtTrie := mpt.NewTrie(node.NewExtensionNode(nil, nil))
 	preparedExtTrie.Put(key, val)
-	b.Run("ToPreparedBranchNodeEmptyTrie", func(b *testing.B) {
+	b.Run("ToPreparedExtensionNodeEmptyTrie", func(b *testing.B) {
 		for i := 0; i < b.N; i++ {
 			preparedExtTrie.Put(key, val)
 		}
 	})
 }
+
+func BenchmarkTrie_Update(b *testing.B) {
+	key, val := []byte("tolongwseb;kjnwkjlevnoknbkomnrwobnwotrh34y6onyo"), []byte("lwebniopwjgnipwuhgpv wrhtpovm rhiopwerhgpowuihnopwrntgmopkrtmvport uiwthgipurthg puti")
+
+	fullTrie := mpt.NewTrie(nil)
+	for j := 0; j < 100000; j++ {
+		tokenKey, tokenValue := make([]byte, 56), make([]byte, 556)
+		rand.Read(tokenKey)
+		rand.Read(tokenValue)
+		fullTrie.Put(tokenKey, tokenValue)
+	}
+	fullTrie.Put(key, val)
+	b.Run("FullTrie100000", func(b *testing.B) {
+		for i := 0; i < b.N; i++ {
+			fullTrie.Update(key, val)
+		}
+	})
+
+	emptyTrie := mpt.NewTrie(nil)
+	emptyTrie.Put(key, val)
+	b.Run("EmptyTrie", func(b *testing.B) {
+		for i := 0; i < b.N; i++ {
+			emptyTrie.Update(key, val)
+		}
+	})
+
+	preparedBranchTrie := mpt.NewTrie(node.NewBranchNode())
+	preparedBranchTrie.Put(key, val)
+	b.Run("PreparedBranchNodeEmptyTrie", func(b *testing.B) {
+		for i := 0; i < b.N; i++ {
+			preparedBranchTrie.Update(key, val)
+		}
+	})
+
+	preparedExtTrie := mpt.NewTrie(node.NewExtensionNode(nil, nil))
+	preparedExtTrie.Put(key, val)
+	b.Run("PreparedExtensionNodeEmptyTrie", func(b *testing.B) {
+		for i := 0; i < b.N; i++ {
+			preparedExtTrie.Update(key, val)
+		}
+	})
+}