/usr/include/gmsh/partitionEdge.h is in libgmsh-dev 2.8.5+dfsg-1.1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 | // Gmsh - Copyright (C) 1997-2014 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to the public mailing list <gmsh@geuz.org>.
#ifndef _PARTITION_EDGE_H_
#define _PARTITION_EDGE_H_
#include <stdio.h>
#include "GModel.h"
#include "GEdge.h"
#include "discreteEdge.h"
class partitionEdge : public discreteEdge {
public:
std::vector<int> _partitions;
public:
partitionEdge(GModel *model, int num, GVertex *_v0, GVertex *_v1,
std::vector<int> &partitions)
: discreteEdge(model, num, _v0, _v1), _partitions(partitions)
{
std::sort(_partitions.begin(), _partitions.end());
}
virtual ~partitionEdge() {}
virtual GeomType geomType() const { return PartitionCurve; }
};
struct Less_partitionEdge :
public std::binary_function<partitionEdge*, partitionEdge*, bool> {
bool operator()(const partitionEdge* e1, const partitionEdge* e2) const
{
if (e1->_partitions.size() < e2->_partitions.size()) return true;
if (e1->_partitions.size() > e2->_partitions.size()) return false;
for (unsigned int i = 0; i < e1->_partitions.size(); i++){
if (e1->_partitions[i] < e2->_partitions[i]) return true;
if (e1->_partitions[i] > e2->_partitions[i]) return false;
}
return false;
}
};
#endif
|