Uses of Class
org.bigraphs.framework.core.impl.BigraphEntity.NodeEntity

Packages that use BigraphEntity.NodeEntity

Package	Description
org.bigraphs.framework.core
org.bigraphs.framework.core.impl
org.bigraphs.framework.core.impl.pure
org.bigraphs.framework.simulation.matching.pure

Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core

Methods in org.bigraphs.framework.core that return BigraphEntity.NodeEntity

Modifier and Type	Method	Description
<C extends Control<?, ?>> BigraphEntity.NodeEntity<C>	Bigraph.getNodeOfPort(BigraphEntity.Port port)
<C extends Control<?, ?>> BigraphEntity.NodeEntity<C>	BigraphDelegator.getNodeOfPort(BigraphEntity.Port port)
<C extends Control<?, ?>> BigraphEntity.NodeEntity<C>	ElementaryBigraph.getNodeOfPort(BigraphEntity.Port port)	Always returns null, since elementary bigraphs are node-free bigraphs

Methods in org.bigraphs.framework.core that return types with arguments of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
<C extends Control<?, ?>> Collection<BigraphEntity.NodeEntity<C>>	Bigraph.getNodes()
Set<BigraphEntity.NodeEntity>	BigraphBuilderSupport.InstanceParameter.getNodes()
<C extends Control<?, ?>> Collection<BigraphEntity.NodeEntity<C>>	BigraphDelegator.getNodes()
<C extends Control<?, ?>> Collection<BigraphEntity.NodeEntity<C>>	ElementaryBigraph.getNodes()

Methods in org.bigraphs.framework.core with parameters of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
<C extends Control<?, ?>> boolean	Bigraph.areConnected(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2)	Check if two nodes are connected to each other.
<C extends Control<?, ?>> boolean	BigraphDelegator.areConnected(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2)
final <C extends Control<?, ?>> boolean	ElementaryBigraph.areConnected(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2)
default <C extends Control<?, ?>> Collection<BigraphEntity.Link>	Bigraph.getIncidentLinksOf(BigraphEntity.NodeEntity<C> node)	Returns all incidents links (i.e., edges and outer names) for the given node
<C extends Control<?, ?>> int	Bigraph.getPortCount(BigraphEntity.NodeEntity<C> node)	Get the number of "blocked/occupied" ports by links of a node.
<C extends Control<?, ?>> int	BigraphDelegator.getPortCount(BigraphEntity.NodeEntity<C> node)
<C extends Control<?, ?>> int	ElementaryBigraph.getPortCount(BigraphEntity.NodeEntity<C> node)
default <C extends Control<?, ?>> boolean	Bigraph.isActiveAtNode(BigraphEntity.NodeEntity<C> node)

Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core.impl

Methods in org.bigraphs.framework.core.impl that return BigraphEntity.NodeEntity

Modifier and Type	Method	Description
static @NonNull BigraphEntity.NodeEntity<? extends Control>	BigraphEntity.createNode(@NonNull org.eclipse.emf.ecore.EObject param, Control control)

Methods in org.bigraphs.framework.core.impl with parameters of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
int	BigraphEntity.NodeEntity.compareTo(BigraphEntity.NodeEntity<C> o)

Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core.impl.pure

Fields in org.bigraphs.framework.core.impl.pure with type parameters of type BigraphEntity.NodeEntity

Modifier and Type	Field	Description
protected final Map<String,BigraphEntity.NodeEntity>	PureBigraphBuilder.availableNodes

Methods in org.bigraphs.framework.core.impl.pure that return BigraphEntity.NodeEntity

Modifier and Type	Method	Description
BigraphEntity.NodeEntity<Control>	PureBigraphBuilder.Hierarchy.getLastCreatedNode()
<C extends Control<?, ?>> BigraphEntity.NodeEntity<C>	KindBigraph.getNodeOfPort(BigraphEntity.Port port)
BigraphEntity.NodeEntity<DynamicControl>	PureBigraph.getNodeOfPort(BigraphEntity.Port port)

Methods in org.bigraphs.framework.core.impl.pure that return types with arguments of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
Map<String,BigraphEntity.NodeEntity>	MutableBuilder.availableNodes()
<C extends Control<?, ?>> Collection<BigraphEntity.NodeEntity<C>>	KindBigraph.getNodes()
List<BigraphEntity.NodeEntity<DynamicControl>>	PureBigraph.getNodes()

