- * Since we are traversing the sorted feature array, all elements prior to the
- * one we are working on have been fully linked. All we are doing is following
- * those links until we find the first array feature with a containedBy
- * element that has an end >= our begin point. It is generally a very short
- * list -- maybe one or two depths. But it might be more than that.
+ * Since we are traversing the sorted feature array in a forward direction,
+ * all elements prior to the one we are working on have been fully linked. All
+ * we are doing is following those links until we find the first array feature
+ * with a containedBy element that has an end >= our begin point. It is
+ * generally a very short list -- maybe one or two depths. But it might be
+ * more than that.