Benchparse output undo skips

Author: ZenGround0

benchparse/main.go

@@ -13,8 +13,8 @@ import (
 )
 
 func main() {
-	if len(os.Args) < 2 {
-		panic("need to specify input file")
+	if len(os.Args) < 3 {
+		panic("need to specify input and output file")
 	}
 	fIn, err := os.Open(os.Args[1])
 	if err != nil {
@@ -35,7 +35,7 @@ func main() {
 		panic(err)
 	}
 
-	fOut, err := os.Create("out.csv")
+	fOut, err := os.Create(os.Args[2])
 	if err != nil {
 		panic(err)
 	}

hamt_test.go

@@ -145,13 +145,11 @@ var shortIdentityHash = func(k []byte) []byte {
 }
 
 func TestCanonicalStructure(t *testing.T) {
-	t.Skip()
 	addAndRemoveKeys(t, []string{"K"}, []string{"B"}, UseHashFunction(identityHash))
 	addAndRemoveKeys(t, []string{"K0", "K1", "KAA1", "KAA2", "KAA3"}, []string{"KAA4"})
 }
 
 func TestCanonicalStructureAlternateBitWidth(t *testing.T) {
-	t.Skip()
 	addAndRemoveKeys(t, []string{"K"}, []string{"B"}, UseTreeBitWidth(7), UseHashFunction(identityHash))
 	addAndRemoveKeys(t, []string{"K0", "K1", "KAA1", "KAA2", "KAA3"}, []string{"KAA4"}, UseTreeBitWidth(7), UseHashFunction(identityHash))
 	addAndRemoveKeys(t, []string{"K"}, []string{"B"}, UseTreeBitWidth(6), UseHashFunction(identityHash))
@@ -161,7 +159,6 @@ func TestCanonicalStructureAlternateBitWidth(t *testing.T) {
 }
 
 func TestOverflow(t *testing.T) {
-	t.Skip()
 	keys := make([]string, 4)
 	for i := range keys {
 		keys[i] = strings.Repeat("A", 32) + fmt.Sprintf("%d", i)
@@ -193,7 +190,6 @@ func TestOverflow(t *testing.T) {
 }
 
 func TestFillAndCollapse(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 	root := NewNode(cs, UseTreeBitWidth(8), UseHashFunction(identityHash))
@@ -525,7 +521,6 @@ func statsrec(n *Node, st *hamtStats) {
 }
 
 func TestHash(t *testing.T) {
-	t.Skip()
 	h1 := defaultHashFunction([]byte("abcd"))
 	h2 := defaultHashFunction([]byte("abce"))
 	if h1[0] == h2[0] && h1[1] == h2[1] && h1[3] == h2[3] {
@@ -534,12 +529,10 @@ func TestHash(t *testing.T) {
 }
 
 func TestBasic(t *testing.T) {
-	t.Skip()
 	testBasic(t)
 }
 
 func TestSha256(t *testing.T) {
-	t.Skip()
 	testBasic(t, UseHashFunction(func(in []byte) []byte {
 		out := sha256.Sum256(in)
 		return out[:]
@@ -586,7 +579,6 @@ func testBasic(t *testing.T, options ...Option) {
 }
 
 func TestDelete(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 	begn := NewNode(cs)
@@ -626,7 +618,6 @@ func TestDelete(t *testing.T) {
 }
 
 func TestSetGet(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	vals := make(map[string][]byte)
 	var keys []string
@@ -750,7 +741,6 @@ func nodesEqual(t *testing.T, store cbor.IpldStore, n1, n2 *Node) bool {
 }
 
 func TestReloadEmpty(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 
@@ -771,7 +761,6 @@ func TestReloadEmpty(t *testing.T) {
 }
 
 func TestCopy(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 
@@ -796,7 +785,6 @@ func TestCopy(t *testing.T) {
 }
 
 func TestCopyCopiesNilSlices(t *testing.T) {
-	t.Skip()
 	cs := cbor.NewCborStore(newMockBlocks())
 
 	n := NewNode(cs)
@@ -815,7 +803,6 @@ func TestCopyCopiesNilSlices(t *testing.T) {
 }
 
 func TestCopyWithoutFlush(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 
@@ -853,7 +840,6 @@ func TestCopyWithoutFlush(t *testing.T) {
 }
 
 func TestValueLinking(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 
@@ -895,7 +881,6 @@ func TestValueLinking(t *testing.T) {
 }
 
 func TestSetNilValues(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	cs := cbor.NewCborStore(newMockBlocks())
 
@@ -945,7 +930,6 @@ func TestSetNilValues(t *testing.T) {
 // nodes to test whether the implementation will reject malformed encoded nodes
 // on load.
 func TestMalformedHamt(t *testing.T) {
-	t.Skip()
 	ctx := context.Background()
 	blocks := newMockBlocks()
 	cs := cbor.NewCborStore(blocks)