/* -*- c++ -*- */
/* 
 * Copyright 2019 Jay Arrowfield.
 * 
 * This is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 3, or (at your option)
 * any later version.
 * 
 * This software is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this software; see the file COPYING.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street,
 * Boston, MA 02110-1301, USA.
 */

#ifndef INCLUDED_JAY_BIT_PACKER_IMPL_H
#define INCLUDED_JAY_BIT_PACKER_IMPL_H

#include <jay/bit_packer.h>

namespace gr {
  namespace jay {

    class bit_packer_impl : public bit_packer
    {
	private:
      // Nothing to declare in this block.
	int m_inputCounter;
	int m_numBitsIn;
	int m_numBitsOut;
	int m_endianess;
	int m_output;
	int m_gapCount;
	int m_patternMatchCount[2];
	static const uint8_t m_pattern[2][18];
	void patternMatchProcess(uint8_t byte);
	void patternMatchReset();
	void reset();
	public:
	bit_packer_impl(int numBitsIn, int numBitsOut, int endianess);
	~bit_packer_impl();

	// Where all the action really happens
	void forecast (int noutput_items, gr_vector_int &ninput_items_required);

	int general_work(int noutput_items,
		gr_vector_int &ninput_items,
		gr_vector_const_void_star &input_items,
		gr_vector_void_star &output_items);
    };

  } // namespace jay
} // namespace gr

#endif /* INCLUDED_JAY_BIT_PACKER_IMPL_H */

