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

Queue.decrement介绍

[英]This method does not affect the queue itself. It is only a helper to decrement an index in the queue.
[中]此方法不会影响队列本身。它只是帮助减少队列中的索引。

代码示例

代码示例来源：origin: com.github.veithen.cosmos.bootstrap/org.eclipse.core.jobs

/**
 * Removes the given object from the queue. Shifts the underlying array.
 */
public boolean remove(Object o) {
  int index = head;
  //find the object to remove
  while (index != tail) {
    if (elements[index].equals(o))
      break;
    index = increment(index);
  }
  //if element wasn't found, return
  if (index == tail)
    return false;
  //store a reference to it (needed for reuse of objects)
  Object toRemove = elements[index];
  int nextIndex = -1;
  while (index != tail) {
    nextIndex = increment(index);
    if (nextIndex != tail)
      elements[index] = elements[nextIndex];
    index = nextIndex;
  }
  //decrement tail
  tail = decrement(tail);
  //if objects are reused, transfer the reference that is removed to the end of the queue
  //otherwise set the element after the last one to null (to avoid duplicate references)
  elements[tail] = reuse ? toRemove : null;
  return true;
}

代码示例来源：origin: org.jibx.config.3rdparty.org.eclipse/org.eclipse.core.jobs

/**
 * Removes the given object from the queue. Shifts the underlying array.
 */
public boolean remove(Object o) {
  int index = head;
  //find the object to remove
  while (index != tail) {
    if (elements[index].equals(o))
      break;
    index = increment(index);
  }
  //if element wasn't found, return
  if (index == tail)
    return false;
  //store a reference to it (needed for reuse of objects)
  Object toRemove = elements[index];
  int nextIndex = -1;
  while (index != tail) {
    nextIndex = increment(index);
    if (nextIndex != tail)
      elements[index] = elements[nextIndex];
    index = nextIndex;
  }
  //decrement tail
  tail = decrement(tail);
  //if objects are reused, transfer the reference that is removed to the end of the queue
  //otherwise set the element after the last one to null (to avoid duplicate references)
  elements[tail] = reuse ? toRemove : null;
  return true;
}

代码示例来源：origin: org.eclipse.scout.sdk.deps/org.eclipse.core.jobs

/**
 * Removes the given object from the queue. Shifts the underlying array.
 */
public boolean remove(Object o) {
  int index = head;
  //find the object to remove
  while (index != tail) {
    if (elements[index].equals(o))
      break;
    index = increment(index);
  }
  //if element wasn't found, return
  if (index == tail)
    return false;
  //store a reference to it (needed for reuse of objects)
  Object toRemove = elements[index];
  int nextIndex = -1;
  while (index != tail) {
    nextIndex = increment(index);
    if (nextIndex != tail)
      elements[index] = elements[nextIndex];
    index = nextIndex;
  }
  //decrement tail
  tail = decrement(tail);
  //if objects are reused, transfer the reference that is removed to the end of the queue
  //otherwise set the element after the last one to null (to avoid duplicate references)
  elements[tail] = reuse ? toRemove : null;
  return true;
}

代码示例来源：origin: org.eclipse/core-jobs

/**
 * Removes the given object from the queue. Shifts the underlying array.
 */
public boolean remove(Object o) {
  int index = head;
  //find the object to remove
  while (index != tail) {
    if (elements[index].equals(o))
      break;
    index = increment(index);
  }
  //if element wasn't found, return
  if (index == tail)
    return false;
  //store a reference to it (needed for reuse of objects)
  Object toRemove = elements[index];
  int nextIndex = -1;
  while (index != tail) {
    nextIndex = increment(index);
    if (nextIndex != tail)
      elements[index] = elements[nextIndex];
    index = nextIndex;
  }
  //decrement tail
  tail = decrement(tail);
  //if objects are reused, transfer the reference that is removed to the end of the queue
  //otherwise set the element after the last one to null (to avoid duplicate references)
  elements[tail] = reuse ? toRemove : null;
  return true;
}