Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Cloning loses matchers #11

Closed
GoogleCodeExporter opened this issue Apr 17, 2015 · 2 comments
Closed

Cloning loses matchers #11

GoogleCodeExporter opened this issue Apr 17, 2015 · 2 comments
Labels
auto-migrated Priority-Medium Type-Defect

Comments

@GoogleCodeExporter
Copy link 

See http://groups.google.com/group/lepl/msg/23734c4bbdaf45f2 and related
thread.

The problem occurs when a graph is cloned starting from a point which is
not the root of the tree (if Delayed nodes are broken to remove cycles).

Original issue reported on code.google.com by acooke....@gmail.com on 4 Sep 2009 at 12:50
@GoogleCodeExporter
Copy link
Author 

This has been fixed by modifying DelayedClone to:
(1) Introduce new Delayed instances for loops, rather than "re-using" existing 
instances
(2) Dropping existing Delayed instances whenever possible, so that the number 
does
not grow with repeated cloning.

Original comment by acooke....@gmail.com on 4 Sep 2009 at 12:52

@GoogleCodeExporter
Copy link
Author 

Fixed in 3.2

Original comment by acooke....@gmail.com on 4 Sep 2009 at 11:55

  • Changed state: Fixed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
auto-migrated Priority-Medium Type-Defect
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@GoogleCodeExporter