Examples of IntIntMap

com.almworks.integers.IntIntMap
com.carrotsearch.hppc.IntIntMap
An associative container with unique binding from keys to a single value.
com.gs.collections.api.map.primitive.IntIntMap
This file was automatically generated from template file primitivePrimitiveMap.stg. @since 3.0.

Examples of com.almworks.integers.IntIntMap

   * Maps index to the value that starts at that index
   */
  private final IntIntMap myMap;


  public SameValuesIntList() {
    this(new IntIntMap());
  }

View Full Code Here

Examples of com.almworks.integers.IntIntMap

   * Maps index to the value that starts at that index
   */
  private final IntIntMap myMap;


  public SameValuesIntList() {
    this(new IntIntMap());
  }

View Full Code Here

Examples of com.carrotsearch.hppc.IntIntMap

        IntArrayList columns, int iterations)
    {
        // Prepare selected matrix
        final DoubleMatrix2D selected = input.viewSelection(null, columns.toArray())
            .copy();
        final IntIntMap selectedToInput = new IntIntOpenHashMap(selected.columns());
        for (int i = 0; i < columns.size(); i++)
        {
            selectedToInput.put(i, columns.get(i));
        }


        // Prepare results holders
        List<IntArrayList> result = Lists.newArrayList();
        List<IntArrayList> previousResult = null;
        for (int i = 0; i < partitions; i++)
        {
            result.add(new IntArrayList(selected.columns()));
        }
        for (int i = 0; i < selected.columns(); i++) 
        {
            result.get(i % partitions).add(i);
        }


        // Matrices for centroids and document-centroid similarities
        final DoubleMatrix2D centroids = new DenseDoubleMatrix2D(selected.rows(),
            partitions).assign(selected.viewPart(0, 0, selected.rows(), partitions));
        final DoubleMatrix2D similarities = new DenseDoubleMatrix2D(partitions,
            selected.columns());


        // Run a fixed number of K-means iterations
        for (int it = 0; it < iterations; it++)
        {
            // Update centroids
            for (int i = 0; i < result.size(); i++)
            {
                final IntArrayList cluster = result.get(i);
                for (int k = 0; k < selected.rows(); k++)
                {
                    double sum = 0;
                    for (int j = 0; j < cluster.size(); j++)
                    {
                        sum += selected.get(k, cluster.get(j));
                    }
                    centroids.setQuick(k, i, sum / cluster.size());
                }
            }


            if (it < iterations - 1)
            {
                previousResult = result;
                result = Lists.newArrayList();
                for (int i = 0; i < partitions; i++)
                {
                    result.add(new IntArrayList(selected.columns()));
                }
            }


            // Calculate similarity to centroids
            centroids.zMult(selected, similarities, 1, 0, true, false);


            // Assign documents to the nearest centroid
            for (int c = 0; c < similarities.columns(); c++)
            {
                int maxRow = 0;
                double max = similarities.get(0, c);
                for (int r = 1; r < similarities.rows(); r++)
                {
                    if (max < similarities.get(r, c))
                    {
                        max = similarities.get(r, c);
                        maxRow = r;
                    }
                }


                result.get(maxRow).add(c);
            }


            if (ObjectUtils.equals(previousResult, result))
            {
                // Unchanged result
                break;
            }
        }


        // Map the results back to the global indices
        for (Iterator<IntArrayList> it = result.iterator(); it.hasNext();)
        {
            final IntArrayList cluster = it.next();
            if (cluster.isEmpty())
            {
                it.remove();
            }
            else
            {
                for (int j = 0; j < cluster.size(); j++)
                {
                    cluster.set(j, selectedToInput.get(cluster.get(j)));
                }
            }
        }


        return result;

View Full Code Here

Examples of com.gs.collections.api.map.primitive.IntIntMap

        }
        if (!(obj instanceof IntIntMap))
        {
            return false;
        }
        IntIntMap map = (IntIntMap) obj;
        if (map.size() != 1)
        {
            return false;
        }
        return map.containsKey(this.key1) && this.value1 == map.getOrThrow(this.key1);
    }

View Full Code Here

Examples of com.gs.collections.api.map.primitive.IntIntMap

        }
        if (!(obj instanceof IntIntMap))
        {
            return false;
        }
        IntIntMap map = (IntIntMap) obj;
        return map.isEmpty();
    }

View Full Code Here

Examples of com.gs.collections.api.map.primitive.IntIntMap

        if (!(obj instanceof IntIntMap))
        {
            return false;
        }


        IntIntMap other = (IntIntMap) obj;


        if (this.size() != other.size())
        {
            return false;
        }


        if (this.sentinelValues == null)
        {
            if (other.containsKey(EMPTY_KEY) || other.containsKey(REMOVED_KEY))
            {
                return false;
            }
        }
        else
        {
            if (this.sentinelValues.containsZeroKey && (!other.containsKey(EMPTY_KEY) || this.sentinelValues.zeroValue != other.getOrThrow(EMPTY_KEY)))
            {
                return false;
            }


            if (this.sentinelValues.containsOneKey && (!other.containsKey(REMOVED_KEY) || this.sentinelValues.oneValue != other.getOrThrow(REMOVED_KEY)))
            {
                return false;
            }
        }


        for (int i = 0; i < this.keys.length; i++)
        {
            int key = this.keys[i];
            if (isNonSentinel(key) && (!other.containsKey(key) || this.values[i] != other.getOrThrow(key)))
            {
                return false;
            }
        }
        return true;

View Full Code Here

TOP

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.