Fix javadoc

kala-base/src/main/java/kala/function/LargeIndexedConsumer.java

@@ -18,7 +18,7 @@
 /**
  * Represents an operation that accepts an index and an object-valued argument, and returns no result.
  *
- * <p>This is a functional interface whose functional method is {@link #accept(int, Object)}.
+ * <p>This is a functional interface whose functional method is {@link #accept(long, Object)}.
  *
  * @param <T> the type of the input to the operation
  * @author Glavo

kala-base/src/main/java/kala/function/LargeIndexedFunction.java

@@ -18,7 +18,7 @@
 /**
  * Represents a function that accepts an index and an object-valued argument, and produces a result.
  *
- * <p>This is a functional interface whose functional method is {@link #apply(int, Object)}.
+ * <p>This is a functional interface whose functional method is {@link #apply(long, Object)}.
  *
  * @param <T> the type of the input to the function
  * @param <R> the type of the result of the function

kala-collection/src/main/java/kala/collection/internal/tree/IndexedTree.java

@@ -124,8 +124,8 @@ public IndexedTree<V> minus(final long key) {
     /**
      * Changes every key k>=key to k+delta.
      *
-     * <p>This method will create an _invalid_ tree if delta<0 and the distance between the smallest
-     * k>=key in this and the largest j<key in this is |delta| or less.
+     * <p>This method will create an _invalid_ tree if delta&lt;0 and the distance between the smallest
+     * k&gt;=key in this and the largest j&lt;key in this is |delta| or less.
      *
      * <p>In other words, this method must not result in any change in the order of the keys in this,
      * since the tree structure is not being changed at all.
@@ -147,9 +147,9 @@ public IndexedTree<V> changeKeysAbove(final long key, final int delta) {
     }
 
     /**
-     * Changes every key k<key to k+delta.
+     * Changes every key k&lt;key to k+delta.
      *
-     * <p>This method will create an _invalid_ tree if delta>0 and the distance between the largest
+     * <p>This method will create an _invalid_ tree if delta&gt;0 and the distance between the largest
      * k<key in this and the smallest j>=key in this is delta or less.
      *
      * <p>In other words, this method must not result in any overlap or change in the order of the