// This file is part of libigl, a simple c++ geometry processing library.
// 
// Copyright (C) 2016 Alec Jacobson <alecjacobson@gmail.com>
// 
// This Source Code Form is subject to the terms of the Mozilla Public License 
// v. 2.0. If a copy of the MPL was not distributed with this file, You can 
// obtain one at http://mozilla.org/MPL/2.0/.
#ifndef IGL_SETUNION_H
#define IGL_SETUNION_H
#include "igl_inline.h"
#include <Eigen/Core>
namespace igl
{
  // Union of elements of matrices (like matlab's `union`)
  //
  // Inputs:
  //   A  m-long vector of indices
  //   B  n-long vector of indices
  // Outputs:
  //   C  (k>=m)-long vector of unique elements appearing in A and/or B
  //   IA  (<k>=m)-long list of indices into A so that C = sort([A(IA);B(IB)])
  //   IB  (<k>=m)-long list of indices into B so that C = sort([A(IA);B(IB)])
  //
  template <
    typename DerivedA,
    typename DerivedB,
    typename DerivedC,
    typename DerivedIA,
    typename DerivedIB>
  IGL_INLINE void setunion(
    const Eigen::DenseBase<DerivedA> & A,
    const Eigen::DenseBase<DerivedB> & B,
    Eigen::PlainObjectBase<DerivedC> & C,
    Eigen::PlainObjectBase<DerivedIA> & IA,
    Eigen::PlainObjectBase<DerivedIB> & IB);
}

#ifndef IGL_STATIC_LIBRARY
#  include "setunion.cpp"
#endif
#endif