-* *
-* Since we can (& do) meet with exponents like 10^5000, it *
-* is silly to make a table of ~ 10,000 entries, one for each *
-* power of 10. We keep a table where item [n] is a struct *
-* FLONUM_FLOATING_POINT representing 10^(2^n). We then *
-* multiply appropriate entries from this table to get any *
-* particular power of 10. For the example of 10^5000, a table *
-* of just 25 entries suffices: 10^(2^-12)...10^(2^+12). *
-* *
-\***********************************************************************/
+ * *
+ * Since we can (& do) meet with exponents like 10^5000, it *
+ * is silly to make a table of ~ 10,000 entries, one for each *
+ * power of 10. We keep a table where item [n] is a struct *
+ * FLONUM_FLOATING_POINT representing 10^(2^n). We then *
+ * multiply appropriate entries from this table to get any *
+ * particular power of 10. For the example of 10^5000, a table *
+ * of just 25 entries suffices: 10^(2^-12)...10^(2^+12). *
+ * *
+ \***********************************************************************/