pub struct LookupTable { /* private fields */ }
Expand description

Lookup-table for nets of low degree.

Implementations

Find a rectilinear steiner minimal tree which connects all pins. Number of de-duplicated pins cannot be larger than the maximum supported number of pins of the lookup table.

Returns: (tree edges, tree weight).

Get maximum number of pins which is supported by the lookup-table.

Get the lookup-table for a net of degree num_pins.

Print number of POWVs and POSTs.

Heuristically break the net into sub-nets until they can be routed using the lookup-table.

Parameters
  • accuracy: Try this number of the most promising split locations. Use the best partitioning.

Trait Implementations

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.