/* ******************************************************************************
 *
 *
 * 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.
 *
 *  See the NOTICE file distributed with this work for additional
 *  information regarding copyright ownership.
 * 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
 ******************************************************************************/

//
// Created by george@skymind.io on 9/6/2018.
//

#include <ops/declarable/CustomOperations.h>
#include <ops/declarable/helpers/segment.h>

namespace sd {
    namespace ops {
        CUSTOM_OP_IMPL(unsorted_segment_prod, 2, 1, false, 0, 0) {
            auto input = INPUT_VARIABLE(0);
            auto reshapedInput = *input;
         /*   if(!input->isVector()) {
                reshapedInput = input->reshape('c',{input->lengthOf()},false);
            }*/

            auto idxSegments = INPUT_VARIABLE(1);
            auto reshapedSegments = *idxSegments;
            if(!idxSegments->isVector() && idxSegments->rankOf() > 1) {
                reshapedSegments = idxSegments->reshape('c',{idxSegments->lengthOf()},false);
            }

            auto segmentedOutput = OUTPUT_NULLIFIED(0);
            Nd4jLong numOfClasses = block.width() == 3 ? INPUT_VARIABLE(2)->e<Nd4jLong>(0) : INT_ARG(0);
            REQUIRE_TRUE(reshapedSegments.isVector(), 0, "unsorted_segment_sum: segment indexes array should be a vector, but it rank is %i.", idxSegments->rankOf());
            helpers::unsortedSegmentProdFunctor(block.launchContext(), &reshapedInput, &reshapedSegments, numOfClasses, segmentedOutput);

            return ND4J_STATUS_OK;
        }

        DECLARE_SHAPE_FN(unsorted_segment_prod) {

            auto in = inputShape->at(0);
            int outRank = shape::rank(in);
            Nd4jLong* outputShape = nullptr;
            Nd4jLong numOfClasses = block.width() == 3 ? INPUT_VARIABLE(2)->e<Nd4jLong>(0) : INT_ARG(0);

            if(INPUT_VARIABLE(0)->rankOf() >= 2) {
                ALLOCATE(outputShape, block.getWorkspace(), shape::shapeInfoLength(outRank), Nd4jLong);
                outputShape[0] = outRank;
                outputShape[1] = numOfClasses;
                for(int i = 1; i < outRank; i++)
                    outputShape[i + 1] = shape::sizeAt(in, i);

                ShapeUtils::updateStridesAndType(outputShape, in, shape::order(in));

            } else {
                ALLOCATE(outputShape, block.getWorkspace(), shape::shapeInfoLength(1), Nd4jLong);
                outputShape[0] = 1;
                outputShape[1] = numOfClasses;
                shape::printShapeInfo(outputShape);
                ShapeUtils::updateStridesAndType(outputShape, in, shape::order(in));
            }


            return SHAPELIST(CONSTANT(outputShape));
        }
        DECLARE_TYPES(unsorted_segment_prod) {
            getOpDescriptor()
                    ->setAllowedOutputTypes({ALL_FLOATS, ALL_INTS})
                    ->setAllowedInputTypes(0, {ALL_FLOATS, ALL_INTS})
                    ->setAllowedInputTypes(1, {ALL_INDICES})
                    ->setSameMode(false);
        }

        CUSTOM_OP_IMPL(unsorted_segment_prod_bp, 3, 2, false, 0, 1) {
            auto input = INPUT_VARIABLE(0);
            auto indices = INPUT_VARIABLE(1);
            auto eps = INPUT_VARIABLE(2);
//            auto numOfClasses = INT_ARG(0);
            auto output = OUTPUT_NULLIFIED(0);

            Nd4jLong numOfClasses = block.width() == 4 ? INPUT_VARIABLE(3)->e<Nd4jLong>(0) : INT_ARG(0);
            REQUIRE_TRUE(indices->isVector(), 0, "unsorted_segment_prod_bp: segment indexes array should be a vector, but it rank is %i.", indices->rankOf());
            REQUIRE_TRUE(indices->lengthOf() == input->sizeAt(0), 0, "unsorted_segment_prod_bp: segment indexes array length should be equal to the input first dimension, but %lld != %lld.", indices->lengthOf(), input->sizeAt(0));

            Nd4jLong wrong = numOfClasses;

            REQUIRE_TRUE(helpers::unsortedSegmentIndicesValidate(block.launchContext(), indices, numOfClasses, wrong), 0, "unsorted_segment_prod_bp: segment indices should be in range [0, %lld), but %lld > %lld",
                         numOfClasses, wrong, numOfClasses);

            return helpers::unsortedSegmentProdFunctorBP(block.launchContext(), input, indices, eps, numOfClasses, output);
        }
        DECLARE_TYPES(unsorted_segment_prod_bp) {
            getOpDescriptor()
                    ->setAllowedOutputTypes(0, {ALL_FLOATS})
                    ->setAllowedOutputTypes(1, {ALL_INDICES})
                    ->setAllowedInputTypes(0, {ALL_FLOATS})
                    ->setAllowedInputTypes(1, {ALL_INDICES})
                    ->setAllowedInputTypes(2,{ALL_FLOATS, ALL_INTS})
                    ->setSameMode(false);
        }

        DECLARE_SHAPE_FN(unsorted_segment_prod_bp){
            auto in = inputShape->at(0);
            auto inIdx = inputShape->at(1);

            Nd4jLong* outShape;
            Nd4jLong* outIndex;
            COPY_SHAPE(in, outShape);
            COPY_SHAPE(inIdx, outIndex);
            return SHAPELIST(CONSTANT(outShape), CONSTANT(outIndex));
//            return SHAPELIST(in, inIdx);
        }

    }

}
