🎨 [BREAKING] refactor: add 'I' as prefix name for interface types

Author: guanghechen

Diff for: packages/binary-index-tree/src/tree1-mod.ts

@@ -1,4 +1,4 @@
-import type { BinaryIndexTree } from './types'
+import type { IBinaryIndexTree } from './types'
 import { lowbit } from './util'
 
 /**
@@ -16,7 +16,7 @@ import { lowbit } from './util'
 export function createBinaryIndexTree1Mod<T extends number | bigint>(
   ZERO: T,
   MOD: T,
-): BinaryIndexTree<T> {
+): IBinaryIndexTree<T> {
   let _size = 0
   const _nodes: T[] = [ZERO]
   return { init, add, query }

Diff for: packages/binary-index-tree/src/tree1.ts

@@ -1,4 +1,4 @@
-import type { BinaryIndexTree } from './types'
+import type { IBinaryIndexTree } from './types'
 import { lowbit } from './util'
 
 /**
@@ -9,7 +9,7 @@ import { lowbit } from './util'
  * @param ZERO    0 for number, 0n for bigint.
  * @returns
  */
-export function createBinaryIndexTree1<T extends number | bigint>(ZERO: T): BinaryIndexTree<T> {
+export function createBinaryIndexTree1<T extends number | bigint>(ZERO: T): IBinaryIndexTree<T> {
   let _size = 0
   const _nodes: T[] = [ZERO]
   return { init, add, query }

Diff for: packages/binary-index-tree/src/tree2-mod.ts

@@ -1,4 +1,4 @@
-import type { BinaryIndexTree } from './types'
+import type { IBinaryIndexTree } from './types'
 import { lowbit } from './util'
 
 /**
@@ -16,7 +16,7 @@ import { lowbit } from './util'
 export function createBinaryIndexTree2Mod<T extends number | bigint>(
   ZERO: T,
   MOD: T,
-): BinaryIndexTree<T> {
+): IBinaryIndexTree<T> {
   let _size = 0
   const _nodes: T[] = [ZERO]
   return { init, add, query }

Diff for: packages/binary-index-tree/src/tree2.ts

@@ -1,4 +1,4 @@
-import type { BinaryIndexTree } from './types'
+import type { IBinaryIndexTree } from './types'
 import { lowbit } from './util'
 
 /**
@@ -9,7 +9,7 @@ import { lowbit } from './util'
  * @param ZERO    0 for number, 0n for bigint.
  * @returns
  */
-export function createBinaryIndexTree2<T extends number | bigint>(ZERO: T): BinaryIndexTree<T> {
+export function createBinaryIndexTree2<T extends number | bigint>(ZERO: T): IBinaryIndexTree<T> {
   let _size = 0
   const _nodes: T[] = [ZERO]
 

Diff for: packages/binary-index-tree/src/types.ts

@@ -8,7 +8,7 @@
  * Tree. Its advantage is that the complexity constant is smaller, and the
  * implementation is simpler and easier to understand.
  */
-export interface BinaryIndexTree<T extends number | bigint> {
+export interface IBinaryIndexTree<T extends number | bigint> {
   /**
    * Initialize the binary search tree.
    *

Diff for: packages/calculate/src/calculate.ts

@@ -1,13 +1,13 @@
 import { TokenSymbol, idx, ll1Table, sddTable } from './constant'
-import type { Operations } from './operations'
+import type { IOperations } from './operations'
 import { bigintOperations, decimalOperations, integerOperations } from './operations'
 
-export type Calculate<T extends number | bigint> = (expression: string) => T
+export type ICalculate<T extends number | bigint> = (expression: string) => T
 
 export function createCalculate<T extends number | bigint>(
-  operations: Operations<T>,
+  operations: IOperations<T>,
   resolveExpression?: (s: string) => string,
-): Calculate<T> {
+): ICalculate<T> {
   const { ZERO, parse, add, subtract, multiply, divide } = operations
   return function (rawExpression: string): T {
     const expression = resolveExpression == null ? rawExpression : resolveExpression(rawExpression)
@@ -136,16 +136,16 @@ export function createCalculate<T extends number | bigint>(
 }
 
 // Integer calculate.
-export const calculate: Calculate<number> = createCalculate<number>(integerOperations, s =>
+export const calculate: ICalculate<number> = createCalculate<number>(integerOperations, s =>
   s.replace(/[\s]+/g, ''),
 )
 
 // Decimal calculate.
-export const decimalCalculate: Calculate<number> = createCalculate<number>(decimalOperations, s =>
+export const decimalCalculate: ICalculate<number> = createCalculate<number>(decimalOperations, s =>
   s.replace(/[\s]+/g, '').replace(/(^|[^\d.])\./g, '$10.'),
 )
 
 // Bigint calculate.
-export const bigintCalculate: Calculate<bigint> = createCalculate<bigint>(bigintOperations, s =>
+export const bigintCalculate: ICalculate<bigint> = createCalculate<bigint>(bigintOperations, s =>
   s.replace(/[\s]+/g, ''),
 )

Diff for: packages/calculate/src/operations.ts

@@ -2,7 +2,7 @@ const DOT_CHAR_CODE = 46
 const ZERO_CHAR_CODE = 48
 const NINE_CHAR_CODE = 57
 
-export interface Operations<T extends number | bigint = number> {
+export interface IOperations<T extends number | bigint = number> {
   ZERO: T
   parse(s: string, start: number): [nextStart: number, value: T]
   add(a: T, b: T): T
@@ -11,7 +11,7 @@ export interface Operations<T extends number | bigint = number> {
   divide(a: T, b: T): T
 }
 
-export const integerOperations: Operations = {
+export const integerOperations: IOperations = {
   ZERO: 0,
   parse: (s, start) => {
     let result = 0
@@ -29,7 +29,7 @@ export const integerOperations: Operations = {
   divide: (a, b) => Math.floor(a / b),
 }
 
-export const decimalOperations: Operations = {
+export const decimalOperations: IOperations = {
   ZERO: 0,
   parse: (s, start) => {
     let i = start
@@ -52,7 +52,7 @@ export const decimalOperations: Operations = {
   divide: (a, b) => a / b,
 }
 
-export const bigintOperations: Operations<bigint> = {
+export const bigintOperations: IOperations<bigint> = {
   ZERO: 0n,
   parse: (s, start) => {
     let i = start

Diff for: packages/dinic/README.md

@@ -69,6 +69,12 @@ The **Dinic** algorithm is an algorithm for solving network flow problems.
   yarn add @algorithm.ts/dinic
   ```
 
+* deno
+
+  ```typescript
+  import { createDinic } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/dinic/src/index.ts'
+  ```
+
 ## Usage
 
 * Codeforces contest 1082 Problem G (https://codeforces.com/contest/1082/problem/G):

Diff for: packages/dinic/__test__/__snapshots__/codeforce.spec.ts.snap

@@ -3,7 +3,6 @@
 exports[`codeforces contest 1082 g 1`] = `
 Array [
   "edgeTot",
-  "dist",
   "edges",
   "G",
 ]