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
/*
* Copyright (c) 2020-2021 Thomas Kramer.
*
* This file is part of LibrEDA
* (see https://codeberg.org/libreda).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
//! Definition of the metal layer stack as it is needed for routers.
/// Annotate a layer ID as 'via' or 'routing' layer.
pub enum RoutingLayerType<LayerId> {
/// Via layer.
Cut(LayerId),
/// Routing layer.
Routing(LayerId)
}
/// Define standardized access for routing and via layers.
pub trait RoutingLayerStack {
/// Identifier type for layers.
type LayerId: Clone + Eq;
/// Get the stack of routing and via layers in process order.
fn layer_stack(&self) -> Vec<RoutingLayerType<Self::LayerId>>;
/// Get the stack of routing metal layers in process order.
fn routing_layer_stack(&self) -> Vec<Self::LayerId> {
self.layer_stack().into_iter()
.filter_map(|l| match l {
RoutingLayerType::Routing(r) => Some(r),
_ => None
})
.collect()
}
/// Get the stack of via layers in process order.
fn via_layer_stack(&self) -> Vec<Self::LayerId> {
self.layer_stack().into_iter()
.filter_map(|l| match l {
RoutingLayerType::Cut(c) => Some(c),
_ => None
})
.collect()
}
}