aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDimitri Sokolyuk <demon@dim13.org>2016-07-10 15:47:42 +0200
committerDimitri Sokolyuk <demon@dim13.org>2016-07-10 15:47:42 +0200
commit1ac83d1ed053aa95f9ac86323d2e5d2f49d4677d (patch)
treebf4614d7c500daaadf7629d676425b5ea16a3bbe
parent717918d1d6f59b929e0afd69e3202963d5db8a52 (diff)
Rename FindFile
-rw-r--r--meta/info.go6
-rw-r--r--meta/torrent_test.go2
2 files changed, 4 insertions, 4 deletions
diff --git a/meta/info.go b/meta/info.go
index 6f38388..b9e1f5d 100644
--- a/meta/info.go
+++ b/meta/info.go
@@ -82,10 +82,10 @@ func (i Info) Offset(piece int) int64 {
return int64(piece) * int64(i.PieceLength)
}
-// FindFile looks up first file # corresponding to offset into it
+// findFirstFile looks up first file # corresponding to offset into it
// If piece is bigger then file, next file(s) with offset 0 shall be used
// to fit a piece into
-func (i Info) FindFile(off int64) (int, int64) {
+func (i Info) findFirstFile(off int64) (int, int64) {
for n, l := range i.Files {
if l.Length > off {
return n, off
@@ -114,7 +114,7 @@ func (i Info) WriteAt(b []byte, off int64) (n int, err error) {
// FIXME ReadAt ...
func (i Info) ReadAt(b []byte, off int64) (n int, err error) {
- n, offset := i.FindFile(off)
+ n, offset := i.findFirstFile(off)
var done int
for k := n; done < len(b); k++ {
fd, err := i.Open(k)
diff --git a/meta/torrent_test.go b/meta/torrent_test.go
index d393e45..75cccc9 100644
--- a/meta/torrent_test.go
+++ b/meta/torrent_test.go
@@ -33,7 +33,7 @@ func TestPieces(t *testing.T) {
t.Error(err)
}
for i, p := range tor.Info.GetPieces() {
- n, off := tor.Info.FindFile(p.Offset)
+ n, off := tor.Info.findFirstFile(p.Offset)
t.Log(i, n, off)
}
}