refactor: format code

Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>

diff --git a/jsr.json b/jsr.json
index ac86155a36ac317028a88c057231d4b0151edbaa..ff144fb69a4d53d2dae482d7cb708555a418cbe3 100644 (file)
--- a/jsr.json
+++ b/jsr.json
@@ -4,11 +4,6 @@
   "version": "4.0.16",
   "exports": "./src/index.ts",
   "publish": {
-    "include": [
-      "LICENSE",
-      "README.md",
-      "jsr.json",
-      "src/**/*.ts"
-    ]
+    "include": ["LICENSE", "README.md", "jsr.json", "src/**/*.ts"]
   }
 }

diff --git a/src/fixed-priority-queue.ts b/src/fixed-priority-queue.ts
index 1597860e3f08bfde4df64cdff149e52e154ab005..74d43c4bd377920b270ef83fb7d33bb84f8a9c98 100644 (file)
--- a/src/fixed-priority-queue.ts
+++ b/src/fixed-priority-queue.ts
@@ -1,4 +1,8 @@
-import { defaultQueueSize, type FixedQueueNode, type IFixedQueue } from './utility-types.js'
+import {
+  defaultQueueSize,
+  type FixedQueueNode,
+  type IFixedQueue,
+} from './utility-types.js'
 
 /**
  * Fixed priority queue.

diff --git a/src/fixed-queue.ts b/src/fixed-queue.ts
index 4856b304302c54c9d2d31fce6f4ad24783645af5..171cd578c9c339eb5f324a17367783671f03fe27 100644 (file)
--- a/src/fixed-queue.ts
+++ b/src/fixed-queue.ts
@@ -1,4 +1,8 @@
-import { defaultQueueSize, type FixedQueueNode, type IFixedQueue } from './utility-types.js'
+import {
+  defaultQueueSize,
+  type FixedQueueNode,
+  type IFixedQueue,
+} from './utility-types.js'
 
 /**
  * Fixed queue.
@@ -118,9 +122,7 @@ export class FixedQueue<T> implements IFixedQueue<T> {
       )
     }
     if (size < 0) {
-      throw new RangeError(
-        `Invalid fixed queue size: ${size.toString()} < 0`
-      )
+      throw new RangeError(`Invalid fixed queue size: ${size.toString()} < 0`)
     }
   }
 }

diff --git a/src/priority-queue.ts b/src/priority-queue.ts
index ac75fc064c4a891a7805e8e1428853cc173b6d17..1e15fe2d5152424a49542362dfffd22034dc92f3 100644 (file)
--- a/src/priority-queue.ts
+++ b/src/priority-queue.ts
@@ -2,7 +2,12 @@
 
 import { FixedPriorityQueue } from './fixed-priority-queue.js'
 import { FixedQueue } from './fixed-queue.js'
-import { defaultBucketSize, type FixedQueueNode, type IFixedQueue, type PriorityQueueNode } from './utility-types.js'
+import {
+  defaultBucketSize,
+  type FixedQueueNode,
+  type IFixedQueue,
+  type PriorityQueueNode,
+} from './utility-types.js'
 
 /**
  * Priority queue.
@@ -65,7 +70,7 @@ export class PriorityQueue<T> {
     this.priorityEnabled = enablePriority
     let head: PriorityQueueNode<T>
     let tail: PriorityQueueNode<T>
-    let prevNode : PriorityQueueNode<T> | undefined
+    let prevNode: PriorityQueueNode<T> | undefined
     let node: PriorityQueueNode<T> | undefined = this.tail
     let buckets = 0
     while (node != null) {
@@ -205,7 +210,9 @@ export class PriorityQueue<T> {
     }
   }
 
-  private getPriorityQueueNode (nodeArray?: FixedQueueNode<T>[]): PriorityQueueNode<T> {
+  private getPriorityQueueNode (
+    nodeArray?: FixedQueueNode<T>[]
+  ): PriorityQueueNode<T> {
     let fixedQueue: IFixedQueue<T>
     if (this.priorityEnabled) {
       fixedQueue = new FixedPriorityQueue(this.bucketSize)

diff --git a/src/utility-types.ts b/src/utility-types.ts
index e40d7b52d04c36a5ef657dd366adecf68b38495c..858dc0e6f0fb256641bc3951d84b76153153f2ec 100644 (file)
--- a/src/utility-types.ts
+++ b/src/utility-types.ts
@@ -245,12 +245,12 @@ export interface IFixedQueue<T> {
    * Checks if the fixed queue is empty.
    * @returns `true` if the fixed queue is empty, `false` otherwise.
    */
