/usr/include/pbseq/alignment/algorithms/anchoring/LongestIncreasingSubsequence.hpp is in libblasr-dev 0~20161219-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 | #ifndef _BLASR_LONGEST_INCREASING_SUBSEQUENCE_HPP_
#define _BLASR_LONGEST_INCREASING_SUBSEQUENCE_HPP_
#include <assert.h>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
template<typename T>
class RawValue {
int operator()(T &t) {
return t;
}
};
template<typename T, typename F_IntValue>
int BinarySearch(T *x, vector<int> &m, int i, int lenM, F_IntValue IntValue);
template<typename T, typename F_IntValue >
int LongestIncreasingSubset(T *x, int xLength, vector<int> &subsetIndices,
vector<int> &m, vector<int> &p, F_IntValue IntValue,
int start=0, int end = -1);
template<typename T, typename F_IntValue>
int LongestIncreasingSubset(T*x, int& xLength, vector<int> &subsetIndices);
#include "LongestIncreasingSubsequenceImpl.hpp"
#endif
|