Introduce ESLint and Prettier

This commit is contained in:
Zaid Abdulla committed 2018-08-24 05:31:22 -07:00
1 parent 9c943d0bbf
commit e494bdca8a
26 files changed
+1585 -1594

No files matched your search

+32 -46
View File
@@ -1,5 +1,5 @@
/**
* Copyright 2013-2017 Zaid Abdulla
* Copyright 2013-2018 Zaid Abdulla
*
* This file is part of GenieACS.
*
@@ -18,25 +18,20 @@
*/
"use strict";
class PathSet {
constructor() {
this.lengthIndex = [];
this.fragmentIndex = [];
}
get depth() {
return this.lengthIndex.length;
}
add(path) {
let p = this.get(path);
if (p)
return p;
if (p) return p;
if (!this.lengthIndex[path.length])
this.lengthIndex[path.length] = new Set();
@@ -44,13 +39,11 @@ class PathSet {
this.lengthIndex[path.length].add(path);
let wildcard = 0;
for (let i = 0; i < path.length; ++ i) {
for (let i = 0; i < path.length; ++i) {
let fragment = path[i];
if (fragment === "*")
wildcard = wildcard | (1 << i);
if (fragment === "*") wildcard = wildcard | (1 << i);
if (!this.fragmentIndex[i])
this.fragmentIndex[i] = {};
if (!this.fragmentIndex[i]) this.fragmentIndex[i] = {};
if (!this.fragmentIndex[i][fragment])
this.fragmentIndex[i][fragment] = new Set();
@@ -66,31 +59,26 @@ class PathSet {
return path;
}
get(pattern) {
if (!this.lengthIndex[pattern.length])
return null;
if (!this.lengthIndex[pattern.length]) return null;
if (this.lengthIndex[pattern.length].has(pattern))
return pattern;
if (this.lengthIndex[pattern.length].has(pattern)) return pattern;
let sets = [];
sets.push(this.lengthIndex[pattern.length]);
for (let i = 0; i < pattern.length; ++ i) {
if (!this.fragmentIndex[i])
return null;
for (let i = 0; i < pattern.length; ++i) {
if (!this.fragmentIndex[i]) return null;
let fragment = pattern[i];
if (!this.fragmentIndex[i][fragment])
return null;
if (!this.fragmentIndex[i][fragment]) return null;
sets.push(this.fragmentIndex[i][fragment]);
}
sets.sort(function(a, b) {
sets.sort((a, b) => {
return a.size - b.size;
});
@@ -99,36 +87,31 @@ class PathSet {
for (let s of sets) {
if (!s.has(path)) {
path = null;
break
break;
}
}
if (path)
return path;
if (path) return path;
}
return null;
}
find(pattern, superset = false, subset = false, depth = pattern.length) {
let res = [];
let groups = [[]];
for (let i = pattern.length; i <= depth; ++ i)
if (this.lengthIndex[i])
groups[0].push(this.lengthIndex[i]);
for (let i = pattern.length; i <= depth; ++i)
if (this.lengthIndex[i]) groups[0].push(this.lengthIndex[i]);
if (!groups[0].length)
return res;
if (!groups[0].length) return res;
for (let i = 0; i < pattern.length; ++ i) {
if (!this.fragmentIndex[i])
return res;
for (let i = 0; i < pattern.length; ++i) {
if (!this.fragmentIndex[i]) return res;
let fragment = pattern[i];
if (fragment === "*" && subset)
continue;
if (fragment === "*" && subset) continue;
let g = [];
@@ -138,15 +121,20 @@ class PathSet {
if (fragment !== "*" && superset && this.fragmentIndex[i]["*"])
g.push(this.fragmentIndex[i]["*"]);
if (!g.length)
return res;
if (!g.length) return res;
groups.push(g);
}
groups.sort(function(a, b) {
return a.reduce(function(prev, cur) {return prev + cur.size;}, 0) -
b.reduce(function(prev, cur) {return prev + cur.size;}, 0);
groups.sort((a, b) => {
return (
a.reduce((prev, cur) => {
return prev + cur.size;
}, 0) -
b.reduce((prev, cur) => {
return prev + cur.size;
}, 0)
);
});
let smallestGroup = groups.shift();
@@ -160,20 +148,18 @@ class PathSet {
break;
}
}
if (!found) {
path = null;
break;
}
}
if (path)
res.push(path);
if (path) res.push(path);
}
}
return res;
}
}
module.exports = PathSet;