Next: LinkingAboveStart, Previous: LinkingAboveBelow1or2Start, Up: Principles list
principle.linkingAboveEnd
D1
, D2
, D3
End: vec(label(D1) set(label(D2)))
End: ^.D3.entry.end
LinkingAboveEnd
(priority 100)
This principle assumes that the Graph principle (Graph) is used
on dimensions D1
and D2
.1
This principle is from the family of linking principles.
For all edges from v to v' labeled l on D1
,
it stipulates the constraint:
End
(l) is not empty, then on D2
,
v' must be above v, and the outgoing edge of v'
must be in End
(l)
End
(l) specifies the direction and endpoint of the
path from v to v' on D2
.
Here is the definition of the LinkingAboveEnd
edge
constraint functor:
%% Copyright 2001-2008 %% by Ralph Debusmann <rade@ps.uni-sb.de> (Saarland University) and %% Denys Duchier <duchier@ps.uni-sb.de> (LIFO, Orleans) and %% Jorge Marques Pelizzoni <jpeliz@icmc.usp.br> (ICMC, Sao Paulo) and %% Jochen Setz <info@jochensetz.de> (Saarland University) %% functor import % System(show) Helpers(checkModel) at 'Helpers.ozf' Opti(isIn) at 'Opti.ozf' export Constraint define proc {Constraint Nodes G Principle FD FS Select} DVA2DIDA = Principle.dVA2DIDA ArgRecProc = Principle.argRecProc %% D1DIDA = {DVA2DIDA 'D1'} D2DIDA = {DVA2DIDA 'D2'} DIDA2LabelLat = G.dIDA2LabelLat D1LabelLat = {DIDA2LabelLat D1DIDA} D2LabelLat = {DIDA2LabelLat D2DIDA} D1LAs = D1LabelLat.constants D2LAs = D2LabelLat.constants in if {Helpers.checkModel 'LinkingAboveEnd.oz' Nodes [D1DIDA#daughtersL D2DIDA#downL]} then for Node1 in Nodes do for Node2 in Nodes do for LA in D1LAs do if {Not {Opti.isIn Node2.index Node1.D1DIDA.model.daughtersL.LA}=='out'} then %% Linking Above and Endpoint %% m -l->1 d => %% End(l) neq emptyset => %% d -End(l)->2 ->*2 m EndLALMRec = {ArgRecProc 'End' o('^': Node1)} EndLM = EndLALMRec.LA %% Node2D2DownLMs = {Map D2LAs fun {$ LA} Node2.D2DIDA.model.downL.LA end} Node2D2DownLM = {Select.union Node2D2DownLMs EndLM} in {FD.impl {FS.reified.include Node2.index Node1.D1DIDA.model.daughtersL.LA} {FD.impl {FD.nega {FS.reified.equal EndLM FS.value.empty}} {FS.reified.include Node1.index Node2D2DownLM}} 1} end end end end end end end