1
1
package object
2
2
3
3
import (
4
- "os"
5
4
"sort"
6
5
7
6
"srcd.works/go-git.v4/plumbing"
7
+ "srcd.works/go-git.v4/plumbing/filemode"
8
8
"srcd.works/go-git.v4/plumbing/storer"
9
9
"srcd.works/go-git.v4/storage/filesystem"
10
10
"srcd.works/go-git.v4/utils/merkletrie"
@@ -51,7 +51,7 @@ func newPath(nn ...noder.Noder) noder.Path { return noder.Path(nn) }
51
51
52
52
func (s * ChangeAdaptorSuite ) TestTreeNoderHashHasMode (c * C ) {
53
53
hash := plumbing .NewHash ("aaaa" )
54
- mode := FileMode
54
+ mode := filemode . Regular
55
55
56
56
treeNoder := & treeNoder {
57
57
hash : hash ,
@@ -64,8 +64,8 @@ func (s *ChangeAdaptorSuite) TestTreeNoderHashHasMode(c *C) {
64
64
0x00 , 0x00 , 0x00 , 0x00 ,
65
65
0x00 , 0x00 , 0x00 , 0x00 ,
66
66
0x00 , 0x00 , 0x00 , 0x00 ,
67
- 0xa4 , 0x81 , 0x00 , 0x00 , // object.FileMode in little endian
68
67
}
68
+ expected = append (expected , filemode .Regular .Bytes ()... )
69
69
70
70
c .Assert (treeNoder .Hash (), DeepEquals , expected )
71
71
}
@@ -74,7 +74,7 @@ func (s *ChangeAdaptorSuite) TestNewChangeInsert(c *C) {
74
74
tree := & Tree {}
75
75
entry := TreeEntry {
76
76
Name : "name" ,
77
- Mode : os .FileMode (42 ),
77
+ Mode : filemode .FileMode (42 ),
78
78
Hash : plumbing .NewHash ("aaaaa" ),
79
79
}
80
80
path := newPath (newNoder (tree , entry ))
@@ -100,7 +100,7 @@ func (s *ChangeAdaptorSuite) TestNewChangeDelete(c *C) {
100
100
tree := & Tree {}
101
101
entry := TreeEntry {
102
102
Name : "name" ,
103
- Mode : os .FileMode (42 ),
103
+ Mode : filemode .FileMode (42 ),
104
104
Hash : plumbing .NewHash ("aaaaa" ),
105
105
}
106
106
path := newPath (newNoder (tree , entry ))
@@ -126,7 +126,7 @@ func (s *ChangeAdaptorSuite) TestNewChangeModify(c *C) {
126
126
treeA := & Tree {}
127
127
entryA := TreeEntry {
128
128
Name : "name" ,
129
- Mode : os .FileMode (42 ),
129
+ Mode : filemode .FileMode (42 ),
130
130
Hash : plumbing .NewHash ("aaaaa" ),
131
131
}
132
132
pathA := newPath (newNoder (treeA , entryA ))
@@ -136,7 +136,7 @@ func (s *ChangeAdaptorSuite) TestNewChangeModify(c *C) {
136
136
treeB := & Tree {}
137
137
entryB := TreeEntry {
138
138
Name : "name" ,
139
- Mode : os .FileMode (42 ),
139
+ Mode : filemode .FileMode (42 ),
140
140
Hash : plumbing .NewHash ("bbbb" ),
141
141
}
142
142
pathB := newPath (newNoder (treeB , entryB ))
@@ -295,7 +295,7 @@ func (s *ChangeAdaptorSuite) TestChangeEntryFromSortPath(c *C) {
295
295
tree := & Tree {}
296
296
entry := TreeEntry {
297
297
Name : "name" ,
298
- Mode : os .FileMode (42 ),
298
+ Mode : filemode .FileMode (42 ),
299
299
Hash : plumbing .NewHash ("aaaaa" ),
300
300
}
301
301
path := newPath (newNoder (tree , entry ))
@@ -312,14 +312,14 @@ func (s *ChangeAdaptorSuite) TestChangeEntryFromLongPath(c *C) {
312
312
treeA := & Tree {}
313
313
entryA := TreeEntry {
314
314
Name : "nameA" ,
315
- Mode : os .FileMode (42 ),
315
+ Mode : filemode .FileMode (42 ),
316
316
Hash : plumbing .NewHash ("aaaa" ),
317
317
}
318
318
319
319
treeB := & Tree {}
320
320
entryB := TreeEntry {
321
321
Name : "nameB" ,
322
- Mode : os .FileMode (24 ),
322
+ Mode : filemode .FileMode (24 ),
323
323
Hash : plumbing .NewHash ("bbbb" ),
324
324
}
325
325
0 commit comments