/usr/include/blasr/algorithms/alignment/sdp/SDPSet.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 | #ifndef _BLASR_SDP_SET_HPP_
#define _BLASR_SDP_SET_HPP_
/*
A SDPSet is a collection of types T that have strict ordering
defined. It supports ways to query for points immediately less or
immediately greater than another value.
*/
template<typename T>
class SDPSet {
private:
typedef std::set<T> Tree;
typename SDPSet<T>::Tree tree;
public:
int size();
/*
* Remove a fragment f if it exists.
*/
int Delete(T &f);
/*
* Insert a fresh copy of f into the set. If a copy
* already exists, replace it with this one.
*/
inline VectorIndex Insert(T &f);
/*
Returns true if there is a value such that value == f
*/
int Member(T &f);
int Min(T &f);
/*
* Given f, set succ to be the first value greater than f.
* Return 1 if such a value exists, 0 otherwise.
*/
int Successor(T &f, T &succ);
/*
* Given f, set pred to the first value less than f.
* Returns 1 if such a value exists, 0 otherwise.
*/
int Predecessor(T &f, T &pred);
};
#include "SDPSetImpl.hpp"
#endif // _BLASR_SDP_SET_HPP_
|