java.util.TreeMap.removeInternal()方法的使用及代码示例

x33g5p2x  于2022-01-17 转载在 其他  
字(3.8k)|赞(0)|评价(0)|浏览(144)

本文整理了Java中java.util.TreeMap.removeInternal()方法的一些代码示例,展示了TreeMap.removeInternal()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TreeMap.removeInternal()方法的具体详情如下:
包路径:java.util.TreeMap
类名称:TreeMap
方法名:removeInternal

TreeMap.removeInternal介绍

[英]Removes node from this tree, rearranging the tree's structure as necessary.
[中]从此树中删除节点,并根据需要重新排列树的结构。

代码示例

代码示例来源:origin: robovm/robovm

Node<K, V> removeInternalByKey(Object key) {
  Node<K, V> node = findByObject(key);
  if (node != null) {
    removeInternal(node);
  }
  return node;
}

代码示例来源:origin: robovm/robovm

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: robovm/robovm

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: robovm/robovm

removeInternal(adjacent); // takes care of rebalance and size--

代码示例来源:origin: ibinti/bugvm

Node<K, V> removeInternalByKey(Object key) {
  Node<K, V> node = findByObject(key);
  if (node != null) {
    removeInternal(node);
  }
  return node;
}

代码示例来源:origin: com.gluonhq/robovm-rt

Node<K, V> removeInternalByKey(Object key) {
  Node<K, V> node = findByObject(key);
  if (node != null) {
    removeInternal(node);
  }
  return node;
}

代码示例来源:origin: MobiVM/robovm

Node<K, V> removeInternalByKey(Object key) {
  Node<K, V> node = findByObject(key);
  if (node != null) {
    removeInternal(node);
  }
  return node;
}

代码示例来源:origin: com.bugvm/bugvm-rt

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.jtransc/jtransc-rt

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: ibinti/bugvm

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: FlexoVM/flexovm

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: MobiVM/robovm

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: MobiVM/robovm

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.mobidevelop.robovm/robovm-rt

Node<K, V> removeInternalByKey(Object key) {
  Node<K, V> node = findByObject(key);
  if (node != null) {
    removeInternal(node);
  }
  return node;
}

代码示例来源:origin: com.gluonhq/robovm-rt

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.mobidevelop.robovm/robovm-rt

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: ibinti/bugvm

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.bugvm/bugvm-rt

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.jtransc/jtransc-rt

private Entry<K, V> internalPollLastEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.last();
  removeInternal(result);
  return result;
}

代码示例来源:origin: com.gluonhq/robovm-rt

private Entry<K, V> internalPollFirstEntry() {
  if (root == null) {
    return null;
  }
  Node<K, V> result = root.first();
  removeInternal(result);
  return result;
}

相关文章