Examples of com.gs.collections.impl.set.mutable.primitive.DoubleHashSet

Package com.gs.collections.impl.set.mutable.primitive

Examples of com.gs.collections.impl.set.mutable.primitive.DoubleHashSet

com.gs.collections.impl.set.mutable.primitive.DoubleHashSet
This file was automatically generated from template file primitiveHashSet.stg. @since 3.0.

        return new DoubleArrayList();
    }


    public MutableDoubleSet toSet()
    {
        return new DoubleHashSet();
    }

View Full Code Here

        return modified;
    }


    public boolean removeAll(double... source)
    {
        DoubleHashSet set = DoubleHashSet.newSetWith(source);
        double[] newItems = new double[this.size];
        int count = 0;
        int oldSize = this.size;
        for (int index = 0; index < this.size; index++)
        {
            if (!set.contains(this.items[index]))
            {
                newItems[count] = this.items[index];
                count++;
            }
        }

View Full Code Here

    }


    public ImmutableDoubleSet select(DoublePredicate predicate)
    {
        return predicate.accept(this.element) ? DoubleHashSet.newSetWith(this.element).toImmutable()
                : new DoubleHashSet().toImmutable();
    }

View Full Code Here

                : new DoubleHashSet().toImmutable();
    }


    public ImmutableDoubleSet reject(DoublePredicate predicate)
    {
        return predicate.accept(this.element) ? new DoubleHashSet().toImmutable()
                : DoubleHashSet.newSetWith(this.element).toImmutable();
    }

View Full Code Here

        return target;
    }


    public MutableDoubleSet collectDouble(DoubleFunction<? super T> doubleFunction)
    {
        return this.collectDouble(doubleFunction, new DoubleHashSet());
    }

View Full Code Here

        return result;
    }


    public MutableDoubleSet collectDouble(DoubleFunction<? super T> doubleFunction)
    {
        DoubleHashSet result = new DoubleHashSet(this.size());
        this.forEach(new CollectDoubleProcedure<T>(doubleFunction, result));
        return result;
    }

View Full Code Here

        return new DoubleArrayList();
    }


    public MutableDoubleSet toSet()
    {
        return new DoubleHashSet();
    }

View Full Code Here

        return target;
    }


    public MutableDoubleSet collectDouble(DoubleFunction<? super K> doubleFunction)
    {
        return this.collectDouble(doubleFunction, new DoubleHashSet());
    }

View Full Code Here

    }


    public void readExternal(ObjectInput in) throws IOException
    {
        int size = in.readInt();
        MutableDoubleSet deserializedSet = new DoubleHashSet(size);


        for (int i = 0; i < size; i++)
        {
            deserializedSet.add(in.readDouble());
        }


        this.set = deserializedSet;
    }

View Full Code Here

        return result.toImmutable();
    }


    public ImmutableDoubleSet collectDouble(DoubleFunction<? super T> doubleFunction)
    {
        DoubleHashSet result = new DoubleHashSet(this.size());
        this.forEach(new CollectDoubleProcedure<T>(doubleFunction, result));
        return result.toImmutable();
    }

View Full Code Here

0 1 2 3 4

TOP

Related Classes of com.gs.collections.impl.set.mutable.primitive.DoubleHashSet

com.gs.collections.api.block.predicate.primitive.DoublePredicate

com.gs.collections.api.iterator.DoubleIterator

com.gs.collections.api.set.primitive.DoubleSet

com.gs.collections.impl.bag.immutable.primitive.ImmutableDoubleEmptyBag

com.gs.collections.impl.lazy.primitive.AbstractLazyDoubleIterable

com.gs.collections.impl.lazy.primitive.LazyDoubleIterableAdapter

com.gs.collections.impl.list.immutable.primitive.ImmutableDoubleEmptyList

com.gs.collections.impl.list.mutable.primitive.DoubleArrayList

com.gs.collections.impl.map.immutable.primitive.ImmutableByteDoubleEmptyMap

com.gs.collections.impl.map.immutable.primitive.ImmutableCharDoubleEmptyMap

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.