public TreePVector<E> minus(final Object e) { for(Entry<Integer,E> entry : map.entrySet()) if(entry.getValue().equals(e)) return minus((int)entry.getKey()); return this; }
public TreePVector<E> minus(final Object e) { for(Entry<Integer,E> entry : map.entrySet()) if(entry.getValue().equals(e)) return minus((int)entry.getKey()); return this; }
public TreePVector<E> minus(final Object e) { for (Entry<Integer, E> entry : map.entrySet()) if (entry.getValue().equals(e)) return minus((int) entry.getKey()); return this; }
public TreePVector<E> minus(final Object e) { for(Entry<Integer,E> entry : map.entrySet()) if(entry.getValue().equals(e)) return minus((int)entry.getKey()); return this; }