mirror/JUCE
1
0
Fork 0
mirror of https://github.com/juce-framework/JUCE.git synced 2026-01-10 23:44:24 +00:00
Code Activity

Graph: Add isAnInputTo overload

Browse source
This commit is contained in:
reuk 2022-08-12 10:55:01 +01:00
parent ecdebbd885
commit 5746bc99da
No known key found for this signature in database
GPG key ID: 9ADCD339CFC98A11
2 changed files with 15 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

12
modules/juce_audio_processors/processors/juce_AudioProcessorGraph.cpp
View file

@ -1443,9 +1443,14 @@ public:
return connections.isConnected (srcID, destID);
}
bool isAnInputTo (Node& src, Node& dst) const
bool isAnInputTo (const Node& src, const Node& dst) const
{
return connections.isAnInputTo (src.nodeID, dst.nodeID);
return isAnInputTo (src.nodeID, dst.nodeID);
}
bool isAnInputTo (NodeID src, NodeID dst) const
{
return connections.isAnInputTo (src, dst);
}
bool canConnect (const Connection& c) const
@ -1622,7 +1627,8 @@ bool AudioProcessorGraph::canConnect (const Connection& c) const
bool AudioProcessorGraph::isConnected (const Connection& c) const noexcept { return pimpl->isConnected (c); }
bool AudioProcessorGraph::isConnected (NodeID a, NodeID b) const noexcept { return pimpl->isConnected (a, b); }
bool AudioProcessorGraph::isConnectionLegal (const Connection& c) const { return pimpl->isConnectionLegal (c); }
bool AudioProcessorGraph::isAnInputTo (Node& source, Node& destination) const noexcept { return pimpl->isAnInputTo (source, destination); }
bool AudioProcessorGraph::isAnInputTo (const Node& source, const Node& destination) const noexcept { return pimpl->isAnInputTo (source, destination); }
bool AudioProcessorGraph::isAnInputTo (NodeID source, NodeID destination) const noexcept { return pimpl->isAnInputTo (source, destination); }
AudioProcessorGraph::Node::Ptr AudioProcessorGraph::addNode (std::unique_ptr<AudioProcessor> newProcessor,
NodeID nodeId,

7
modules/juce_audio_processors/processors/juce_AudioProcessorGraph.h
View file

@ -275,7 +275,12 @@ public:
/** Does a recursive check to see if there's a direct or indirect series of connections
between these two nodes.
*/
bool isAnInputTo (Node& source, Node& destination) const noexcept;
bool isAnInputTo (const Node& source, const Node& destination) const noexcept;
/** Does a recursive check to see if there's a direct or indirect series of connections
between these two nodes.
*/
bool isAnInputTo (NodeID source, NodeID destination) const noexcept;
/** Returns true if it would be legal to connect the specified points. */
bool canConnect (const Connection&) const;