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
|
/*
* Normaliz 2.7
* Copyright (C) 2007-2011 Winfried Bruns, Bogdan Ichim, Christof Soeger
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
//---------------------------------------------------------------------------
#include <iostream>
#include <string>
#include "integer.h"
#include "vector_operations.h"
#include "matrix.h"
#include "simplex.h"
#include "list_operations.h"
//---------------------------------------------------------------------------
namespace libnormaliz {
using namespace std;
template<typename Integer>
int l_read(const list< vector<Integer> >& l){
typename list< vector<Integer> >::const_iterator i;
for (i =l.begin(); i != l.end(); i++) {
v_read(*i);
}
return l.size();
}
//---------------------------------------------------------------------------
template<typename Integer>
int l_read(const list< vector<int> >& l){
typename list< vector<int> >::const_iterator i;
for (i =l.begin(); i != l.end(); i++) {
v_read(*i);
}
return l.size();
}
//---------------------------------------------------------------------------
template<typename Integer>
int l_read(const list <pair<vector<size_t>,Integer> >& l){
typename list< Simplex<Integer> >::const_iterator i;
for (i =l.begin(); i != l.end(); i++) {
(*i).first;
}
return l.size();
}
//---------------------------------------------------------------------------
template<typename Integer>
int l_read(const list< int >& l){
typename list< int >::const_iterator i;
for (i =l.begin(); i != l.end(); i++) {
std::cout<<(*i)<<" ";
}
std::cout<<std::endl;
return l.size();
}
//---------------------------------------------------------------------------
template<typename Integer>
vector<Integer> l_multiplication(const list< vector<Integer> >& l,const vector<Integer>& v){
register int s=l.size();
vector<Integer> p(s);
typename list< vector<Integer> >::const_iterator i;
s=0;
for (i =l.begin(); i != l.end(); i++) {
p[s]=v_scalar_product(*i,v); //maybe we loose time here?
s++;
}
return p;
}
//---------------------------------------------------------------------------
template<typename Integer>
list< vector<Integer> > l_list_x_matrix(const list< vector<Integer> >& l,const Matrix<Integer>& M){
list< vector<Integer> > result;
vector<Integer> p;
typename list< vector<Integer> >::const_iterator i;
for (i =l.begin(); i != l.end(); i++) {
p=M.VxM(*i);
result.push_back(p);
}
return result;
}
//---------------------------------------------------------------------------
template<typename Integer>
void l_cut(list< vector<Integer> >& l, int size){
typename list< vector<Integer> >::iterator i;
for (i =l.begin(); i != l.end(); i++) {
(*i).resize(size);
}
}
//---------------------------------------------------------------------------
template<typename Integer>
void l_cut_front(list< vector<Integer> >& l, int size){
typename list< vector<Integer> >::iterator i;
vector<Integer> tmp;
for (i =l.begin(); i != l.end(); ) {
tmp=v_cut_front(*i, size);
i=l.erase(i); //important to decrease memory consumption
l.insert(i,tmp);
}
}
//---------------------------------------------------------------------------
}
|
