paul@368 | 1 | Fix object table entries for attributes not provided by any known object, or provide an
|
paul@368 | 2 | error, potentially overridden by options. For example, the augmented assignment methods
|
paul@368 | 3 | are not supported by the built-in objects and thus the operator module functions cause
|
paul@368 | 4 | the compilation to fail.
|
paul@368 | 5 |
|
paul@368 | 6 | Support tuple parameters.
|
paul@364 | 7 |
|
paul@364 | 8 | Consider type deduction and its consequences where types belong to the same hierarchy
|
paul@364 | 9 | and where a guard could be generated for the most general type.
|
paul@364 | 10 |
|
paul@364 | 11 | Consider attribute merging where many attributes are just aliases for the same underlying
|
paul@364 | 12 | definition.
|
paul@364 | 13 |
|
paul@362 | 14 | Consider merging the InspectedModule.store tests with the scope conflict handling.
|
paul@362 | 15 |
|
paul@364 | 16 | Consider permitting multiple class alternatives where the attributes are all identical.
|
paul@364 | 17 |
|
paul@360 | 18 | Support class attribute positioning similar to instance attribute positioning, potentially
|
paul@360 | 19 | (for both) based on usage observations. For example, if __iter__ is used on two classes,
|
paul@360 | 20 | the class attribute could be exposed at a similar relative position to the class (and
|
paul@360 | 21 | potentially accessible using a LoadAttr-style instruction).
|
paul@360 | 22 |
|
paul@349 | 23 | Consider references to defaults as occurring only within the context of a particular
|
paul@349 | 24 | function, thus eliminating default value classes if such functions are not themselves
|
paul@349 | 25 | invoked.
|
paul@349 | 26 |
|
paul@343 | 27 | Consider labelling _scope on assignments and dealing with the assignment of removed
|
paul@343 | 28 | attributes, possibly removing the entire assignment, and distinguishing between such cases
|
paul@343 | 29 | and unknown names.
|
paul@343 | 30 |
|
paul@342 | 31 | Check name origin where multiple branches could yield multiple scope interpretations:
|
paul@342 | 32 |
|
paul@342 | 33 | ----
|
paul@342 | 34 | try:
|
paul@342 | 35 | set # built-in name
|
paul@342 | 36 | except NameError:
|
paul@342 | 37 | from sets import Set as set # local definition of name
|
paul@342 | 38 |
|
paul@342 | 39 | set # could be confused by the local definition at run-time
|
paul@342 | 40 | ----
|
paul@342 | 41 |
|
paul@332 | 42 | Support __init__ traversal (and other implicit names) more effectively.
|
paul@332 | 43 |
|
paul@332 | 44 | Check context_value initialisation (avoiding or handling None effectively).
|
paul@332 | 45 |
|
paul@342 | 46 | __getitem__ could be written in Python, using a native method only to access fragments.
|
paul@349 | 47 |
|
paul@342 | 48 | Support slicing.
|
paul@349 | 49 |
|
paul@342 | 50 | Consider better "macro" support where new expressions need to be generated and processed.
|
paul@342 | 51 |
|
paul@342 | 52 | **** Constant attribute users need not maintain usage since they are already resolved. ****
|
paul@342 | 53 |
|
paul@310 | 54 | Loop entry points should capture usage to update later assignments in the loop.
|
paul@310 | 55 | The continue and break statements should affect usage propagation.
|
paul@304 | 56 |
|
paul@304 | 57 | Consider handling CallFunc in micropython.inspect in order to produce instances of specific classes.
|
paul@304 | 58 | Then, consider adding support for guard removal/verification where known instances are involved.
|
paul@304 | 59 | Consider handling branches of values within namespaces in order to support more precise value usage.
|