All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.libtorrent4j.PiecesTracker Maven / Gradle / Ivy

The newest version!
package org.libtorrent4j;

import java.util.ArrayList;

/**
 * @author gubatron
 * @author aldenml
 */
public final class PiecesTracker {

    private final int numFiles;
    private final int numPieces;

    private final int[][] files;
    private final long[][] sizes;
    private final boolean[] complete;

    public PiecesTracker(TorrentInfo ti) {
        this.numFiles = ti.numFiles();
        this.numPieces = ti.numPieces();

        this.files = new int[numFiles][];
        this.sizes = new long[numFiles][];
        this.complete = new boolean[numPieces];

        FileStorage fs = ti.files();

        for (int fileIndex = 0; fileIndex < numFiles; fileIndex++) {
            long size = fs.fileSize(fileIndex);
            int firstPiece = ti.mapFile(fileIndex, 0, 1).piece();
            int lastPiece = ti.mapFile(fileIndex, size - 1, 1).piece();

            int numSlices = lastPiece - firstPiece + 1;
            files[fileIndex] = new int[numSlices];
            sizes[fileIndex] = new long[numSlices];

            for (int pieceIndex = firstPiece; pieceIndex <= lastPiece; pieceIndex++) {
                int index = pieceIndex - firstPiece;

                files[fileIndex][index] = pieceIndex;

                ArrayList slices = ti.mapBlock(pieceIndex, 0, ti.pieceSize(pieceIndex));
                for (FileSlice slice : slices) {
                    if (slice.fileIndex() == fileIndex) {
                        sizes[fileIndex][index] = slice.size();
                    }
                }
            }
        }
    }

    public int numFiles() {
        return numFiles;
    }

    public int numPieces() {
        return numPieces;
    }

    public boolean isComplete(int pieceIndex) {
        return complete[pieceIndex];
    }

    public void setComplete(int pieceIndex, boolean complete) {
        this.complete[pieceIndex] = complete;
    }

    public long getSequentialDownloadedBytes(int fileIndex) {
        int[] pieces = files[fileIndex];

        long downloaded = 0;

        for (int i = 0; i < pieces.length; i++) {
            int pieceIndex = pieces[i];

            if (complete[pieceIndex]) {
                downloaded += sizes[fileIndex][i];
            } else {
                break;
            }
        }

        return downloaded;
    }

    public int getSequentialDownloadedPieces(int fileIndex) {
        int[] pieces = files[fileIndex];

        int count = 0;

        for (int i = 0; i < pieces.length; i++) {
            int pieceIndex = pieces[i];

            if (complete[pieceIndex]) {
                count++;
            } else {
                break;
            }
        }

        return count;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy