Hello All,
I have a class, where for each value of variable1, only few of the possible values of other variables are valid.
In other words, I have too many illegal combinations to constraint and few valid combinations.
I fear writing too many constraints will slowdown the constraint solver, is my assumption valid?
I thought of implementing the above by populate the queue with the valid combinations and based on user inputs, I search the queue for valid objects and return a valid one, instead of randomizing with too may constraints.
The same class has few other variables that can be randomized and above method will not work as there are too many valid combinations.
For that I need to implement a function say “pseudo_randomize” that can take two “with clauses” that contain an expression for “find_index” and an “in-line constraint” block.
But I am not sure how to implement a function that can do so.
Function call should look something like below.
pseudo_randomize() with_find {} with_constraints {};
or
pseudo_randomize({expression_for_search}, {constraints_to_randomize});
Any out of the box solutions to solve above are also welcome.
Thanks & Regards,
Krishna