Fix typos in comments

src/com/frostwire/jlibtorrent/SessionSettings.java

@@ -1708,7 +1708,7 @@ public void setMaxPausedPeerlistSize(int value) {
      * complete and needs to be verified against the piece hash. This happens
      * if some blocks were flushed to the disk out of order. Everything that
      * is flushed in order is hashed as it goes along. Optimizing for speed
-     * will allocate space to fit all the the remaingin, unhashed, part of
+     * will allocate space to fit all the remaining, unhashed, part of
      * the piece, reads the data into it in a single call and hashes it. This
      * is the default. If ``optimizing_hashing_for_speed`` is false, a single
      * block will be allocated (16 kB), and the unhashed parts of the piece
@@ -1726,7 +1726,7 @@ public boolean optimizeHashingForSpeed() {
      * complete and needs to be verified against the piece hash. This happens
      * if some blocks were flushed to the disk out of order. Everything that
      * is flushed in order is hashed as it goes along. Optimizing for speed
-     * will allocate space to fit all the the remaingin, unhashed, part of
+     * will allocate space to fit all the remaining, unhashed, part of
      * the piece, reads the data into it in a single call and hashes it. This
      * is the default. If ``optimizing_hashing_for_speed`` is false, a single
      * block will be allocated (16 kB), and the unhashed parts of the piece
@@ -2585,7 +2585,7 @@ public void setMaxMetadataSize(int value) {
     // second may be limited to below the ``connection_speed``, in case we're
     // close to bump up against the limit of number of connections. The
     // intention of this setting is to more evenly distribute our connection
-    // attempts over time, instead of attempting to connect in in batches, and
+    // attempts over time, instead of attempting to connect in batches, and
     // timing them out in batches.
     //bool smooth_connects;
 

src/com/frostwire/jlibtorrent/SparseArray.java

@@ -35,7 +35,7 @@
  * keys: instead of compacting its array immediately, it leaves the removed entry marked
  * as deleted.  The entry can then be re-used for the same key, or compacted later in
  * a single garbage collection step of all removed entries.  This garbage collection will
- * need to be performed at any time the array needs to be grown or the the map size or
+ * need to be performed at any time the array needs to be grown or the map size or
  * entry values are retrieved.</p>
  *
  * <p>It is possible to iterate over the items in this container using

src/com/frostwire/jlibtorrent/TorrentHandle.java

@@ -769,7 +769,7 @@ public Priority[] getFilePriorities() {
     }
 
     /**
-     * This function fills in the supplied vector with the the number of
+     * This function fills in the supplied vector with the number of
      * bytes downloaded of each file in this torrent. The progress values are
      * ordered the same as the files in the torrent_info. This operation is
      * not very cheap. Its complexity is *O(n + mj)*. Where *n* is the number
@@ -795,7 +795,7 @@ public long[] getFileProgress(FileProgressFlags flags) {
     }
 
     /**
-     * This function fills in the supplied vector with the the number of
+     * This function fills in the supplied vector with the number of
      * bytes downloaded of each file in this torrent. The progress values are
      * ordered the same as the files in the torrent_info. This operation is
      * not very cheap. Its complexity is *O(n + mj)*. Where *n* is the number