mirror of
https://github.com/verilator/verilator.git
synced 2026-10-07 02:23:19 +02:00
+1
-1
@@ -785,7 +785,7 @@ private:
|
||||
std::unordered_set<AstNode*> m_nodeDeleteds; // Any node in this hash was deleted
|
||||
|
||||
bool same(AstNode* node1p, AstNode* node2p) {
|
||||
// Regarding the complexity of this funcition 'same':
|
||||
// Regarding the complexity of this function 'same':
|
||||
// Applying this comparison function to a a set of n trees pairwise is O(n^2) in the
|
||||
// number of comparisons (number of pairs). AstNode::sameTree itself, is O(sizeOfTree) in
|
||||
// the worst case, which happens if the operands of sameTree are indeed identical copies,
|
||||
|
||||
Reference in New Issue
Block a user