com.fasteasytrade.jrandtest.tests.Count3Bits Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of ports-jrandtest Show documentation
Show all versions of ports-jrandtest Show documentation
Fork from https://github.com/cryptopony/jrandtest
The newest version!
/*
* Created on 03/02/2005
*
* JRandTest package
*
* Copyright (c) 2005, Zur Aougav, [email protected]
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this list
* of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice, this
* list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* Neither the name of the JRandTest nor the names of its contributors may be
* used to endorse or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.fasteasytrade.jrandtest.tests;
import java.util.Map;
import java.util.logging.Logger;
import com.fasteasytrade.jrandtest.utils.Format;
import com.fasteasytrade.jrandtest.utils.Stat;
/**
* Counts consecutive 3-bit words. The sums and differences are reported.
*
* @author Zur Aougav
*/
public class Count3Bits extends Base {
final private Logger log = Logger.getLogger(getClass().getName());
@Override
public ResultStatus test(Map details) {
final int no_seqs = 8;
double[] v1 = new double[no_seqs]; // count 3 bits - 000/001/010/../111
long length = 0;
rs.openInputStream();
byte b, b2, b3;
int temp;
int i;
while (true) {
b = rs.readByte();
if (!rs.isOpen()) {
break;
}
b2 = rs.readByte();
if (!rs.isOpen()) {
break;
}
b3 = rs.readByte();
if (!rs.isOpen()) {
break;
}
length += 8;
/*
* temp has 24 bits of data.
* loop and take 3 bits each time...
*/
temp = ((0xff & b) << 16) | ((0xff & b2) << 8) | (0xff & b3);
for (i = 0; i < 8; i++) {
v1[temp & 0x07]++; // increment counter for the first 3 bits
temp = temp >>> 3; // delete the first 3 bits
}
}
rs.closeInputStream();
double pv = Stat.KStest(v1, no_seqs);
log.info("\t ks test for " + no_seqs + " p's: " + Format.d4(pv) + "\n");
long k = length / v1.length;
log.info("\n\t found " + length + " 3 bits.");
log.info("\n\t expected avg for 3 bits: " + k);
log.info("\n\t found avg for 3 bits: " + Format.d4(Stat.avg(v1)));
for (int j = 0; j < no_seqs; j++) {
log.info("\n\t count 3 bits " + j + ": " + Format.d4((long)v1[j]) + "\tdelta: " + Format.d4(v1[j] - k) + "\t%: " + Format.d4(100.00 * v1[j] / k - 100.00));
}
double t = Stat.stdev(v1, k);
log.info("\n\t stdev for 3 bits\t: " + Format.d4(t));
log.info("\n\t % stdev for 3 bits\t: %" + Format.d4(100.00 * t / k));
log.info("\n\t chitest for 3 bits\t: " + Format.d4(Stat.chitest(v1, k)));
log.info("\n\t r2 for 3 bits\t\t: " + Format.d4(Stat.r2_double(v1)));
return ResultStatus.UNKNOWN;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy