是否有一个列表模块功能就像解压缩变压器一样

Question

下面是我会在标准库中找到的东西吗？

split transformer1 ([], []) [("Foo", 1); ("Bar", 2); ("FooBar", 3)];; 
> val it : string list * int list = (["FooBar"; "Bar"; "Foo"], [3; 2; 1]) 

这里是我的执行

let split transformer defval stream = 
    let rec split' s acc = 
     match s with 
      | [] -> acc 
      | x::xs -> split' xs (transformer x acc) 
    split' stream defval 

let transformer1 (key, item) (akey, aitem) = (key::akey, item::aitem) 
let transformer2 (key, item) (akey) = (key::akey) 
let transformer3 (key, item) (a1, a2, a3) = (key::a1, item::a2, (item + 1)::a3) 

split transformer1 ([], []) [("Foo", 1); ("Bar", 2); ("FooBar", 3)];; 
split transformer2 ([]) [("Foo", 1); ("Bar", 2); ("FooBar", 3)];; 
split transformer3 ([], [], []) [("Foo", 1); ("Bar", 2); ("FooBar", 3)];; 

Answer 1

据我所知，你已经彻底改造List.fold。以下是如何与fold重现结果：

[("Foo", 1); ("Bar", 2); ("FooBar", 3)] 
|> List.fold (fun (akey, aitem) (key, item) -> key::akey, item::aitem) ([], []) 

[("Foo", 1); ("Bar", 2); ("FooBar", 3)] 
|> List.fold (fun (akey) (key, item) -> key::akey) [] 

[("Foo", 1); ("Bar", 2); ("FooBar", 3)] 
|> List.fold (fun (a1, a2, a3) (key, item) -> key::a1, item::a2, (item + 1)::a3) ([], [], []) 

还有的（潜在懒洋洋地评估）序列的Seq.fold功能。