Skip to content

Replaces ArrayList by HashSet to increase the performance #114

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

Closed
wants to merge 1 commit into from
Closed

Replaces ArrayList by HashSet to increase the performance #114

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 5 additions & 3 deletions src/main/java/de/danielbechler/util/Collections.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -88,18 +88,20 @@ public static <T> int indexOf(final Iterable<? extends T> haystack, final T need
public static <T> Collection<? extends T> filteredCopyOf(final Collection<? extends T> source,
final Collection<? extends T> filter)
{
// Patched : Replaces collection and arrayList by HashSet to improve the removeAll performance using the
// implementation of contains() of the hashset
final Collection<T> copy;
if (source != null)
{
copy = new LinkedList<T>(source);
copy = new HashSet<T>(source);
}
else
{
copy = new LinkedList<T>();
copy = new HashSet<T>();
}
if (filter != null)
{
copy.removeAll(new ArrayList<T>(filter));
copy.removeAll(new HashSet<T>(filter));
}
return copy;
}
Expand Down