Replace '<tt>' with '<code>' tags in JavaDocs (#2889)

Author: pivovarit

vavr/src/main/java/io/vavr/collection/IndexedSeq.java

@@ -452,7 +452,7 @@ default boolean startsWith(Iterable<? extends T> that, int offset) {
      *
      * @param element the element to find
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.
@@ -475,7 +475,7 @@ default int search(T element) {
      * @param element    the element to find
      * @param comparator the comparator by which this sequence is ordered
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.

vavr/src/main/java/io/vavr/collection/LinearSeq.java

@@ -391,7 +391,7 @@ default int segmentLength(Predicate<? super T> predicate, int from) {
      *
      * @param element the element to find
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.
@@ -411,7 +411,7 @@ default int search(T element) {
      * @param element    the element to find
      * @param comparator the comparator by which this sequence is ordered
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.

vavr/src/main/java/io/vavr/collection/Seq.java

@@ -1093,7 +1093,7 @@ default boolean startsWith(Iterable<? extends T> that, int offset) {
      *
      * @param element the element to find
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.
@@ -1110,7 +1110,7 @@ default boolean startsWith(Iterable<? extends T> that, int offset) {
      * @param element    the element to find
      * @param comparator the comparator by which this sequence is ordered
      * @return the index of the search element, if it is contained in the sequence;
-     * otherwise, <tt>(-(<i>insertion point</i>) - 1)</tt>. The
+     * otherwise, <code>(-(<i>insertion point</i>) - 1)</code>. The
      * <i>insertion point</i> is defined as the point at which the
      * element would be inserted into the sequence. Note that this guarantees that
      * the return value will be &gt;= 0 if and only if the element is found.