github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-11-25 11:04:00 +03:00
Code Issues Projects Releases Wiki Activity

Define ana using the backwards application operator to clarify dataflow.

Browse Source
This commit is contained in:
Rob Rix 2015-10-22 17:08:17 -04:00
parent d6a9be0794
commit f0379f421b
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
prototype/Doubt/Free.swift
View File

@ -115,7 +115,7 @@ extension Free {
///
/// Unfolds a tree bottom-up by recursively applying `transform` to a series of values starting with `seed`. Since `Syntax.Leaf` does not recur, this will halt when it has produced leaves for every branch.
public static func ana<Seed>(transform: Seed -> Syntax<Seed, Leaf>)(_ seed: Seed) -> Free {
return (Roll <<< { $0.map(ana(transform)) } <<< transform)(seed)
return (Roll <<< { $0.map(ana(transform)) } <<< transform) <| seed
}
}