New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[FEAT] Discover Packed Dynamic Arrays #74

Open

2 tasks

iamrecursion opened this issue Sep 8, 2023 · 0 comments

Labels

Contributor

iamrecursion commented Sep 8, 2023

Description

Where a whole multiple of a type can fit into a single storage slots, dynamic arrays pack these. We should be able to discover this.

Spec

Work out what patterns are used to access elements of such arrays.
Implement lifting passes and/or inference rules to make this work.

iamrecursion added the enhancement label

iamrecursion changed the title ~~[TASK] Discover Packed Dynamic Arrays~~ [FEAT] Discover Packed Dynamic Arrays

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment