我正在寻找一种方法来将这个列表简化为布尔值。原文如下:
let ones = [1;1;1;1]
let twos = [2;2;2;2]
let bad = [1;2;3]
let isAllOnes = List.forall (fun op -> op = 1)
let isAllTwos = List.forall (fun op -> op = 2)
let isOneOrTwo ops = isAllOnes ops || isAllTwos ops
isOneOrTwo ones |> should be True
isOneOrTwo twos |> should be True
isOneOrTwo bad |> should be False我正在尝试使用一种reduce来重构它。如下所示:
let isOneOrTwo ops = [isAllOnes; isAllTwos] |> List.tryFind (fun acc -> acc ops)
(isOneOrTwo ones).IsSome |> should be True
(isOneOrTwo twos).IsSome |> should be True
(isOneOrTwo bad).IsSome |> should be False我不喜欢isOneOrTwo变成一种选择。我真的希望将列表减少为布尔值,这样我的断言就可以看起来像这样:
isOneOrTwo ones |> should be True
isOneOrTwo twos |> should be True
isOneOrTwo bad |> should be False有人知道怎么做到这一点吗?List.reduce无法工作,因为类型不同。
发布于 2012-05-04 01:39:34
用List.exists替换List.tryFind
let ones = [1;1;1;1]
let twos = [2;2;2;2]
let bad = [1;2;3]
let allOnes = List.forall ((=) 1)
let allTwos = List.forall ((=) 2)
let isOneOrTwo l = [allOnes; allTwos] |> List.exists (fun f -> f l)
printfn "%A " (isOneOrTwo ones) // true
printfn "%A " (isOneOrTwo twos) // true
printfn "%A " (isOneOrTwo bad) // falsehttps://stackoverflow.com/questions/10436470
复制相似问题