chore: Formatted code using prettier.

redis · Oct 23, 2020 · f560813 · f560813
1 parent aba3c74
commit f560813
Show file tree

Hide file tree

Showing 16 changed files with 536 additions and 447 deletions.
diff --git a/benchmarks/autopipelining-cluster.ts b/benchmarks/autopipelining-cluster.ts
@@ -1,60 +1,68 @@
-import { cronometro } from 'cronometro'
-import { readFileSync } from 'fs'
-import { join } from 'path'
-import Cluster from '../lib/cluster'
-
-const numNodes = parseInt(process.env.NODES || '3', 10)
-const iterations = parseInt(process.env.ITERATIONS || '10000', 10)
-const batchSize = parseInt(process.env.BATCH_SIZE || '1000', 10)
-const keys = readFileSync(join(__dirname, `fixtures/cluster-${numNodes}.txt`), 'utf-8').split('\n')
-const configuration = Array.from(Array(numNodes), (_, i) => ({ host: '127.0.0.1', port: 30000 + i + 1 }))
-let cluster
+import { cronometro } from "cronometro";
+import { readFileSync } from "fs";
+import { join } from "path";
+import Cluster from "../lib/cluster";
+
+const numNodes = parseInt(process.env.NODES || "3", 10);
+const iterations = parseInt(process.env.ITERATIONS || "10000", 10);
+const batchSize = parseInt(process.env.BATCH_SIZE || "1000", 10);
+const keys = readFileSync(
+  join(__dirname, `fixtures/cluster-${numNodes}.txt`),
+  "utf-8"
+).split("\n");
+const configuration = Array.from(Array(numNodes), (_, i) => ({
+  host: "127.0.0.1",
+  port: 30000 + i + 1,
+}));
+let cluster;
 
 function command(): string {
-  const choice = Math.random()
+  const choice = Math.random();
 
   if (choice < 0.3) {
-    return 'ttl'
+    return "ttl";
   } else if (choice < 0.6) {
-    return 'exists'
+    return "exists";
   }
 
-  return 'get'
+  return "get";
 }
 
 function test() {
-  const index = Math.floor(Math.random() * keys.length)
+  const index = Math.floor(Math.random() * keys.length);
 
-  return Promise.all(Array.from(Array(batchSize)).map(() => cluster[command()](keys[index])))
+  return Promise.all(
+    Array.from(Array(batchSize)).map(() => cluster[command()](keys[index]))
+  );
 }
 
 function after(cb) {
-  cluster.quit()
-  cb()
+  cluster.quit();
+  cb();
 }
 
 cronometro(
   {
     default: {
       test,
       before(cb) {
-        cluster = new Cluster(configuration)
+        cluster = new Cluster(configuration);
 
-        cb()
+        cb();
       },
-      after
+      after,
     },
-    'enableAutoPipelining=true': {
+    "enableAutoPipelining=true": {
       test,
       before(cb) {
-        cluster = new Cluster(configuration, { enableAutoPipelining: true })
-        cb()
+        cluster = new Cluster(configuration, { enableAutoPipelining: true });
+        cb();
       },
-      after
-    }
+      after,
+    },
   },
   {
     iterations,
-    print: { compare: true }
+    print: { compare: true },
   }
-)
+);
diff --git a/benchmarks/autopipelining-single.ts b/benchmarks/autopipelining-single.ts
@@ -1,58 +1,63 @@
-import { cronometro } from 'cronometro'
-import { readFileSync } from 'fs'
-import { join } from 'path'
-import Redis from '../lib/redis'
-
-const iterations = parseInt(process.env.ITERATIONS || '10000', 10)
-const batchSize = parseInt(process.env.BATCH_SIZE || '1000', 10)
-const keys = readFileSync(join(__dirname, 'fixtures/cluster-3.txt'), 'utf-8').split('\n')
-let redis
+import { cronometro } from "cronometro";
+import { readFileSync } from "fs";
+import { join } from "path";
+import Redis from "../lib/redis";
+
+const iterations = parseInt(process.env.ITERATIONS || "10000", 10);
+const batchSize = parseInt(process.env.BATCH_SIZE || "1000", 10);
+const keys = readFileSync(
+  join(__dirname, "fixtures/cluster-3.txt"),
+  "utf-8"
+).split("\n");
+let redis;
 
 function command(): string {
-  const choice = Math.random()
+  const choice = Math.random();
 
   if (choice < 0.3) {
-    return 'ttl'
+    return "ttl";
   } else if (choice < 0.6) {
-    return 'exists'
+    return "exists";
   }
 
-  return 'get'
+  return "get";
 }
 
 function test() {
-  const index = Math.floor(Math.random() * keys.length)
+  const index = Math.floor(Math.random() * keys.length);
 
-  return Promise.all(Array.from(Array(batchSize)).map(() => redis[command()](keys[index])))
+  return Promise.all(
+    Array.from(Array(batchSize)).map(() => redis[command()](keys[index]))
+  );
 }
 
 function after(cb) {
-  redis.quit()
-  cb()
+  redis.quit();
+  cb();
 }
 
 cronometro(
   {
     default: {
       test,
       before(cb) {
-        redis = new Redis()
+        redis = new Redis();
 
-        cb()
+        cb();
       },
-      after
+      after,
     },
-    'enableAutoPipelining=true': {
+    "enableAutoPipelining=true": {
       test,
       before(cb) {
-        redis = new Redis({ enableAutoPipelining: true })
-        cb()
+        redis = new Redis({ enableAutoPipelining: true });
+        cb();
       },
-      after
-    }
+      after,
+    },
   },
   {
     iterations,
-    print: { compare: true }
+    print: { compare: true },
   }
-)
+);
diff --git a/benchmarks/dropBuffer.ts b/benchmarks/dropBuffer.ts
@@ -1,38 +1,38 @@
-import { cronometro } from 'cronometro'
-import Redis from '../lib/redis'
+import { cronometro } from "cronometro";
+import Redis from "../lib/redis";
 
