/usr/include/blasr/algorithms/alignment/sdp/SDPFragment.hpp is in libblasr-dev 0~20151014+gitbe5d1bf-2.
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 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 | #ifndef _BLASR_SDP_FRAGMENT_HPP_
#define _BLASR_SDP_FRAGMENT_HPP_
class Fragment {
public:
unsigned int x;
unsigned int y;
unsigned int weight;
unsigned int length;
int index;
int chainPrev;
int cost;
int above;
unsigned int chainLength;
inline Fragment(unsigned int px, unsigned int py, int pweight=0);
inline Fragment();
unsigned int GetX() const {return x;}
unsigned int GetY() const {return y;}
bool SetAbove(int a);
bool GetAbove(int & a);
inline int LessThanXY(const Fragment &f) const;
inline int LessThanYX(const Fragment &f) const;
inline int operator<(const Fragment &f) const;
inline Fragment& operator=(const Fragment &rhs);
inline int operator==(const Fragment &f) const;
int operator>(const Fragment &f) const;
int GetLength();
void SetLength(int _length);
};
inline Fragment::Fragment(unsigned int px, unsigned int py, int pweight) {
x = px;
y = py;
weight = pweight;
length = index = 0;
chainPrev = cost = chainLength = 0;
above = -1;
}
//
// Provide default constructor that will
// give bad results if members are not properly initialized
// later on.
//
inline Fragment::Fragment() {
x = -1;
y = -1;
weight = length = index = 0;
chainPrev = cost = chainLength = 0;
above = -1;
}
inline int Fragment::LessThanXY(const Fragment &f) const {
if (x == f.x) {
if (y == f.y) {
if (length == f.length) return 0;
else return length < f.length;
} else return y < f.y;
} else return x < f.x;
/*
if (x < f.x)
return 1;
else if (x == f.x)
return y < f.y;
else
return 0;
*/
}
inline int Fragment::LessThanYX(const Fragment &f) const {
if (y == f.y) {
if (x == f.x) {
if (length == f.length) return 0;
else return length < f.length;
} else return x < f.x;
} else return y < f.y;
/*
if (y < f.y)
return 1;
else if (y == f.y)
return x < f.x;
else
return 0;
*/
}
inline Fragment& Fragment::operator=(const Fragment &rhs) {
x = rhs.x;
y = rhs.y;
index = rhs.index;
cost = rhs.cost;
weight = rhs.weight;
length = rhs.length;
chainLength = rhs.chainLength;
chainPrev = rhs.chainPrev;
above = rhs.above;
return *this;
}
inline int Fragment::operator==(const Fragment &f) const {
return (x == f.x and y == f.y);
}
inline int Fragment::operator<(const Fragment &f) const {
//
// Sort fragments by diagonal:
//
int diag, fDiag;
diag = (y - x);
fDiag = f.y - f.x;
if (diag < fDiag)
return 1;
else if (diag == fDiag)
return (x < f.x);
else
return 0;
}
#endif // _BLASR_SDP_FRAGMENT_HPP_
|