|
| 1 | +from dataclasses import make_dataclass |
| 2 | +import typing |
| 3 | +import dataclasses |
| 4 | +import json |
| 5 | +import polyfempy |
| 6 | + |
| 7 | +def getter(contain, key): |
| 8 | + if key not in contain: |
| 9 | + return [] |
| 10 | + return contain[key] |
| 11 | + |
| 12 | +def parse_tree(rules, mark_required = False): |
| 13 | + tree = dict() |
| 14 | + for r in rules: |
| 15 | + pt = r['pointer'] |
| 16 | + pt = pt.replace('/*','') |
| 17 | + |
| 18 | + path = pt.split('/') |
| 19 | + if pt == '/': |
| 20 | + path = [''] |
| 21 | + |
| 22 | + subtree = tree |
| 23 | + for k in path: |
| 24 | + if k not in subtree: |
| 25 | + subtree[k] = dict() |
| 26 | + subtree = subtree[k] |
| 27 | + req, opt = (getter(r,'required'), getter(r, 'optional')) |
| 28 | + for k in req: |
| 29 | + if k not in subtree: |
| 30 | + subtree[k] = {} |
| 31 | + if mark_required: |
| 32 | + subtree[k]['R'] = '0' |
| 33 | + for k in opt: |
| 34 | + if k not in subtree: |
| 35 | + subtree[k] = {} |
| 36 | + return tree |
| 37 | + |
| 38 | + |
| 39 | +def snake_to_camel(name): |
| 40 | + if name == '': |
| 41 | + return 'PolyFEM' |
| 42 | + return ''.join([n.capitalize() for n in name.split('_')]) |
| 43 | + |
| 44 | +def print_script(): |
| 45 | + # deprecated to the make_dataclasses interface |
| 46 | + key = '' |
| 47 | + node = tree[key] |
| 48 | + indent = 4 |
| 49 | + repre = 'from dataclasses import dataclass\nimport typing\n' |
| 50 | + |
| 51 | + def rec(key, val, h): |
| 52 | + global repre |
| 53 | + if key == 'lambda': |
| 54 | + return |
| 55 | + if key !='': |
| 56 | + repre += (' '*h*indent + f'{key} : typing.Any = None\n') |
| 57 | + |
| 58 | + if len(val) == 0: |
| 59 | + return |
| 60 | + classname = snake_to_camel(key) |
| 61 | + repre += (' '*h*indent + f'@dataclass\n') |
| 62 | + repre += (' '*h*indent + f'class {classname}:\n') |
| 63 | + for k,v in (val.items()): |
| 64 | + rec(k,v, h+1) |
| 65 | + |
| 66 | + rec(key, node, 0) |
| 67 | + |
| 68 | + repre += """ |
| 69 | + if __name__ == '__main__': |
| 70 | + print(PolyFEM(geometry='mesh.obj')) |
| 71 | + """ |
| 72 | + |
| 73 | + with open('test.py', 'w') as fp: |
| 74 | + fp.write(repre) |
| 75 | + |
| 76 | + |
| 77 | + |
| 78 | +def recursive_data_class_builder(node, name): |
| 79 | + fields = [] |
| 80 | + namespace = dict() |
| 81 | + for k, v in node.items(): |
| 82 | + if k == 'lambda': |
| 83 | + continue |
| 84 | + fields.append((k,typing.Any,None)) |
| 85 | + if isinstance(v, dict) and len(v) != 0: |
| 86 | + name0 = snake_to_camel(k) |
| 87 | + namespace[name0] = recursive_data_class_builder(v, name0) |
| 88 | + return make_dataclass(name, fields=fields, namespace = namespace) |
| 89 | + |
| 90 | + |
| 91 | +def prune_none_entry(node): |
| 92 | + if not isinstance(node, dict): |
| 93 | + if isinstance(node, list): |
| 94 | + for v in node: |
| 95 | + prune_none_entry(v) |
| 96 | + else: |
| 97 | + for k, v in list(node.items()): |
| 98 | + prune_none_entry(v) |
| 99 | + if v is None or (hasattr(v, '__len__') and len(v) == 0): |
| 100 | + node.pop(k) |
| 101 | + |
| 102 | +def generate_input_dict(config): |
| 103 | + output = dataclasses.asdict(config) |
| 104 | + prune_none_entry(output) |
| 105 | + return output |
| 106 | + |
| 107 | + |
| 108 | +with open('data/default_rules.json')as fp: |
| 109 | + rules = json.load(fp) |
| 110 | + |
| 111 | +tree = parse_tree(rules) |
| 112 | +pf = recursive_data_class_builder(tree[''], '') |
| 113 | + |
| 114 | +geometry = pf.Geometry(mesh='import.obj') |
| 115 | +matnu = pf.Materials(id = 0, nu=0.1) |
| 116 | +matE = pf.Materials(id = 1,E=10) |
| 117 | + |
| 118 | +config = pf(geometry = geometry, materials = [matnu, matE]) |
| 119 | + |
| 120 | +def solve(**kwargs): |
| 121 | + d = generate_input_dict(config) |
| 122 | + polyfempy.solve(**d) |
0 commit comments