52 set< std::pair<OutPort *,bool> > temp(
_backLinks);
55 set<OutPort *> trueBackOutputs;
56 iter.first->getAllRepresented(trueBackOutputs);
57 for(
auto iter2 : trueBackOutputs )
67 std::set<OutPort *> ret;
69 ret.insert(iter.first);
95 auto it(std::find_if(
_backLinks.begin(),
_backLinks.end(),[fromPort](
const std::pair<OutPort *,bool>&
p){ return p.first==fromPort; }));
98 _backLinks.insert(std::pair<OutPort *,bool>(fromPort,isLoopProof));
104 auto it(std::find_if(
_backLinks.begin(),
_backLinks.end(),[fromPort](
const std::pair<OutPort *,bool>&
p){ return p.first==fromPort; }));
112 repr.insert((
InPort *)
this);
void edRemoveLink(OutPort *start, InPort *end)
Remove a dataflow link.
virtual std::set< OutPort * > edSetOutPort() const
Returns physical backlinks NOT user backlinks.
virtual void edNotifyDereferencedBy(OutPort *fromPort)
virtual int edGetNumberOfLinks() const
Returns number of physical backlinks NOT number of user backlinks.
InPort(const InPort &other, Node *newHelder)
bool isBackLinked() const
void edRemoveAllLinksLinkedWithMe()
std::set< std::pair< OutPort *, bool > > _backLinks
bool canSafelySqueezeMemory() const
virtual void getAllRepresentants(std::set< InPort * > &repr) const
virtual void edNotifyReferencedBy(OutPort *fromPort, bool isLoopProof=true)
Base class for all nodes.
virtual ComposedNode * getRootNode() const
Base class for all ports.
Base class for all type objects.