This file is indexed.

/usr/include/m4rie/permutation.h is in libm4rie-dev 20140914-1.

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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/**
 * \file permutation.h
 * \brief Permutation matrices.
 *
 * \author Martin Albrecht <martinralbrecht@googlemail.com>
 */

#ifndef M4RIE_PERMUTATION_H
#define M4RIE_PERMUTATION_H

/******************************************************************************
*
*            M4RIE: Linear Algebra over GF(2^e)
*
*    Copyright (C) 2011 Martin Albrecht <martinralbrecht@googlemail.com>
*
*  Distributed under the terms of the GNU General Public License (GEL)
*  version 2 or higher.
*
*    This code 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.
*
*  The full text of the GPL is available at:
*
*                  http://www.gnu.org/licenses/
******************************************************************************/

#include <m4ri/mzp.h>
#include <m4rie/mzed.h>
#include <m4rie/mzd_slice.h>

/**
 * Apply the permutation P to A from the left.
 *
 * This is equivalent to row swaps walking from 0 to length-1.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzed_apply_p_left(mzed_t *A, mzp_t const *P) {
  mzd_apply_p_left(A->x, P);
}

/**
 * Apply the permutation P to A from the left but transpose P before.
 *
 * This is equivalent to row swaps walking from length-1 to 0.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzed_apply_p_left_trans(mzed_t *A, mzp_t const *P) {
  mzd_apply_p_left_trans(A->x, P);
}

/**
 * Apply the permutation P to A from the right.
 *
 * This is equivalent to column swaps walking from length-1 to 0.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzed_apply_p_right(mzed_t *A, mzp_t const *P) {
  if(A->nrows == 0)
    return;
  rci_t const length = MIN(P->length, A->ncols);
  for (rci_t i = length-1; i >= 0; --i) {
    mzed_col_swap(A, i, P->values[i]);
  }
}

/**
 * Apply the permutation P to A from the right but transpose P before.
 *
 * This is equivalent to column swaps walking from 0 to length-1.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzed_apply_p_right_trans(mzed_t *A, mzp_t const *P) {
  if(A->nrows == 0)
    return;
  rci_t const length = MIN(P->length, A->ncols);
  for (rci_t i = 0; i < length; ++i) {
    mzed_col_swap(A, i, P->values[i]);
  }
}

/**
 * Apply the permutation P to A from the left.
 *
 * This is equivalent to row swaps walking from 0 to length-1.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzd_slice_apply_p_left(mzd_slice_t *A, mzp_t const *P) {
  for(int i=0; i<A->depth; i++) {
    mzd_apply_p_left(A->x[i], P);
  }
}

/**
 * Apply the permutation P to A from the left but transpose P before.
 *
 * This is equivalent to row swaps walking from length-1 to 0.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzd_slice_apply_p_left_trans(mzd_slice_t *A, mzp_t const *P) {
  for(int i=0; i<A->depth; i++) {
    mzd_apply_p_left_trans(A->x[i], P);
  }
}

/**
 * Apply the permutation P to A from the right.
 *
 * This is equivalent to column swaps walking from length-1 to 0.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzd_slice_apply_p_right(mzd_slice_t *A, mzp_t const *P) {
  for(int i=0; i<A->depth; i++) {
    mzd_apply_p_right(A->x[i], P);
  }
}

/**
 * Apply the permutation P to A from the right but transpose P before.
 *
 * This is equivalent to column swaps walking from 0 to length-1.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzd_slice_apply_p_right_trans(mzd_slice_t *A, mzp_t const *P) {
  for(int i=0; i<A->depth; i++) {
    mzd_apply_p_right_trans(A->x[i], P);
  }
}

/**
 * Apply the permutation P to A from the right, but only on the upper
 * the matrix A above the main diagonal.
 *
 * This is equivalent to column swaps walking from 0 to length-1 and
 * is used to compress PLE to PLUQ.
 *
 * \param A Matrix.
 * \param P Permutation.
 */

static inline void mzd_slice_apply_p_right_trans_tri(mzd_slice_t *A, mzp_t const *P) {
  for(int i=0; i<A->depth; i++) {
    mzd_apply_p_right_trans_tri(A->x[i], P);
  }
}


#endif // M4RIE_PERMUTATION_H