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

📄 newregressionseqmethods.java

📁 Jena推理机
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
        if (!(seq6.getChar( 1 ) == tvChar)) error( test, n );
        seq6.add( 1, tvFloat );
        n++;
        if (!(seq6.getFloat( 1 ) == tvFloat)) error( test, n );
        seq6.add( 1, tvDouble );
        n++;
        if (!(seq6.getDouble( 1 ) == tvDouble)) error( test, n );
        seq6.add( 1, tvString );
        n++;
        if (!(seq6.getString( 1 ).equals( tvString ))) error( test, n );
        seq6.add( 1, tvString, lang );
        n++;
        if (!(seq6.getString( 1 ).equals( tvString ))) error( test, n );
        seq6.add( 1, tvResource );
        n++;
        if (!(seq6.getResource( 1 ).equals( tvResource ))) error( test, n );
        seq6.add( 1, tvLiteral );
        n++;
        if (!(seq6.getLiteral( 1 ).equals( tvLiteral ))) error( test, n );
        seq6.add( 1, tvLitObj );
        n++;
        if (!(seq6.getObject( 1, new LitTestObjF() ).equals( tvLitObj ))) error(
                test, n );

        n = (n / 100) * 100 + 100;
        n++;
        if (!(seq6.indexOf( tvLitObj ) == 1)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvLiteral ) == 2)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvResource ) == 3)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvString, lang ) == 4)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvString ) == 5)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvDouble ) == 6)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvFloat ) == 7)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvChar ) == 8)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvLong ) == 9)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvInt ) == 10)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvShort ) == 11)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvByte ) == 12)) error( test, n );
        n++;
        if (!(seq6.indexOf( tvBoolean ) == 13)) error( test, n );
        n++;
        if (!(seq6.indexOf( 1234543 ) == 0)) error( test, n );
        }

    public void testSeq5()
        {
        Seq seq5 = m.createSeq();
        String test = "seq5";
        int n = 0;
        for (int i = 0; i < num; i++)
            {
            seq5.add( i );
            }

        try
            {
            n++;
            seq5.add( 0, false );
            error( test, n );
            }
        catch (SeqIndexBoundsException e)
            {
            // as required
            }
        seq5.add( num + 1, false );
        if (seq5.size() != num + 1) error( test, n );
        seq5.remove( num + 1 );
        try
            {
            n++;
            seq5.add( num + 2, false );
            error( test, n );
            }
        catch (SeqIndexBoundsException e)
            {
            // as required
            }

        n = (n / 100) * 100 + 100;
        int size = seq5.size();
        for (int i = 1; i <= num - 1; i++)
            {
            n++;
            seq5.add( i, 1000 + i );
            n++;
            if (!(seq5.getInt( i ) == 1000 + i)) error( test, n );
            n++;
            if (!(seq5.getInt( i + 1 ) == 0)) error( test, n );
            n++;
            if (!(seq5.size() == (size + i))) error( test, n );
            n++;
            if (!(seq5.getInt( size ) == (num - i - 1))) error( test, n );
            }
        }

    public void testSeq4()
        {
        String test = "temp";
        int n = 58305;
        Seq seq4 = m.createSeq();
        n = (n / 100) * 100 + 100;
        n++;
        seq4.add( tvBoolean );
        n++;
        if (!(seq4.getBoolean( 1 ) == tvBoolean)) error( test, n );
        n++;
        seq4.add( tvByte );
        n++;
        if (!(seq4.getByte( 2 ) == tvByte)) error( test, n );
        n++;
        seq4.add( tvShort );
        n++;
        if (!(seq4.getShort( 3 ) == tvShort)) error( test, n );
        n++;
        seq4.add( tvInt );
        n++;
        if (!(seq4.getInt( 4 ) == tvInt)) error( test, n );
        n++;
        seq4.add( tvLong );
        n++;
        if (!(seq4.getLong( 5 ) == tvLong)) error( test, n );
        n++;
        seq4.add( tvChar );
        n++;
        if (!(seq4.getChar( 6 ) == tvChar)) error( test, n );
        n++;
        seq4.add( tvFloat );
        n++;
        if (!(seq4.getFloat( 7 ) == tvFloat)) error( test, n );
        n++;
        seq4.add( tvDouble );
        n++;
        if (!(seq4.getDouble( 8 ) == tvDouble)) error( test, n );
        n++;
        seq4.add( tvString );
        n++;
        if (!(seq4.getString( 9 ).equals( tvString ))) error( test, n );
        n++;
        if (!(seq4.getLanguage( 9 ).equals( "" ))) error( test, n );
        n++;
        seq4.add( tvString, lang );
        n++;
        if (!(seq4.getString( 10 ).equals( tvString ))) error( test, n );
        n++;
        if (!(seq4.getLanguage( 10 ).equals( lang ))) error( test, n );
        n++;
        seq4.add( tvLitObj );
        n++;
        if (!(seq4.getObject( 11, new LitTestObjF() ).equals( tvLitObj ))) error(
                test, n );
        n++;
        seq4.add( tvResource );
        n++;
        if (!(seq4.getResource( 12 ).equals( tvResource ))) error( test, n );
        n++;
        seq4.add( tvLiteral );
        n++;
        if (!(seq4.getLiteral( 13 ).equals( tvLiteral ))) error( test, n );
        n++;
        seq4.add( tvResObj );
        n++;
        if (!(seq4.getResource( 14, new ResTestObjF() ).equals( tvResObj ))) error(
                test, n );
        n++;
        seq4.add( tvBag );
        n++;
        if (!(seq4.getBag( 15 ).equals( tvBag ))) error( test, n );
        n++;
        seq4.add( tvAlt );
        n++;
        if (!(seq4.getAlt( 16 ).equals( tvAlt ))) error( test, n );
        n++;
        seq4.add( tvSeq );
        n++;
        if (!(seq4.getSeq( 17 ).equals( tvSeq ))) error( test, n );
        n++;
        try
            {
            seq4.getInt( 18 );
            error( test, n );
            }
        catch (SeqIndexBoundsException e)
            {
            // as required
            }
        n++;
        try
            {
            seq4.getInt( 0 );
            error( test, n );
            }
        catch (SeqIndexBoundsException e)
            {
            // as required
            }
        }
    }


/*
 * (c) Copyright 2005, 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 + -