Remove element from the RangeSet if it is a member.

        If the element is not a member, do nothing.
978248
def discard(self, element):
        
        try:
            i = int(element)
            set.discard(self, i)
        except ValueError:
            pass
478737
public void removeElementAt(int i)
  {

    if (null == m_map)
      return;
      
    if (i >= m_firstFree)
      throw new ArrayIndexOutOfBoundsException(i + " >= " + m_firstFree);
    else if (i < 0)
      throw new ArrayIndexOutOfBoundsException(i);

    if (i < m_firstFree - 1)
      System.arraycopy(m_map, i + 1, m_map, i, m_firstFree - i - 1);

    m_firstFree--;
    m_map[m_firstFree] = null;
  }
952757
void deleteElement(int list, int prevNode, int node) {
		if (prevNode != nullNode()) {
			assert (m_listNodes.getField(prevNode, 1) == node);
			m_listNodes.setField(prevNode, 1, m_listNodes.getField(node, 1));
			if (m_lists.getField(list, 1) == node)// deleting a tail
			{
				m_lists.setField(list, 1, prevNode);
			}
		} else {
			assert (m_lists.getField(list, 0) == node);
			m_lists.setField(list, 0, m_listNodes.getField(node, 1));
			if (m_lists.getField(list, 1) == node) {// removing last element
				assert (m_listNodes.getField(node, 1) == nullNode());
				m_lists.setField(list, 1, nullNode());
			}
		}
		freeNode_(node);
	}
738050
function () {
      if (!codeViewer.codeActive) {
        return;
      }

      if (window.getSelection().empty) {
        window.getSelection().empty();
      }
      else if (window.getSelection().removeAllRanges) {
        window.getSelection().removeAllRanges();
      }
    }
752890
def pop(self, index=None):
    
    if not self.items:
        raise KeyError('Set is empty')

    def remove_index(i):
        elem = self.items[i]
        del self.items[i]
        del self.map[elem]
        return elem
    if index is None:
        elem = remove_index(-1)
    else:
        size = len(self.items)
        if index < 0:
            index = size + index
            if index < 0:
                raise IndexError('assignement index out of range')
        elif index >= size:
            raise IndexError('assignement index out of range')
        elem = remove_index(index)
        for k, v in self.map.items():
            if v >= index and v > 0:
                self.map[k] = v - 1
    return elem
718539
public Mutations<S> removeMutationsInRange(Range range) {
        return removeMutationsInRange(range.getFrom(), range.getTo());
    }
1372927
public static void removeChildrenFrom(final Element element) {
        if (element != null) {
            while (element.getFirstChild() != null) {
                element.removeChild(element.getFirstChild());
            }
        }
    }
587124
public boolean remove(T element) {
		for (Iterator<Node<T>> it = nodes.iterator(); it.hasNext(); )
			if (ObjectUtil.equalsOrNull(it.next().element, element)) {
				it.remove();
				return true;
			}
		return false;
	}
285591
def remove(self, element):
        """"""
        try:
            index = self.index(element)
        except ValueError:
            raise ValueError("list.remove(x): x not in list")
        else:
            self._notify_remove_at(index)
            super(ObservableList, self).pop(index)
275730
def remove(self, cls, originalMemberNameList, memberName, classNamingConvention):
        
        accessorDict = self._accessorDict(memberName, classNamingConvention)
        for accessorName, _ in accessorDict.items():
            if accessorName not in originalMemberNameList and hasattr(cls, accessorName):
                delattr(cls, accessorName)
1142415
def discard_member(self, member, pipe=None):
        
        pipe = self.redis if pipe is None else pipe
        pipe.zrem(self.key, self._pickle(member))
367983
public void minus(Range range) {
		List<Range> newList = new ArrayList<>();
		Range target = range;
		for (Iterator<Range> iterator = this.ranges.iterator(); iterator.hasNext();) {
			Range r = iterator.next();
			if (r.equals(target)) {
				iterator.remove();
			} else if (target.include(r)) {
				iterator.remove();
			} else if (r.include(target)) {
				if (r.getStart() < target.getStart()) {
					newList.add(new Range(r.getStart(), target.getStart() - 1));
				}
				if (r.getEnd() > target.getEnd()) {
					newList.add(new Range(target.getEnd() + 1, r.getEnd()));
				}
				iterator.remove();
			} else if (r.hasIntersection(target)) {
				if (r.include(target.getStart())) {
					newList.add(new Range(r.getStart(), target.getStart() - 1));
				} else {
					newList.add(new Range(target.getEnd() + 1, r.getEnd()));
				}
				iterator.remove();
			}
		}
		ranges.addAll(newList);
	}
882908
def delete(self, start=None, stop=None):
		
		_check_start_stop(start, stop)
		start_loc = self._bisect_right(start) - 1
		if stop is None:
			stop_loc = len(self._keys)
		else:
			stop_loc = self._bisect_left(stop)
		for value in self._values[start_loc:stop_loc]:
			if value is NOT_SET:
				raise KeyError((start, stop))
		# this is inefficient, we've already found the sub ranges
		self.set(NOT_SET, start=start, stop=stop)
1053140
public <T> void remove(ElementDescriptor<T> property)
	{
		if (mRemove == null)
		{
			mRemove = new HashMap<ElementDescriptor<?>, Object>(16);
		}
		mRemove.put(property, null);

		if (mSet != null)
		{
			mSet.remove(property);
		}
	}
279135
public void reset() {
        endRange = set.getRangeCount() - 1;
        range = 0;
        endElement = -1;
        nextElement = 0;            
        if (endRange >= 0) {
            loadRange(range);
        }
        stringIterator = null;
        if (set.strings != null) {
            stringIterator = set.strings.iterator();
            if (!stringIterator.hasNext()) {
                stringIterator = null;
            }
        }
    }
54505
def remove_member(self, member, api=None):
        
        api = api or self._API
        username = Transform.to_member(member)

        api.delete(
            url=self._URL['member'].format(
                id=self.id,
                username=username
            )
        )
353860
public boolean removeMemberByC2jName(String memberC2jName, boolean ignoreCase) {
        // Implicitly depending on the default equals and hashcode
        // implementation of the class MemberModel
        MemberModel model = tryFindMemberModelByC2jName(memberC2jName, ignoreCase);
        return model == null ? false : members.remove(model);
    }