From 12f1aea38d6f9dd9748a95b2d9ea813ae16277a7 Mon Sep 17 00:00:00 2001
From: obscuren <geffobscura@gmail.com>
Date: Thu, 20 Nov 2014 18:11:31 +0100
Subject: Fixed iterator for short nodes.

In some cases the iterator didn't properly return the correct key
because it didn't append fields to the reverse lookup.
---
 ptrie/trie_test.go | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

(limited to 'ptrie/trie_test.go')

diff --git a/ptrie/trie_test.go b/ptrie/trie_test.go
index dfc89709d..ba50f50a5 100644
--- a/ptrie/trie_test.go
+++ b/ptrie/trie_test.go
@@ -122,7 +122,6 @@ func TestEmptyValues(t *testing.T) {
 }
 
 func TestReplication(t *testing.T) {
-	t.Skip()
 	trie := NewEmpty()
 	vals := []struct{ k, v string }{
 		{"do", "verb"},
@@ -138,7 +137,7 @@ func TestReplication(t *testing.T) {
 	for _, val := range vals {
 		trie.UpdateString(val.k, val.v)
 	}
-	trie.Hash()
+	trie.Commit()
 
 	trie2 := New(trie.roothash, trie.cache.backend)
 	if string(trie2.GetString("horse")) != "stallion" {
-- 
cgit