Function calculateInsertPosition

src/renderer/src/utils/treeUtils.ts:165–200

(
  items: T[],
  folders: ConfigFolder[],
  afterItemId?: string
)

// ==================== 拖拽排序辅助 ====================

export function calculateInsertPosition<T extends TreeNode>(
  items: T[],
  folders: ConfigFolder[],
  afterItemId?: string
): { parentFolderId?: string; order: number } {
  if (!afterItemId) {
    return { order: getMaxOrderAtLevel(items) + 1 }
  }

  const afterItem = items.find((i) => i.id === afterItemId)
  const afterFolder = folders.find((f) => f.id === afterItemId)
  const target = afterItem || afterFolder

  if (!target) {
    return { order: getMaxOrderAtLevel(items) + 1 }
  }

  const parentFolderId = target.parentFolderId
  const siblingItems = items.filter(
    (i) => i.parentFolderId === parentFolderId && i.id !== afterItemId
  )
  const siblingFolders = folders.filter(
    (f) => f.parentFolderId === parentFolderId && f.id !== afterItemId
  )

  const allSiblings = [...siblingItems, ...siblingFolders].sort(
    (a, b) => (a.order ?? 0) - (b.order ?? 0)
  )

  const targetOrder = target.order ?? 0
  const nextItem = allSiblings.find((item) => (item.order ?? 0) > targetOrder)

  const order = nextItem ? (targetOrder + (nextItem.order ?? 0)) / 2 : targetOrder + 1

  return { parentFolderId, order }
}

export function reorderItems<T extends TreeNode>(
  items: T[],