// expect: 0 drop 7 1 1 1 0/
// destructors 6: the collector runs an unreachable value's drop after the sweep, exactly once; later collections never run it again
include rt;
int n;
word g;
fn make() { g = drop(heap(7), fn() { n++; rt.put_s("drop "); rt.put_n(*this); rt.put_c(32); }); return 0; }
fn main() {
	make();
	rt.gc(); rt.put_n(n); rt.put_c(32);
	g = 0;
	rt.gc(); rt.put_n(n); rt.put_c(32);
	rt.gc(); rt.put_n(n); rt.put_c(32);
	rt.gc(); rt.put_n(n); rt.put_c(32);
	rt.put_n(rt.dcount); rt.put_c(10);	// its entry is gone with the block
	return 0;
}
// zc0: skip