super(session);
super(session, set); comparator = set.comparator();
seePersistentSortedSet#comparator() return comparator;
return comparator;
seePersistentSortedSet#first() read(); return ( (SortedSet) set ).first();
read(); return ( (SortedSet) set ).first();
seePersistentSortedSet#headSet(Object) read(); SortedSet s = ( (SortedSet) set ).headSet(toElement); return new SubSetProxy(s);
read(); SortedSet s = ( (SortedSet) set ).headSet(toElement); return new SubSetProxy(s);
seePersistentSortedSet#last() read(); return ( (SortedSet) set ).last();
read(); return ( (SortedSet) set ).last();
this.comparator = comparator;
//if (set==null) return new Set(session); TreeMap clonedSet = new TreeMap(comparator); Iterator iter = set.iterator(); while ( iter.hasNext() ) { Object copy = persister.getElementType().deepCopy( iter.next(), entityMode, persister.getFactory() ); clonedSet.put(copy, copy); } return clonedSet;
seePersistentSortedSet#subSet(Object,Object) read(); SortedSet s; s = ( (SortedSet) set ).subSet(fromElement, toElement); return new SubSetProxy(s);
read(); SortedSet s; s = ( (SortedSet) set ).subSet(fromElement, toElement); return new SubSetProxy(s);
seePersistentSortedSet#tailSet(Object) read(); SortedSet s = ( (SortedSet) set ).tailSet(fromElement); return new SubSetProxy(s);
read(); SortedSet s = ( (SortedSet) set ).tailSet(fromElement); return new SubSetProxy(s);