30 lines
2.3 KiB
JSON
30 lines
2.3 KiB
JSON
|
{
|
|||
|
|
"projectId": 55,
|
|||
|
|
"generationId": "codegen_ad3ea22cd7cf49deb1370f2f050ef554",
|
|||
|
|
"language": "C++",
|
|||
|
|
"status": "completed",
|
|||
|
|
"fileIds": [
|
|||
|
|
877
|
|||
|
|
],
|
|||
|
|
"outputDir": "/app/agents/ai_agents/project-files/codegen-runs/codegen_ad3ea22cd7cf49deb1370f2f050ef554",
|
|||
|
|
"relativeOutputDir": "codegen-runs/codegen_ad3ea22cd7cf49deb1370f2f050ef554",
|
|||
|
|
"generatedFiles": [
|
|||
|
|
"CMakeLists.txt",
|
|||
|
|
"README.md",
|
|||
|
|
"events.ndjson",
|
|||
|
|
"include/app.hpp",
|
|||
|
|
"src/app.cpp",
|
|||
|
|
"src/main.cpp",
|
|||
|
|
"tests/basic_test.cpp"
|
|||
|
|
],
|
|||
|
|
"analysisSummary": "{\n \"业务目标\": \"实现三种经典排序算法（冒泡排序、快速排序、选择排序），能够对整型数组进行升序排列。\",\n \"功能清单\": [\n \"冒泡排序函数：通过相邻元素比较和交换，将最大元素逐步‘冒泡’至数组末尾。\",\n \"快速排序函数：采用分治策略，选取基准元素将数组划分为左右两部分并递归排序。\",\n \"选择排序函数：每轮从未排序部分选出最小元素，与未排序首位交换位置。\"\n ],\n \"数据结构\": [\n \"int数组：用于存储待排序的整数序列。\",\n \"函数参数包含数组指针和数组长度（或使用std::vector<int>）\"\n ],\n \"接口或命令\": [\n \"void bubbleSort(int arr[], int n);\",\n \"void quickSort(int arr[], int low, int high);\",\n \"void selectionSort(int arr[], int n);\"\n ],\n \"约束\": [\n \"使用C++语言实现。\",\n \"输入为整型数组，支持空数组或单元素数组。\",\n \"排序结果为非降序（升序）。\",\n \"不允许使用标准库中的排序函数（如std::sort）。\"\n ],\n \"测试建议\": [\n \"测试空数组和单元素数组的边界情况。\",\n \"测试已有序数组、逆序数组、含重复元素数组。\",\n \"验证排序后数组是否为升序且元素完整。\",\n \"可添加断言或打印数组前后状态辅助验证。\"\n ]\n}",
|
|||
|
|
"eventLogFile": "/app/agents/ai_agents/project-files/codegen-runs/codegen_ad3ea22cd7cf49deb1370f2f050ef554/events.ndjson",
|
|||
|
|
"repoSettings": {
|
|||
|
|
"username": "root",
|
|||
|
|
"password": "pAssW0rd",
|
|||
|
|
"repoUrl": "http://47.108.255.216:3000/root/sortDemo.git",
|
|||
|
|
"branch": "main"
|
|||
|
|
},
|
|||
|
|
"repoUrl": "http://47.108.255.216:3000/root/sortDemo.git",
|
|||
|
|
"branch": "main"
|
|||
|
|
}
|