All Downloads are FREE. Search and download functionalities are using the official Maven repository.

edu.ucla.sspace.vector.IntArrayAsVector Maven / Gradle / Ivy

Go to download

The S-Space Package is a collection of algorithms for building Semantic Spaces as well as a highly-scalable library for designing new distributional semantics algorithms. Distributional algorithms process text corpora and represent the semantic for words as high dimensional feature vectors. This package also includes matrices, vectors, and numerous clustering algorithms. These approaches are known by many names, such as word spaces, semantic spaces, or distributed semantics and rest upon the Distributional Hypothesis: words that appear in similar contexts have similar meanings.

The newest version!
/*
 * Copyright 2009 David Jurgens
 *
 * This file is part of the S-Space package and is covered under the terms and
 * conditions therein.
 *
 * The S-Space package is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as published
 * by the Free Software Foundation and distributed hereunder to you.
 *
 * THIS SOFTWARE IS PROVIDED "AS IS" AND NO REPRESENTATIONS OR WARRANTIES,
 * EXPRESS OR IMPLIED ARE MADE.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, WE MAKE
 * NO REPRESENTATIONS OR WARRANTIES OF MERCHANT- ABILITY OR FITNESS FOR ANY
 * PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE OR DOCUMENTATION
 * WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER
 * RIGHTS.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see .
 */

package edu.ucla.sspace.vector;

import java.io.Serializable;

import java.util.Arrays;


/**
 * A {@code Vector} backed by an {@code int} array.  Any changes to the vector
 * are reflected in the backing array.  This class provides a link between
 * array-based and {@code Vector}-based computation.
 *
 * @author David Jurgens
*/
class IntArrayAsVector implements IntegerVector, Serializable {

    private static final long serialVersionUID = 1L;

    /**
     * The array whose values back this vector
     */
    private final int[] array;

    /**
     * Creates a new vector back by the provided array
     *
     * @param vector the values of this vector
     */
    public IntArrayAsVector(int[] array) {
        assert array != null : "wrapped array cannot be null";
        this.array = array;
    }

    /**
     * {@inheritDoc}
     */
    public int add(int index, int delta) {
        return (array[index] += delta);
    }

    /**
     * {@inheritDoc}
     */
    public void set(int index, int value) {
        array[index] = value;
    }

    /**
     * {@inheritDoc}
     */
    public void set(int index, Number value) {
        array[index] = value.intValue();
    }

    /**
     * {@inheritDoc}
     */
    public int get(int index) {
        return array[index];
    }

    /**
     * {@inheritDoc}
     */
    public Integer getValue(int index) {
        return array[index];
    }

    /**
     * {@inheritDoc}
     */
    public double magnitude() {
        double m = 0;
        for (int i : array)
            m += i * i;
        return Math.sqrt(m);
    }

    /**
     * {@inheritDoc}
     */
    public int[] toArray() {
        return Arrays.copyOf(array, array.length);
    }

    /**
     * {@inheritDoc}
     */
    public int length() {
        return array.length;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy