/usr/include/bliss/utils.hh is in libbliss-dev 0.72-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 | #ifndef BLISS_UTILS_HH
#define BLISS_UTILS_HH
/*
Copyright (c) 2006-2011 Tommi Junttila
Released under the GNU General Public License version 3.
This file is part of bliss.
bliss is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License version 3
as published by the Free Software Foundation.
bliss is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* \file
* \brief Some small utilities.
*
*/
#include <cstdio>
namespace bliss {
/**
* Print the permutation \a perm of {0,...,N-1} in the cycle format
* in the file stream \a fp.
* The amount \a offset is added to each element before printing,
* e.g. the permutation (2 4) is printed as (3 5) when \a offset is 1.
*/
void print_permutation(FILE *fp,
const unsigned int N,
const unsigned int *perm,
const unsigned int offset = 0);
/**
* Print the permutation \a perm of {0,...,N-1} in the cycle format
* in the file stream \a fp.
* The amount \a offset is added to each element before printing,
* e.g. the permutation (2 4) is printed as (3 5) when \a offset is 1.
*/
void print_permutation(FILE *fp,
const std::vector<unsigned int>& perm,
const unsigned int offset = 0);
/**
* Check whether \a perm is a valid permutation on {0,...,N-1}.
* Slow, mainly for debugging and validation purposes.
*/
bool is_permutation(const unsigned int N, const unsigned int* perm);
/**
* Check whether \a perm is a valid permutation on {0,...,N-1}.
* Slow, mainly for debugging and validation purposes.
*/
bool is_permutation(const std::vector<unsigned int>& perm);
} // namespace bliss
#endif
|