java.util.LinkedList.offerFirst()方法的使用及代码示例

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

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

LinkedList.offerFirst介绍

[英]Inserts the specified element at the front of this list.
[中]在此列表的前面插入指定的元素。

代码示例

代码示例来源：origin: apache/flink

  1. /**
  2.  * Adds a single input split
  3.  *
  4.  * @param split The input split to add
  5.  */
  6. public void addInputSplit(LocatableInputSplitWithCount split) {
  7.   int localCount = split.getLocalCount();
  8.   if (minLocalCount == -1) {
  9.     // first split to add
  10.     this.minLocalCount = localCount;
  11.     this.elementCycleCount = 1;
  12.     this.splits.offerFirst(split);
  13.   } else if (localCount < minLocalCount) {
  14.     // split with new min local count
  15.     this.nextMinLocalCount = this.minLocalCount;
  16.     this.minLocalCount = localCount;
  17.     // all other splits have more local host than this one
  18.     this.elementCycleCount = 1;
  19.     splits.offerFirst(split);
  20.   } else if (localCount == minLocalCount ) {
  21.     this.elementCycleCount++;
  22.     this.splits.offerFirst(split);
  23.   } else {
  24.     if (localCount < nextMinLocalCount) {
  25.       nextMinLocalCount = localCount;
  26.     }
  27.     splits.offerLast(split);
  28.   }
  29. }

代码示例来源：origin: apache/hbase

  1. @Test
  2. public void testParseOptsMultiPuts() {
  3.  Queue<String> opts = new LinkedList<>();
  4.  String cmdName = "sequentialWrite";
  5.  opts.offer("--multiPut=10");
  6.  opts.offer(cmdName);
  7.  opts.offer("64");
  8.  PerformanceEvaluation.TestOptions options = null;
  9.  try {
  10.   options = PerformanceEvaluation.parseOpts(opts);
  11.   fail("should fail");
  12.  } catch (IllegalArgumentException  e) {
  13.   System.out.println(e.getMessage());
  14.  }
  15.  ((LinkedList<String>) opts).offerFirst("--multiPut=10");
  16.  ((LinkedList<String>) opts).offerFirst("--autoFlush=true");
  17.  options = PerformanceEvaluation.parseOpts(opts);
  18.  assertNotNull(options);
  19.  assertNotNull(options.getCmdName());
  20.  assertEquals(cmdName, options.getCmdName());
  21.  assertTrue(options.getMultiPut() == 10);
  22. }

代码示例来源：origin: apache/hbase

  1. @Test
  2.  public void testParseOptsConnCount() {
  3.   Queue<String> opts = new LinkedList<>();
  4.   String cmdName = "sequentialWrite";
  5.   opts.offer("--oneCon=true");
  6.   opts.offer("--connCount=10");
  7.   opts.offer(cmdName);
  8.   opts.offer("64");
  9.   PerformanceEvaluation.TestOptions options = null;
  10.   try {
  11.    options = PerformanceEvaluation.parseOpts(opts);
  12.    fail("should fail");
  13.   } catch (IllegalArgumentException  e) {
  14.    System.out.println(e.getMessage());
  15.   }
  16.   ((LinkedList<String>) opts).offerFirst("--connCount=10");
  17.   options = PerformanceEvaluation.parseOpts(opts);
  18.   assertNotNull(options);
  19.   assertNotNull(options.getCmdName());
  20.   assertEquals(cmdName, options.getCmdName());
  21.   assertTrue(options.getConnCount() == 10);
  22.  }
  23. }

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

  1. @Override
  2. public boolean offerFirst(E e, long timeout, TimeUnit unit) throws InterruptedException {
  3.   return queue.offerFirst(e);
  4. }

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

  1. @Override
  2. public boolean offerFirst(E e) {
  3.   return queue.offerFirst(e);
  4. }

代码示例来源：origin: org.apache.openjpa/openjpa-all

  1. @Override
  2. public boolean offerFirst(Object paramObject) {
  3.   if (_directAccess) {
  4.     return super.offerFirst(paramObject);
  5.   }
  6.   if (isDelayLoad()) {
  7.     load();
  8.   }
  9.   return super.offerFirst(paramObject);
  10. }

代码示例来源：origin: org.apache.openejb.patch/openjpa

  1. @Override
  2. public boolean offerFirst(Object paramObject) {
  3.   if (_directAccess) {
  4.     return super.offerFirst(paramObject);
  5.   }
  6.   if (isDelayLoad()) {
  7.     load();
  8.   }
  9.   return super.offerFirst(paramObject);
  10. }

代码示例来源：origin: org.onehippo.cms7/hippo-cms7-utilities

  1. @Override
  2. public boolean offerFirst(E element) {
  3.   validateCapacityAndPollFirstIfNeeded();
  4.   return super.offerFirst(element);
  5. }

代码示例来源：origin: org.apache.openjpa/openjpa-kernel

  1. @Override
  2. public boolean offerFirst(Object paramObject) {
  3.   if (_directAccess) {
  4.     return super.offerFirst(paramObject);
  5.   }
  6.   if (isDelayLoad()) {
  7.     load();
  8.   }
  9.   return super.offerFirst(paramObject);
  10. }

代码示例来源：origin: uk.org.retep.tools/collections

  1. @Override
  2. public boolean offerFirst( E e )
  3. {
  4.   if( size() >= maxElements )
  5.   {
  6.     return false;
  7.   }
  8.   return super.offerFirst( e );
  9. }

