org.rdfhdt.hdt.util.BitUtil Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of hdt-java-core Show documentation
HDT Core Library Implementation in Java
The newest version!
/*
 * File: $HeadURL: https://hdt-java.googlecode.com/svn/trunk/hdt-java/src/org/rdfhdt/hdt/util/BitUtil.java $
 * Revision: $Rev: 191 $
 * Last modified: $Date: 2013-03-03 11:41:43 +0000 (dom, 03 mar 2013) $
 * Last modified by: $Author: mario.arias $
 *
 * 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
 *
 * Contacting the authors:
 *   Mario Arias:               [email protected]
 *   Javier D. Fernandez:       [email protected]
 *   Miguel A. Martinez-Prieto: [email protected]
 *   Alejandro Andres:          [email protected]
 */
package org.rdfhdt.hdt.util;

import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;

public class BitUtil {
	
	private BitUtil() {}
	
	/**
	 * Number of bits needed to store up to n
	 * @param n
	 * @return
	 */
	public static int log2(long n) {
		return (n != 0) ? (64 - Long.numberOfLeadingZeros(n)) : 0;
	}
	
	public static long maxVal(int numbits) {
		return ~(~0L<0) {
			out.write((int)(value & 0xFF));
			value>>>=8;
        	numbits-=8;
		}
	}
	
	public static int select1(long value, int rank) {
        int bitpos=0;
        while(rank>0 && value!=0) {
        	rank-= value & 1;
        	bitpos++;
        	value>>>=1;
        }
        return bitpos;
	}
	
	public static int select0(long value, int rank) {
        int bitpos=0;
        while(rank>0) {
        	rank-= (value ^ 1) & 1;
        	bitpos++;
        	value>>>=1;
        }
        return bitpos;
	}
}