RegisterSetTest.java

/*
 * Copyright (C) 2012 Clearspring Technologies, Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.streaminer.stream.cardinality;

import static junit.framework.Assert.assertEquals;

import java.util.Random;

import org.junit.Test;

public class RegisterSetTest
{
    @Test
    public void testGetAndSet() throws Exception
    {
        RegisterSet rs = new RegisterSet((int) Math.pow(2, 4));
        rs.set(0, 11);
        assertEquals(11, rs.get(0));
    }

    @Test
    public void testGetAndSet_allPositions() throws Exception
    {
        RegisterSet rs = new RegisterSet((int) Math.pow(2, 4));
        for (int i = 0; i < Math.pow(2, 4); i++)
        {
            rs.set(i, i % 31);
            assertEquals(i % 31, rs.get(i));
        }
    }

    @Test
    public void testGetAndSet_withSmallBits() throws Exception
    {
        RegisterSet rs = new RegisterSet(6);
        rs.set(0, 11);
        assertEquals(11, rs.get(0));
    }
    
    @Test
    public void testMerge()
    {
        Random rand = new Random(2);
        int count = 32;
        RegisterSet rs = new RegisterSet(count);
        RegisterSet[] rss = new RegisterSet[5];

        for (int i = 0; i < rss.length; i++)
        {
            rss[i] = new RegisterSet(count);

            for (int pos = 0; pos < rs.count; pos++)
            {
                int val = rand.nextInt(10);
                rs.updateIfGreater(pos, val);
                rss[i].set(pos, val);
            }
        }

        RegisterSet merged = new RegisterSet(count);
        for (int i = 0; i < rss.length; i++)
        {
           merged.merge(rss[i]);
        }

        for (int pos = 0; pos < rs.count; pos++)
        {
            assertEquals(rs.get(pos), merged.get(pos));
        }
    }

    @Test
    public void testMergeUsingUpdate()
    {
        Random rand = new Random(2);
        int count = 32;
        RegisterSet rs = new RegisterSet(count);
        RegisterSet[] rss = new RegisterSet[5];

        for (int i = 0; i < rss.length; i++)
        {
            rss[i] = new RegisterSet(count);

            for (int pos = 0; pos < rs.count; pos++)
            {
                int val = rand.nextInt(10);
                rs.updateIfGreater(pos, val);
                rss[i].set(pos, val);
            }
        }

        RegisterSet merged = new RegisterSet(count);
        for (int i = 0; i < rss.length; i++)
        {
            for (int pos = 0; pos < rs.count; pos++)
            {
                merged.updateIfGreater(pos, rss[i].get(pos));
            }
        }

        for (int pos = 0; pos < rs.count; pos++)
        {
            assertEquals(rs.get(pos), merged.get(pos));
        }
    }
}