Skip to content

Conversation

@nastra
Copy link

@nastra nastra commented Nov 19, 2018

Locally tested with mvn clean install -DskipIntegrationTests=false -DincludeNeo4j

Eduard Tudenhoefner added 2 commits November 19, 2018 12:39
Since this part of the code is being called very often, it seems more
efficient to use a LinkedHashSet instead of an ArrayList, where we get
insertion & deletion in O(1) instead of O(n).
When analyzing heap memory consumption we noticed that this particular
list had to be enlarged quite often, thus generating unnecessary garbage
on the Heap. Quick fix is to init the list with the size that's needed.
@nastra nastra changed the base branch from master to tp33 November 19, 2018 11:41
@nastra nastra changed the base branch from tp33 to master November 19, 2018 11:41
@spmallette
Copy link
Contributor

going to close this one since we have #999

@spmallette spmallette closed this Nov 20, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants