This file is indexed.

/usr/include/givaro/givvectdenseops.inl is in libgivaro-dev 3.7.2-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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
// ==========================================================================
// $Source
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
// Authors: T. Gautier
// $Id
// ==========================================================================
namespace Givaro {
#pragma message "#warning this file will probably not compile"


  // -- map of a unary operator, with operator()( Type_t& res )
  // res and u could be aliases if OP permits it
template<class Domain>
template<class UNOP>
inline void VectorDom<Domain,Dense>::
  map ( Rep& res, UNOP& op ) const
{
  size_t sz = dim(res);
  for (size_t i=0; i<sz; ++i) op(res[i]);
}


template<class Domain>
template<class BINOP>
inline void VectorDom<Domain,Dense>::
  map( Rep& res, const BINOP& OP, const Rep& u, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)) && (dim(u) == dim(v)), "Bad size");
  size_t sz = dim(res);
  for (size_t i=0; i<sz; ++i)
    OP(res[i], u[i], v[i]);
}

template<class Domain>
template<class UNOP>
inline void VectorDom<Domain,Dense>::
  map( Rep& res, UNOP& OP, const Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  size_t sz = dim(u);
  for (size_t i=0; i<sz; ++i)
    OP(res[i], u[i]);
}

// --- mul
template<class Domain>
inline void VectorDom<Domain,Dense>::mulin( Rep& res, const Type_t& val ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  Curried2<MulOp<Domain> > opcode(_domain, (Type_t&)val);
  map( res, opcode);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::mul
 ( Rep& res, const Rep& u, const Type_t& val ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  Curried2<MulOp<Domain> > opcode(_domain, (Type_t&)val);
  map( res, opcode, u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::mul
 ( Rep& res, const Type_t& val, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)), "Bad size");
  Curried1<MulOp<Domain> > opcode(_domain, val);
  map( res, opcode, v);
}



// --- add
template<class Domain>
inline void VectorDom<Domain,Dense>::addin( Rep& res, const Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  AddOp<Domain> opcode( _domain );
  map( res, opcode, u );
}

template<class Domain>
inline void VectorDom<Domain,Dense>::add
 ( Rep& res, const Rep& u, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)) && (dim(u) == dim(v)), "Bad size");
  AddOp<Domain> opcode (_domain);
  map( res, opcode, u, v);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::add
 ( Rep& res, const Rep& u, const Type_t& val ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  Curried2<AddOp<Domain> > opcode(_domain, (Type_t&)val);
  map( res, opcode, u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::add
 ( Rep& res, const Type_t& val, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)), "Bad size");
  Curried1<AddOp<Domain> > opcode(_domain, val);
  map( res, opcode, v);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::add
 ( Rep& res, const VectorDom<Domain,Sparse>::Rep& u, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)) && (dim(v) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  assign(res, v);
  addin(res, u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::add
( Rep& res, const Rep& v, const VectorDom<Domain,Sparse>::Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)) && (dim(v) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  assign(res, v);
  addin(res,u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::addin
 ( Rep& res, const VectorDom<Domain,Sparse>::Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  typedef VectorDom<Domain,Sparse> VSparseDom;
  typedef VSparseDom::constIterator_t cIterator_t;
  typedef VSparseDom::IndiceIterator_t cIndiceIterator_t;
  cIterator_t u_curr = u.begin_data();
  cIterator_t u_end = u.end_data();
  cIndiceIterator_t u_indice = u.begin_indice();
  for ( ; u_curr != u_end; ++u_curr, ++u_indice )
    _domain.addin(res[*u_indice], *u_curr);
}



// --- sub
template<class Domain>
inline void VectorDom<Domain,Dense>::subin( Rep& res, const Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  SubOp<Domain> opcode ( _domain );
  map( res, opcode, u );
}

template<class Domain>
inline void VectorDom<Domain,Dense>::sub( Rep& res, const Rep& u, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)) && (dim(v) == dim(u)), "Bad size");
  SubOp<Domain> opcode ( _domain );
  map( res, opcode, u, v);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::sub( Rep& res, const Rep& u, const Type_t& val ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  Curried2<SubOp<Domain> > opcode( _domain, (Type_t&)val);
  map( res, opcode, u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::sub( Rep& res, const Type_t& val, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)), "Bad size");
  Curried1<SubOp<Domain> > opcode( _domain, val);
  map( res, opcode, v);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::subin
 ( Rep& res, const VectorDom<Domain,Sparse>::Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  typedef VectorDom<Domain,Sparse> VSparseDom;
  typedef VSparseDom::constIterator_t cIterator_t;
  typedef VSparseDom::IndiceIterator_t cIndiceIterator_t;
  cIterator_t u_curr = u.begin_data();
  cIterator_t u_end = u.end_data();
  cIndiceIterator_t u_indice = u.begin_indice();
  for ( ; u_curr != u_end; ++u_curr, ++u_indice )
    _domain.subin(res[*u_indice], *u_curr);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::sub
 ( Rep& res, const VectorDom<Domain,Sparse>::Rep& u, const Rep& v ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)) && (dim(v) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  neg(res, v);
  addin(res, u);
}

template<class Domain>
inline void VectorDom<Domain,Dense>::sub
 ( Rep& res, const Rep& v, const VectorDom<Domain,Sparse>::Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(v)) && (dim(v) == u.dim()), "Bad size");
  // -- here assume : subdomains of res, u and v are equal
  assign(res,v);
  subin(res,u);
}


