/* MapperRev.h
 * Copyright (C) 2012, Francisco Claude, all rights reserved.
 *
 * MapperRev definition
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */

#ifndef _MAPPERREV_H
#define _MAPPERREV_H

#include <libcdsBasics.h>
#include <iostream>

#include <Array.h>
#include <Mapper.h>
#include <BitSequence.h>
#include <BitSequenceBuilder.h>

using namespace std;
using namespace cds_utils;

namespace cds_static
{

	/** Mapper that reverses the bits (considering how many bits are required 
	 *  to represent the maximum value in the sequence)
	 *
	 *  @author Francisco Claude
	 */
	class MapperRev : public Mapper
	{
		public:
			MapperRev(const Array &a);
			MapperRev(const uint *A, const size_t len);
			virtual ~MapperRev() {}
			virtual uint map(const uint s) const;
			virtual uint unmap(const uint s) const;
			virtual size_t getSize() const;
			virtual void save(ostream & out) const;
			static MapperRev * load(istream & input);

		protected:
			MapperRev();
			uint bits;
	};
};
#endif							 /* __MAPPER_REV_H */