Package org.voltdb.plannodes

Examples of org.voltdb.plannodes.IndexCountPlanNode


        if (subPlanGraph != null) {
            ixcounts.addAll(subPlanGraph.findAllNodesOfType(PlanNodeType.INDEXCOUNT));
        }
        for (AbstractPlanNode apn : ixcounts) {
            assert(apn instanceof IndexCountPlanNode);
            IndexCountPlanNode ixc = (IndexCountPlanNode) apn;
            setParamIndexes(ints, ixc.getBindings());
        }
        return bitSetToIntVector(ints);
    }
View Full Code Here


        // Options to be determined are:
        // - whether each of the start/end keys is missing, partial (a prefix of a compund key), or complete,
        // - whether the count should include or exclude entries exactly matching each of the start/end keys.
        // Not all combinations of these options are supported;
        // unsupportable cases cause the factory method to return null.
        IndexCountPlanNode countingPlan = IndexCountPlanNode.createOrNull(isp, aggplan);
        if (countingPlan == null) {
            return plan;
        }
        return countingPlan;
    }
View Full Code Here

TOP

Related Classes of org.voltdb.plannodes.IndexCountPlanNode

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.