if (tail_branch == n_leaves) {
/*
* We're not getting here, no way, never ever.
- * Unless we made a terible mistake.
+ * Unless we made a terrible mistake.
*
* That is, in a binary tree with n leaves,
* there are ALWAYS n-1 internal nodes.
}
/*
- * requantize by halfing and rounding up, so that small counts
+ * requantize by halving and rounding up, so that small counts
* become relatively bigger. This will lead to a flatter tree.
*/
for (i = 0; i < n_leaves; i++) {
* # input bytes are read for match lengths.
*
* Note that we *don't* specifically check for the EOF marker (symbol
- * 256) in this loop, because the a precondition for stopping for the
+ * 256) in this loop, because the precondition for stopping for the
* EOF marker is that the output buffer is full (otherwise, you
* wouldn't know which 256 is EOF, rather than an actual symbol), and
* we *always* want to stop when the buffer is full. So we work out if
- * there is an EOF in in another loop after we stop writing.
+ * there is an EOF in another loop after we stop writing.
*/
index = 0;