-  empty(): boolean
+  empty: () => boolean
   /**
    * Checks if the fixed queue is full.
    * @returns `true` if the fixed queue is full, `false` otherwise.
    */
-  full(): boolean
+  full: () => boolean
   /**
    * Enqueue data into the fixed queue.
    * @param data - Data to enqueue.
@@ -258,28 +258,28 @@ export interface IFixedQueue<T> {
    * @returns The new size of the fixed queue.
    * @throws If the fixed queue is full.
    */
-  enqueue (data: T, priority?: number): number
+  enqueue: (data: T, priority?: number) => number
   /**
    * Gets data from the fixed queue.
    * @param index - The index of the data to get.
    * @returns The data at the index or `undefined` if the fixed queue is empty or the index is out of bounds.
    */
-  get (index: number): T | undefined
+  get: (index: number) => T | undefined
   /**
    * Dequeue data from the fixed queue.
    * @returns The dequeued data or `undefined` if the fixed queue is empty.
    */
-  dequeue (): T | undefined
+  dequeue: () => T | undefined
   /**
    * Clears the fixed queue.
    */
-  clear (): void
+  clear: () => void
   /**
    * Returns an iterator for the fixed queue.
    * @returns An iterator for the fixed queue.
    * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols
    */
-  [Symbol.iterator] (): Iterator<T>
+  [Symbol.iterator]: () => Iterator<T>
 }
 
 /**

diff --git a/tests/fixed-priority-queue.test.mjs b/tests/fixed-priority-queue.test.mjs
index e474bd1c3b0dd54366d1416b7e5a202df6304698..9321709dbccfb7adc4b4e83dd7d0d47c0656348b 100644 (file)
--- a/tests/fixed-priority-queue.test.mjs
+++ b/tests/fixed-priority-queue.test.mjs
@@ -1,8 +1,6 @@
 import { expect } from 'expect'
 
-import {
-  FixedPriorityQueue,
-} from '../lib/fixed-priority-queue.cjs'
+import { FixedPriorityQueue } from '../lib/fixed-priority-queue.cjs'
 import { defaultQueueSize } from '../lib/utility-types.cjs'
 
 describe('Fixed priority queue test suite', () => {

diff --git a/tests/fixed-queue.test.mjs b/tests/fixed-queue.test.mjs
index 941b7916a01e078328fdfbc2ba8bc9b906b21e7f..e99e75669d753451682c850711bdd2da7d6ebfee 100644 (file)
--- a/tests/fixed-queue.test.mjs
+++ b/tests/fixed-queue.test.mjs
@@ -1,8 +1,6 @@
 import { expect } from 'expect'
 
-import {
-  FixedQueue,
-} from '../lib/fixed-queue.cjs'
+import { FixedQueue } from '../lib/fixed-queue.cjs'
 import { defaultQueueSize } from '../lib/utility-types.cjs'
 
 describe('Fixed queue test suite', () => {
@@ -27,9 +25,7 @@ describe('Fixed queue test suite', () => {
     expect(fixedQueue.start).toBe(0)
     expect(fixedQueue.size).toBe(1)
     expect(rtSize).toBe(fixedQueue.size)
-    expect(fixedQueue.nodeArray).toMatchObject([
-      { data: 1, priority: 0 },
-    ])
+    expect(fixedQueue.nodeArray).toMatchObject([{ data: 1, priority: 0 }])
     expect(fixedQueue.capacity).toBe(queueSize)
     rtSize = fixedQueue.enqueue(2)
     expect(fixedQueue.start).toBe(0)