@@ -88,7 +88,7 @@ type Predicate<T,U> = Nullary | Unary<U> | Binary<U> | Ternary<T,U>;
8888* var n = countIfs( x0, predicate0 );
8989* // returns 3
9090*/
91- declare function countIfs < T = unknown , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > ) : number ;
91+ declare function countIfs < T , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > ) : number ;
9292
9393/**
9494* Counts the number of elements in the input arrays which pass the tests implemented by the predicate functions.
@@ -114,7 +114,7 @@ declare function countIfs<T = unknown, U extends InputArray<T>>( x0: U, predicat
114114* var n = countIfs( x0, predicate0, x1, predicate1 );
115115* // returns 2
116116*/
117- declare function countIfs < T = unknown , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > ) : number ;
117+ declare function countIfs < T , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > ) : number ;
118118
119119/**
120120* Counts the number of elements in the input arrays which pass the tests implemented by the predicate functions.
@@ -147,7 +147,7 @@ declare function countIfs<T = unknown, U extends InputArray<T>>( x0: U, predicat
147147* var n = countIfs( x0, predicate0, x1, predicate1 );
148148* // returns 2
149149*/
150- declare function countIfs < T = unknown , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > ) : number ;
150+ declare function countIfs < T , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > ) : number ;
151151
152152/**
153153* Counts the number of elements in the input arrays which pass the tests implemented by the predicate functions.
@@ -187,7 +187,7 @@ declare function countIfs<T = unknown, U extends InputArray<T>>( x0: U, predicat
187187* var n = countIfs( x0, predicate0, x1, predicate1, x3, predicate3 );
188188* // returns 2
189189*/
190- declare function countIfs < T = unknown , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > , x3 : U , predicate3 : Predicate < T , U > ) : number ;
190+ declare function countIfs < T , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > , x3 : U , predicate3 : Predicate < T , U > ) : number ;
191191
192192/**
193193* Counts the number of elements in the input arrays which pass the tests implemented by the predicate functions.
@@ -235,7 +235,7 @@ declare function countIfs<T = unknown, U extends InputArray<T>>( x0: U, predicat
235235* var n = countIfs( x0, predicate0, x1, predicate1, x3, predicate3, x4, predicate4 );
236236* // returns 2
237237*/
238- declare function countIfs < T = unknown , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > , x3 : U , predicate3 : Predicate < T , U > , x4 : U , predicate4 : Predicate < T , U > , ...args : Array < U | Predicate < T , U > > ) : number ;
238+ declare function countIfs < T , U extends InputArray < T > > ( x0 : U , predicate0 : Predicate < T , U > , x1 : U , predicate1 : Predicate < T , U > , x2 : U , predicate2 : Predicate < T , U > , x3 : U , predicate3 : Predicate < T , U > , x4 : U , predicate4 : Predicate < T , U > , ...args : Array < U | Predicate < T , U > > ) : number ;
239239
240240
241241// EXPORTS //
0 commit comments