⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 testbits.java

📁 Jena推理机
💻 JAVA
字号:
/*
 * (c) Copyright 2006, 2007 Hewlett-Packard Development Company, LP
 * All rights reserved.
 * [See end of file]
 */

package com.hp.hpl.jena.shared.uuid.test;

import com.hp.hpl.jena.shared.uuid.Bits;

import junit.framework.TestCase;

public class TestBits extends TestCase
{
    public void testMask1()
    {
        long v = Bits.mask(0,1) ;
        check(0x1L, v) ;
    }
    
    public void testMask2()
    {
        long v = Bits.mask(0,2) ;
        check(0x3L, v) ;
    }
    
    public void testMask3()
    {
        long v = Bits.mask(1,2) ;
        check(0x2L, v) ;
    }
    
    public void testMask4()
    {
        long v = Bits.mask(0,64) ;
        check(-1L, v) ;
    }
    
    public void testMask5()
    {
        long v = Bits.mask(16,48) ;
        check(0x0000FFFFFFFF0000L, v) ;
    }

    public void testMask6()
    {
        long v = Bits.mask(16,64) ;
        check(0xFFFFFFFFFFFF0000L, v) ;
    }

    public void testMask7()
    {
        long v = Bits.mask(0, 0) ;
        check(0L, v) ;
    }
    
    public void testMaskZero1()
    {
        long v = Bits.maskZero(0,1) ;
        check(~0x1L, v) ;
    }
    
    public void testMaskZero2()
    {
        long v = Bits.maskZero(0,2) ;
        check(~0x3L, v) ;
    }
    
    public void testMaskZero3()
    {
        long v = Bits.maskZero(1,2) ;
        check(0xFFFFFFFFFFFFFFFDL, v) ;
    }
    
    public void testMaskZero4()
    {
        long v = Bits.maskZero(0,64) ;
        check(0, v) ;
    }
    
    public void testMaskZero5()
    {
        long v = Bits.maskZero(16,48) ;
        check(0xFFFF00000000FFFFL, v) ;
    }

    public void testMaskZero6()
    {
        long v = Bits.maskZero(16,64) ;
        check(0xFFFFL, v) ;
    }

    public void testMaskZero7()
    {
        long v = Bits.maskZero(0, 0) ;
        check(-1L, v) ;
    }

    public void testClear1()
    {
        long v = 0xF0F0 ;
        v = Bits.clear(v, 4, 8) ;
        String s = Long.toHexString(v) ;
        check(0xF000L, v ) ;
    }

    public void testClear2()
    {
        long v = 0x8000000000000000L;
        v = Bits.clear(v, 63, 64) ;
        String s = Long.toHexString(v) ;
        check(0x0L, v ) ;
    }

    public void testClear3()
    {
        long v = 0xC000000000000000L;
        v = Bits.clear(v, 63, 64) ;
        String s = Long.toHexString(v) ;
        check(0x4000000000000000L, v ) ;
    }

    public void testClear4()
    {
        long v = -1 ;
        v = Bits.clear(v, 63, 64) ;
        String s = Long.toHexString(v) ;
        check(0x7FFFFFFFFFFFFFFFL, v ) ;
    }
    
    public void testClear5()
    {
        long v = -1 ;
        v = Bits.clear(v, 32, 64) ;
        String s = Long.toHexString(v) ;
        check(0x00000000FFFFFFFFL, v ) ;
    }

    public void testClear6()
    {
        long v = -1 ;
        v = Bits.clear(v, 0, 32) ;
        String s = Long.toHexString(v) ;
        check(0xFFFFFFFF00000000L, v ) ;
    }

    public void testClear7()
    {
        long v = -1L ;
        v = Bits.clear(v, 0, 0) ;
        String s = Long.toHexString(v) ;
        check(-1L, v ) ;
    }

    public void testSet1()
    {
        long v = 0x0 ;
        v = Bits.set(v, 0, 1) ;
        check(1, v) ;
    }
    
    public void testSet2()
    {
        long v = 0x1 ;
        v = Bits.set(v, 0, 1) ;
        check(1, v) ;
    }
    
    public void testSet3()
    {
        long v = 0xF0 ;
        v = Bits.set(v, 0, 1) ;
        check(0xF1, v) ;
    }
    
    public void testSet4()
    {
        long v = 0xF0F0F0F0F0F0F0F0L ;
        v = Bits.set(v, 0, 8) ;
        check(0xF0F0F0F0F0F0F0FFL, v) ;
    }

    public void testSet5()
    {
        long v = 0 ;
        v = Bits.set(v, 16, 48) ;
        check(0x0000FFFFFFFF0000L, v) ;
    }
    
    public void testSet6()
    {
        long v = 0 ;
        v = Bits.set(v, 63, 64) ;
        check(0x8000000000000000L, v) ;
    }
    
    public void testSet7()
    {
        long v = 0 ;
        v = Bits.set(v, 62, 64) ;
        check(0xC000000000000000L, v) ;
    }
    
    public void testSet8()
    {
        long v = 0 ;
        v = Bits.set(v, 0, 64) ;
        check(-1L, v) ;
    }
    
    public void testSet9()
    {
        long v = 0 ;
        v = Bits.set(v, 10, 10) ;
        check(0, v) ;
    }
    
    public void testSetBit1()
    {
        long v = 0 ;
        v = Bits.set(v, 0) ;
        check(1, v) ;
    }
    
    public void testSetBit2()
    {
        long v = 0 ;
        v = Bits.set(v, 1) ;
        check(2, v) ;
    }
    
    public void testSetBit3()
    {
        long v = 1 ;
        v = Bits.set(v, 0) ;
        check(1, v) ;
    }

