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
|
//! Graph manipulation code
//!
//! I had hoped to use petgraph, but it is optimized for efficiency over
//! usability, and I got lost in a maze of indices.
// @@ begin lint list maintained by maint/add_warning @@
#![allow(renamed_and_removed_lints)] // @@REMOVE_WHEN(ci_arti_stable)
#![allow(unknown_lints)] // @@REMOVE_WHEN(ci_arti_nightly)
#![warn(missing_docs)]
#![warn(noop_method_call)]
#![warn(unreachable_pub)]
#![warn(clippy::all)]
#![deny(clippy::await_holding_lock)]
#![deny(clippy::cargo_common_metadata)]
#![deny(clippy::cast_lossless)]
#![deny(clippy::checked_conversions)]
#![warn(clippy::cognitive_complexity)]
#![deny(clippy::debug_assert_with_mut_call)]
#![deny(clippy::exhaustive_enums)]
#![deny(clippy::exhaustive_structs)]
#![deny(clippy::expl_impl_clone_on_copy)]
#![deny(clippy::fallible_impl_from)]
#![deny(clippy::implicit_clone)]
#![deny(clippy::large_stack_arrays)]
#![warn(clippy::manual_ok_or)]
#![deny(clippy::missing_docs_in_private_items)]
#![warn(clippy::needless_borrow)]
#![warn(clippy::needless_pass_by_value)]
#![warn(clippy::option_option)]
#![deny(clippy::print_stderr)]
#![deny(clippy::print_stdout)]
#![warn(clippy::rc_buffer)]
#![deny(clippy::ref_option_ref)]
#![warn(clippy::semicolon_if_nothing_returned)]
#![warn(clippy::trait_duplication_in_bounds)]
#![deny(clippy::unchecked_duration_subtraction)]
#![deny(clippy::unnecessary_wraps)]
#![warn(clippy::unseparated_literal_suffix)]
#![deny(clippy::unwrap_used)]
#![deny(clippy::mod_module_files)]
#![allow(clippy::let_unit_value)] // This can reasonably be done for explicitness
#![allow(clippy::uninlined_format_args)]
#![allow(clippy::significant_drop_in_scrutinee)] // arti/-/merge_requests/588/#note_2812945
#![allow(clippy::result_large_err)] // temporary workaround for arti#587
#![allow(clippy::needless_raw_string_hashes)] // complained-about code is fine, often best
#![allow(clippy::needless_lifetimes)] // See arti#1765
#![allow(mismatched_lifetime_syntaxes)] // temporary workaround for arti#2060
//! <!-- @@ end lint list maintained by maint/add_warning @@ -->
// @@ begin test lint list maintained by maint/add_warning @@
#![allow(clippy::bool_assert_comparison)]
#![allow(clippy::clone_on_copy)]
#![allow(clippy::dbg_macro)]
#![allow(clippy::mixed_attributes_style)]
#![allow(clippy::print_stderr)]
#![allow(clippy::print_stdout)]
#![allow(clippy::single_char_pattern)]
#![allow(clippy::unwrap_used)]
#![allow(clippy::unchecked_duration_subtraction)]
#![allow(clippy::useless_vec)]
#![allow(clippy::needless_pass_by_value)]
//! <!-- @@ end test lint list maintained by maint/add_warning @@ -->
#![allow(clippy::missing_docs_in_private_items)]
#![allow(unreachable_pub)]
use anyhow::{Result, anyhow};
use std::collections::{HashMap, HashSet};
use std::hash::Hash;
/// Given a hashmap representing a binary relationship, compute its transitive closure.
fn transitive_closure<K: Hash + Eq + PartialEq + Clone>(
inp: &HashMap<K, HashSet<K>>,
) -> HashMap<K, HashSet<K>> {
let mut out = inp.clone();
let max_iters = inp.len();
for _ in 0..max_iters {
let mut new_out = out.clone();
for (k, vs) in out.iter() {
let new_vs = new_out
.get_mut(k)
.expect("That key should have been there when I cloned it...");
for v in vs.iter() {
if let Some(vv) = out.get(v) {
new_vs.extend(vv.iter().cloned());
}
}
}
if out == new_out {
break;
} else {
out = new_out;
}
}
out
}
/// Given a hashmap representing a binary relationship, invert it.
fn invert<K: Hash + Eq + PartialEq + Clone>(
inp: &HashMap<K, HashSet<K>>,
) -> HashMap<K, HashSet<K>> {
let mut out: HashMap<K, HashSet<K>> = HashMap::new();
for (k, vs) in inp.iter() {
for v in vs {
out.entry(v.clone()).or_default().insert(k.clone());
}
}
out
}
/// A representation of which features depend on what.
#[derive(Clone, Debug, Default)]
pub struct FeatureGraph {
/// List of all features.
all_features: HashSet<String>,
/// Adjacency map: for each feature F, `depends_on[F]` includes G if F
/// directly depends on G.
depends_on: HashMap<String, HashSet<String>>,
/// Inverse adjacency map.
depended_on_by: HashMap<String, HashSet<String>>,
/// Transitive closure of the adjacency map.
reachable_from: HashMap<String, HashSet<String>>,
}
impl FeatureGraph {
/// Convert a toml `[features]` section into a [`FeatureGraph`].
pub fn from_features_table(features: &toml_edit::Table) -> Result<Self> {
let mut depends_on = HashMap::new();
for (k, vs) in features.iter() {
let mut d = HashSet::new();
for v in vs
.as_array()
.ok_or_else(|| anyhow!("features.{} was not an array", k))?
{
let v = v
.as_str()
.ok_or_else(|| anyhow!("features.{} contained a non-string", k))?;
d.insert(v.to_string());
}
depends_on.insert(k.to_string(), d);
}
let all_features = depends_on.keys().cloned().collect();
let reachable_from = transitive_closure(&depends_on);
let depended_on_by = invert(&depends_on);
Ok(Self {
all_features,
depends_on,
depended_on_by,
reachable_from,
})
}
pub fn all_features(&self) -> impl Iterator<Item = String> + '_ {
self.depends_on.keys().cloned()
}
pub fn contains_feature(&self, feature: &str) -> bool {
self.all_features.contains(feature)
}
pub fn contains_edge(&self, from: &str, to: &str) -> bool {
match self.depends_on.get(from) {
Some(fs) => fs.contains(to),
None => false,
}
}
pub fn all_reachable_from(&self, feature: &str) -> impl Iterator<Item = String> + '_ + use<'_> {
match self.reachable_from.get(feature) {
Some(set) => itertools::Either::Left(set.iter().cloned()),
None => itertools::Either::Right(std::iter::empty()),
}
}
/// Return all the features that `feature` depends on. Return an empty iterator if
/// it has no dependencies, or is not in this map.
pub fn edges_from(&self, feature: &str) -> impl Iterator<Item = String> + '_ + use<'_> {
match self.depends_on.get(feature) {
Some(set) => itertools::Either::Left(set.iter().cloned()),
None => itertools::Either::Right(std::iter::empty()),
}
}
/// Return all the features that depend on `feature` directly. Return an empty iterator if
/// it has no dependencies, or is not in this map.
pub fn edges_to(&self, feature: &str) -> impl Iterator<Item = String> + '_ + use<'_> {
match self.depended_on_by.get(feature) {
Some(set) => itertools::Either::Left(set.iter().cloned()),
None => itertools::Either::Right(std::iter::empty()),
}
}
}
|
