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

org.nd4j.linalg.api.ops.IndexAccumulation Maven / Gradle / Ivy

There is a newer version: 1.0.0-M2.1
Show newest version
package org.nd4j.linalg.api.ops;

import org.nd4j.linalg.api.complex.IComplexNumber;
import org.nd4j.linalg.primitives.Pair;

/**An index accumulation is an operation that returns an index within
 * a NDArray.
* Examples of IndexAccumulation operations include finding the index * of the minimim value, index of the maximum value, index of the first * element equal to value y, index of the maximum pair-wise difference * between two NDArrays X and Y etc.
* * Index accumulation is similar to {@link Accumulation} in that both are * accumulation/reduction operations, however index accumulation returns * an integer corresponding to an index, rather than a real (or complex) * value.
* * Index accumulation operations generally have 3 inputs:
* x -> the origin ndarray
* y -> the pairwise ndarray (frequently null/not applicable)
* n -> the number of times to accumulate
* * Note that IndexAccumulation op implementations should be stateless * (other than the final result and x/y/n arguments) and hence threadsafe, * such that they may be parallelized using the update, combineSubResults * and set/getFinalResults methods. */ public interface IndexAccumulation extends Op { /** Set the final index/result of the accumulation. */ void setFinalResult(int idx); /** Get the final result of the IndexAccumulation */ int getFinalResult(); /**Initial value for the index accumulation *@return the initial value */ double zeroDouble(); /** Initial value for the index accumulation. * @return the initial value * */ float zeroFloat(); /** Initial value for the index accumulation. * @return the initial value * */ float zeroHalf(); /** The initial value and initial index to use * for the accumulation * @return */ Pair zeroPair(); /**Complex initial value * @return the complex initial value */ IComplexNumber zeroComplex(); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy