Clover Coverage Report - Backport Util Concurrent v3.0
Coverage timestamp: Fri May 9 2008 11:05:23 EST
Overview   Package   File
    FRAMES   NO FRAMES     
../../../../../../../img/srcFileCovDistChart9.png 35% of files have more coverage
139   493   76   4.79
78   261   0.55   7.25
29     2.62  
4    
 
  ConcurrentLinkedQueue       Line # 58 100 56 83.9% 0.8388889
  ConcurrentLinkedQueue.Node       Line # 82 15 10 70.4% 0.7037037
  ConcurrentLinkedQueue.Itr       Line # 380 24 10 84.6% 0.84615386
  ConcurrentLinkedQueue.SerializableLock       Line # 492 0 0 - -1.0
 
  (36)
 
1    /*
2    * Written by Doug Lea with assistance from members of JCP JSR-166
3    * Expert Group and released to the public domain, as explained at
4    * http://creativecommons.org/licenses/publicdomain
5    */
6   
7    package edu.emory.mathcs.backport.java.util.concurrent;
8    import edu.emory.mathcs.backport.java.util.*;
9    import java.io.*;
10    import java.util.Collection;
11    import java.util.Iterator;
12    import java.util.NoSuchElementException;
13   
14   
15    /**
16    * An unbounded thread-safe {@linkplain Queue queue} based on linked nodes.
17    * This queue orders elements FIFO (first-in-first-out).
18    * The <em>head</em> of the queue is that element that has been on the
19    * queue the longest time.
20    * The <em>tail</em> of the queue is that element that has been on the
21    * queue the shortest time. New elements
22    * are inserted at the tail of the queue, and the queue retrieval
23    * operations obtain elements at the head of the queue.
24    * A <tt>ConcurrentLinkedQueue</tt> is an appropriate choice when
25    * many threads will share access to a common collection.
26    * This queue does not permit <tt>null</tt> elements.
27    *
28    * <p>This implementation employs an efficient &quot;wait-free&quot;
29    * algorithm based on one described in <a
30