java.util.concurrent.LinkedBlockingDeque.unlink()方法的使用及代码示例

x33g5p2x  于2022-01-23 转载在 其他  
字(5.8k)|赞(0)|评价(0)|浏览(142)

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

LinkedBlockingDeque.unlink介绍

[英]Unlinks x.
[中]取消链接x。

代码示例

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: org.codehaus.jsr166-mirror/jsr166

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: jtulach/bck2brwsr

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

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

public boolean removeLastOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = last; p != null; p = p.prev) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

代码示例来源：origin: jtulach/bck2brwsr

public boolean removeFirstOccurrence(Object o) {
  if (o == null) return false;
  final ReentrantLock lock = this.lock;
  lock.lock();
  try {
    for (Node<E> p = first; p != null; p = p.next) {
      if (o.equals(p.item)) {
        unlink(p);
        return true;
      }
    }
    return false;
  } finally {
    lock.unlock();
  }
}

内容来源于网络，如有侵权，请联系作者删除！

LinkedBlockingDeque

相关文章

    查看更多
    微信公众号

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多

    LinkedBlockingDeque类方法

    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com