cavis/libnd4j/include/ops/specials_sparse.h

70 lines
2.4 KiB
C++

/*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations
* under the License.
*
* SPDX-License-Identifier: Apache-2.0
******************************************************************************/
//
// This file contains various helper methods/classes suited for sparse support
//
// @author raver119@gmail.com
//
#ifndef LIBND4J_SPECIALS_SPARSE_H
#define LIBND4J_SPECIALS_SPARSE_H
#include <system/pointercast.h>
namespace sd {
namespace sparse {
template <typename T>
class SparseUtils {
public:
/**
* Just simple helper for debugging :)
*
* @param indices
* @param rank
* @param x
*/
static void printIndex(Nd4jLong *indices, int rank, int x);
static bool ltIndices(Nd4jLong *indices, int rank, Nd4jLong x, Nd4jLong y);
/**
* Returns true, if x > y, false otherwise
* @param indices
* @param rank
* @param x
* @param y
* @return
*/
static bool gtIndices(Nd4jLong *indices, int rank, Nd4jLong x, Nd4jLong y);
static void swapEverything(Nd4jLong *indices, T *array, int rank, Nd4jLong x, Nd4jLong y);
static void coo_quickSort_parallel_internal(Nd4jLong *indices, T* array, Nd4jLong left, Nd4jLong right, int cutoff, int rank);
static void coo_quickSort_parallel(Nd4jLong *indices, T* array, Nd4jLong lenArray, int numThreads, int rank);
static Nd4jLong coo_quickSort_findPivot(Nd4jLong *indices, T *array, Nd4jLong left, Nd4jLong right,
int rank);
static void sortCooIndicesGeneric(Nd4jLong *indices, T *values, Nd4jLong length, int rank);
};
}
}
#endif //LIBND4J_SPECIALS_SPARSE_H