//-----------------------------------------------------------------------
// -----------------------------------------------------------------------
// file="MatrixParallel.TaskPublic.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
//     
// Permission is hereby granted, free of charge, to any person 
// obtaining a copy of this software and associated documentation 
// files (the “Software”), to deal in the Software without restriction, 
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software, 
// and to permit persons to whom the Software is furnished to do so, 
// subject to the following conditions:
//     
// The above copyright notice and 
// this permission notice shall be included in all copies 
// or substantial portions of the Software.
//     
// THE SOFTWARE IS PROVIDED “AS IS”, 
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, 
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, 
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, 
// ARISING FROM, OUT OF OR IN CONNECTION WITH 
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//     
// -----------------------------------------------------------------------
// -----------------------------------------------------------------------
using StgSharp.HighPerformance;

using System;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;

namespace StgSharp.Mathematics
{
    public static partial class MatrixParallel
    {

        public static unsafe void PublicTask<T>(
                                  MatrixSegmentEnumeration<T> left,
                                  MatrixSegmentEnumeration<T> right,
                                  MatrixSegmentEnumeration<T> ans,
                                  delegate*<MatrixKernel<T>*, MatrixKernel<T>*, MatrixKernel<T>*, void> Operation)
            where T: unmanaged, INumber<T>
        {
            int length = _threads.Length,
                columnCount = left.PrimSize,
                rowCount = right.PrimSize;
            (int c3, int c4) = FastDecompose(columnCount);

            MatrixParallelTaskPackage<T>* package = MatrixParallelFactory.CreateBaseTask<T>();
            package->Left = left.Source;
            package->Right = right.Source;
            package->Result = ans.Source;
            package->LeftPrimOffset = left.PrimOffset;
            package->RightPrimOffset = right.PrimOffset;
            package->ResultPrimOffset = ans.PrimOffset;
            package->LeftPrimStride = left.PrimStride;
            package->RightPrimStride = right.PrimStride;
            package->ResultPrimStride = ans.PrimStride;
            package->LeftSecOffset = left.SecondaryOffset;
            package->RightSecOffset = right.SecondaryOffset;
            package->ResultSecOffset = ans.SecondaryOffset;
            package->LeftSecStride = left.SecondaryStride;
            package->RightSecStride = right.SecondaryStride;
            package->ResultSecStride = ans.SecondaryStride;
            package->PrimCount = left.PrimSize;
            package->SecCount = left.SecondarySize;
            package->ComputeHandle = (nint)Operation;
            package->ElementSize = sizeof(T);
            package->ComputeMode = 3;

            int
                small_4_size = c4 / LargeWrapCount,
                large_4_size = small_4_size + 1,
                small_3_size = c3 / LargeWrapCount,
                large_3_size = small_3_size + 1;
            int
                large_4_count = c4 % LargeWrapCount,
                small_4_count = LargeWrapCount - large_4_count,
                large_3_count = c3 % LargeWrapCount,
                small_3_count = LargeWrapCount - large_3_count;

            for (int i = 0; i < SmallWraps.Length; i++) { }
        }

    }
}