`星期${'日一二三四五六'.charAt(new Date().getDay())}`

/**
 * 队列执行函数
 * @param asyncFunction 异步函数
 * @param items  参数数组
 * @param maxConcurrent  最大并发数
 * @returns 结果数组
 */
async executeAsyncFunctionInQueue<T, K>(
  asyncFunction: (item: K, index: number) => Promise<T>,
  items: K[],
  maxConcurrent: number = 10
): Promise<Array<T | Error>> {
  const queue = [...items]
  const results: Array<T | Error> = new Array(items.length)
  const executing = new Set<Promise<void>>()

  const executeNext = async (): Promise<void> => {
    if (queue.length === 0) return

    const currentIndex = items.length - queue.length
    const item = queue.shift()!

    const promise = (async () => {
      try {
        const result = await asyncFunction(item, currentIndex)
        results[currentIndex] = result
      } catch (error) {
        results[currentIndex] =
          error instanceof Error ? error : new Error(String(error))
      }
    })()

    executing.add(promise)
    await promise
    executing.delete(promise)

    if (queue.length > 0) {
      await executeNext()
    }
  }

  const workers = Array.from(
    { length: Math.min(maxConcurrent, queue.length) },
    () => executeNext()
  )

  await Promise.all(workers)
  return results
}

/**
 * 获取多个经纬度的中间坐标
 * @param {{lat: number, lng: number}[]} points 多个经纬度点
 * @returns {{lat: number, lng: number}} 中间坐标
 */
export function getPointsCalculateCenter(points) {
  const point_num = points.length; //坐标点个数
  let X = 0,
    Y = 0,
    Z = 0;
  for (let i = 0; i < points.length; i++) {
    if (!points[i]) {
      continue;
    }
    const point = points[i];
    const lat = (point.lat * Math.PI) / 180;
    const lng = (point.lng * Math.PI) / 180;
    const x = Math.cos(lat) * Math.cos(lng);
    const y = Math.cos(lat) * Math.sin(lng);
    const z = Math.sin(lat);
    X += x;
    Y += y;
    Z += z;
  }
  X = X / point_num;
  Y = Y / point_num;
  Z = Z / point_num;
  const tmp_lng = Math.atan2(Y, X);
  const tmp_lat = Math.atan2(Z, Math.sqrt(X * X + Y * Y));
  return { lat: (tmp_lat * 180) / Math.PI, lng: (tmp_lng * 180) / Math.PI };
}

/**
 * 获取坐标的是否在围栏内
 * @param { { lat: number, lng: number } } point 坐标
 * @param { { lat: number, lng: number }[] } APoints 围栏
 * @returns { boolean } 在围栏内返回true，否则false
 */
export function isPointInPolygon(point, APoints) {
  const { lat, lng } = point
  let iSum = 0
  let dLon1, dLon2, dLat1, dLat2, dLon
  if (APoints.length < 3) return false
  const iCount = APoints.length
  for (let i = 0; i < iCount; i++) {
    if (i == iCount - 1) {
      dLon1 = APoints[i].lng
      dLat1 = APoints[i].lat
      dLon2 = APoints[0].lng
      dLat2 = APoints[0].lat
    } else {
      dLon1 = APoints[i].lng
      dLat1 = APoints[i].lat
      dLon2 = APoints[i + 1].lng
      dLat2 = APoints[i + 1].lat
    }
    //以下语句判断A点是否在边的两端点的水平平行线之间，在则可能有交点，开始判断交点是否在左射线上
    if ((lat >= dLat1 && lat < dLat2) || (lat >= dLat2 && lat < dLat1)) {
      if (Math.abs(dLat1 - dLat2) > 0) {
        //得到 A点向左射线与边的交点的x坐标：
        dLon = dLon1 - ((dLon1 - dLon2) * (dLat1 - lat)) / (dLat1 - dLat2)
        if (dLon < lng) iSum++
      }
    }
  }
  if (iSum % 2 != 0) return true
  return false
}