Small code formatting fixlets

.gitignore

@@ -2,5 +2,6 @@ node_modules
 build
 *.log
 *.lock
+.eslintcache
 .DS_Store
 TODO.md

bit-set.d.ts

@@ -13,7 +13,7 @@ export default class BitSet implements Iterable<number> {
 
   // Methods
   clear(): void;
-  set(index: number, value?: boolean | number): void;
+  set(index: number, value?: boolean | number): void;
   reset(index: number, value: boolean | number): void;
   flip(index: number, value: boolean | number): void;
   get(index: number): number;

bit-vector.d.ts

@@ -21,7 +21,7 @@ export default class BitVector implements Iterable<number> {
 
   // Methods
   clear(): void;
-  set(index: number, value?: boolean | number): this;
+  set(index: number, value?: boolean | number): this;
   reset(index: number, value: boolean | number): void;
   flip(index: number, value: boolean | number): void;
   reallocate(capacity: number): this;

bk-tree.d.ts

@@ -5,7 +5,7 @@
 type DistanceFunction<T> = (a: T, b: T) => number;
 
 export default class BKTree<T> {
-  
+
   // Members
   distance: DistanceFunction<T>;
   size: number;
@@ -20,5 +20,5 @@ export default class BKTree<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}, distance: DistanceFunction<I>): BKTree<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}, distance: DistanceFunction<I>): BKTree<I>;
 }

fibonacci-heap.d.ts

@@ -21,7 +21,7 @@ export default class FibonacciHeap<T> {
 
   // Statics
   static from<I>(
-    iterable: Iterable<I> | {[key: string] : I},
+    iterable: Iterable<I> | {[key: string]: I},
     comparator?: FibonacciHeapComparator<I>
   ): FibonacciHeap<I>;
 }
@@ -42,7 +42,7 @@ export class MinFibonacciHeap<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): FibonacciHeap<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): FibonacciHeap<I>;
 }
 
 export class MaxFibonacciHeap<T> {
@@ -61,5 +61,5 @@ export class MaxFibonacciHeap<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): FibonacciHeap<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): FibonacciHeap<I>;
 }

inverted-index.d.ts

@@ -27,7 +27,7 @@ export default class InvertedIndex<D> implements Iterable<D> {
 
   // Statics
   static from<I>(
-    iterable: Iterable<I> | {[key: string] : I},
+    iterable: Iterable<I> | {[key: string]: I},
     tokenizer?: Tokenizer | TokenizersTuple
   ): InvertedIndex<I>;
 }

linked-list.d.ts

@@ -25,5 +25,5 @@ export default class LinkedList<T> implements Iterable<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): LinkedList<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): LinkedList<I>;
 }

lru-cache-with-delete.d.ts

@@ -2,12 +2,12 @@
  * Mnemonist LRUCacheWithDelete Typings
  * =====================================
  */
- import LRUCache from './lru-cache';
+import LRUCache from './lru-cache';
 
