@SuppressWarnings("deprecation") protected static void assertSameSolutionsAnyOrder( final IBindingSet[] expected, final Iterator<IBindingSet> actual) { AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, actual); }
@SuppressWarnings("deprecation") protected static void assertSameSolutionsAnyOrder( final IBindingSet[] expected, final Iterator<IBindingSet> actual) { AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, actual); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. */ static public void assertSameSolutionsAnyOrder(final IBindingSet[] expected, final IRunningQuery runningQuery) { assertSameSolutionsAnyOrder("", expected, runningQuery); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. */ static public void assertSameSolutionsAnyOrder(final IBindingSet[] expected, final IRunningQuery runningQuery) { assertSameSolutionsAnyOrder("", expected, runningQuery); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. * * @deprecated by the version which passes the {@link IRunningQuery} */ static public <T> void assertSameSolutionsAnyOrder(final T[] expected, final Iterator<T> actual) { assertSameSolutionsAnyOrder("", expected, actual); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. * * @deprecated by the version which passes the {@link IRunningQuery} */ static public <T> void assertSameSolutionsAnyOrder(final T[] expected, final Iterator<T> actual) { assertSameSolutionsAnyOrder("", expected, actual); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. */ static public void assertSameSolutionsAnyOrder(final String msg, final IBindingSet[] expected, final IRunningQuery runningQuery) { final ICloseableIterator<IBindingSet[]> itr = runningQuery .iterator(); assertSameSolutionsAnyOrder(msg, expected, itr, runningQuery/* future */); }
/** * Verifies that the iterator visits the specified objects in some arbitrary * ordering and that the iterator is exhausted once all expected objects * have been visited. The implementation uses a selection without * replacement "pattern". * <p> * Note: If the objects being visited do not correctly implement hashCode() * and equals() then this can fail even if the desired objects would be * visited. When this happens, fix the implementation classes. */ static public void assertSameSolutionsAnyOrder(final String msg, final IBindingSet[] expected, final IRunningQuery runningQuery) { final ICloseableIterator<IBindingSet[]> itr = runningQuery .iterator(); assertSameSolutionsAnyOrder(msg, expected, itr, runningQuery/* future */); }
static public void assertSameSolutionsAnyOrder(final String msg, final IBindingSet[] expected, final ICloseableIterator<IBindingSet[]> itr, final Future<?> runningQuery) { try { final Iterator<IBindingSet> actual = new Dechunkerator<IBindingSet>( itr); /* * Populate a map that we will use to realize the match and * selection without replacement logic. The map uses counters to * handle duplicate keys. This makes it possible to write tests in * which two or more binding sets which are "equal" appear. */ final int nrange = expected.length; final java.util.Map<IBindingSet, AtomicInteger> range = new java.util.LinkedHashMap<IBindingSet, AtomicInteger>(); for (int j = 0; j < nrange; j++) { AtomicInteger count = range.get(expected[j]); if (count == null) { count = new AtomicInteger(); }
static public void assertSameSolutionsAnyOrder(final String msg, final IBindingSet[] expected, final ICloseableIterator<IBindingSet[]> itr, final Future<?> runningQuery) { try { final Iterator<IBindingSet> actual = new Dechunkerator<IBindingSet>( itr); /* * Populate a map that we will use to realize the match and * selection without replacement logic. The map uses counters to * handle duplicate keys. This makes it possible to write tests in * which two or more binding sets which are "equal" appear. */ final int nrange = expected.length; final java.util.Map<IBindingSet, AtomicInteger> range = new java.util.LinkedHashMap<IBindingSet, AtomicInteger>(); for (int j = 0; j < nrange; j++) { AtomicInteger count = range.get(expected[j]); if (count == null) { count = new AtomicInteger(); }
}; AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);
}; AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder( expectedSolutions, tmp.indexScan());
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder( expectedSolutions, tmp.indexScan());
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, sink.iterator(), ft);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, sink.iterator(), ft);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);
AbstractQueryEngineTestCase.assertSameSolutionsAnyOrder(expected, runningQuery);