// First apply limited inference (child elements) - this removes matching child groupId/version
        hasChanges |= trimParentElementLimited(context, root, parentElement);

        // Only remove parent elements if the parent is in the same reactor (not external)
        if (isParentInReactor(parentElement, pomMap, context)) {
            // Remove parent groupId if child has no explicit groupId

    }
  }

  // Returned from removeAt() to iterator.remove()
  private static final class MoveDesc<E> {
    final E toTrickle;
    final E replaced;

    MoveDesc(E toTrickle, E replaced) {
      this.toTrickle = toTrickle;
      this.replaced = replaced;
    }
  }

  /** Removes and returns the value at {@code index}. */
  private E removeAndGet(int index) {

    E x = items[takeIndex];
    items[takeIndex] = null;
    takeIndex = inc(takeIndex);
    --count;
    return x;
  }

  /**
   * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying
   * monitor.
   */
  void removeAt(int i) {
    E[] items = this.items;
    // if removing front item, just advance
    if (i == takeIndex) {
      items[takeIndex] = null;

      }
    }

    /**
     * Removes <b>all</b> occurrences of the specified element from this multiset. This method
     * complements {@link Multiset#remove(Object)}, which removes only one occurrence at a time.
     *
     * @param element the element whose occurrences should all be removed
     * @return the number of occurrences successfully removed, possibly zero
     */

                    return e;
                }
            }
        }
        return null;
    }

    /**
     * Removes the entry at the specified index from the list entries.
     *
     * @param index
     *            the index of the entry to remove
     * @return the removed entry
     */
    protected Entry<K, V> removeList(final int index) {
        final Entry<K, V> e = listTable[index];

     */
    public boolean contains(final E element) {
        return indexOf(element) != -1;
    }

    /**
     * Removes an element from the list.
     *
     * @param element the element
     * @return true if the element was removed, false otherwise
     */
    public boolean remove(final E element) {
        if (element == null) {
            for (Entry e = header.next; e != header; e = e.next) {

    }

    /**
     * Removes the specified element from this set if it is present.
     *
     * @param o
     *            object to be removed from this set, if present.
     * @return true if the set contained the specified element.
     */
    @Override
    public boolean remove(final Object o) {
        return map.remove(o) == PRESENT;
    }

    /**

        // only remove after setting to zero, to avoid concurrent updates
        map.remove(key, atomic);
        // succeed even if the remove fails, since the value was already adjusted
        return oldValue;
      }
    }
  }

  /**
   * If {@code (key, value)} is currently in the map, this method removes it and returns true;
   * otherwise, this method returns false.

		return jentry{}, false
	}

	// 1. If bucket versioning is disabled, remove the remote object.
	// 2. If bucket versioning is suspended and
	//    a. version id is specified, remove its remote object.
	//    b. version id is not specified, remove null version's remote object if it exists.
	// 3. If bucket versioning is enabled and
	//    a. version id is specified, remove its remote object.

    }
  }

  /**
   * Removes a number of occurrences of the specified element from this multiset. If the multiset
   * contains fewer than this number of occurrences to begin with, all occurrences will be removed.
   *
   * @param element the element whose occurrences should be removed
   * @param occurrences the number of occurrences of the element to remove