Qucs-core
0.0.19
|
Go to the source code of this file.
Data Structures | |
struct | node_t |
struct | value_t |
struct | pair_t |
struct | definition_t |
struct | property_t |
struct | define_t |
Namespaces | |
namespace | qucs |
Defines | |
#define | MAX_PORTS 256 |
#define | PROP_ACTION 1 |
#define | PROP_COMPONENT 0 |
#define | PROP_SUBSTRATE 1 |
#define | PROP_NO_SUBSTRATE 0 |
#define | PROP_NONLINEAR 1 |
#define | PROP_LINEAR 0 |
#define | PROP_NODES -1 |
#define | PROP_NO_PROP |
#define | PROP_NO_VAL 0.0 |
#define | PROP_NO_STR ((char *) -1) |
#define | PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define | PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define | PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |
#define | PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define | PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define | PROP_MIN_VAL(k) { '[', k, 0, '.', { NULL } } |
#define | PROP_MAX_VAL(k) { '.', 0, k, ']', { NULL } } |
#define | PROP_MIN_VALX(k) { ']', k, 0, '.', { NULL } } |
#define | PROP_MAX_VALX(k) { '.', 0, k, '[', { NULL } } |
#define | PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define | PROP_RNGII(f, t) { '[', f, t, ']', { NULL } } |
#define | PROP_RNGXI(f, t) { ']', f, t, ']', { NULL } } |
#define | PROP_RNGIX(f, t) { '[', f, t, '[', { NULL } } |
#define | PROP_RNGXX(f, t) { ']', f, t, '[', { NULL } } |
#define | PROP_RNG_STR1(s) { '.', 0, 0, '.', { s, NULL } } |
#define | PROP_RNG_STR2(s1, s2) { '.', 0, 0, '.', { s1, s2, NULL } } |
#define | PROP_RNG_STR3(s1, s2, s3) { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define | PROP_RNG_STR4(s1, s2, s3, s4) { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define | PROP_RNG_STR5(s1, s2, s3, s4, s5) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define | PROP_RNG_STR6(s1, s2, s3, s4, s5, s6) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define | PROP_RNG_STR7(s1, s2, s3, s4, s5, s6, s7) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define | PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define | PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define | PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define | PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define | PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define | PROP_RNG_SOL |
#define | PROP_RNG_DIS |
#define | PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define | PROP_NONE -1 |
#define | PROP_INT 0 |
#define | PROP_REAL 1 |
#define | PROP_STR 2 |
#define | PROP_LIST 3 |
#define | PROP_IS_PROP(prop) ((prop).key != NULL) |
#define | PROP_IS_VAL(prop) ((prop).type != PROP_STR) |
#define | PROP_IS_INT(prop) ((prop).type == PROP_INT) |
#define | PROP_IS_STR(prop) (!PROP_IS_VAL (prop)) |
#define | PROP_IS_LST(prop) ((prop).type == PROP_LIST) |
#define | PROP_HAS_RANGE(prop) |
#define | PROP_HAS_STR(prop) ((prop).range.str[0] != NULL) |
#define | PROP_REQ static struct property_t required |
#define | PROP_OPT static struct property_t optional |
#define | PROP_DEF required, optional |
#define | create_definition() ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define | create_value() ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define | create_node() ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define | create_pair() ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define | MAX_PORTS 256 |
#define | PROP_ACTION 1 |
#define | PROP_COMPONENT 0 |
#define | PROP_SUBSTRATE 1 |
#define | PROP_NO_SUBSTRATE 0 |
#define | PROP_NONLINEAR 1 |
#define | PROP_LINEAR 0 |
#define | PROP_NODES -1 |
#define | PROP_NO_PROP |
#define | PROP_NO_VAL 0.0 |
#define | PROP_NO_STR ((char *) -1) |
#define | PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define | PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define | PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |
#define | PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define | PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define | PROP_MIN_VAL(k) { '[', k, 0, '.', { NULL } } |
#define | PROP_MAX_VAL(k) { '.', 0, k, ']', { NULL } } |
#define | PROP_MIN_VALX(k) { ']', k, 0, '.', { NULL } } |
#define | PROP_MAX_VALX(k) { '.', 0, k, '[', { NULL } } |
#define | PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define | PROP_RNGII(f, t) { '[', f, t, ']', { NULL } } |
#define | PROP_RNGXI(f, t) { ']', f, t, ']', { NULL } } |
#define | PROP_RNGIX(f, t) { '[', f, t, '[', { NULL } } |
#define | PROP_RNGXX(f, t) { ']', f, t, '[', { NULL } } |
#define | PROP_RNG_STR1(s) { '.', 0, 0, '.', { s, NULL } } |
#define | PROP_RNG_STR2(s1, s2) { '.', 0, 0, '.', { s1, s2, NULL } } |
#define | PROP_RNG_STR3(s1, s2, s3) { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define | PROP_RNG_STR4(s1, s2, s3, s4) { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define | PROP_RNG_STR5(s1, s2, s3, s4, s5) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define | PROP_RNG_STR6(s1, s2, s3, s4, s5, s6) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define | PROP_RNG_STR7(s1, s2, s3, s4, s5, s6, s7) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define | PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define | PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define | PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define | PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define | PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define | PROP_RNG_SOL |
#define | PROP_RNG_DIS |
#define | PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define | PROP_NONE -1 |
#define | PROP_INT 0 |
#define | PROP_REAL 1 |
#define | PROP_STR 2 |
#define | PROP_LIST 3 |
#define | PROP_IS_PROP(prop) ((prop).key != NULL) |
#define | PROP_IS_VAL(prop) ((prop).type != PROP_STR) |
#define | PROP_IS_INT(prop) ((prop).type == PROP_INT) |
#define | PROP_IS_STR(prop) (!PROP_IS_VAL (prop)) |
#define | PROP_IS_LST(prop) ((prop).type == PROP_LIST) |
#define | PROP_HAS_RANGE(prop) |
#define | PROP_HAS_STR(prop) ((prop).range.str[0] != NULL) |
#define | PROP_REQ static struct property_t required |
#define | PROP_OPT static struct property_t optional |
#define | PROP_DEF required, optional |
#define | create_definition() ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define | create_value() ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define | create_node() ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define | create_pair() ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define | MAX_PORTS 256 |
#define | PROP_ACTION 1 |
#define | PROP_COMPONENT 0 |
#define | PROP_SUBSTRATE 1 |
#define | PROP_NO_SUBSTRATE 0 |
#define | PROP_NONLINEAR 1 |
#define | PROP_LINEAR 0 |
#define | PROP_NODES -1 |
#define | PROP_NO_PROP |
#define | PROP_NO_VAL 0.0 |
#define | PROP_NO_STR ((char *) -1) |
#define | PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define | PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define | PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |
#define | PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define | PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define | PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define | PROP_MIN_VAL(k) { '[', k, 0, '.', { NULL } } |
#define | PROP_MAX_VAL(k) { '.', 0, k, ']', { NULL } } |
#define | PROP_MIN_VALX(k) { ']', k, 0, '.', { NULL } } |
#define | PROP_MAX_VALX(k) { '.', 0, k, '[', { NULL } } |
#define | PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define | PROP_RNGII(f, t) { '[', f, t, ']', { NULL } } |
#define | PROP_RNGXI(f, t) { ']', f, t, ']', { NULL } } |
#define | PROP_RNGIX(f, t) { '[', f, t, '[', { NULL } } |
#define | PROP_RNGXX(f, t) { ']', f, t, '[', { NULL } } |
#define | PROP_RNG_STR1(s) { '.', 0, 0, '.', { s, NULL } } |
#define | PROP_RNG_STR2(s1, s2) { '.', 0, 0, '.', { s1, s2, NULL } } |
#define | PROP_RNG_STR3(s1, s2, s3) { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define | PROP_RNG_STR4(s1, s2, s3, s4) { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define | PROP_RNG_STR5(s1, s2, s3, s4, s5) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define | PROP_RNG_STR6(s1, s2, s3, s4, s5, s6) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define | PROP_RNG_STR7(s1, s2, s3, s4, s5, s6, s7) { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define | PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define | PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define | PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define | PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define | PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define | PROP_RNG_SOL |
#define | PROP_RNG_DIS |
#define | PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define | PROP_NONE -1 |
#define | PROP_INT 0 |
#define | PROP_REAL 1 |
#define | PROP_STR 2 |
#define | PROP_LIST 3 |
#define | PROP_IS_PROP(prop) ((prop).key != NULL) |
#define | PROP_IS_VAL(prop) ((prop).type != PROP_STR) |
#define | PROP_IS_INT(prop) ((prop).type == PROP_INT) |
#define | PROP_IS_STR(prop) (!PROP_IS_VAL (prop)) |
#define | PROP_IS_LST(prop) ((prop).type == PROP_LIST) |
#define | PROP_HAS_RANGE(prop) |
#define | PROP_HAS_STR(prop) ((prop).range.str[0] != NULL) |
#define | PROP_REQ static struct property_t required |
#define | PROP_OPT static struct property_t optional |
#define | PROP_DEF required, optional |
#define | create_definition() ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define | create_value() ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define | create_node() ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define | create_pair() ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define create_definition | ( | ) | ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define create_definition | ( | ) | ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define create_definition | ( | ) | ((struct definition_t *) calloc (sizeof (struct definition_t), 1)) |
#define create_node | ( | ) | ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define create_node | ( | ) | ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define create_node | ( | ) | ((struct node_t *) calloc (sizeof (struct node_t), 1)) |
#define create_pair | ( | ) | ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define create_pair | ( | ) | ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define create_pair | ( | ) | ((struct pair_t *) calloc (sizeof (struct pair_t), 1)) |
#define create_value | ( | ) | ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define create_value | ( | ) | ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define create_value | ( | ) | ((struct value_t *) calloc (sizeof (struct value_t), 1)) |
#define MAX_PORTS 256 |
#define MAX_PORTS 256 |
#define PROP_ACTION 1 |
#define PROP_ACTION 1 |
#define PROP_ACTION 1 |
#define PROP_COMPONENT 0 |
#define PROP_COMPONENT 0 |
#define PROP_COMPONENT 0 |
#define PROP_DEF required, optional |
#define PROP_DEF required, optional |
#define PROP_HAS_RANGE | ( | prop | ) |
#define PROP_HAS_RANGE | ( | prop | ) |
#define PROP_HAS_RANGE | ( | prop | ) |
#define PROP_HAS_STR | ( | prop | ) | ((prop).range.str[0] != NULL) |
#define PROP_HAS_STR | ( | prop | ) | ((prop).range.str[0] != NULL) |
#define PROP_HAS_STR | ( | prop | ) | ((prop).range.str[0] != NULL) |
#define PROP_INT 0 |
#define PROP_INT 0 |
#define PROP_IS_INT | ( | prop | ) | ((prop).type == PROP_INT) |
#define PROP_IS_INT | ( | prop | ) | ((prop).type == PROP_INT) |
#define PROP_IS_INT | ( | prop | ) | ((prop).type == PROP_INT) |
#define PROP_IS_LST | ( | prop | ) | ((prop).type == PROP_LIST) |
#define PROP_IS_LST | ( | prop | ) | ((prop).type == PROP_LIST) |
#define PROP_IS_LST | ( | prop | ) | ((prop).type == PROP_LIST) |
#define PROP_IS_PROP | ( | prop | ) | ((prop).key != NULL) |
#define PROP_IS_PROP | ( | prop | ) | ((prop).key != NULL) |
#define PROP_IS_PROP | ( | prop | ) | ((prop).key != NULL) |
#define PROP_IS_STR | ( | prop | ) | (!PROP_IS_VAL (prop)) |
#define PROP_IS_STR | ( | prop | ) | (!PROP_IS_VAL (prop)) |
#define PROP_IS_STR | ( | prop | ) | (!PROP_IS_VAL (prop)) |
#define PROP_IS_VAL | ( | prop | ) | ((prop).type != PROP_STR) |
#define PROP_IS_VAL | ( | prop | ) | ((prop).type != PROP_STR) |
#define PROP_IS_VAL | ( | prop | ) | ((prop).type != PROP_STR) |
#define PROP_LINEAR 0 |
#define PROP_LINEAR 0 |
#define PROP_LINEAR 0 |
#define PROP_LIST 3 |
#define PROP_LIST 3 |
#define PROP_MAX_VAL | ( | k | ) | { '.', 0, k, ']', { NULL } } |
#define PROP_MAX_VAL | ( | k | ) | { '.', 0, k, ']', { NULL } } |
#define PROP_MAX_VAL | ( | k | ) | { '.', 0, k, ']', { NULL } } |
#define PROP_MAX_VALX | ( | k | ) | { '.', 0, k, '[', { NULL } } |
#define PROP_MAX_VALX | ( | k | ) | { '.', 0, k, '[', { NULL } } |
#define PROP_MAX_VALX | ( | k | ) | { '.', 0, k, '[', { NULL } } |
#define PROP_MIN_VAL | ( | k | ) | { '[', k, 0, '.', { NULL } } |
#define PROP_MIN_VAL | ( | k | ) | { '[', k, 0, '.', { NULL } } |
#define PROP_MIN_VAL | ( | k | ) | { '[', k, 0, '.', { NULL } } |
#define PROP_MIN_VALX | ( | k | ) | { ']', k, 0, '.', { NULL } } |
#define PROP_MIN_VALX | ( | k | ) | { ']', k, 0, '.', { NULL } } |
#define PROP_MIN_VALX | ( | k | ) | { ']', k, 0, '.', { NULL } } |
#define PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define PROP_NEG_RANGE { '.', 0, 0, ']', { NULL } } |
#define PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define PROP_NEG_RANGEX { '.', 0, 0, '[', { NULL } } |
#define PROP_NO_PROP |
{ NULL, PROP_REAL, { PROP_NO_VAL, PROP_NO_STR }, \ PROP_NO_RANGE }
#define PROP_NO_PROP |
{ NULL, PROP_REAL, { PROP_NO_VAL, PROP_NO_STR }, \ PROP_NO_RANGE }
#define PROP_NO_PROP |
{ NULL, PROP_REAL, { PROP_NO_VAL, PROP_NO_STR }, \ PROP_NO_RANGE }
#define PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define PROP_NO_RANGE { '.', 0, 0, '.', { NULL } } |
#define PROP_NO_STR ((char *) -1) |
#define PROP_NO_STR ((char *) -1) |
#define PROP_NO_STR ((char *) -1) |
#define PROP_NO_SUBSTRATE 0 |
#define PROP_NO_SUBSTRATE 0 |
#define PROP_NO_SUBSTRATE 0 |
#define PROP_NO_VAL 0.0 |
#define PROP_NO_VAL 0.0 |
#define PROP_NO_VAL 0.0 |
#define PROP_NODES -1 |
#define PROP_NODES -1 |
#define PROP_NODES -1 |
#define PROP_NONE -1 |
#define PROP_NONE -1 |
#define PROP_NONLINEAR 1 |
#define PROP_NONLINEAR 1 |
#define PROP_NONLINEAR 1 |
#define PROP_OPT static struct property_t optional |
#define PROP_OPT static struct property_t optional |
#define PROP_OPT static struct property_t optional |
#define PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define PROP_POS_RANGE { '[', 0, 0, '.', { NULL } } |
#define PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define PROP_POS_RANGEX { ']', 0, 0, '.', { NULL } } |
#define PROP_REAL 1 |
#define PROP_REAL 1 |
#define PROP_REQ static struct property_t required |
#define PROP_REQ static struct property_t required |
#define PROP_REQ static struct property_t required |
#define PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define PROP_RNG_BJT PROP_RNG_STR2 ("npn", "pnp") |
#define PROP_RNG_DIS |
PROP_RNG_STR7 ("Kirschning", "Kobayashi", "Yamashita", "Getsinger", \ "Schneider", "Pramanick", "Hammerstad")
#define PROP_RNG_DIS |
PROP_RNG_STR7 ("Kirschning", "Kobayashi", "Yamashita", "Getsinger", \ "Schneider", "Pramanick", "Hammerstad")
#define PROP_RNG_DIS |
PROP_RNG_STR7 ("Kirschning", "Kobayashi", "Yamashita", "Getsinger", \ "Schneider", "Pramanick", "Hammerstad")
#define PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define PROP_RNG_FET PROP_RNG_STR2 ("nfet", "pfet") |
#define PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define PROP_RNG_MOD PROP_RNG_STR3 ("Wheeler", "Schneider", "Hammerstad") |
#define PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define PROP_RNG_MOS PROP_RNG_STR2 ("nmos", "pmos") |
#define PROP_RNG_SOL |
PROP_RNG_STR5 ("CroutLU", "DoolittleLU", "HouseholderQR", \ "HouseholderLQ", "GolubSVD")
#define PROP_RNG_SOL |
PROP_RNG_STR5 ("CroutLU", "DoolittleLU", "HouseholderQR", \ "HouseholderLQ", "GolubSVD")
#define PROP_RNG_SOL |
PROP_RNG_STR5 ("CroutLU", "DoolittleLU", "HouseholderQR", \ "HouseholderLQ", "GolubSVD")
#define PROP_RNG_STR1 | ( | s | ) | { '.', 0, 0, '.', { s, NULL } } |
#define PROP_RNG_STR1 | ( | s | ) | { '.', 0, 0, '.', { s, NULL } } |
#define PROP_RNG_STR1 | ( | s | ) | { '.', 0, 0, '.', { s, NULL } } |
#define PROP_RNG_STR2 | ( | s1, | |
s2 | |||
) | { '.', 0, 0, '.', { s1, s2, NULL } } |
#define PROP_RNG_STR2 | ( | s1, | |
s2 | |||
) | { '.', 0, 0, '.', { s1, s2, NULL } } |
#define PROP_RNG_STR2 | ( | s1, | |
s2 | |||
) | { '.', 0, 0, '.', { s1, s2, NULL } } |
#define PROP_RNG_STR3 | ( | s1, | |
s2, | |||
s3 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define PROP_RNG_STR3 | ( | s1, | |
s2, | |||
s3 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define PROP_RNG_STR3 | ( | s1, | |
s2, | |||
s3 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, NULL } } |
#define PROP_RNG_STR4 | ( | s1, | |
s2, | |||
s3, | |||
s4 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define PROP_RNG_STR4 | ( | s1, | |
s2, | |||
s3, | |||
s4 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define PROP_RNG_STR4 | ( | s1, | |
s2, | |||
s3, | |||
s4 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, NULL } } |
#define PROP_RNG_STR5 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define PROP_RNG_STR5 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define PROP_RNG_STR5 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, NULL } } |
#define PROP_RNG_STR6 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define PROP_RNG_STR6 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define PROP_RNG_STR6 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, NULL } } |
#define PROP_RNG_STR7 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6, | |||
s7 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define PROP_RNG_STR7 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6, | |||
s7 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define PROP_RNG_STR7 | ( | s1, | |
s2, | |||
s3, | |||
s4, | |||
s5, | |||
s6, | |||
s7 | |||
) | { '.', 0, 0, '.', { s1, s2, s3, s4, s5, s6, s7, NULL } } |
#define PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define PROP_RNG_TYP PROP_RNG_STR4 ("lin", "log", "list", "const") |
#define PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define PROP_RNG_X01I { ']', 0, 1, ']', { NULL } } |
#define PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define PROP_RNG_YESNO PROP_RNG_STR2 ("yes", "no") |
#define PROP_RNGII | ( | f, | |
t | |||
) | { '[', f, t, ']', { NULL } } |
#define PROP_RNGII | ( | f, | |
t | |||
) | { '[', f, t, ']', { NULL } } |
#define PROP_RNGII | ( | f, | |
t | |||
) | { '[', f, t, ']', { NULL } } |
#define PROP_RNGIX | ( | f, | |
t | |||
) | { '[', f, t, '[', { NULL } } |
#define PROP_RNGIX | ( | f, | |
t | |||
) | { '[', f, t, '[', { NULL } } |
#define PROP_RNGIX | ( | f, | |
t | |||
) | { '[', f, t, '[', { NULL } } |
#define PROP_RNGXI | ( | f, | |
t | |||
) | { ']', f, t, ']', { NULL } } |
#define PROP_RNGXI | ( | f, | |
t | |||
) | { ']', f, t, ']', { NULL } } |
#define PROP_RNGXI | ( | f, | |
t | |||
) | { ']', f, t, ']', { NULL } } |
#define PROP_RNGXX | ( | f, | |
t | |||
) | { ']', f, t, '[', { NULL } } |
#define PROP_RNGXX | ( | f, | |
t | |||
) | { ']', f, t, '[', { NULL } } |
#define PROP_RNGXX | ( | f, | |
t | |||
) | { ']', f, t, '[', { NULL } } |
#define PROP_STR 2 |
#define PROP_STR 2 |
#define PROP_SUBSTRATE 1 |
#define PROP_SUBSTRATE 1 |
#define PROP_SUBSTRATE 1 |
#define PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define PROP_VAL_MAX std::numeric_limits<nr_double_t>::max() |
#define PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |
#define PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |
#define PROP_VAL_MIN std::numeric_limits<nr_double_t>::min() |