    public void testSetBit4()
    {
        long v = -1 ;
        v = Bits.set(v, 0) ;
        check(-1, v) ;
    }

    public void testSetBit5()
    {
        long v = 0 ;
        v = Bits.set(v, 62) ;
        check(0x4000000000000000L, v) ;
    }

    public void testSetBit6()
    {
        long v = 0 ;
        v = Bits.set(v, 63) ;
        check(0x8000000000000000L, v) ;
    }
    
    public void testBitTest1()
    {
        long v = 0 ;
        assertTrue(Bits.test(v, false, 0)) ;
    }
    
    public void testBitTest2()
    {
        long v = 1 ;
        assertTrue(Bits.test(v, true, 0)) ;
    }
    
    public void testBitTest3()
    {
        long v = -1 ;
        assertTrue(Bits.test(v, true, 63)) ;
    }

    public void testBitTest4()
    {
        long v = 0x7FFFFFFFFFFFFFFFL ;
        assertTrue(Bits.test(v, false, 63)) ;
    }

    public void testBitsTest1()
    {
        long v = 0xFEDCBA9876543210L ;
        assertTrue(Bits.test(v, 0x0, 0, 4)) ;
    }
    
    public void testBitsTest2()
    {
        long v = 0xFEDCBA9876543210L ;
        assertTrue(Bits.test(v, 0x10, 0, 8)) ;
    }
    
    public void testBitsTest3()
    {
        long v = 0xFEDCBA9876543210L ;
        assertTrue(Bits.test(v, v, 0, 64)) ;
    }
    
    public void testBitsTest4()
    {
        long v = 0xFEDCBA9876543210L ;
        assertFalse(Bits.test(v, 0, 0, 64)) ;
    }
    
    public void testBitsTest5()
    {
        long v = 0xFEDCBA9876543210L ;
        assertTrue(Bits.test(v, 0x0000BA9876540000L, 16, 48)) ;
    }
    
    public void testAccess1()
    {
        long v = -1 ;
        v = Bits.access(v, 4, 8) ;
        check(0xF0L, v ) ;
    }
    
    public void testAccess2()
    {
        long v = 0xFEDCBA9876543210L ;
        v = Bits.access(v, 0, 8) ;
        check(0x10L, v ) ;
    }

    public void testAccess3()
    {
        long v = 0xFEDCBA9876543210L ;
        v = Bits.access(v, 0, 64) ;
        check(0xFEDCBA9876543210L, v ) ;
    }

    public void testAccess4()
    {
        long v = 0xFEDCBA9876543210L ;
        v = Bits.access(v, 62, 64) ;
        check(0xC000000000000000L, v ) ;
    }

    public void testAccess5()
    {
        long v = 0xFEDCBA9876543210L ;
        v = Bits.access(v, 0, 2) ;
        check(0L, v ) ;
    }

    public void testPack1()
    {
        long v = 0 ;
        v = Bits.pack(v, 0xFL, 0, 4) ;
        check(0xFL, v ) ;
    }
    
    public void testPack2()
    {
        long v = 0xF0 ;
        v = Bits.pack(v, 0x2, 0, 4) ;
        check(0xF2L, v ) ;
    }
    
    public void testPack3()
    {
        long v = -1 ;
        v = Bits.pack(v, 0x2, 0, 8) ;
        check(0xFFFFFFFFFFFFFF02L, v ) ;
    }

    public void testPack4()
    {
        long v = 0xFFFFFFFF00000000L ;
        v = Bits.pack(v, 0x2, 16, 32) ;
        check(0xFFFFFFFF00020000L, v ) ;
    }

    public void testPack5()
    {
        long v = 0xFFFFFFFF00000000L ;
        v = Bits.pack(v, 0xFFFF, 16, 32) ;
        check(0xFFFFFFFFFFFF0000L, v ) ;
    }

    public void testUnpack1()
    {
        long v = 0xABCDABCDABCDABCDL ;
        v = Bits.unpack(v, 0, 4) ;
        check(0xDL, v ) ;
    }
    
    public void testUnpack2()
    {
        long v = 0xABCDABCDABCDABCDL ;
        v = Bits.unpack(v, 63, 64) ;
        check(1L, v ) ;
    }

    public void testUnpack3()
    {
        long v = 0xABCDABCDABCDABCDL ;
        v = Bits.unpack(v, 56, 64) ;
        check(0xABL, v ) ;
    }

    public void testUnpack4()
    {
        long v = 0xABCD12345678ABCDL ;
        v = Bits.unpack(v, 32, 48) ;
        check(0x1234L, v ) ;
    }

    public void testUnpackStr1()
    {
        String s = "ABCD" ;
        long v = Bits.unpack(s, 0, 4) ;
        check(0xABCDL, v ) ;
    }
    
    public void testUnpackStr2()
    {
        String s = "ABCD" ;
        long v = Bits.unpack(s, 2, 4) ;
        check(0xCDL, v ) ;
    }
    
    public void testUnpackStr3()
    {
        String s = "ABCD" ;
        long v = Bits.unpack(s, 0, 2) ;
        check(0xABL, v ) ;
    }
    
    private void check(long expected, long actual)
    {
        check(null, expected, actual) ;
    }
    
    private void check(String msg, long expected, long actual)
    {
        if ( expected == actual ) return ;
        String s = "Expected: "+Long.toHexString(expected)+" : Got: "+Long.toHexString(actual) ;
        if ( msg != null )
            s = msg+": "+s ;
        assertFalse(s, true) ;
    }
}

/*
 * (c) Copyright 2006, 2007 Hewlett-Packard Development Company, LP
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -