/** * Inserts the specified binding set into the list. The binding set is inserted immediately before the * next element that would be returned by {@link #next()}, if any, and after the next element that would * be returned by {@link #previous}, if any. (If the table contains no binding sets, the new element * becomes the sole element on the table.) The new element is inserted before the implicit cursor: a * subsequent call to <tt>next()</tt> would be unaffected, and a subsequent call to <tt>previous()</tt> * would return the new binding set. * * @param bindingSet * The binding set to insert. */ public void insert(BindingSet bindingSet) { insert(currentIndex, bindingSet); }
public void remove() { if (lastReturned == -1) { throw new IllegalStateException(); } remove(lastReturned); if (currentIndex > lastReturned) { currentIndex--; } lastReturned = -1; }
MutableTupleQueryResult queryResultTable = new MutableTupleQueryResult(queryResult); MutableTupleQueryResult expectedResultTable = new MutableTupleQueryResult(expectedResult); queryResultTable.beforeFirst(); expectedResultTable.beforeFirst(); while (queryResultTable.hasNext()) { BindingSet bs = queryResultTable.next(); BindingSet expectedBs = expectedResultTable.next(); queryResultTable.beforeFirst(); expectedResultTable.beforeFirst();
public void set(BindingSet bindingSet) { if (lastReturned == -1) { throw new IllegalStateException(); } set(lastReturned, bindingSet); }
public BindingSet previous() { if (hasPrevious()) { BindingSet result = bindingSets.get(currentIndex - 1); currentIndex--; lastReturned = currentIndex; return result; } throw new NoSuchElementException(); }
public void set(BindingSet bindingSet) { if (lastReturned == -1) { throw new IllegalStateException(); } set(lastReturned, bindingSet); }
public BindingSet previous() { if (hasPrevious()) { BindingSet result = bindingSets.get(currentIndex - 1); currentIndex--; lastReturned = currentIndex; return result; } throw new NoSuchElementException(); }
public void remove() { if (lastReturned == -1) { throw new IllegalStateException(); } remove(lastReturned); if (currentIndex > lastReturned) { currentIndex--; } lastReturned = -1; }
public void set(BindingSet bindingSet) { if (lastReturned == -1) { throw new IllegalStateException(); } set(lastReturned, bindingSet); }
public BindingSet previous() { if (hasPrevious()) { BindingSet result = bindingSets.get(currentIndex - 1); currentIndex--; lastReturned = currentIndex; return result; } throw new NoSuchElementException(); }
/** * Inserts the specified binding set into the list. The binding set is inserted immediately before the * next element that would be returned by {@link #next()}, if any, and after the next element that would * be returned by {@link #previous}, if any. (If the table contains no binding sets, the new element * becomes the sole element on the table.) The new element is inserted before the implicit cursor: a * subsequent call to <tt>next()</tt> would be unaffected, and a subsequent call to <tt>previous()</tt> * would return the new binding set. * * @param bindingSet * The binding set to insert. */ public void insert(BindingSet bindingSet) { insert(currentIndex, bindingSet); }
@Override public void remove() { if (lastReturned == -1) { throw new IllegalStateException(); } remove(lastReturned); if (currentIndex > lastReturned) { currentIndex--; } lastReturned = -1; }
/** * Inserts the specified binding set into the list. The binding set is inserted immediately before the * next element that would be returned by {@link #next()}, if any, and after the next element that would * be returned by {@link #previous}, if any. (If the table contains no binding sets, the new element * becomes the sole element on the table.) The new element is inserted before the implicit cursor: a * subsequent call to <tt>next()</tt> would be unaffected, and a subsequent call to <tt>previous()</tt> * would return the new binding set. * * @param bindingSet * The binding set to insert. */ public void insert(BindingSet bindingSet) { insert(currentIndex, bindingSet); }