@@ -191,6 +191,8 @@ def task_sqrt(x):
191191from math import cos as rcos
192192from math import sin as rsin
193193
194+ from numpy import nanmax , isnan
195+
194196if __name__ == '__main__' :
195197 """
196198This file contains the code under test for the example bug.
@@ -1645,11 +1647,11 @@ def get_all_input_specifications(dec_tree,
16451647import random
16461648from itertools import chain
16471649
1648- def best_trees (forest , spec ):
1650+ def best_trees (forest , spec , grammar ):
16491651 samples = [tree_to_string (tree ) for tree in forest ]
16501652 fulfilled_fractions = []
16511653 for sample in samples :
1652- gen_features = collect_features ([sample ], CALC_GRAMMAR )
1654+ gen_features = collect_features ([sample ], grammar )
16531655
16541656 # calculate percentage of fulfilled requirements (used to rank the sample)
16551657 fulfilled_count = 0
@@ -1716,7 +1718,7 @@ def generate_samples_advanced(grammar: Grammar,
17161718 done = False
17171719 starttime = time .time ()
17181720 best_chosen = [fuzzer .fuzz_tree () for _ in range (100 )]
1719- done , best_chosen = best_trees (best_chosen , spec )
1721+ done , best_chosen = best_trees (best_chosen , spec , grammar )
17201722 if done :
17211723 final_samples .append (tree_to_string (best_chosen ))
17221724
@@ -1756,7 +1758,7 @@ def generate_samples_advanced(grammar: Grammar,
17561758 curr = s [0 ]
17571759 except SyntaxError :
17581760 pass
1759- done , best_chosen = best_trees (best_chosen , spec )
1761+ done , best_chosen = best_trees (best_chosen , spec , grammar )
17601762 if done :
17611763 final_samples .append (tree_to_string (best_chosen ))
17621764 if not done :
@@ -1773,6 +1775,8 @@ def generate_samples_random(grammar, new_input_specifications, num):
17731775
17741776 return data
17751777
1778+ generate_samples = generate_samples_advanced
1779+
17761780if __name__ == '__main__' :
17771781 generate_samples = generate_samples_advanced
17781782
0 commit comments