-let redis
+let redis;
 
 cronometro(
   {
     default: {
       test() {
-        return redis.set('foo', 'bar')
+        return redis.set("foo", "bar");
       },
       before(cb) {
-        redis = new Redis()
-        cb()
+        redis = new Redis();
+        cb();
       },
       after(cb) {
-        redis.quit()
-        cb()
-      }
+        redis.quit();
+        cb();
+      },
     },
-    'dropBufferSupport=true': {
+    "dropBufferSupport=true": {
       test() {
-        return redis.set('foo', 'bar')
+        return redis.set("foo", "bar");
       },
       before(cb) {
-        redis = new Redis({ dropBufferSupport: true })
-        cb()
+        redis = new Redis({ dropBufferSupport: true });
+        cb();
       },
       after(cb) {
-        redis.quit()
-        cb()
-      }
-    }
+        redis.quit();
+        cb();
+      },
+    },
   },
   {
-    print: { compare: true }
+    print: { compare: true },
   }
-)
+);
diff --git a/benchmarks/fixtures/generate.ts b/benchmarks/fixtures/generate.ts
@@ -1,67 +1,78 @@
-'use strict'
+"use strict";
 
-const start = process.hrtime.bigint()
+const start = process.hrtime.bigint();
 
-import * as calculateSlot from 'cluster-key-slot'
-import { writeFileSync } from 'fs'
-import { join } from 'path'
-import { v4 as uuid } from 'uuid'
+import * as calculateSlot from "cluster-key-slot";
+import { writeFileSync } from "fs";
+import { join } from "path";
+import { v4 as uuid } from "uuid";
 
 // Input parameters
-const numKeys = parseInt(process.env.KEYS || '1000000', 10)
-const numNodes = parseInt(process.env.NODES || '3', 10)
+const numKeys = parseInt(process.env.KEYS || "1000000", 10);
+const numNodes = parseInt(process.env.NODES || "3", 10);
 
 // Prepare topology
-const maxSlot = 16384
-const destination = join(__dirname, `cluster-${numNodes}.txt`)
-const counts = Array.from(Array(numNodes), () => 0)
-const keys = []
+const maxSlot = 16384;
+const destination = join(__dirname, `cluster-${numNodes}.txt`);
+const counts = Array.from(Array(numNodes), () => 0);
+const keys = [];
 
 /*
   This algorithm is taken and adapted from Redis source code
   See: https://github.com/redis/redis/blob/d9f970d8d3f0b694f1e8915cab6d4eab9cfb2ef1/src/redis-cli.c#L5453
 */
-const nodes = [] // This only holds starting slot, since the ending slot can be computed out of the next one
-let first = 0
-let cursor = 0
-const slotsPerNode = maxSlot / numNodes
+const nodes = []; // This only holds starting slot, since the ending slot can be computed out of the next one
+let first = 0;
+let cursor = 0;
+const slotsPerNode = maxSlot / numNodes;
 
 for (let i = 0; i < numNodes; i++) {
-  let last = Math.round(cursor + slotsPerNode - 1)
+  let last = Math.round(cursor + slotsPerNode - 1);
 
   if (last > maxSlot || i === numNodes - 1) {
-    last = maxSlot - 1
+    last = maxSlot - 1;
   }
 
   if (last < first) {
-    last = first
+    last = first;
   }
 
-  nodes.push(first)
-  first = last + 1
-  cursor += slotsPerNode
+  nodes.push(first);
+  first = last + 1;
+  cursor += slotsPerNode;
 }
 
 // Generate keys and also track slot allocations
 for (let i = 0; i < numKeys; i++) {
-  const key = uuid()
-  const slot = calculateSlot(key)
-  const node = nodes.findIndex((start, i) => i === numNodes - 1 || (slot >= start && slot < nodes[i + 1]))
+  const key = uuid();
+  const slot = calculateSlot(key);
+  const node = nodes.findIndex(
+    (start, i) => i === numNodes - 1 || (slot >= start && slot < nodes[i + 1])
+  );
 
-  counts[node]++
-  keys.push(key)
+  counts[node]++;
+  keys.push(key);
 }
 
 // Save keys
-writeFileSync(destination, keys.join('\n'))
+writeFileSync(destination, keys.join("\n"));
 
 // Print summary
-console.log(`Generated ${numKeys} keys in ${(Number(process.hrtime.bigint() - start) / 1e6).toFixed(2)} ms `)
+console.log(
+  `Generated ${numKeys} keys in ${(
+    Number(process.hrtime.bigint() - start) / 1e6
+  ).toFixed(2)} ms `
+);
 
 for (let i = 0; i < numNodes; i++) {
-  const from = nodes[i]
-  const to = (i === numNodes - 1 ? maxSlot : nodes[i + 1]) - 1
+  const from = nodes[i];
+  const to = (i === numNodes - 1 ? maxSlot : nodes[i + 1]) - 1;
   console.log(
-    `  - Generated ${counts[i]} keys for node(s) serving slots ${from}-${to} (${((counts[i] * 100) / numKeys).toFixed(2)} %)`
-  )
+    `  - Generated ${
+      counts[i]
+    } keys for node(s) serving slots ${from}-${to} (${(
+      (counts[i] * 100) /
+      numKeys
+    ).toFixed(2)} %)`
+  );
 }