단점 : F #에서 시퀀스를위한 연산자?
문제
시퀀스를 목록으로 변환 할 필요가없는 더 나은 코드가 있습니까?
let rec addentry map keys =
match keys with
| ((i,j) :: tail) -> Map.add (i,j) ((inputd.[i]).[j]) (addentry map tail)
| ([]) -> map
addentry Map.empty (Cartesian keys1 keys2 |> Seq.toList)
. 해결책
This is a great place to use Seq.fold
. It collapses a collection down into a single value.
Cartesian keys1 keys2
|> Seq.fold (fun map (i, j) ->
let value = (inputd.[i]).[j]
Map.add (i, j) value map) Map.empty
다른 팁
Cartesian keys1 keys2
|> Seq.map (fun (i, j) -> ((i, j), (inputd.[i]).[j]))
|> Map.ofSeq
As a complement to the previous answers, if you want to be able to pattern-match sequences, you can define an active pattern:
let (|Cons|Nil|) s =
if Seq.isEmpty s then
Nil
else
Cons(Seq.head s, Seq.skip 1 s)
let rec addentry map keys =
match keys with
| Cons((i,j), tail) -> Map.add (i,j) ((inputd.[i]).[j]) (addentry map tail)
| Nil -> map
제휴하지 않습니다 StackOverflow