A range table is a table of values that are indexed by ranges. It can be viewed as a map from contiguous ranges [a,b] to v.
More...
#include <tech.h>
|
int | sz |
|
int * | table |
| range table contents
|
|
int | minval |
| minimum value of range
|
|
A range table is a table of values that are indexed by ranges. It can be viewed as a map from contiguous ranges [a,b] to v.
More information about the format of a range table can be found at: https://avlsi.csl.yale.edu/act/doku.php?id=config:layout&s[]=range&s[]=table::range_tables This is used to hold design rules where the rule is indexed by the value of another parameter (e.g. minimum width of a metal depends on the length of the metal wire)
◆ RangeTable()
RangeTable::RangeTable |
( |
int |
_s, |
|
|
int * |
_tab |
|
) |
| |
|
inline |
- Parameters
-
_s | is the size of the range table |
_tab | is the range table, in the standard range table format |
◆ min()
- Returns
- the minimum value in the range table
◆ operator[]()
int RangeTable::operator[] |
( |
int |
idx | ) |
|
An array operator overload that is used so that the range table can be accessed like a simple array.
- Parameters
-
idx | is the index to look up in the range table |
- Returns
- the value stored in the range table for the given index
◆ range_threshold()
int RangeTable::range_threshold |
( |
int |
idx | ) |
|
Return the minimum value for the i-th range in the range tablel
- Parameters
-
- Returns
- the min value of the idx-th range.
◆ size()
- Returns
- the number of entries in the range table
◆ minval
◆ sz
◆ table
The documentation for this class was generated from the following file: