Wolfram/DiagrammaticComputation

Wolfram`DiagrammaticComputation`

DiagramSplit

DiagramSplit [d,n]
	repartitions the ports of d so that its first n ports become outputs and the remaining ones inputs.

DiagramSplit [d]
	turns every port into an output, making d a state.

DiagramSplit [d,n,dualQ]
	controls whether the moved ports are dualised.

DiagramSplit [d,n,dualQ,flipQ]
	bends the moved wires around the other side.

Details and Options

▪

Ports are counted in the flattened order: outputs first, then inputs. A negative

n

counts back from the total arity,

-

Infinity

makes every port an input, and the default

Infinity

makes every port an output.

▪

The repartitioning composes

d

with a pure wire diagram that bends the moved ports around, so the underlying process is unchanged — this is the diagrammatic analogue of currying a function or transposing tensor legs between covariant and contravariant positions.

▪

With

dualQ

set to

False

, the moved ports keep their direction and are wrapped in

PortDual

instead.

▪

With

flipQ

set to

True

, the bending wires pass on the opposite side of the retained ports.

Examples

(2)

Basic Examples

(1)

Make all five ports of a process into outputs:

In[1]:=

DiagramSplit



Diagram

[A,{a,b,c},{x,y}]

Out[1]=

Repartition to three outputs and two inputs:

In[2]:=

DiagramSplit



Diagram

[A,{a,b,c},{x,y}],3

Out[2]=

Turn the process into a costate, with every port an input:

In[3]:=

DiagramSplit



Diagram

[A,{a,b,c},{x,y}],0

Out[3]=

Properties & Relations

(1)



SeeAlso

▪

▪

▪

▪

RelatedGuides

▪

Diagrams

""