// Copyright 2018 Klaus Post. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Based on work Copyright (c) 2013, Yann Collet, released under BSD License.

package fse

import 

// bitWriter will write bits.
// First bit will be LSB of the first byte of output.
type bitWriter struct {
	bitContainer uint64
	nBits        uint8
	out          []byte
}

// bitMask16 is bitmasks. Has extra to avoid bounds check.
var bitMask16 = [32]uint16{
	0, 1, 3, 7, 0xF, 0x1F,
	0x3F, 0x7F, 0xFF, 0x1FF, 0x3FF, 0x7FF,
	0xFFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF, 0xFFFF,
	0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF,
	0xFFFF, 0xFFFF} /* up to 16 bits */

// addBits16NC will add up to 16 bits.
// It will not check if there is space for them,
// so the caller must ensure that it has flushed recently.
func ( *bitWriter) ( uint16,  uint8) {
	.bitContainer |= uint64(&bitMask16[&31]) << (.nBits & 63)
	.nBits += 
}

// addBits16Clean will add up to 16 bits. value may not contain more set bits than indicated.
// It will not check if there is space for them, so the caller must ensure that it has flushed recently.
func ( *bitWriter) ( uint16,  uint8) {
	.bitContainer |= uint64() << (.nBits & 63)
	.nBits += 
}

// addBits16ZeroNC will add up to 16 bits.
// It will not check if there is space for them,
// so the caller must ensure that it has flushed recently.
// This is fastest if bits can be zero.
func ( *bitWriter) ( uint16,  uint8) {
	if  == 0 {
		return
	}
	 <<= (16 - ) & 15
	 >>= (16 - ) & 15
	.bitContainer |= uint64() << (.nBits & 63)
	.nBits += 
}

// flush will flush all pending full bytes.
// There will be at least 56 bits available for writing when this has been called.
// Using flush32 is faster, but leaves less space for writing.
func ( *bitWriter) () {
	 := .nBits >> 3
	switch  {
	case 0:
	case 1:
		.out = append(.out,
			byte(.bitContainer),
		)
	case 2:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
		)
	case 3:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
		)
	case 4:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
			byte(.bitContainer>>24),
		)
	case 5:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
			byte(.bitContainer>>24),
			byte(.bitContainer>>32),
		)
	case 6:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
			byte(.bitContainer>>24),
			byte(.bitContainer>>32),
			byte(.bitContainer>>40),
		)
	case 7:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
			byte(.bitContainer>>24),
			byte(.bitContainer>>32),
			byte(.bitContainer>>40),
			byte(.bitContainer>>48),
		)
	case 8:
		.out = append(.out,
			byte(.bitContainer),
			byte(.bitContainer>>8),
			byte(.bitContainer>>16),
			byte(.bitContainer>>24),
			byte(.bitContainer>>32),
			byte(.bitContainer>>40),
			byte(.bitContainer>>48),
			byte(.bitContainer>>56),
		)
	default:
		panic(fmt.Errorf("bits (%d) > 64", .nBits))
	}
	.bitContainer >>=  << 3
	.nBits &= 7
}

// flush32 will flush out, so there are at least 32 bits available for writing.
func ( *bitWriter) () {
	if .nBits < 32 {
		return
	}
	.out = append(.out,
		byte(.bitContainer),
		byte(.bitContainer>>8),
		byte(.bitContainer>>16),
		byte(.bitContainer>>24))
	.nBits -= 32
	.bitContainer >>= 32
}

// flushAlign will flush remaining full bytes and align to next byte boundary.
func ( *bitWriter) () {
	 := (.nBits + 7) >> 3
	for  := range  {
		.out = append(.out, byte(.bitContainer>>(*8)))
	}
	.nBits = 0
	.bitContainer = 0
}

// close will write the alignment bit and write the final byte(s)
// to the output.
func ( *bitWriter) () {
	// End mark
	.addBits16Clean(1, 1)
	// flush until next byte.
	.flushAlign()
}

// reset and continue writing by appending to out.
func ( *bitWriter) ( []byte) {
	.bitContainer = 0
	.nBits = 0
	.out = 
}