-
-
-/* Modified binary search -- make intelligent guesses as to where the time
- might lie along the timeline, assuming that our target time lies a
- linear distance (w/o considering time jumps of a particular region).
-
- Assume that time does not fluctuate at all along the timeline -- e.g.,
- assume that a day will always take 86400 seconds, etc. -- and come up
- with a hypothetical value for the time_t representation of the struct tm
- TARGET, in relation to the guess variable -- it should be pretty close! */
+
+
+/* Modified b-search -- make intelligent guesses as to where the time
+ * might lie along the timeline, assuming that our target time lies a
+ * linear distance (w/o considering time jumps of a particular region).
+ *
+ * Assume that time does not fluctuate at all along the timeline --
+ * e.g., assume that a day will always take 86400 seconds, etc. -- and
+ * come up with a hypothetical value for the time_t representation of
+ * the struct tm TARGET, in relation to the guess variable -- it should
+ * be pretty close! */