{"ast_node_type":"other","tokens":[{"end":95,"kind":"keyword","start":0,"text":"//!"}]}
//! exhaustiveness problem. See [here](https://niedzejkob.p4.team/rust-np) for the fun details.
//! Fun fact: computing exhaustiveness is NP-complete, because we can encode a SAT problem as an
//!