//============================================================================
//  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)
//==============================================================================

#include <vtkm/cont/ArrayCopy.h>
#include <vtkm/filter/scalar_topology/internal/BranchDecompositionBlock.h>

namespace vtkm
{
namespace filter
{
namespace scalar_topology
{
namespace internal
{

namespace
{ // anonymous namespace to restrict defition to this translation unit
vtkm::cont::ArrayHandleGroupVecVariable<vtkm::cont::ArrayHandle<vtkm::Id>,
                                        vtkm::cont::ArrayHandle<vtkm::Id>>
CreateFirstsupernodePerIterationArrayHandle(
  const vtkm::cont::DataSet& hierarchicalContourTreeDataSet)
{
  vtkm::cont::ArrayHandle<vtkm::Id> FirstSupernodePerIterationComponents;
  vtkm::cont::ArrayHandle<vtkm::Id> FirstSupernodePerIterationOffsets;

  vtkm::cont::ArrayCopyShallowIfPossible(
    hierarchicalContourTreeDataSet.GetField("FirstSupernodePerIterationComponents").GetData(),
    FirstSupernodePerIterationComponents);
  vtkm::cont::ArrayCopyShallowIfPossible(
    hierarchicalContourTreeDataSet.GetField("FirstSupernodePerIterationOffsets").GetData(),
    FirstSupernodePerIterationOffsets);
  return vtkm::cont::make_ArrayHandleGroupVecVariable(FirstSupernodePerIterationComponents,
                                                      FirstSupernodePerIterationOffsets);
}
} // anonymous namespace to restrict defition to this translation unit

BranchDecompositionBlock::BranchDecompositionBlock(
  vtkm::Id localBlockNo,
  int globalBlockId,
  const vtkm::cont::DataSet& hierarchicalTreeDataSet)
  : LocalBlockNo(localBlockNo)
  , GlobalBlockId(globalBlockId)
  , FirstSupernodePerIteration(CreateFirstsupernodePerIterationArrayHandle(hierarchicalTreeDataSet))
{
  vtkm::Id nSupernodes =
    hierarchicalTreeDataSet.GetField("Supernodes").GetData().GetNumberOfValues();
  this->BranchRoots.AllocateAndFill(nSupernodes,
                                    vtkm::worklet::contourtree_augmented::NO_SUCH_ELEMENT);
}

} // namespace internal
} // namespace scalar_topology
} // namespace filter
} // namespace vtkm
