public void setupKieBase()

in drools-benchmarks-parent/drools-benchmarks/src/main/java/org/drools/benchmarks/session/SegmentPropagationBenchmark.java [58:87]

• 29 lines of code
• 2 McCabe index (conditional complexity)

    public void setupKieBase() {
        StringBuilder sb = new StringBuilder();
        sb.append("import " + A.class.getCanonicalName() + ";\n");
        sb.append("import " + B.class.getCanonicalName() + ";\n");
        sb.append("import " + C.class.getCanonicalName() + ";\n");
        sb.append("import " + D.class.getCanonicalName() + ";\n");
        sb.append("import " + E.class.getCanonicalName() + ";\n");
        for ( int i = 0; i < treesNr; i++ ) {
            sb.append( "rule R" + i + "C when\n" +
                       "  A( $a : value > " + i + ")\n" +
                       "  B( $b : value > $a)\n" +
                       "  C( value > $b)\n" +
                       "then\n" +
                       "end\n" );
            sb.append( "rule R" + i + "D when\n" +
                       "  A( $a : value > " + i + ")\n" +
                       "  B( $b : value > $a)\n" +
                       "  D( value > $b)\n" +
                       "then\n" +
                       "end\n" );
            sb.append( "rule R" + i + "E when\n" +
                       "  A( $a : value > " + i + ")\n" +
                       "  B( $b : value > $a)\n" +
                       "  E( value > $b)\n" +
                       "then\n" +
                       "end\n" );
        }

        kieBase = BuildtimeUtil.createKieBaseFromDrl(sb.toString() );
    }