mirror of
https://github.com/SoftFever/OrcaSlicer.git
synced 2025-10-30 12:11:15 -06:00
77 lines
2.5 KiB
C++
77 lines
2.5 KiB
C++
// This file is part of libigl, a simple c++ geometry processing library.
|
|
//
|
|
// Copyright (C) 2013 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_FIND_H
|
|
#define IGL_FIND_H
|
|
#include "igl_inline.h"
|
|
#define EIGEN_YES_I_KNOW_SPARSE_MODULE_IS_NOT_STABLE_YET
|
|
#include <Eigen/Dense>
|
|
#include <Eigen/Sparse>
|
|
namespace igl
|
|
{
|
|
// Find the non-zero entries and there respective indices in a sparse matrix.
|
|
// Like matlab's [I,J,V] = find(X)
|
|
//
|
|
// Templates:
|
|
// T should be a eigen sparse matrix primitive type like int or double
|
|
// Input:
|
|
// X m by n matrix whose entries are to be found
|
|
// Outputs:
|
|
// I nnz vector of row indices of non zeros entries in X
|
|
// J nnz vector of column indices of non zeros entries in X
|
|
// V nnz vector of type T non-zeros entries in X
|
|
//
|
|
template <
|
|
typename T,
|
|
typename DerivedI,
|
|
typename DerivedJ,
|
|
typename DerivedV>
|
|
IGL_INLINE void find(
|
|
const Eigen::SparseMatrix<T>& X,
|
|
Eigen::DenseBase<DerivedI> & I,
|
|
Eigen::DenseBase<DerivedJ> & J,
|
|
Eigen::DenseBase<DerivedV> & V);
|
|
template <
|
|
typename DerivedX,
|
|
typename DerivedI,
|
|
typename DerivedJ,
|
|
typename DerivedV>
|
|
IGL_INLINE void find(
|
|
const Eigen::DenseBase<DerivedX>& X,
|
|
Eigen::PlainObjectBase<DerivedI> & I,
|
|
Eigen::PlainObjectBase<DerivedJ> & J,
|
|
Eigen::PlainObjectBase<DerivedV> & V);
|
|
template <
|
|
typename DerivedX,
|
|
typename DerivedI>
|
|
IGL_INLINE void find(
|
|
const Eigen::DenseBase<DerivedX>& X,
|
|
Eigen::PlainObjectBase<DerivedI> & I);
|
|
// Find the non-zero entries and there respective indices in a sparse vector.
|
|
// Similar to matlab's [I,J,V] = find(X), but instead of [I,J] being
|
|
// subscripts into X, since X is a vector we just return I, a list of indices
|
|
// into X
|
|
//
|
|
// Templates:
|
|
// T should be a eigen sparse matrix primitive type like int or double
|
|
// Input:
|
|
// X vector whose entries are to be found
|
|
// Outputs:
|
|
// I nnz vector of indices of non zeros entries in X
|
|
// V nnz vector of type T non-zeros entries in X
|
|
template <typename T>
|
|
IGL_INLINE void find(
|
|
const Eigen::SparseVector<T>& X,
|
|
Eigen::Matrix<int,Eigen::Dynamic,1> & I,
|
|
Eigen::Matrix<T,Eigen::Dynamic,1> & V);
|
|
}
|
|
|
|
#ifndef IGL_STATIC_LIBRARY
|
|
# include "find.cpp"
|
|
#endif
|
|
|
|
#endif
|