[GROOVY-5513] Set - Collection has quadratic complexity

• Type: Improvement
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Fix Version/s: 4.x
• Component/s: groovy-jdk
• Assignee: Unassigned
• Reporter: Peter Gromov
• Created: 13/Jun/12 06:44
• Updated: 27/Jan/20 10:56

Description

org.codehaus.groovy.runtime.DefaultGroovyMethods#minus(Set<T> self, Collection<?> removeMe)'s complexity is O(m*n). If you used something like THashSet (http://trove4j.sourceforge.net/javadocs/gnu/trove/set/hash/THashSet.html) you could make it O(m+n) by plugging in a smart hashing strategy. Perhaps you already have something similar in your codebase or dependencies?