Alex Ozdemir d7217e559e Optimize GC (#166) ...

Previously, a GC call would scan the HC table, identifying dead nodes.

Now, whenever a Node is destroyed, if it's ready to be GC'd, it gets added to a list. That list is used at GC time instead of the scan.

This substantially decreases the cost of running GC many times (as the Z# FE does).

2023-07-09 14:45:14 -07:00

..

examples

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00

src

Optimize GC (#166)

2023-07-09 14:45:14 -07:00

.gitignore

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00

Cargo.toml

Optimize GC (#166)

2023-07-09 14:45:14 -07:00

generate_macro.zsh

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00

generate_u8.zsh

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00

Makefile

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00

out.csv

Optimize GC (#166)

2023-07-09 14:45:14 -07:00

rust-toolchain.toml

Split hash-consing into its own crate & reimplement (#134)

2023-01-17 02:17:58 -08:00