// --- sub

// --- neg
template<class Domain>
inline void VectorDom<Domain,Dense>::negin( Rep& res ) const
{
  NegOp<Domain> opcode ( _domain );
  map( res, opcode, res );
}

template<class Domain>
inline void VectorDom<Domain,Dense>::neg( Rep& res, const Rep& u ) const
{
  GIVARO_ASSERT((dim(res) == dim(u)), "Bad size");
  NegOp<Domain> opcode ( _domain );
  map( res, opcode, u );
}

template<class Domain>
void VectorDom<Domain,Dense>::axpy
 ( Rep& res, const Type_t& a, const Rep& x, const Rep& y ) const
{
  GIVARO_ASSERT((dim(res) == dim(x)) && (dim(x) == dim(y)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axpy(res[i], a, x[i], y[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axpyin
 ( Rep& res, const Type_t& a, const Rep& x ) const
{
  GIVARO_ASSERT((dim(res) == dim(x)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axpyin(res[i], a, x[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axmy
 ( Rep& res, const Type_t& a, const Rep& x, const Rep& y ) const
{
  GIVARO_ASSERT((dim(res) == dim(x)) && (dim(x) == dim(y)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axmy(res[i], a, x[i], y[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axmyin
 ( Rep& res, const Type_t& a, const Rep& x ) const
{
  GIVARO_ASSERT((dim(res) == dim(x)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axmyin(res[i], a, x[i]);
}


template<class Domain>
void VectorDom<Domain,Dense>::axpy
 ( Rep& res, const Rep& a, const Rep& b, const Rep& y ) const
{
  GIVARO_ASSERT((dim(res) == dim(a)) && (dim(a) == dim(b)) && (dim(b) == dim(y)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axpy(res[i], a[i], b[i], y[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axpyin
 ( Rep& res, const Rep& a, const Rep& b ) const
{
  GIVARO_ASSERT((dim(res) == dim(a)) && (dim(a) == dim(b)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axpyin(res[i], a[i], b[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axmy
 ( Rep& res, const Rep& a, const Rep& b, const Rep& y ) const
{
  GIVARO_ASSERT((dim(res) == dim(a)) && (dim(a) == dim(b)) && (dim(b) == dim(y)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axmy(res[i], a[i], b[i], y[i]);
}

template<class Domain>
void VectorDom<Domain,Dense>::axmyin
 ( Rep& res, const Rep& a, const Rep& b ) const
{
  GIVARO_ASSERT((dim(res) == dim(a)) && (dim(a) == dim(b)), "Bad size");
  size_t sz = dim(res);
  for ( size_t i=0; i<sz; ++i )
   _domain.axmyin(res[i], a[i], b[i]);
}



template<class Domain>
inline void VectorDom<Domain,Dense>::dot
  ( Type_t& res, const Rep& op1, const Rep& op2) const
{
  GIVARO_ASSERT((dim(op1) == dim(op2)), "Bad size");
  size_t sz = dim(op1);
  _domain.assign(res, _domain.zero);
  for ( size_t i=0; i<sz; ++i ) _domain.axpyin(res, op1[i], op2[i] );
}



// ==========================================================================
//
// -- Write the domain
//
template<class Domain>
ostream& VectorDom<Domain, Dense>::write( ostream& o ) const
{
  return _domain.write(o << "(") << ",Dense)";
}

// -- read the domain
template<class Domain>
istream& VectorDom<Domain, Dense>::read( istream& sin )
{
  char ch;
  sin >> std::ws >> ch;
  if (ch != '(')
    GivError::throw_error(
      GivBadFormat("VectorDom<Domain,Dense>::read: syntax error no '('"));

  // -- read subdomain:
  _domain.read(sin);

  // -- read ,
  sin >> std::ws >> ch;
  if (ch != ',')
    GivError::throw_error(
      GivBadFormat("VectorDom<Domain,Dense>::read: syntax error no ','"));

  // -- read dense:
  char name[6];
  sin >> std::ws; sin.read(name, 5); name[5] = (char)0;
  if (strcmp(name, "Dense") !=0)
    GivError::throw_error(
      GivBadFormat("VectorDom<Domain,Dense>::read: syntax error no 'Dense'"));

  // -- read )
  sin >> std::ws >> ch;
  if (ch != ')')
    GivError::throw_error(
      GivBadFormat("VectorDom<Domain,Dense>::read: syntax error no ')'"));
  return sin;
}


// ==========================================================================
//
// -- Don't write the domain !, only write a rep / domain
template<class Domain>
ostream& VectorDom<Domain, Dense>::write(ostream& o, const Rep& V) const
{
   if (dim(V) ==0) return o << "[ ]";
   o << '[';
   size_t i;
   for (i=0; i<dim(V)-1; i++) o << V[i] << ',';
   return o << V[i] << ']';
}


//
// Read a vector given by a Maple-like format:
// the grammar is :
//   s  --->  '[' list_of_elt ']'
//   list_of_elt --->   elt
//                    | list_of_elt ',' elt
// The contraints are :
//   All lines are the same number of Elements.
//   The separators a those of the C lexical-convention, i.e.
//    ' ', '\n', '\t', '\f' .

template<class Domain>
istream&  VectorDom<Domain,Dense>::read (istream& fin, Rep& A) const
{
  char ch;

  // -- Skip the first "white":
  fin >> std::ws; fin.get(ch);
  if (ch != '[')
    GivError::throw_error(
      GivBadFormat("VectorDom<Domain,Dense>::read: syntax error no '['"));

  // -- Read the line and count the nb of elts
  int i = 0;
  Rep rep;
  rep.allocate(1);
  Type_t Tmp;
  fin >> Tmp;
  fin >> std::ws; fin.get(ch);
  rep[0] = Tmp;
  while (ch != ']')
  {
    if (ch != ',')
      GivError::throw_error(
        GivBadFormat("VectorDom<T,Dense>::read: syntax error no ','"));
    i++;
    fin >> std::ws >> Tmp;
    fin >> std::ws; fin.get(ch);

    // resize the vector :
    rep.reallocate(i+1);
    rep[i] = Tmp;
  }
  A.logcopy( rep );
  return fin;
}
} // Givaro
#include "givaro/givvectdensespe.inl"