// Should skip invalid line
        PagingList<CharMappingItem> result = charMappingFile.selectList(0, 10);
        assertEquals(2, result.size());
    }

    // Test reload with missing arrow
    public void test_reload_missingArrow() throws Exception {
        writeTestFile("a,b c\n");

        PagingList<CharMappingItem> result = charMappingFile.selectList(0, 10);
        assertEquals(0, result.size());

    /*
     * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
     *
     * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
     * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
     * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
     */
    int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)];

        of simply using the `dtype` & `shape`.
    *   [Improve support](https://github.com/tensorflow/tensorflow/issues/33862)
        for dynamically-sized TensorArray inside `tf.function`.
*   `tf.math`:
    *   Narrow down `argmin`/`argmax` contract to always return the smallest
        index for ties.
    *   `tf.math.reduce_variance` and `tf.math.reduce_std` return correct