### Question:
KTypeWormSet extends AbstractKTypeCollection<KType> implements /*! #if ($templateonly) !*/ Intrinsics.KeyHasher<KType>, /*! #end !*/
        KTypeLookupContainer<KType>,
        KTypeSet<KType>,
        Preallocable,
        Cloneable,
        Accountable { @Override public void clear() { Arrays.fill(next, (byte) 0); size = 0; Arrays.fill(keys, Intrinsics.<KType>empty()); } KTypeWormSet();  KTypeWormSet(int expectedElements);  KTypeWormSet(KTypeContainer<? extends KType> container); @SafeVarargs /* #end */ static KTypeWormSet<KType> from(KType... elements); @Override KTypeWormSet<KType> clone(); @Override int size(); @Override boolean isEmpty(); @Override boolean contains(KType key); @Override boolean add(KType key); @SafeVarargs /* #end */ final int addAll(KType... elements); int addAll(KTypeContainer<? extends KType> container); int addAll(Iterable<? extends KTypeCursor<? extends KType>> iterable); boolean remove(KType key); @Override int removeAll(KType key); int removeAll(KTypeContainer<? super KType> other); @Override int removeAll(KTypePredicate<? super KType> predicate); @Override T forEach(T procedure); @Override T forEach(T predicate); @Override Iterator<KTypeCursor<KType>> iterator(); @Override void clear(); @Override void release(); @Override @SuppressWarnings("unchecked") boolean equals(Object o); @Override int hashCode(); @Override int hashKey(KType key); int indexOf(KType key); boolean indexExists(int index); KType indexGet(int index); KType indexReplace(int index, KType equivalentKey); void indexInsert(int index, KType key); @Override String toString(); @Override void ensureCapacity(int expectedElements); @Override String visualizeKeyDistribution(int characters); @Override long ramBytesAllocated(); @Override long ramBytesUsed(); public Object[] keys; public byte[] next; }### Answer:
@Test public void testClear() { set.addAll(asArray(1, 2, 3)); set.clear(); assertEquals(0, set.size()); }