- export default class LRUCacheWithDelete<K, V> extends LRUCache<K, V> {
+export default class LRUCacheWithDelete<K, V> extends LRUCache<K, V> {
 
-   delete(key: K): boolean;
+  delete(key: K): boolean;
 
-   remove<T>(key: K, missing?: T): V | T;
+  remove<T>(key: K, missing?: T): V | T;
 
 }

lru-cache-with-delete.js

@@ -43,7 +43,7 @@ if (typeof Symbol !== 'undefined')
  *
  * @return {undefined}
  */
- LRUCacheWithDelete.prototype.clear = function() {
+LRUCacheWithDelete.prototype.clear = function() {
   LRUCache.prototype.clear.call(this);
   this.deletedSize = 0;
 };
@@ -262,7 +262,7 @@ LRUCacheWithDelete.prototype.remove = function(key, missing = undefined) {
  * @param  {number}   capacity - Cache's capacity.
  * @return {LRUCacheWithDelete}
  */
- LRUCacheWithDelete.from = function(iterable, Keys, Values, capacity) {
+LRUCacheWithDelete.from = function(iterable, Keys, Values, capacity) {
   if (arguments.length < 2) {
     capacity = iterables.guessLength(iterable);
 

lru-cache.js

@@ -40,7 +40,7 @@ function LRUCache(Keys, Values, capacity) {
   if (typeof this.capacity !== 'number' || this.capacity <= 0)
     throw new Error('mnemonist/lru-cache: capacity should be positive number.');
   else if (!isFinite(this.capacity) || Math.floor(this.capacity) !== this.capacity)
-      throw new Error('mnemonist/lru-cache: capacity should be a finite positive integer.');
+    throw new Error('mnemonist/lru-cache: capacity should be a finite positive integer.');
 
   var PointerArray = typed.getPointerArray(capacity);
 
@@ -235,12 +235,12 @@ LRUCache.prototype.get = function(key) {
  * @return {any}
  */
 LRUCache.prototype.peek = function(key) {
-    var pointer = this.items[key];
+  var pointer = this.items[key];
 
-    if (typeof pointer === 'undefined')
-        return;
+  if (typeof pointer === 'undefined')
+    return;
 
-    return this.V[pointer];
+  return this.V[pointer];
 };
 
 /**

lru-map-with-delete.d.ts

@@ -2,12 +2,12 @@
  * Mnemonist LRUMapWithDelete Typings
  * ===================================
  */
- import LRUMap from './lru-map';
+import LRUMap from './lru-map';
 
- export default class LRUMapWithDelete<K, V> extends LRUMap<K, V> {
+export default class LRUMapWithDelete<K, V> extends LRUMap<K, V> {
 
-   delete(key: K): boolean;
+  delete(key: K): boolean;
 
-   remove<T>(key: K, missing?: T): V | T;
+  remove<T>(key: K, missing?: T): V | T;
 
 }

lru-map-with-delete.js

@@ -43,7 +43,7 @@ if (typeof Symbol !== 'undefined')
  *
  * @return {undefined}
  */
- LRUMapWithDelete.prototype.clear = function() {
+LRUMapWithDelete.prototype.clear = function() {
   LRUMap.prototype.clear.call(this);
   this.deletedSize = 0;
 };
@@ -262,7 +262,7 @@ LRUMapWithDelete.prototype.remove = function(key, missing = undefined) {
  * @param  {number}   capacity - Cache's capacity.
  * @return {LRUMapWithDelete}
  */
- LRUMapWithDelete.from = function(iterable, Keys, Values, capacity) {
+LRUMapWithDelete.from = function(iterable, Keys, Values, capacity) {
   if (arguments.length < 2) {
     capacity = iterables.guessLength(iterable);
 

package.json

@@ -3,7 +3,8 @@
   "version": "0.39.2",
   "description": "Curated collection of data structures for the JavaScript/TypeScript.",
   "scripts": {
-    "lint": "eslint ./*.js ./utils ./test",
+    "lint": "eslint --cache ./*.js ./utils ./test",
+    "lint:fix": "eslint --cache --fix ./*.js ./utils ./test",
     "prepublishOnly": "npm run lint && npm test && npm run test:types",
     "test": "mocha",
     "test:types": "tsc --target es2015 --noEmit --noImplicitAny --noImplicitReturns ./test/types.ts"

passjoin-index.d.ts

@@ -23,7 +23,7 @@ export default class PassjoinIndex<T> implements Iterable<T> {
 
   // Statics
   static from<I>(
-    iterable: Iterable<I> | {[key: string] : I},
+    iterable: Iterable<I> | {[key: string]: I},
     levenshtein: LevenshteinDistanceFunction<I>,
     k: number
   ): PassjoinIndex<I>;

queue.d.ts

@@ -22,6 +22,6 @@ export default class Queue<T> implements Iterable<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): Queue<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): Queue<I>;
   static of<I>(...items: Array<I>): Queue<I>;
 }

set.d.ts

@@ -12,7 +12,7 @@ export function add<T>(a: Set<T>, b: Set<T>): void;
 export function subtract<T>(a: Set<T>, b: Set<T>): void;
 export function intersect<T>(a: Set<T>, b: Set<T>): void;
 export function disjunct<T>(a: Set<T>, b: Set<T>): void;
-export function intersectionSize<T>(a: Set<T>, b:Set<T>): number;
-export function unionSize<T>(a: Set<T>, b:Set<T>): number;
-export function jaccard<T>(a: Set<T>, b:Set<T>): number;
+export function intersectionSize<T>(a: Set<T>, b: Set<T>): number;
+export function unionSize<T>(a: Set<T>, b: Set<T>): number;
+export function jaccard<T>(a: Set<T>, b: Set<T>): number;
 export function overlap<T>(a: Set<T>, b: Set<T>): number;

stack.d.ts

@@ -22,6 +22,6 @@ export default class Stack<T> implements Iterable<T> {
   inspect(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): Stack<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): Stack<I>;
   static of<I>(...items: Array<I>): Stack<I>;
 }

static-disjoint-set.d.ts

@@ -5,7 +5,7 @@
 import {ArrayLike} from './utils/types';
 
 export default class StaticDisjointSet {
-  
+
   // Members
   dimension: number;
   size: number;

static-interval-tree.d.ts

@@ -18,7 +18,7 @@ export default class StaticIntervalTree<T> {
   intervalsContainingPoint(point: number): Array<T>;
   intervalsOverlappingInterval(interval: T): Array<T>;
   inspect(): any;
-  
+
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}): StaticIntervalTree<I>;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}): StaticIntervalTree<I>;
 }

suffix-array.d.ts

@@ -3,7 +3,7 @@
  * ==============================
  */
 export default class SuffixArray {
-  
+
   // Members
   array: Array<number>;
   length: number;

vector.d.ts

@@ -37,7 +37,7 @@ export default class Vector implements Iterable<number> {
   toJSON(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}, ArrayClass: IArrayLikeConstructor, capacity?: number): Vector;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}, ArrayClass: IArrayLikeConstructor, capacity?: number): Vector;
 }
 
 declare class TypedVector implements Iterable<number> {
@@ -67,7 +67,7 @@ declare class TypedVector implements Iterable<number> {
   toJSON(): any;
 
   // Statics
-  static from<I>(iterable: Iterable<I> | {[key: string] : I}, capacity?: number): TypedVector;
+  static from<I>(iterable: Iterable<I> | {[key: string]: I}, capacity?: number): TypedVector;
 }
 
 export class Int8Vector extends TypedVector {}

vp-tree.d.ts

@@ -21,7 +21,7 @@ export default class VPTree<T> {
 
   // Statics
   static from<I>(
-    iterable: Iterable<I> | {[key: string] : I},
+    iterable: Iterable<I> | {[key: string]: I},
     distance: DistanceFunction<I>
   ): VPTree<I>;
 }