0x1.5e-2     // invalid: hexadecimal mantissa requires p exponent
1_.5         // invalid: _ must separate successive digits
1._5         // invalid: _ must separate successive digits
1.5_e1       // invalid: _ must separate successive digits
1.5e_1       // invalid: _ must separate successive digits
1.5e1_       // invalid: _ must separate successive digits
</pre>


<h3 id="Imaginary_literals">Imaginary literals</h3>

<p>

    int initialBufferSize = min(BUFFER_SIZE, max(128, Integer.highestOneBit(totalLen) * 2));
    // Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers
    // quadruple in size until they reach 8k, to minimize the number of small reads for longer
    // streams. Buffers are retained in a deque so that there's no copying between buffers while

windowValue) p.Add(p, t) } return p, nil } var {{.p}}GeneratorTable *[{{.p}}ElementLength * 2]{{.p}}Table var {{.p}}GeneratorTableOnce sync.Once // generatorTable returns a sequence of {{.p}}Tables. The first table contains // multiples of G. Each successive table is the previous table doubled four // times. func (p *{{.P}}Point) generatorTable() *[{{.p}}ElementLength * 2]{{.p}}Table { {{.p}}GeneratorTableOnce.Do(func() { {{.p}}GeneratorTable = new([{{.p}}ElementLength * 2]{{.p}}Table) base := New{...

windowValue) p.Add(p, t) } return p, nil } var {{.p}}GeneratorTable *[{{.p}}ElementLength * 2]{{.p}}Table var {{.p}}GeneratorTableOnce sync.Once // generatorTable returns a sequence of {{.p}}Tables. The first table contains // multiples of G. Each successive table is the previous table doubled four // times. func (p *{{.P}}Point) generatorTable() *[{{.p}}ElementLength * 2]{{.p}}Table { {{.p}}GeneratorTableOnce.Do(func() { {{.p}}GeneratorTable = new([{{.p}}ElementLength * 2]{{.p}}Table) base := New{...