# Review

Demo:

 1. ‹bsearch› – binary search using spans

Prep:

 1. ‹dsort›     – in-place sort of a span
 2. ‹decomp›    – decompose a graph into connected components
 3. ‹tfold›     – tree fold on generic rooted trees
 4. ‹transpose› – in-place transpose of a matrix
 5. ‹nilpotent› – is a given matrix nilpotent
 6. ‹bexpr›     – parse and evaluate a boolean expression