fix yarn doc warnings

Author: folkvir

src/cell.ts

@@ -7,8 +7,10 @@ export interface ExportedCell {
 }
 
 /**
- * A cell is an internal datastructure of an {@link InvertibleBloomFilter}.
- * It is composed of an idSum (the XOR of all element inserted in that cell), a hashSum (the XOR of all hashed element in that cell) and a counter (the number of elements inserted in that cell).
+ * @internal
+ * @private
+ * @see InvertibleBloomFilter
+ * A cell is composed of an idSum (the XOR of all element inserted in that cell), a hashSum (the XOR of all hashed element in that cell) and a counter (the number of elements inserted in that cell).
  * @author Arnaud Grall
  * @author Thomas Minier
  */

src/count-min-sketch.ts

@@ -122,7 +122,7 @@ export default class CountMinSketch extends BaseFilter implements CountingFilter
 
     /**
      * Check if another Count Min Sketch is equal to this one
-     * @param  filter - The filter to compare to this one
+     * @param  other - The filter to compare to this one
      * @return True if they are equal, false otherwise
      */
     public equals(other: CountMinSketch): boolean {

src/counting-bloom-filter.ts

@@ -174,7 +174,7 @@ export default class CountingBloomFilter
 
     /**
      * Check if another Counting Bloom Filter is equal to this one
-     * @param  filter - The filter to compare to this one
+     * @param  other - The filter to compare to this one
      * @return True if they are equal, false otherwise
      */
     public equals(other: CountingBloomFilter): boolean {

src/invertible-bloom-filter.ts

@@ -139,7 +139,7 @@ export default class InvertibleBloomFilter extends BaseFilter implements Writabl
 
     /**
      * Substract the filter with another {@link InvertibleBloomFilter}, and returns the resulting filter.
-     * @param  remote - The filter to substract with
+     * @param  iblt - The filter to substract with
      * @return A new InvertibleBloomFilter which is the XOR of the local and remote one
      */
     public substract(iblt: InvertibleBloomFilter): InvertibleBloomFilter {

src/min-hash.ts

@@ -38,7 +38,7 @@ export interface ExportedMinHash {
  * MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are.
  * It is able to estimate the Jaccard similarity between two large sets of numbers using random hashing.
  *
- * **WARNING**: Only the MinHash produced by the same {@link MinHashFactory} can be compared between them.
+ * **WARNING**: Only the MinHash produced by the same @see MinHashFactory can be compared between them.
  *
  * @see "On the resemblance and containment of documents", by Andrei Z. Broder, in Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997.
  * @author Thomas Minier

src/partitioned-bloom-filter.ts

@@ -154,7 +154,7 @@ export default class PartitionedBloomFilter
 
     /**
      * Check if another Partitioned Bloom Filter is equal to this one
-     * @param  filter - The filter to compare to this one
+     * @param  other - The filter to compare to this one
      * @return True if they are equal, false otherwise
      */
     public equals(other: PartitionedBloomFilter): boolean {

src/utils.ts

@@ -85,7 +85,7 @@ export function xorUint8Array(a: Uint8Array, b: Uint8Array): Uint8Array {
  * @author Arnaud Grall
  */
 export function getDefaultSeed(): SeedType {
-    return BigInt(0x1234567890)
+    return BigInt('0x1234567890')
 }
 
 /**