Uses of Class
org.bigraphs.framework.core.impl.BigraphEntity.NodeEntity
Package
Description
-
Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core
Modifier and TypeMethodDescription<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 returnsnull
, since elementary bigraphs are node-free bigraphsModifier and TypeMethodDescription<C extends Control<?,
?>>
Collection<BigraphEntity.NodeEntity<C>>Bigraph.getNodes()
BigraphBuilderSupport.InstanceParameter.getNodes()
<C extends Control<?,
?>>
Collection<BigraphEntity.NodeEntity<C>>BigraphDelegator.getNodes()
<C extends Control<?,
?>>
Collection<BigraphEntity.NodeEntity<C>>ElementaryBigraph.getNodes()
Modifier and TypeMethodDescription<C extends Control<?,
?>>
booleanBigraph.areConnected
(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2) Check if two nodes are connected to each other.<C extends Control<?,
?>>
booleanBigraphDelegator.areConnected
(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2) final <C extends Control<?,
?>>
booleanElementaryBigraph.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<?,
?>>
intBigraph.getPortCount
(BigraphEntity.NodeEntity<C> node) Get the number of "blocked/occupied" ports by links of a node.<C extends Control<?,
?>>
intBigraphDelegator.getPortCount
(BigraphEntity.NodeEntity<C> node) <C extends Control<?,
?>>
intElementaryBigraph.getPortCount
(BigraphEntity.NodeEntity<C> node) default <C extends Control<?,
?>>
booleanBigraph.isActiveAtNode
(BigraphEntity.NodeEntity<C> node) -
Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core.impl
Modifier and TypeMethodDescriptionstatic @NonNull BigraphEntity.NodeEntity<? extends Control>
BigraphEntity.createNode
(@NonNull org.eclipse.emf.ecore.EObject param, Control control) Modifier and TypeMethodDescriptionint
BigraphEntity.NodeEntity.compareTo
(BigraphEntity.NodeEntity<C> o) -
Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.core.impl.pure
Modifier and TypeFieldDescriptionprotected final Map<String,
BigraphEntity.NodeEntity> PureBigraphBuilder.availableNodes
Modifier and TypeMethodDescriptionPureBigraphBuilder.Hierarchy.getLastCreatedNode()
<C extends Control<?,
?>>
BigraphEntity.NodeEntity<C>KindBigraph.getNodeOfPort
(BigraphEntity.Port port) PureBigraph.getNodeOfPort
(BigraphEntity.Port port) Modifier and TypeMethodDescriptionMutableBuilder.availableNodes()
<C extends Control<?,
?>>
Collection<BigraphEntity.NodeEntity<C>>KindBigraph.getNodes()
PureBigraph.getNodes()
Modifier and TypeMethodDescription<C extends Control<?,
?>>
booleanKindBigraph.areConnected
(BigraphEntity.NodeEntity<C> place1, BigraphEntity.NodeEntity<C> place2) <C extends Control<?,
?>>
booleanPureBigraph.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
PureBigraphBuilder.connectNodeToInnerName
(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.InnerName innerName) Link a node with an inner name by an edgevoid
PureBigraphBuilder.connectNodeToInnerNames
(BigraphEntity.NodeEntity<Control> node1, BigraphEntity.InnerName... innerNames) Link multiple inner names by an edge to one nodevoid
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...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<?,
?>>
intKindBigraph.getPortCount
(BigraphEntity.NodeEntity<C> node) <C extends Control<?,
?>>
intPureBigraph.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. -
Uses of BigraphEntity.NodeEntity in org.bigraphs.framework.simulation.matching.pure
Modifier and TypeMethodDescriptionIHSFilter.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()
IHSFilter.getOfNodesForHyperedgeWithLabel
(BigraphEntity.Link he, String label, Bigraph<?> bigraph) Modifier and TypeMethodDescriptionIHSFilter.adj
(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph) boolean
IHSFilter.condition1
(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent) Degree and labelboolean
IHSFilter.condition2
(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent) The number of adjacent nodesboolean
IHSFilter.condition3
(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent) Arity containment of hyperedgesboolean
IHSFilter.condition4
(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent) Label matchings of hyperedgesint
IHSFilter.degree
(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph) IHSFilter.getIncidentHyperedges
(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph) IHSFilter.getLabel
(BigraphEntity.NodeEntity<?> node) int
IHSFilter.numOfadj
(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph) ModifierConstructorDescriptionEmbedding
(Map<? extends BigraphEntity.NodeEntity<?>, ? extends BigraphEntity.NodeEntity<?>> m) Embedding
(Map<? extends BigraphEntity.NodeEntity<?>, ? extends BigraphEntity.NodeEntity<?>> m)