regression.java

来自「Jena推理机」· Java 代码 · 共 1,751 行 · 第 1/5 页

JAVA
1,751 行
字号
12345

            n = 100;

            n++; stmt = m.getRequiredProperty(subject[1], predicate[1]);

            n++; try {
                stmt = m.getRequiredProperty(subject[1], RDF.value); error(test,n);
            } catch (PropertyNotFoundException jx) {
                // as required
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            boolean found = false;

            ResIterator rIter = m.listSubjectsWithProperty(predicate[4]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, 110);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, 120);
            }
            for (int i=0; i<num; i++) {
                if (! subjf[i]) error(test, 130+i);
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, 150);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, 160);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, 170+i);
                } else {
                    if (i<2) error(test, 190+i);
                }
            }

            n=200;
            // System.out.println( "* -- n := " + n );
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvBoolean[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvBoolean[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i);
            }

            n=300;
            // System.out.println( "* -- n := " + n );
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (byte)tvLong[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                // System.out.println( "+ " + subj );
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }

            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (byte) tvLong[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }

            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i);
            }

            n=400;
            // System.out.println( "* -- n := " + n );
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (short) tvLong[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (short) tvLong[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i);
            }

            n=500;
            // System.out.println( "* -- n := " + n );
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (int) tvLong[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], (int) tvLong[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i);
            }

            // System.out.println( "* -- n := " + n );
            n=600;
            // System.out.println( "* -- n := " + n );
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvLong[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvLong[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i);
            }

            n=700;
            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvChar[0]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+10);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+20);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) {
                    if (i>1) error(test, n+30+i);
                } else {
                    if (i<2) error(test, n+40+i);
                }
            }

            for (int i=0; i<num; i++) {
                subjf[i] = false;
            }
            found = false;
            rIter = m.listSubjectsWithProperty(predicate[0], tvChar[1]);
            while (rIter.hasNext()) {
                Resource subj = rIter.nextResource();
                found = false;
                for (int i=0; i<num; i++) {
                    if (subj.equals(subject[i])) {
                        found = true;
                        if (subjf[i]) error(test, n+50);
                        subjf[i] = true;
                    }
                }
                if (! found) error(test, n+60);
            }
            for (int i=0; i<num; i++) {
                if (subjf[i]) error(test, n+70+i
12345

regression.java - 源码说明

本页面展示了「Jena推理机」中的 regression.java 源码文件，采用 Java 编程语言编写，共 1,751 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫开发者社区收录了大量与Jena相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

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