@@ -123,7 +123,7 @@ func TestTreeDecodingShaBoundary(t *testing.T) {
123123func TestTreeMergeReplaceElements (t * testing.T ) {
124124 e1 := & TreeEntry {Name : "a" , Filemode : 0100644 , Oid : []byte {0x1 }}
125125 e2 := & TreeEntry {Name : "b" , Filemode : 0100644 , Oid : []byte {0x2 }}
126- e3 := & TreeEntry {Name : "c" , Filemode : 0100644 , Oid : []byte {0x3 }}
126+ e3 := & TreeEntry {Name : "c" , Filemode : 0100755 , Oid : []byte {0x3 }}
127127
128128 e4 := & TreeEntry {Name : "b" , Filemode : 0100644 , Oid : []byte {0x4 }}
129129 e5 := & TreeEntry {Name : "c" , Filemode : 0100644 , Oid : []byte {0x5 }}
@@ -157,6 +157,7 @@ func TestMergeInsertElementsInSubtreeOrder(t *testing.T) {
157157 assert .True (t , bytes .Equal (t1 .Entries [1 ].Oid , []byte {0x2 }))
158158 assert .True (t , bytes .Equal (t1 .Entries [2 ].Oid , []byte {0x3 }))
159159
160+ require .Len (t , t2 .Entries , 4 )
160161 assert .True (t , bytes .Equal (t2 .Entries [0 ].Oid , []byte {0x4 }))
161162 assert .True (t , bytes .Equal (t2 .Entries [1 ].Oid , []byte {0x1 }))
162163 assert .True (t , bytes .Equal (t2 .Entries [2 ].Oid , []byte {0x2 }))
0 commit comments