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
|
/* Copyright (c) 1997-2024
Ewgenij Gawrilow, Michael Joswig, and the polymake team
Technische Universität Berlin, Germany
https://polymake.org
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 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
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.
--------------------------------------------------------------------------------
*/
#pragma once
#include "polymake/Graph.h"
#include "polymake/Array.h"
#include "polymake/graph/Decoration.h"
namespace polymake { namespace graph {
/*
* This iterator is used for converting the old DIMS array of HasseDiagram/FaceLattice to the new
* InverseRankMap. It iterates over pairs (rank, list of node of this rank).
*/
template <typename SeqType>
class dim_to_rank_iterator {
public:
using iterator_category = std::forward_iterator_tag;
using value_type = std::pair<Int, typename SeqType::map_value_type>;
using reference = const value_type&;
using pointer = const value_type*;
using difference_type = ptrdiff_t;
dim_to_rank_iterator(Int total_rank_, Int total_size_, bool built_dually_, const Array<Int>& dims_)
: total_rank(total_rank_)
, total_size(total_size_)
, built_dually(built_dually_)
, dims(dims_)
, current_dims_index(0)
, current_index_bound(0)
{
if (!dims.empty()) current_index_bound = dims[0];
result = std::make_pair(built_dually ? total_rank : 0,
SeqType::make_map_value_type(0, std::max(current_index_bound, 1L)-1));
}
reference operator* () const { return result; }
pointer operator->() const { return &result; }
dim_to_rank_iterator& operator++ () { find_next(); return *this; }
const dim_to_rank_iterator operator++ (int) { dim_to_rank_iterator copy = *this; operator++(); return copy; }
bool at_end() const { return current_dims_index > dims.size(); }
protected:
void find_next()
{
++current_dims_index;
if (!at_end()) {
Int old_index_bound = current_index_bound;
current_index_bound = current_dims_index == dims.size()? total_size : dims[current_dims_index];
Int next_rank = result.first + (built_dually? -1 : 1);
result = std::make_pair(next_rank,
SeqType::make_map_value_type(old_index_bound, current_index_bound-1));
}
}
const Int total_rank;
const Int total_size;
const bool built_dually;
const Array<Int>& dims;
Int current_dims_index;
Int current_index_bound;
value_type result;
};
/*
* @brief Computes a NodeMap which only contains the face of nodes.
*/
template <typename Decoration>
NodeMap<Directed, Set<Int>>
faces_map_from_decoration(const Graph<Directed>& graph, const NodeMap<Directed, Decoration>& decor)
{
return NodeMap<Directed, Set<Int>>(
graph,
entire(attach_member_accessor(decor, ptr2type<Decoration, Set<Int>, &Decoration::face>()))
);
}
} }
|
