-
Notifications
You must be signed in to change notification settings - Fork 0
/
pareto.h
184 lines (154 loc) · 5.97 KB
/
pareto.h
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
/** \file pareto.h
Class for calculation the Pareto optimal elements from a set of multi-valued objects
Copyright (c) 2013, Pieter Eendebak <[email protected]>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#ifndef PARETO_H
#define PARETO_H
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <deque>
#include <iterator>
namespace detail
{
template <class atype>
/// generic function to print a std::vector
void display_vector ( const std::vector<atype> &v, const char *sep = " " ) {
std::copy ( v.begin(), v.end(), std::ostream_iterator<atype> ( std::cout, sep ) );
}
}
template <class ValueType, class IndexType>
/// helper class for the Pareto class
struct pareto_element {
typedef std::vector<ValueType> pValue;
pValue value;
std::vector<IndexType> indices;
/// return true of the argument element dominates this value
bool dominates ( pValue v ) {
for ( size_t i=0; i<v.size(); i++ ) {
if ( value[i] < v[i] )
return false;
}
return true;
}
bool isdominated ( pValue v ) {
for ( size_t i=0; i<v.size(); i++ ) {
if ( value[i] > v[i] )
return false;
}
return true;
}
/// return true of the argument element is equal to this element
bool equal ( pValue v ) {
for ( size_t i=0; i<v.size(); i++ ) {
if ( value[i] != v[i] )
return false;
}
return true;
}
};
template <class ValueType, class IndexType>
class Pareto
{
public:
typedef std::vector<ValueType> pValue;
typedef pareto_element<ValueType, IndexType> pElement;
int verbose;
/// contains a list of all Pareto optimal elements
std::deque<pareto_element<ValueType, IndexType> > elements;
/// constructor
Pareto() : verbose ( 1 ) {};
~Pareto() {};
/// return the total number of Pareto optimal values
int number() const {
return elements.size();
}
/// return the total number of Pareto optimal elements
int numberindices() const {
int t=0;
for ( size_t i=0; i<elements.size(); i++ ) {
t+= elements[i].indices.size() ;
}
return t;
}
/// show the current set of Pareto optimal elements
void show ( int verbose=1 ) {
if ( verbose==0 )
return;
printf ( "Pareto: %zu optimal values\n", elements.size() );
if ( verbose>=2 ) {
for ( size_t i=0; i<elements.size(); i++ ) {
printf ( "value %zu: ", i );
detail::display_vector ( elements[i].value, "; " );
printf ( "\n" );
if ( verbose>=3 ) {
printf ( " indices: " );
detail::display_vector ( elements[i].indices, ", " );
printf ( "\n" );
}
}
}
}
/// return all indices of the Pareto optimal elements as a std::deque
std::deque<IndexType> allindicesdeque() const {
std::deque<IndexType> lst;
for ( size_t i=0; i<elements.size(); i++ ) {
lst.insert ( lst.end(), elements[i].indices.begin(), elements[i].indices.end() );
}
return lst;
}
/// return all indices of the Pareto optimal elements
std::vector<IndexType> allindices() const {
std::vector<IndexType> lst;
for ( size_t i=0; i<elements.size(); i++ ) {
lst.insert ( lst.end(), elements[i].indices.begin(), elements[i].indices.end() );
}
return lst;
}
/// add a new element
bool addvalue ( pValue val, IndexType idx ) {
size_t ii=0;
while ( ii<elements.size() ) {
if ( elements[ii].dominates ( val ) ) {
if ( elements[ii].equal ( val ) ) {
elements[ii].indices.push_back ( idx );
return true;
} else {
// not a pareto element, so continue
if ( verbose>=3 )
printf ( "addvalue: not pareto\n" );
return false;
}
}
if ( elements[ii].isdominated ( val ) ) {
// element ii is dominated by the new element, we remove element ii
if ( verbose>=2 )
printf ( "addvalue: removing element\n" );
elements.erase ( elements.begin() +ii );
} else {
ii++;
}
}
// we have a new pareto element: add it to the current set
pElement p;
p.value = val;
p.indices.push_back ( idx );
this->elements.push_back ( p );
if ( verbose>=2 )
printf ( "addvalue: new elem, total is %zu\n", this->elements.size() );
return true;
}
};
#endif