@Override public void detach() { super.detach(); list = null; }
public BaseTreeDataProvider<T, S> setSortAsc(S property) { super.setSort(property, SortOrder.ASCENDING); return this; } public BaseTreeDataProvider<T, S> setSortDesc(S property) {
@SuppressWarnings({ "unchecked", "rawtypes" }) protected int compare(final IModel<Comparable> model1, final IModel<Comparable> model2) { int result; if (model1.getObject() == null && model2.getObject() == null) { result = 0; } else if (model1.getObject() == null) { result = 1; } else if (model2.getObject() == null) { result = -1; } else { result = model1.getObject().compareTo(model2.getObject()); } result = provider.getSort().isAscending() ? result : -result; return result; }
@Override public Iterator<? extends T> iterator(long first, long count) { return delegate().iterator(first, count); }
@Override public IModel<T> model(T object) { return delegate().model(object); }
public Iterator<C> iterator(int first, int count) { String prefix = (String) fieldStringModel.getObject(); if (prefix == null || currentListData == null) return new LinkedList<C>().iterator(); SortParam sort = super.getSort(); if (sort != null && this.currentListData.size() > 1) { Comparator<C> c = sorter.getComparatorForProperty(sort); if (c != null) Collections.sort(this.currentListData, c); } int size = currentListData.size(); int last = DataProviderUtils.getLastIndex(size, first, count); if (first > last) { log.warn("indexing problem"); last = DataProviderUtils.getLastIndex(size, first, count); } return currentListData.subList(first, last).iterator(); }
@Override public Iterator<? extends T> iterator(long first, long count) { return delegate().iterator(first, count); }
@Override public IModel<T> model(T object) { return delegate().model(object); }
public BaseDataProvider<T, S> setSortAsc(S property) { super.setSort(property, SortOrder.ASCENDING); return this; } public BaseDataProvider<T, S> setSortDesc(S property) {
@Override public void detach() { dataModel.detach(); super.detach(); }
public Iterator<C> iterator(int first, int count) { String prefix = fieldStringModel.getObject(); if (prefix == null || currentListData == null) return new LinkedList<C>().iterator(); SortParam sort = super.getSort(); if (sort != null && this.currentListData.size() > 1) { Comparator<C> c = sorter.getComparatorForProperty(sort); if (c != null) Collections.sort(this.currentListData, c); } int size = currentListData.size(); int last = DataProviderUtils.getLastIndex(size, first, count); if (first > last) { log.warn("indexing problem"); last = DataProviderUtils.getLastIndex(size, first, count); } return currentListData.subList(first, last).iterator(); }
public BaseTreeDataProvider<T, S> setSortDesc(S property) { super.setSort(property, SortOrder.DESCENDING); return this; }
@Override public void detach() { dataModel.detach(); super.detach(); }
@SuppressWarnings("rawtypes") @Override public int compare(final T object1, final T object2) { IModel<Comparable> model1 = new PropertyModel<>(object1, provider.getSort().getProperty()); IModel<Comparable> model2 = new PropertyModel<>(object2, provider.getSort().getProperty()); return compare(model1, model2); } }
public BaseTreeDataProvider<T, S> setSortDesc(S property) { super.setSort(property, SortOrder.DESCENDING); return this; }
@Override public void detach() { super.detach(); listModel.detach(); } }
@Override public int compare(final T any1, final T any2) { if (INLINE_PROPS.contains(provider.getSort().getProperty())) { return super.compare(any1, any2); } return super.compare(new AttrModel(any1), new AttrModel(any2)); }
public BaseDataProvider<T, S> setSortDesc(S property) { super.setSort(property, SortOrder.DESCENDING); return this; }
@Override public void detach() { /* * If we want to support selectable values then we need to make the list last longer than * just one rendered pass. */ clear(); super.detach(); }
public BaseDataProvider<T, S> setSortAsc(S property) { super.setSort(property, SortOrder.ASCENDING); return this; } public BaseDataProvider<T, S> setSortDesc(S property) {