{"ast_node_type":"other","tokens":[{"end":3,"kind":"keyword","start":0,"text":"///"}]}
///
/// are *O*(*n*) but elements can be iterated in order cheaply.
/// `SortedMap` can be faster than a `BTreeMap` for small sizes (<50) since it