Methods in org.bigraphs.framework.core.impl.pure with parameters of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
<C extends Control<?, ?>> boolean	KindBigraph.areConnected(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2)
<C extends Control<?, ?>> boolean	PureBigraph.areConnected(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2)
void	PureBigraphBuilder.checkIfNodeIsConnectable(BigraphEntity.NodeEntity<Control> node)	Checks whether a node's ports can be connected to a link (i.e., an edge or an outer name which in turn also includes inner names).
protected BigraphEntity.Edge	PureBigraphBuilder.connectByEdge(BigraphEntity.NodeEntity<Control>... nodes)
void	MutableBuilder.connectNodeToOuterName(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.OuterName outerName)
protected void	PureBigraphBuilder.connectNodeToOuterName(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.OuterName outerName)	Helper method to connect a node to an outer name.
void	MutableBuilder.connectNodeToOuterName2(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.OuterName outerName)	Performs no checking at all, only if the node is already connected to the given outer name.
void	MutableBuilder.connectToEdge(BigraphEntity.NodeEntity<Control> node, BigraphEntity.Edge theLink)
protected void	PureBigraphBuilder.connectToEdge(BigraphEntity.NodeEntity<Control> node, BigraphEntity.Edge edge)	no checks are done here... use PureBigraphBuilder.isConnectedWithLink(BigraphEntity.NodeEntity, EObject)
void	MutableBuilder.connectToLinkUsingIndex(BigraphEntity.NodeEntity<Control> node, BigraphEntity theLink, int customPortIndex)
protected void	PureBigraphBuilder.connectToLinkUsingIndex(BigraphEntity.NodeEntity<Control> node, BigraphEntity theLink, int customPortIndex)
void	MutableBuilder.disconnectPort(BigraphEntity.NodeEntity node, int portIndex)
<C extends Control<?, ?>> int	KindBigraph.getPortCount(BigraphEntity.NodeEntity<C> node)
<C extends Control<?, ?>> int	PureBigraph.getPortCount(BigraphEntity.NodeEntity<C> node)
protected boolean	PureBigraphBuilder.isConnectedWithLink(BigraphEntity.NodeEntity<Control> place, @Nullable org.eclipse.emf.ecore.EObject theLink)	Helper method to check if a given node is connected to the given link.
void	PureBigraphBuilder.linkNodeToInner(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.InnerName innerName)	Link a node with an inner name by an edge
void	PureBigraphBuilder.linkNodeToInner(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.InnerName... innerNames)	Link multiple inner names by an edge to one node

Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.simulation.matching.pure

Methods in org.bigraphs.framework.simulation.matching.pure that return types with arguments of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
Set<BigraphEntity.NodeEntity<?>>	IHSFilter.adj(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
Map<BigraphEntity.NodeEntity<Control<?,?>>,Float>	SubHypergraphIsoSearch.computeRanks()
org.eclipse.collections.api.map.MutableMap<BigraphEntity.NodeEntity<?>,List<BigraphEntity.NodeEntity<?>>>	SubHypergraphIsoSearch.getCandidates()
org.eclipse.collections.api.map.MutableMap<BigraphEntity.NodeEntity<?>,List<BigraphEntity.NodeEntity<?>>>	SubHypergraphIsoSearch.getCandidates()
Set<BigraphEntity.NodeEntity<?>>	IHSFilter.getOfNodesForHyperedgeWithLabel(BigraphEntity.Link he, String label, Bigraph<?> bigraph)

Methods in org.bigraphs.framework.simulation.matching.pure with parameters of type BigraphEntity.NodeEntity

Modifier and Type	Method	Description
Set<BigraphEntity.NodeEntity<?>>	IHSFilter.adj(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
boolean	IHSFilter.condition1(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Degree and label
boolean	IHSFilter.condition2(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	The number of adjacent nodes
boolean	IHSFilter.condition3(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Arity containment of hyperedges
boolean	IHSFilter.condition4(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Label matchings of hyperedges
int	IHSFilter.degree(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
Map<Integer,List<BigraphEntity.Link>>	IHSFilter.getIncidentHyperedges(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
String	IHSFilter.getLabel(BigraphEntity.NodeEntity<?> node)
int	IHSFilter.numOfadj(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)

Constructor parameters in org.bigraphs.framework.simulation.matching.pure with type arguments of type BigraphEntity.NodeEntity

Modifier	Constructor	Description
	Embedding(Map<? extends BigraphEntity.NodeEntity<?>,? extends BigraphEntity.NodeEntity<?>> m)
	Embedding(Map<? extends BigraphEntity.NodeEntity<?>,? extends BigraphEntity.NodeEntity<?>> m)