/** <code>path = [1, 2, 4, 6, 0, 3, 5]</code> */ public void test_attachConstraints_BSBM_Q5_path01() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p1, s.p2, s.p4, s.p6, s.p0, s.p3, s.p5 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p1 s.C0, // p2 s.NA, // p4 s.NA, // p6 s.NA, // p0 s.C1, // p3 s.C2, // p5 }; assertSameConstraints(expected, actual); }
/** <code>[5, 3, 1, 0, 2, 4, 6]</code>. */ public void test_attachConstraints_BSBM_Q5_path02() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p5, s.p3, s.p1, s.p0, s.p2, s.p4, s.p6 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p5 s.NA, // p3 s.NA, // p1 s.C0, // p0 s.NA, // p2 s.C1, // p4 s.C2, // p6 }; assertSameConstraints(expected, actual); }
/** <code>[5, 3, 1, 0, 2, 4, 6]</code>. */ public void test_attachConstraints_BSBM_Q5_path02() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p5, s.p3, s.p1, s.p0, s.p2, s.p4, s.p6 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p5 s.NA, // p3 s.NA, // p1 s.C0, // p0 s.NA, // p2 s.C1, // p4 s.C2, // p6 }; assertSameConstraints(expected, actual); }
/** <code>path = [1, 2, 4, 6, 0, 3, 5]</code> */ public void test_attachConstraints_BSBM_Q5_path01() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p1, s.p2, s.p4, s.p6, s.p0, s.p3, s.p5 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p1 s.C0, // p2 s.NA, // p4 s.NA, // p6 s.NA, // p0 s.C1, // p3 s.C2, // p5 }; assertSameConstraints(expected, actual); }
/** <code>[3, 4, 5, 6, 1, 2, 0]</code> (key-range constraint variant). */ public void test_attachConstraints_BSBM_Q5_path03() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p3, s.p4, s.p5, s.p6, s.p1, s.p2, s.p0 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p3 asSet(new FilterNode[]{s.c0,s.c1}), // p4 s.NA, // p5 s.C2, // p6 s.NA, // p1 s.NA, // p2 s.NA, // p0 }; assertSameConstraints(expected, actual); }
.getJoinGraphConstraints(path, joinFilters .toArray(new FilterNode[joinFilters.size()]), knownBound, false/* pathIsComplete */);
.getJoinGraphConstraints(path, joinFilters .toArray(new FilterNode[joinFilters.size()]), knownBound, false/* pathIsComplete */);
/** <code>[3, 4, 5, 6, 1, 2, 0]</code> (key-range constraint variant). */ public void test_attachConstraints_BSBM_Q5_path03() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p3, s.p4, s.p5, s.p6, s.p1, s.p2, s.p0 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p3 asSet(new FilterNode[]{s.c0,s.c1}), // p4 s.NA, // p5 s.C2, // p6 s.NA, // p1 s.NA, // p2 s.NA, // p0 }; assertSameConstraints(expected, actual); }
.getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */);
.getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */);
/** <code>path = [1, 2, 4, 6, 0, 3, 5]</code> */ public void test_attachConstraints_BSBM_Q5_path01() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p1, s.p2, s.p4, s.p6, s.p0, s.p3, s.p5 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p1 s.C0, // p2 s.NA, // p4 s.NA, // p6 s.NA, // p0 s.C1, // p3 s.C2, // p5 }; assertSameConstraints(expected, actual); }
/** <code>[5, 3, 1, 0, 2, 4, 6]</code>. */ public void test_attachConstraints_BSBM_Q5_path02() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p5, s.p3, s.p1, s.p0, s.p2, s.p4, s.p6 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p5 s.NA, // p3 s.NA, // p1 s.C0, // p0 s.NA, // p2 s.C1, // p4 s.C2, // p6 }; assertSameConstraints(expected, actual); }
/** <code>[3, 4, 5, 6, 1, 2, 0]</code> (key-range constraint variant). */ public void test_attachConstraints_BSBM_Q5_path03() { final BSBMQ5Setup s = new BSBMQ5Setup(store); final StaticAnalysis sa = new StaticAnalysis(s.queryRoot); final IJoinNode[] path = { s.p3, s.p4, s.p5, s.p6, s.p1, s.p2, s.p0 }; final FilterNode[][] actual = sa .getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */); @SuppressWarnings("unchecked") final Set<FilterNode>[] expected = new Set[] { // s.NA, // p3 asSet(new FilterNode[]{s.c0,s.c1}), // p4 s.NA, // p5 s.C2, // p6 s.NA, // p1 s.NA, // p2 s.NA, // p0 }; assertSameConstraints(expected, actual); }
.getJoinGraphConstraints(path, s.constraints, null/* knownBoundVars */, true/* pathIsComplete */);