Struct InputGraph

pub struct InputGraph {
    pub mcs: ObjPool<InputGraphMacrocell>,
    pub pterms: ObjPool<InputGraphPTerm>,
    pub bufg_clks: ObjPool<InputGraphBufgClk>,
    pub bufg_gts: ObjPool<InputGraphBufgGTS>,
    pub bufg_gsr: ObjPool<InputGraphBufgGSR>,
}

Fields

mcs: ObjPool<InputGraphMacrocell>

pterms: ObjPool<InputGraphPTerm>

bufg_clks: ObjPool<InputGraphBufgClk>

bufg_gts: ObjPool<InputGraphBufgGTS>

bufg_gsr: ObjPool<InputGraphBufgGSR>

Implementations

impl InputGraph

pub fn from_intermed_graph<L: Into<Option<Logger>>>( g: &IntermediateGraph, logger: L, ) -> Result<Self, IntermedToInputError>

Trait Implementations

impl Debug for InputGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InputGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for InputGraph

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for InputGraph

fn eq(&self, other: &InputGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for InputGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for InputGraph

impl StructuralPartialEq for InputGraph