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.

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

StandardBranchCollisionDetector memory footprint enhancement #4790

Closed
AlexanderYastrebov opened this issue Jun 8, 2015 · 1 comment
Closed

Comments

@AlexanderYastrebov
Copy link
Contributor

Hi all.
Currently StandardBranchCollisionDetector saves all found paths in internal map (returnedPaths.add):

if ( returnedPaths.add( path ) && includePath( path, startPath, endPath ) )

On the other hand BidirectionalTraverserIterator may filter out many of them (and filters out most of them in case of Uniqueness.NODE_PATH i.e. AllSimplePaths):

foundPaths = uniquenessFiltered( pathCollisions.iterator() );

The proposal is to pass Uniqueness(BidirectionalUniquenessFilter) to StandardBranchCollisionDetector so it could filter out paths before adding them to its map which leads to great memory/GC saving.

@spacecowboy
Copy link
Contributor

Fixed by #4865

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants