//============================================================================
//  Copyright (c) Kitware, Inc.
//  All rights reserved.
//  See LICENSE.txt for details.
//
//  This software is distributed WITHOUT ANY WARRANTY; without even
//  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
//  PURPOSE.  See the above copyright notice for more information.
//============================================================================
// Copyright (c) 2018, The Regents of the University of California, through
// Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
// from the U.S. Dept. of Energy).  All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// (1) Redistributions of source code must retain the above copyright notice, this
//     list of conditions and the following disclaimer.
//
// (2) Redistributions in binary form must reproduce the above copyright notice,
//     this list of conditions and the following disclaimer in the documentation
//     and/or other materials provided with the distribution.
//
// (3) Neither the name of the University of California, Lawrence Berkeley National
//     Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
//     used to endorse or promote products derived from this software without
//     specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
// OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
// OF THE POSSIBILITY OF SUCH DAMAGE.
//
//=============================================================================
//
//  This code is an extension of the algorithm presented in the paper:
//  Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
//  Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
//  Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
//  (LDAV), October 2016, Baltimore, Maryland.
//
//  The PPP2 algorithm and software were jointly developed by
//  Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
//  Oliver Ruebel (LBNL)
//==============================================================================

#ifndef vtk_m_worklet_contourtree_distributed_bract_maker_boundary_vertices_per_superarc_worklets_h
#define vtk_m_worklet_contourtree_distributed_bract_maker_boundary_vertices_per_superarc_worklets_h

#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
#include <vtkm/worklet/WorkletMapField.h>

namespace vtkm
{
namespace worklet
{
namespace contourtree_distributed
{
namespace bract_maker
{

// Step 1of2 for BoundaryRestrictedAugmentedContourTreeMaker<MeshType>::ComputeDependentBoundaryCounts
class BoundaryVerticiesPerSuperArcStepOneWorklet : public vtkm::worklet::WorkletMapField
{
public:
  using ControlSignature = void(WholeArrayIn boundarySuperparents,             // (input)
                                WholeArrayOut superarcIntrinsicBoundaryCount); // (output) hyperarcs
  using ExecutionSignature = void(_1, InputIndex, _2);
  using InputDomain = _1;

  // Default Constructor
  VTKM_EXEC_CONT
  BoundaryVerticiesPerSuperArcStepOneWorklet(vtkm::Id numBoundary)
    : NumBoundary(numBoundary)
  {
  }

  template <typename InFieldPortalType, typename OutFieldPortalType>
  VTKM_EXEC void operator()(const InFieldPortalType& boundarySuperparentsPortal,
                            const vtkm::Id& boundaryVertex,
                            const OutFieldPortalType& superarcIntrinsicBoundaryCountPortal) const
  {
    if (boundaryVertex == 0)
    {
      return;
    }

    vtkm::Id superarcId = boundarySuperparentsPortal.Get(boundaryVertex);
    vtkm::Id prevSuperarcId = boundarySuperparentsPortal.Get(boundaryVertex - 1);

    // i. Start by detecting the high end of the range
    // if they don't match, we're at the beginning of a segment - set the *LOWER* segment's value
    if (superarcId != prevSuperarcId)
    {
      superarcIntrinsicBoundaryCountPortal.Set(prevSuperarcId, boundaryVertex);
    }
    // ii. Now set the last one explicitly
    if (boundaryVertex == (this->NumBoundary - 1))
    {
      superarcIntrinsicBoundaryCountPortal.Set(superarcId, this->NumBoundary);
    }
    // In serial this worklet implements the following operation
    /*
    for (indexType boundaryVertex = 1; boundaryVertex < nBoundary; boundaryVertex++)
    { // per boundary vertex
        indexType superarcID = boundarySuperparents[boundaryVertex];
        indexType prevSuperarcID = boundarySuperparents[boundaryVertex-1];
        // if they don't match, we're at the beginning of a segment - set the *LOWER* segment's value
        if (superarcID != prevSuperarcID)
            superarcIntrinsicBoundaryCount[prevSuperarcID] = boundaryVertex;
     } // per boundary vertex
     superarcIntrinsicBoundaryCount[boundarySuperparents[nBoundary-1]] = nBoundary;

    */
  }

private:
  vtkm::Id NumBoundary;

}; // BoundaryVerticiesPerSuperArcStepOneWorklet



// Step 1of2 for BoundaryRestrictedAugmentedContourTreeMaker<MeshType>::ComputeDependentBoundaryCounts
class BoundaryVerticiesPerSuperArcStepTwoWorklet : public vtkm::worklet::WorkletMapField
{
public:
  using ControlSignature = void(WholeArrayIn boundarySuperparents,             // (input)
                                WholeArrayOut superarcIntrinsicBoundaryCount); // (output) hyperarcs
  using ExecutionSignature = void(_1, InputIndex, _2);
  using InputDomain = _1;

  // Default Constructor
  VTKM_EXEC_CONT
  BoundaryVerticiesPerSuperArcStepTwoWorklet() {}

  template <typename InFieldPortalType, typename OutFieldPortalType>
  VTKM_EXEC void operator()(const InFieldPortalType& boundarySuperparentsPortal,
                            const vtkm::Id& boundaryVertex,
                            const OutFieldPortalType& superarcIntrinsicBoundaryCountPortal) const
  {
    if (boundaryVertex == 0)
    {
      return;
    }

    vtkm::Id superarcId = boundarySuperparentsPortal.Get(boundaryVertex);
    vtkm::Id prevSuperarcId = boundarySuperparentsPortal.Get(boundaryVertex - 1);

    // i. Start by detecting the high end of the range
    // if they don't match, we're at the beginning of a segment - set the *LOWER* segment's value
    if (superarcId != prevSuperarcId)
    {
      superarcIntrinsicBoundaryCountPortal.Set(
        superarcId, superarcIntrinsicBoundaryCountPortal.Get(superarcId) - boundaryVertex);
    }

    // In serial this worklet implements the following operation
    /*
    for (indexType boundaryVertex = 1; boundaryVertex < nBoundary; boundaryVertex++)
      { // per boundary vertex
      indexType superarcID = boundarySuperparents[boundaryVertex];
      indexType prevSuperarcID = boundarySuperparents[boundaryVertex-1];
      // if they don't match, we're at the beginning of a segment - set the *LOWER* segment's value
      if (superarcID != prevSuperarcID)
        superarcIntrinsicBoundaryCount[superarcID] -= boundaryVertex;
      } // per boundary vertex

    */
  }
}; // BoundaryVerticiesPerSuperArcStepTwoWorklet

} // namespace bract_maker
} // namespace contourtree_distributed
} // namespace worklet
} // namespace vtkm

#endif
