⬆️ Update dependency prettier to v3

.all-contributorsrc

@@ -417,4 +417,3 @@
   ],
   "contributorsPerLine": 7
 }
-

.github/workflows/scripts/generate-changelog.cjs

@@ -141,7 +141,7 @@ async function extractAndParseDiff(fromIdentifier, packageName) {
       default:
         ++numFailed;
         errors.push(
-          `⚠️ Unhandled type: ${type} on [PR-${pr}](https://github.com/dubzzz/fast-check/pull/${pr}) with title ${title}`
+          `⚠️ Unhandled type: ${type} on [PR-${pr}](https://github.com/dubzzz/fast-check/pull/${pr}) with title ${title}`,
         );
         break;
     }
@@ -231,13 +231,13 @@ async function run() {
     console.debug(`[debug] Checking ${packageName} between tag ${oldTag} and tag ${newTag}`);
     const { breakingSection, newFeaturesSection, maintenanceSection, errors } = await extractAndParseDiff(
       oldTag,
-      packageName
+      packageName,
     );
 
     // Build changelog message
     const codeUrl = `https://github.com/dubzzz/fast-check/tree/${encodeURIComponent(newTag)}`;
     const diffUrl = `https://github.com/dubzzz/fast-check/compare/${encodeURIComponent(oldTag)}...${encodeURIComponent(
-      newTag
+      newTag,
     )}`;
     const breakingBlock = breakingSection
       .reverse()
@@ -297,7 +297,7 @@ async function run() {
     .map((b) => b.cwd.substring(process.cwd().length + 1).replace(/\\/g, '/'))
     .map(
       (packageRelativePath) =>
-        `https://github.com/dubzzz/fast-check/blob/${branchName}/${packageRelativePath}/CHANGELOG.md`
+        `https://github.com/dubzzz/fast-check/blob/${branchName}/${packageRelativePath}/CHANGELOG.md`,
     );
 
   // Return useful details

.yarn/versions/f78ad017.yml

@@ -0,0 +1,8 @@
+releases:
+  "@fast-check/ava": patch
+  "@fast-check/jest": patch
+  "@fast-check/packaged": patch
+  "@fast-check/poisoning": patch
+  "@fast-check/vitest": patch
+  "@fast-check/worker": patch
+  fast-check: patch

examples/001-simple/decompPrime/main.spec.ts

@@ -11,7 +11,7 @@ describe('decompPrime', () => {
         const factors = decompPrime(n);
         const productOfFactors = factors.reduce((a, b) => a * b, 1);
         return productOfFactors === n;
-      })
+      }),
     );
   });
 
@@ -21,7 +21,7 @@ describe('decompPrime', () => {
         const n = a * b;
         const factors = decompPrime(n);
         return factors.length >= 2;
-      })
+      }),
     );
   });
 
@@ -33,7 +33,7 @@ describe('decompPrime', () => {
         const factorsAB = decompPrime(a * b);
         const reorder = (arr: number[]) => [...arr].sort((a, b) => a - b);
         expect(reorder(factorsAB)).toEqual(reorder([...factorsA, ...factorsB]));
-      })
+      }),
     );
   });
 });

examples/001-simple/fibonacci/main.spec.ts

@@ -10,7 +10,7 @@ describe('fibonacci', () => {
     fc.assert(
       fc.property(fc.integer({ min: 2, max: MaxN }), (n) => {
         expect(fibo(n)).toBe(fibo(n - 1) + fibo(n - 2));
-      })
+      }),
     );
   });
 
@@ -21,7 +21,7 @@ describe('fibonacci', () => {
     fc.assert(
       fc.property(fc.integer({ min: 1, max: MaxN }), fc.integer({ min: 0, max: MaxN }), (p, q) => {
         expect(fibo(p + q)).toBe(fibo(p) * fibo(q + 1) + fibo(p - 1) * fibo(q));
-      })
+      }),
     );
   });
 
@@ -30,7 +30,7 @@ describe('fibonacci', () => {
     fc.assert(
       fc.property(fc.integer({ min: 1, max: MaxN }), (p) => {
         expect(fibo(2 * p - 1)).toBe(fibo(p - 1) * fibo(p - 1) + fibo(p) * fibo(p));
-      })
+      }),
     );
   });
 
@@ -40,7 +40,7 @@ describe('fibonacci', () => {
         const [p, q] = a < b ? [b, a] : [a, b];
         const sign = (p - q) % 2 === 0 ? 1n : -1n; // (-1)^(p-q)
         expect(fibo(p) * fibo(p) - fibo(p - q) * fibo(p + q)).toBe(sign * fibo(q) * fibo(q));
-      })
+      }),
     );
   });
 
