-
Notifications
You must be signed in to change notification settings - Fork 4
/
AtomPlan.scala
135 lines (108 loc) · 5.84 KB
/
AtomPlan.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
package gallia.plans
import scala.util.chaining._
import aptus._
import gallia._
import gallia.dag._
// ===========================================================================
case class AtomPlan(dag: DAG[AtomNode]) {
override def toString: String = formatSuccinct1
def formatDefault : String = dag.formatDefault
def formatSuccinct1: String = dag.formatDefault2(x => s"${x.id}:${x.atom.formatSuccinct1}")
def formatDot = s"""
digraph {
${dag
.nodes
.map { node => s"${node.id.quote} [label=${node.formatSuccinct1.quote}]" }
.joinln}
${dag.edges.map{ case (f, t) => s"${f.quote} -> ${t.quote}"}.joinln}
}"""
// ---------------------------------------------------------------------------
private def nestingPlaceholderRootIds(dag: DAG[AtomNode]): Seq[RootId] =
dag.roots.filter(_.atom == NestingDataPlaceholder).map(_.id)
// ===========================================================================
def naiveRun(missingInputs: Map[RootId, NDT] = Map()): NDT = // TODO: t201027130649 - abstract runner strategy
if (dag.isChain)
dag
.nodes // TODO: t210614142629 - confirm/enforce guaranteed topologically sorted if chain?
.pipe(AtomNodes.apply)
.pruneChain
.pipe(ChainDataRun(missingInputs))
else
NaiveGraphDataRun(missingInputs)(dag)
// ===========================================================================
@deprecated object V1 { // to be phased out in favor of V2's approach
def naiveRunUU_(missingInput: Option[Obj]): Option[Obj] = missingInput.map(naiveRunUU)
def naiveRunUU (missingInput: Obj ): Obj = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.O(missingInput))).forceO
def naiveRunZZ_(missingInput: Option[Objs]): Option[Objs] = missingInput.map(naiveRunZZ)
def naiveRunZZ (missingInput: Objs ): Objs = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.Z(missingInput))).forceZ
// ---------------------------------------------------------------------------
def naiveRunUZ_(missingInput: Option[Obj]): Option[Objs] = missingInput.map(naiveRunUZ)
def naiveRunUZ (missingInput: Obj ): Objs = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.O(missingInput))).forceZ
def naiveRunZU_(missingInput: Option[Objs]): Option[Obj] = missingInput.map(naiveRunZU)
def naiveRunZU (missingInput: Objs ): Obj = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.Z(missingInput))).forceO
// ---------------------------------------------------------------------------
def naiveRunUV_(missingInput: Option[Obj]): AnyValue = missingInput.map(naiveRunUV)
def naiveRunUV (missingInput: Obj ): AnyValue = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.O(missingInput))).forceVle
def naiveRunZV_(missingInput: Option[Objs]): Option[AnyValue] = missingInput.map(naiveRunZV)
def naiveRunZV (missingInput: Objs ): AnyValue = naiveRun(Map(nestingPlaceholderRootIds(dag).force.one -> NDT.Z(missingInput))).forceVle
// ---------------------------------------------------------------------------
def naiveRunUu2U(missingInput1: Obj, missingInput2: Obj): Obj = // only if rootIds are ordered... TODO: ok?
nestingPlaceholderRootIds(dag)
.force.tuple2
.pipe { case (rootId1, rootId2) =>
naiveRun(
Map(
rootId1 -> NDT.O(missingInput1),
rootId2 -> NDT.O(missingInput2)))
.forceO }
}
// ===========================================================================
object V2 {
def forceNestingDataPlaceholderRootId: RootId = dag.roots.filter(_.atom == NestingDataPlaceholder).map(_.id).force.one
// ---------------------------------------------------------------------------
def naiveRunUU(missingInput: Any): Obj =
Map(forceNestingDataPlaceholderRootId -> NDT.anyToO(missingInput))
.pipe(naiveRun)
.forceO
// ---------------------------------------------------------------------------
def naiveRunUU_(missingInput: Any): Option[Obj] =
NDT.anyToO_(missingInput)
.map { input =>
Map(forceNestingDataPlaceholderRootId -> input)
.pipe(naiveRun)
.forceO }
// ---------------------------------------------------------------------------
def naiveRunZZ(missingInput: Any): Seq[Obj] =
Map(forceNestingDataPlaceholderRootId -> NDT.anyToZ(missingInput))
.pipe(naiveRun)
.forceZ
.toListAndTrash
// ---------------------------------------------------------------------------
def naiveRunZZ_(missingInput: Any): Option[Seq[Obj]] =
NDT.anyToZ_(missingInput)
.map { input =>
Map(forceNestingDataPlaceholderRootId -> input)
.pipe(naiveRun)
.forceZ
.toListAndTrash }
}
// ===========================================================================
// used by forXs
def chainU: Seq[AtomUU] = dag.kahnTraverseNodes.map(_.atom).map(_.asInstanceOf[AtomUU])
def chainZ: Seq[AtomZZ] = dag.kahnTraverseNodes.map(_.atom).map(_.asInstanceOf[AtomZZ])
}
// ===========================================================================
object AtomPlan {
def stitchAll(atomPlans: Seq[AtomPlan]): AtomPlan =
atomPlans
.map(_.dag)
.map(_.exciseAllFromChain(_.isBar))
.reduceLeft { (previous, current) =>
val previousLeaf = previous.leaveIds.force.one
val currentRoot = current .rootIds .force.one
current.mergeDisjointContinuous(
previous)(
previousLeaf -> currentRoot) }
.pipe(AtomPlan.apply)
}
// ===========================================================================