1 /* static_permutation_mrrr.h
2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 #ifndef _STATIC_PERMUTATION_MRRR_H
23 #define _STATIC_PERMUTATION_MRRR_H
26 #include <static_permutation.h>
29 /** Wrapper for Diego Arroyuelo's implementation of Munro et al.'s permutations.
30 * @author Francisco Claude
32 class static_permutation_mrrr : public static_permutation {
34 static_permutation_mrrr(uint * elems, uint nelems, uint t, static_bitsequence_builder * bmb);
35 virtual ~static_permutation_mrrr();
36 /** Computes the i-th element of the permutation */
37 virtual uint pi(uint i);
38 /** Computes the inverse of i */
39 virtual uint rev_pi(uint i);
40 /** Saves the permutation to fp, returns 0 in case of success */
41 virtual uint save(FILE *fp);
42 /** Returns the size of the permutation */
44 /** Loads a static_permutation from fp */
45 static static_permutation_mrrr * load(FILE *fp);
48 static_permutation_mrrr();