@@ -49,15 +49,15 @@ describe('fibonacci', () => {
       fc.property(fc.integer({ min: 1, max: MaxN }), (p) => {
         const sign = p % 2 === 0 ? 1n : -1n; // (-1)^p
         expect(fibo(p + 1) * fibo(p - 1) - fibo(p) * fibo(p)).toBe(sign);
-      })
+      }),
     );
   });
 
   it('should fibo(nk) divisible by fibo(n)', () => {
     fc.assert(
       fc.property(fc.integer({ min: 1, max: MaxN }), fc.integer({ min: 0, max: 100 }), (n, k) => {
         expect(fibo(n * k) % fibo(n)).toBe(0n);
-      })
+      }),
     );
   });
 
@@ -81,7 +81,7 @@ describe('fibonacci', () => {
           }
         };
         expect(gcd(fibo(a), fibo(b), 0n)).toBe(fibo(gcd(a, b, 0)));
-      })
+      }),
     );
   });
 });

examples/001-simple/indexOf/main.spec.ts

@@ -6,7 +6,7 @@ describe('indexOf', () => {
     fc.assert(
       fc.property(fc.string(), fc.string(), fc.string(), (a, b, c) => {
         return indexOf(a + b + c, b) !== -1;
-      })
+      }),
     );
   });
 
@@ -17,7 +17,7 @@ describe('indexOf', () => {
         const pattern = b;
         const index = indexOf(text, pattern);
         return index === -1 || text.substr(index, pattern.length) === pattern;
-      })
+      }),
     );
   });
 });

examples/001-simple/sort/main.spec.ts

@@ -7,7 +7,7 @@ describe('sort', () => {
     fc.assert(
       fc.property(fc.array(fc.integer()), (data) => {
         expect(sort(data)).toHaveLength(data.length);
-      })
+      }),
     );
   });
 
@@ -16,7 +16,7 @@ describe('sort', () => {
       fc.property(fc.array(fc.integer()), (data) => {
         const sorted = sort(data);
         expect(_.groupBy(sorted)).toEqual(_.groupBy(data));
-      })
+      }),
     );
   });
 
@@ -27,7 +27,7 @@ describe('sort', () => {
         for (let idx = 1; idx < sorted.length; ++idx) {
           expect(sorted[idx - 1]).toBeLessThanOrEqual(sorted[idx]);
         }
-      })
+      }),
     );
   });
 
@@ -45,7 +45,7 @@ describe('sort', () => {
           // a < b means in terms of ordering a comes before b
           // One important property is: a < b and b < c implies a < c
         }
-      })
+      }),
     );
   });
 });

examples/002-recursive/isSearchTree/arbitraries/BinarySearchTreeArbitrary.ts

@@ -31,7 +31,7 @@ export const binarySearchTreeWithMaxDepth = (maxDepth: number): fc.Arbitrary<Tre
 export const binarySearchTreeWithMaxDepthOldWay = (
   maxDepth: number,
   minValue: number = Number.MIN_SAFE_INTEGER,
-  maxValue: number = Number.MAX_SAFE_INTEGER
+  maxValue: number = Number.MAX_SAFE_INTEGER,
 ): fc.Arbitrary<Tree<number>> => {
   const valueArbitrary = fc.integer({ min: minValue, max: maxValue });
   if (maxDepth <= 0) {

examples/002-recursive/isSearchTree/main.spec.ts

@@ -9,7 +9,7 @@ describe('isSearchTree', () => {
     fc.assert(
       fc.property(binarySearchTreeWithMaxDepth(3), (tree) => {
         return isSearchTree(tree);
-      })
+      }),
     );
   });
 
@@ -18,7 +18,7 @@ describe('isSearchTree', () => {
       fc.property(binaryTreeWithMaxDepth(3), (tree) => {
         fc.pre(!isSorted(traversal(tree, (t) => t.value)));
         return !isSearchTree(tree);
-      })
+      }),
     );
   });
 
@@ -27,7 +27,7 @@ describe('isSearchTree', () => {
       fc.property(binaryTreeWithoutMaxDepth(), (tree) => {
         fc.pre(!isSorted(traversal(tree, (t) => t.value)));
         return !isSearchTree(tree);
-      })
+      }),
     );
   });
 
@@ -36,11 +36,11 @@ describe('isSearchTree', () => {
       fc.property(binaryTreeWithMaxDepth(3), (tree) => {
         fc.pre(
           traversal(tree, (t) => t).some(
-            (t) => (t.left && t.left.value > t.value) || (t.right && t.right.value <= t.value)
-          )
+            (t) => (t.left && t.left.value > t.value) || (t.right && t.right.value <= t.value),
+          ),
         );
         return !isSearchTree(tree);
-      })
+      }),
     );
   });
 });
