From 35b0c1007fcbd1835bd4683630fa5e46b6e88d1f Mon Sep 17 00:00:00 2001 From: Grzegorz Piwowarek Date: Thu, 10 Oct 2024 17:20:07 +0200 Subject: [PATCH] Replace '' with '' tags in JavaDocs (#2889) --- vavr/src/main/java/io/vavr/collection/IndexedSeq.java | 4 ++-- vavr/src/main/java/io/vavr/collection/LinearSeq.java | 4 ++-- vavr/src/main/java/io/vavr/collection/Seq.java | 4 ++-- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/vavr/src/main/java/io/vavr/collection/IndexedSeq.java b/vavr/src/main/java/io/vavr/collection/IndexedSeq.java index f48c6b059..cee62860c 100644 --- a/vavr/src/main/java/io/vavr/collection/IndexedSeq.java +++ b/vavr/src/main/java/io/vavr/collection/IndexedSeq.java @@ -452,7 +452,7 @@ default boolean startsWith(Iterable that, int offset) { * * @param element the element to find * @return the index of the search element, if it is contained in the sequence; - * otherwise, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 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, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 0 if and only if the element is found. diff --git a/vavr/src/main/java/io/vavr/collection/LinearSeq.java b/vavr/src/main/java/io/vavr/collection/LinearSeq.java index 65206a292..2a9fe255f 100644 --- a/vavr/src/main/java/io/vavr/collection/LinearSeq.java +++ b/vavr/src/main/java/io/vavr/collection/LinearSeq.java @@ -391,7 +391,7 @@ default int segmentLength(Predicate predicate, int from) { * * @param element the element to find * @return the index of the search element, if it is contained in the sequence; - * otherwise, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 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, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 0 if and only if the element is found. diff --git a/vavr/src/main/java/io/vavr/collection/Seq.java b/vavr/src/main/java/io/vavr/collection/Seq.java index 70b7a76aa..4b51dae1a 100644 --- a/vavr/src/main/java/io/vavr/collection/Seq.java +++ b/vavr/src/main/java/io/vavr/collection/Seq.java @@ -1093,7 +1093,7 @@ default boolean startsWith(Iterable that, int offset) { * * @param element the element to find * @return the index of the search element, if it is contained in the sequence; - * otherwise, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 0 if and only if the element is found. @@ -1110,7 +1110,7 @@ default boolean startsWith(Iterable 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, (-(insertion point) - 1). The + * otherwise, (-(insertion point) - 1). The * insertion point 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 >= 0 if and only if the element is found.