mirror of
https://git.mirrors.martin98.com/https://github.com/slic3r/Slic3r.git
synced 2025-07-25 08:54:26 +08:00
2ae2672ee9
Fixing dep build script on Windows and removing some warnings. Use bundled igl by default. Not building with the dependency scripts if not explicitly stated. This way, it will stay in Fix the libigl patch to include C source files in header only mode.
71 lines
1.9 KiB
C++
71 lines
1.9 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_SORTABLE_ROW_H
|
|
#define IGL_SORTABLE_ROW_H
|
|
|
|
// Simple class to contain a rowvector which allows rowwise sorting and
|
|
// reordering
|
|
#include <Eigen/Core>
|
|
|
|
namespace igl
|
|
{
|
|
// Templates:
|
|
// T should be a matrix that implements .size(), and operator(int i)
|
|
template <typename T>
|
|
class SortableRow
|
|
{
|
|
public:
|
|
T data;
|
|
public:
|
|
SortableRow():data(){};
|
|
SortableRow(const T & data):data(data){};
|
|
bool operator<(const SortableRow & that) const
|
|
{
|
|
// Get reference so that I can use parenthesis
|
|
const SortableRow<T> & THIS = *this;
|
|
// Lexicographical
|
|
int minc = (THIS.data.size() < that.data.size()?
|
|
THIS.data.size() : that.data.size());
|
|
// loop over columns
|
|
for(int i = 0;i<minc;i++)
|
|
{
|
|
if(THIS.data(i) == that.data(i))
|
|
{
|
|
continue;
|
|
}
|
|
return THIS.data(i) < that.data(i);
|
|
}
|
|
// All characters the same, comes done to length
|
|
return THIS.data.size()<that.data.size();
|
|
};
|
|
bool operator==(const SortableRow & that) const
|
|
{
|
|
// Get reference so that I can use parenthesis
|
|
const SortableRow<T> & THIS = *this;
|
|
if(THIS.data.size() != that.data.size())
|
|
{
|
|
return false;
|
|
}
|
|
for(int i = 0;i<THIS.data.size();i++)
|
|
{
|
|
if(THIS.data(i) != that.data(i))
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
};
|
|
bool operator!=(const SortableRow & that) const
|
|
{
|
|
return !(*this == that);
|
|
};
|
|
};
|
|
}
|
|
|
|
#endif
|