# stage1: recursively resolve lazy values before hashing · gitcafe/zig

[View on GitCafe](https://git.cafe/gitcafe/zig/commit/9b0868776646934bdec84888dabebbb2b8d9924e)

Repository: [gitcafe/zig](https://git.cafe/gitcafe/zig)

Visibility: public

Requested revision: 9b0868776646934bdec84888dabebbb2b8d9924e

Requested commit: 9b0868776646934bdec84888dabebbb2b8d9924e

Commit: 9b0868776646934bdec84888dabebbb2b8d9924e

Tree: 3639f84c9895f4a16687296ced79ebde232bd9b5

Author: Andrew Kelley

Committer: Andrew Kelley

## Message

```
stage1: recursively resolve lazy values before hashing

When putting ZigValues into a hash map. The hash of a lazy value
and a fully resolved value must equal, and so we must resolve
the lazy values prior. The hash function asserts that none of
the values are lazy.

```

## Parents

- [b7da1b2d45bc42a56eea3a143e4237a0712c4769](https://git.cafe/gitcafe/zig/commit/b7da1b2d45bc42a56eea3a143e4237a0712c4769?format=markdown)

[Source at this commit](https://git.cafe/gitcafe/zig/tree/9b0868776646934bdec84888dabebbb2b8d9924e?format=markdown)