PandA-2024.02
level_constructor.cpp
Go to the documentation of this file.
1 /*
2  *
3  * _/_/_/ _/_/ _/ _/ _/_/_/ _/_/
4  * _/ _/ _/ _/ _/_/ _/ _/ _/ _/ _/
5  * _/_/_/ _/_/_/_/ _/ _/_/ _/ _/ _/_/_/_/
6  * _/ _/ _/ _/ _/ _/ _/ _/ _/
7  * _/ _/ _/ _/ _/ _/_/_/ _/ _/
8  *
9  * ***********************************************
10  * PandA Project
11  * URL: http://panda.dei.polimi.it
12  * Politecnico di Milano - DEIB
13  * System Architectures Group
14  * ***********************************************
15  * Copyright (C) 2004-2024 Politecnico di Milano
16  *
17  * This file is part of the PandA framework.
18  *
19  * The PandA framework is free software; you can redistribute it and/or modify
20  * it under the terms of the GNU General Public License as published by
21  * the Free Software Foundation; either version 3 of the License, or
22  * (at your option) any later version.
23  *
24  * This program is distributed in the hope that it will be useful,
25  * but WITHOUT ANY WARRANTY; without even the implied warranty of
26  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27  * GNU General Public License for more details.
28  *
29  * You should have received a copy of the GNU General Public License
30  * along with this program. If not, see <http://www.gnu.org/licenses/>.
31  *
32  */
43 #include "level_constructor.hpp"
44 
45 level_constructor::level_constructor(std::map<vertex, unsigned int>& _map_levels_true,
46  std::deque<vertex>& _deque_levels_true)
47  : map_levels_true(_map_levels_true), deque_levels_true(_deque_levels_true)
48 {
49 }
50 
52 
53 void level_constructor::add(vertex v, unsigned int index)
54 {
56  deque_levels_true.push_back(v);
57 }
level_constructor(std::map< vertex, unsigned int > &_map_levels_true, std::deque< vertex > &_deque_levels_true)
Constructor.
Data structore used to build the topological order of the operations vertices.
std::map< vertex, unsigned int > & map_levels_true
Map vertex to position in topological order; in the sorting then part vertices come before else part ...
std::deque< vertex > & deque_levels_true
List of vertices sorted by topological order; in the sorting then part vertices come before else part...
#define index(x, y)
Definition: Keccak.c:74
boost::graph_traits< graph >::vertex_descriptor vertex
vertex definition.
Definition: graph.hpp:1303
~level_constructor()
Destructor.
void add(vertex v, unsigned int index)
Add a vertex to the deque and to the map.

Generated on Mon Feb 12 2024 13:02:50 for PandA-2024.02 by doxygen 1.8.13