代码示例来源：origin: org.apache.openejb.patch/openjpa-kernel

  1. @Override
  2. public boolean offerFirst(Object paramObject) {
  3.   if (_directAccess) {
  4.     return super.offerFirst(paramObject);
  5.   }
  6.   if (isDelayLoad()) {
  7.     load();
  8.   }
  9.   return super.offerFirst(paramObject);
  10. }

代码示例来源：origin: com.virjar/dungproxy-client

  1. @Override
  2. public boolean offerFirst(T t) {
  3.   lock.lock();
  4.   try {
  5.     boolean ret = super.offerFirst(t);
  6.     notifyIfNotEmpty();
  7.     return ret;
  8.   } finally {
  9.     lock.unlock();
  10.   }
  11. }

代码示例来源：origin: stackoverflow.com

  1. public class StreamHistory<T> {
  3.   private final int numberOfElementsToRemember;
  4.   private LinkedList<T> queue = new LinkedList<T>(); // queue will store at most numberOfElementsToRemember
  6.   public StreamHistory(int numberOfElementsToRemember) {
  7.     this.numberOfElementsToRemember = numberOfElementsToRemember;
  8.   }
  10.   public StreamHistory save(T curElem) {
  12.     if (queue.size() == numberOfElementsToRemember) {
  13.       queue.pollLast(); // remove last to keep only requested number of elements
  14.     }
  16.     queue.offerFirst(curElem);
  18.     return this;
  19.   }
  21.   public LinkedList<T> getLastElements() {
  22.     return queue; // or return immutable copy or immutable view on the queue. Depends on what you want.
  23.   }
  24. }

代码示例来源：origin: org.apache.flink/flink-core

  1. /**
  2.  * Adds a single input split
  3.  *
  4.  * @param split The input split to add
  5.  */
  6. public void addInputSplit(LocatableInputSplitWithCount split) {
  7.   int localCount = split.getLocalCount();
  8.   if (minLocalCount == -1) {
  9.     // first split to add
  10.     this.minLocalCount = localCount;
  11.     this.elementCycleCount = 1;
  12.     this.splits.offerFirst(split);
  13.   } else if (localCount < minLocalCount) {
  14.     // split with new min local count
  15.     this.nextMinLocalCount = this.minLocalCount;
  16.     this.minLocalCount = localCount;
  17.     // all other splits have more local host than this one
  18.     this.elementCycleCount = 1;
  19.     splits.offerFirst(split);
  20.   } else if (localCount == minLocalCount ) {
  21.     this.elementCycleCount++;
  22.     this.splits.offerFirst(split);
  23.   } else {
  24.     if (localCount < nextMinLocalCount) {
  25.       nextMinLocalCount = localCount;
  26.     }
  27.     splits.offerLast(split);
  28.   }
  29. }

代码示例来源：origin: stackoverflow.com

  1. offerFirst(curElem);

代码示例来源：origin: stackoverflow.com

  1. offerFirst(curElem);
  2. return this;

代码示例来源：origin: net.digitalid.utility/utility-collections

  1. @Impure
  2. @Override
  3. @NonFrozenRecipient
  4. public boolean offerFirst(@Captured E element) {
  5.   return super.offerFirst(element);
  6. }

代码示例来源：origin: org.apache.hbase/hbase-mapreduce

  1. @Test
  2. public void testParseOptsMultiPuts() {
  3.  Queue<String> opts = new LinkedList<>();
  4.  String cmdName = "sequentialWrite";
  5.  opts.offer("--multiPut=10");
  6.  opts.offer(cmdName);
  7.  opts.offer("64");
  8.  PerformanceEvaluation.TestOptions options = null;
  9.  try {
  10.   options = PerformanceEvaluation.parseOpts(opts);
  11.   fail("should fail");
  12.  } catch (IllegalArgumentException e) {
  13.   System.out.println(e.getMessage());
  14.  }
  15.  ((LinkedList<String>) opts).offerFirst("--multiPut=10");
  16.  ((LinkedList<String>) opts).offerFirst("--autoFlush=true");
  17.  options = PerformanceEvaluation.parseOpts(opts);
  18.  assertNotNull(options);
  19.  assertNotNull(options.getCmdName());
  20.  assertEquals(cmdName, options.getCmdName());
  21.  assertTrue(options.getMultiPut() == 10);
  22. }

代码示例来源：origin: jmacglashan/burlap

  1. trajectory.offerFirst(csh);

代码示例来源：origin: org.apache.hbase/hbase-mapreduce

  1. @Test
  2.  public void testParseOptsConnCount() {
  3.   Queue<String> opts = new LinkedList<>();
  4.   String cmdName = "sequentialWrite";
  5.   opts.offer("--oneCon=true");
  6.   opts.offer("--connCount=10");
  7.   opts.offer(cmdName);
  8.   opts.offer("64");
  9.   PerformanceEvaluation.TestOptions options = null;
  10.   try {
  11.    options = PerformanceEvaluation.parseOpts(opts);
  12.    fail("should fail");
  13.   } catch (IllegalArgumentException e) {
  14.    System.out.println(e.getMessage());
  15.   }
  16.   ((LinkedList<String>) opts).offerFirst("--connCount=10");
  17.   options = PerformanceEvaluation.parseOpts(opts);
  18.   assertNotNull(options);
  19.   assertNotNull(options.getCmdName());
  20.   assertEquals(cmdName, options.getCmdName());
  21.   assertTrue(options.getConnCount() == 10);
  22.  }
  23. }

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

LinkedList

相关文章

    查看更多

    热门标签

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

    最新文章

    更多

    LinkedList类方法

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