@@ -57,6 +57,6 @@ function traversal<TOut>(t: Tree<number>, extract: (node: Tree<number>) => TOut,
 function isSorted(d: number[]): boolean {
   return _.isEqual(
     d,
-    [...d].sort((a, b) => a - b)
+    [...d].sort((a, b) => a - b),
   );
 }

examples/003-misc/knight/arbitraries/SpaceArbitrary.ts

@@ -12,6 +12,6 @@ export const SpaceArbitrary = fc
   })
   .filter(({ w, h, cx, cy, sx, sy }) => cx < w && sx < w && cy < h && sy < h)
   .map(({ w, h, cx, cy, sx, sy }) =>
-    new SpaceBuilder().withDimension(w, h).withSolution(cx, cy).withCurrent(sx, sy).build()
+    new SpaceBuilder().withDimension(w, h).withSolution(cx, cy).withCurrent(sx, sy).build(),
   )
   .map((space) => [space, Math.ceil(Math.log(Math.max(space.dim_x, space.dim_y)) / Math.log(2))] as [Space, number]);

examples/003-misc/knight/main.spec.ts

@@ -13,7 +13,7 @@ describe('knight', () => {
         const [space, max_guesses] = inputs;
         knight(space, max_guesses);
         return space.solved();
-      })
+      }),
     );
   });
 

examples/003-misc/knight/src/space.ts

@@ -5,7 +5,7 @@ export class Space {
     private readonly solution_x: number,
     private readonly solution_y: number,
     private current_x: number,
-    private current_y: number
+    private current_y: number,
   ) {}
   readHint(): string {
     let hint = '';

examples/003-misc/mazeGenerator/main.spec.ts

@@ -9,7 +9,7 @@ describe('mazeGenerator', () => {
         const maze = mazeGenerator(seed, ins.dim, ins.startPt, ins.endPt);
         expect(maze[ins.startPt.y][ins.startPt.x]).toBe(CellType.Start);
         expect(_.flatten(maze).filter((c) => c === CellType.Start)).toHaveLength(1);
-      })
+      }),
     );
   });
 
@@ -19,7 +19,7 @@ describe('mazeGenerator', () => {
         const maze = mazeGenerator(seed, ins.dim, ins.startPt, ins.endPt);
         expect(maze[ins.endPt.y][ins.endPt.x]).toBe(CellType.End);
         expect(_.flatten(maze).filter((c) => c === CellType.End)).toHaveLength(1);
-      })
+      }),
     );
   });
 
@@ -28,7 +28,7 @@ describe('mazeGenerator', () => {
       fc.property(seedArb, inputsArb, (seed, ins) => {
         const maze = mazeGenerator(seed, ins.dim, ins.startPt, ins.endPt);
         return hasPathFromStartToEnd(maze, ins.startPt);
-      })
+      }),
     );
   });
 
@@ -56,11 +56,11 @@ describe('mazeGenerator', () => {
                 return cell !== null && cell !== CellType.Wall;
               })
               // Keep the src aka source point in order not to go back on our tracks
-              .map((nPt) => ({ pt: nPt, src: pt }))
+              .map((nPt) => ({ pt: nPt, src: pt })),
           );
         }
         return true;
-      })
+      }),
     );
   });
 
@@ -74,7 +74,7 @@ describe('mazeGenerator', () => {
           else return count + 1;
         }, 0);
         expect(numPathsLeavingEnd).toBe(1);
-      })
+      }),
     );
   });
 
@@ -92,12 +92,12 @@ describe('mazeGenerator', () => {
             ...neighboorsFor(pt).filter((nPt) => {
               const cell = cellTypeAt(maze, nPt);
               return cell !== null && cell !== CellType.Wall && cell !== 'Visited';
-            })
+            }),
           );
         }
         // All cells are either Walls or marked as visited
         expect(_.flatten(maze).filter((c) => c !== CellType.Wall && c !== 'Visited')).toHaveLength(0);
-      })
+      }),
     );
   });
 });

examples/003-misc/mazeGenerator/src/mazeGenerator.ts

@@ -21,7 +21,7 @@ const mazeGeneratorInternal = (
   mrng: Random,
   dim: Dimension,
   startPt: Point,
-  endPt: Point
+  endPt: Point,
 ): { maze: CellType[][]; hasPathLeadingToTheEnd: boolean } => {
   // Initialize grid
   const maze: CellType[][] = [...Array(dim.height)].map((_) => [...Array(dim.width)].fill(CellType.Wall));