Compute the hash-consed size from the info_map. This is the theoretical size if each unique subterm were stored once in a content-addressed store. Each unique expression = 32-byte key + value (with 32-byte hash references for children/externals).
( info_map: &std::collections::HashMap<blake3::Hash, sharing::SubtermInfo>, )
| 1596 | } |
| 1597 | })?; |
| 1598 | |
| 1599 | let (ref_idx, _) = cache.refs.insert_full(type_addr.clone()); |
| 1600 | let name_addr = compile_name(type_name, stt); |
| 1601 | |
| 1602 | stack.push(Frame::BuildProj(ref_idx as u64, idx_u64, name_addr)); |
| 1603 | stack.push(Frame::Compile(struct_val.clone())); |
| 1604 | }, |
| 1605 |
no outgoing calls
no test coverage detected