让你脑洞大开的AI交流方式

qsort: (list@list) => {    [] -> []  // 空列表模式    [pivot, ...rest] -> {        rest        <> filter(_ <= pivot@)  // 左侧处理        <> qsort        <> merge (            [pivot],            rest            <> filter(_ > pivot@)            <> qsort        )    }}
// 执行示例[9,3,7,5] <> qsort <> print  // 输出[3,5,7,9]

bsearch: (target@num, arr@list) => {    // 模式匹配解构区间    (low@num, high@num) -> {        low > high@ => -1        _ -> {            mid = (low + high) // 2            arr[mid@] -> {                _ == target@ => mid                _ < target@ => (mid+1, high@) <> recur  // 递归调用                _ > target@ => (low@, mid-1) <> recur            }        }    } @ (0, arr<>len-1)  // 初始区间}
// 执行示例[2,4,6,8,10] <> bsearch(6) <> print  // 输出2

kmp: (pattern@str, text@str) => {    // 构建部分匹配表    pmt = pattern    <> chars@    <> scan (0, [0]@list) {        (i@num, (len, table)@tuple) -> {            len > 0 and pmt[i@] != pmt[len@]                 => (table[len-1@], table)            pmt[i@] == pmt[len@]                 => (len+1, table<>append(len+1))            _ => (0, table<>append(0))        }    } <> last  // 取最终PMT        // 匹配阶段    text <> chars@    <> scan (0, 0) {        (i@num, (j, pos)@tuple) -> {            j == pattern<>len => break pos - j@            chars[i@] == pmt[j@]                 => (i+1, j+1)            j > 0 => (i, pmt[j-1@])            _ => (i+1, 0)        }    } <> or(-1)}
// 执行示例"ABABDABACD" <> kmp("ABAC") <> print  // 输出6

// 传统方式process3(process2(process1(data)))
// FlowScript方式data <> process1 <> process2 <> process3// 或反向执行process3 < process2 < process1 < data

arr = [1,3,5,7,9]arr[// 取中位数5arr[^1]   // 倒数第一个元素9arr[2..// 从索引2到中间：[5,7]

factorial: (n@num) => {    0|1 -> 1    _ -> n * (n-1)<>factorial}

price@num = 99.9     // 数值类型name@str = "Flow"    // 字符串类型matrix@grid = [[1,2],[3,4]]  // 二维网格