cartesian.ts — tailwindcss Source File

Architecture documentation for cartesian.ts, a typescript file in the tailwindcss codebase. 0 imports, 1 dependents.

File typescript Oxide Scanner 1 dependents 1 functions

Entity Profile

Oxide→ Scanner→ cartesian.ts — tailwindcss Source File

Dependency Diagram

graph LR
  4d385060_88c8_95d1_bd14_4eb53b36b689["cartesian.ts"]
  a57d0003_9aa7_26da_25b8_b100327975d6["canonicalize-candidates.test.ts"]
  a57d0003_9aa7_26da_25b8_b100327975d6 --> 4d385060_88c8_95d1_bd14_4eb53b36b689
  style 4d385060_88c8_95d1_bd14_4eb53b36b689 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

type CartesianInput = readonly unknown[][]

type CartesianResult<T extends CartesianInput> = T extends [
  infer Head extends unknown[],
  ...infer Tail extends CartesianInput,
]
  ? [Head[number], ...CartesianResult<Tail>]
  : []

export function* cartesian<T extends CartesianInput>(...sets: T): Generator<CartesianResult<T>> {
  let n = sets.length
  if (n === 0) return

  // If any input set is empty, the Cartesian product is empty.
  if (sets.some((set) => set.length === 0)) {
    return
  }

  // Index lookup
  let idx = Array(n).fill(0)

  while (true) {
    // Compute current combination
    let result = [] as CartesianResult<T>
    for (let i = 0; i < n; i++) {
      result[i] = sets[i][idx[i]]
    }
    yield result

    // Update index vector
    let k = n - 1
    while (k >= 0) {
      idx[k]++
      if (idx[k] < sets[k].length) {
        break
      }
      idx[k] = 0
      k--
    }

    if (k < 0) {
      return
    }
  }
}