@@ -102,10 +102,10 @@ export class AbstractIterator<TDatabase, K, V> extends CommonIterator<TDatabase,
102
102
* @param options Options (none at the moment, reserved for future use).
103
103
* @param callback Error-first callback. If none is provided, a promise is returned.
104
104
*/
105
- nextv ( size : number , options : { } , callback : NodeCallback < [ [ K , V ] ] > ) : void
106
- nextv ( size : number , callback : NodeCallback < [ [ K , V ] ] > ) : void
107
- nextv ( size : number , options : { } ) : Promise < [ [ K , V ] ] >
108
- nextv ( size : number ) : Promise < [ [ K , V ] ] >
105
+ nextv ( size : number , options : { } , callback : NodeCallback < [ K , V ] [ ] > ) : void
106
+ nextv ( size : number , callback : NodeCallback < [ K , V ] [ ] > ) : void
107
+ nextv ( size : number , options : { } ) : Promise < [ K , V ] [ ] >
108
+ nextv ( size : number ) : Promise < [ K , V ] [ ] >
109
109
110
110
/**
111
111
* Advance repeatedly and get all (remaining) entries as an array, automatically
@@ -117,10 +117,10 @@ export class AbstractIterator<TDatabase, K, V> extends CommonIterator<TDatabase,
117
117
* @param options Options (none at the moment, reserved for future use).
118
118
* @param callback Error-first callback. If none is provided, a promise is returned.
119
119
*/
120
- all ( options : { } , callback : NodeCallback < [ [ K , V ] ] > ) : void
121
- all ( callback : NodeCallback < [ [ K , V ] ] > ) : void
122
- all ( options : { } ) : Promise < [ [ K , V ] ] >
123
- all ( ) : Promise < [ [ K , V ] ] >
120
+ all ( options : { } , callback : NodeCallback < [ K , V ] [ ] > ) : void
121
+ all ( callback : NodeCallback < [ K , V ] [ ] > ) : void
122
+ all ( options : { } ) : Promise < [ K , V ] [ ] >
123
+ all ( ) : Promise < [ K , V ] [ ] >
124
124
125
125
/**
126
126
* Seek to the key closest to {@link target}. Subsequent calls to {@link next()},
0 commit comments