/usr/include/libwildmagic/Wm5TetrahedronKey.h is in libwildmagic-dev 5.13-1ubuntu3.
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 43 44 45 46 47 48 49 50 51 52 53 | // Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.10.1 (2014/01/21)
#ifndef WM5TETRAHEDRONKEY_H
#define WM5TETRAHEDRONKEY_H
#include "Wm5MathematicsLIB.h"
namespace Wm5
{
class WM5_MATHEMATICS_ITEM TetrahedronKey
{
public:
// An ordered tetrahedron has V[0] = min(v0,v1,v2,v3). Let {u1,u2,u3} be
// the set of inputs excluding the one assigned to V[0] and define
// V[1] = min(u1,u2,u3). Choose (V[1],V[2],V[3]) to be a permutation of
// (u1,u2,u3) so that the final storage is one of
// (v0,v1,v2,v3), (v0,v2,v3,v1), (v0,v3,v1,v2)
// (v1,v3,v2,v0), (v1,v2,v0,v3), (v1,v0,v3,v2)
// (v2,v3,v0,v1), (v2,v0,v1,v3), (v2,v1,v3,v0)
// (v3,v1,v0,v2), (v3,v0,v2,v1), (v3,v2,v1,v0)
// The idea is that if v0 corresponds to (1,0,0,0), v1 corresponds to
// (0,1,0,0), v2 corresponds to (0,0,1,0), and v3 corresponds to
// (0,0,0,1), the ordering (v0,v1,v2,v3) corresponds to the 4x4 identity
// matrix I; the rows are the specified 4-tuples. The permutation
// (V[0],V[1],V[2],V[3]) induces a permutation of the rows of the identity
// matrix to form a permutation matrix P with det(P) = 1 = det(I).
TetrahedronKey(int v0 = -1, int v1 = -1, int v2 = -1, int v3 = -1);
bool operator< (const TetrahedronKey& key) const;
int V[4];
// Indexing for the vertices of the triangle opposite a vertex. The
// triangle opposite vertex j is
// <oppositeFace[j][0], oppositeFace[j][1], oppositeFace[j][2]>
// and is listed in counterclockwise order when viewed from outside the
// tetrahedron.
static const int oppositeFace[4][3];
private:
void Permute (int u0, int u1, int u2);
};
}
#endif
|