void function ( Set < T > arg0 ) { elements = remove ( elements , arg0 ) ; size -= arg0 . size ( ) ; }
removes the elements in toremove from this list . takes time proportional to the size of the list , so should not be called often . concode_field_sep List<E> currentGroup concode_elem_sep CompactHashSet<E> elements concode_elem_sep Object EMPTY_LIST concode_elem_sep int size concode_elem_sep List<Object> groupedList concode_elem_sep Iterator<Object> iter concode_field_sep Collection<T> next concode_elem_sep void add concode_elem_sep void endGroup concode_elem_sep void appendGroup concode_elem_sep int sizeOf concode_elem_sep Object compress concode_elem_sep boolean expensiveContains concode_elem_sep boolean isEmpty concode_elem_sep boolean isEmpty concode_elem_sep boolean hasNext concode_elem_sep int listSize concode_elem_sep int numElements concode_elem_sep void addItem concode_elem_sep Set<T> toSet concode_elem_sep Iterator<Collection<T>> iterator concode_elem_sep Iterator<E> iterator concode_elem_sep boolean contains concode_elem_sep int size concode_elem_sep boolean checkUnorderedEqualityWithoutDuplicates concode_elem_sep void startGroup concode_elem_sep int hashCode concode_elem_sep List<T> get concode_elem_sep boolean equals concode_elem_sep GroupedList<E> create concode_elem_sep GroupedListHelper<F> create concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep void append