(ISeq items)
| 20 | |
| 21 | |
| 22 | static public PersistentTreeSet create(ISeq items){ |
| 23 | PersistentTreeSet ret = EMPTY; |
| 24 | for(; items != null; items = items.next()) |
| 25 | { |
| 26 | ret = (PersistentTreeSet) ret.cons(items.first()); |
| 27 | } |
| 28 | return ret; |
| 29 | } |
| 30 | |
| 31 | static public PersistentTreeSet create(Comparator comp, ISeq items){ |
| 32 | PersistentTreeSet ret = new PersistentTreeSet(null, new PersistentTreeMap(null, comp)); |