d6df056687
- 数据层：messages 表增加 part_type 字段，新建 file_versions 表支持版本追踪 - 后端：saveWorkspace 版本追踪、saveAgentOutput 源头分离、generateBriefMessage 成员简报 - 后端：applyDocumentEdit 增量编辑、buildWorkflowStep phase-aware 工作流引擎 - API：文件版本查询/回退接口 - 前端：part_type 驱动渲染，产物面板版本历史 - 新增写手团队（主编/搜索员/策划编辑/合规审查员）配置 - store 模块、scheduler 模块、web-search skill Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
65 lines
1.2 KiB
JavaScript
65 lines
1.2 KiB
JavaScript
'use strict'
|
|
|
|
/**
|
|
* Expose `arrayFlatten`.
|
|
*/
|
|
module.exports = arrayFlatten
|
|
|
|
/**
|
|
* Recursive flatten function with depth.
|
|
*
|
|
* @param {Array} array
|
|
* @param {Array} result
|
|
* @param {Number} depth
|
|
* @return {Array}
|
|
*/
|
|
function flattenWithDepth (array, result, depth) {
|
|
for (var i = 0; i < array.length; i++) {
|
|
var value = array[i]
|
|
|
|
if (depth > 0 && Array.isArray(value)) {
|
|
flattenWithDepth(value, result, depth - 1)
|
|
} else {
|
|
result.push(value)
|
|
}
|
|
}
|
|
|
|
return result
|
|
}
|
|
|
|
/**
|
|
* Recursive flatten function. Omitting depth is slightly faster.
|
|
*
|
|
* @param {Array} array
|
|
* @param {Array} result
|
|
* @return {Array}
|
|
*/
|
|
function flattenForever (array, result) {
|
|
for (var i = 0; i < array.length; i++) {
|
|
var value = array[i]
|
|
|
|
if (Array.isArray(value)) {
|
|
flattenForever(value, result)
|
|
} else {
|
|
result.push(value)
|
|
}
|
|
}
|
|
|
|
return result
|
|
}
|
|
|
|
/**
|
|
* Flatten an array, with the ability to define a depth.
|
|
*
|
|
* @param {Array} array
|
|
* @param {Number} depth
|
|
* @return {Array}
|
|
*/
|
|
function arrayFlatten (array, depth) {
|
|
if (depth == null) {
|
|
return flattenForever(array, [])
|
|
}
|
|
|
|
return flattenWithDepth(array, [], depth)
|
|
}
|