anchor.diff:  
               ResizeArray.toArray result
   
  -    //
  +    /// Create a list containing the elements of the Queue in order.
       member this.ToList () : 'T list =
           // OPTIMIZATION : If the queue is empty return immediately.
           if this.IsEmpty then
  
positive.code:         
          queue.ToArray ()
  
  
negative.code:             rear,
              pending)
  
      /// Returns a new Queue with the object added to the end of the Queue.
      member __.Enqueue value =
          Queue<_>.CreateQueue (
              front,
              value :: rear,
              pending)
  
      /// Returns a new Queue with the object added to the front of the Queue.
      member __.EnqueueFront value =
          Queue (
              LazyList.cons value front,
              rear,
              LazyList.cons value pending)
  
      /// Create an array containing the elements of the Queue in order.
      member this.ToArray () : 'T[] =
          // OPTIMIZATION : If the queue is empty return immediately.
          if this.IsEmpty then
              Array.empty
          else
              // OPTIMIZE : Tune this for best average-case performance.
              // Perhaps we can use the LazyList.LazyLength property to
              // estimate a better initial capacity for the ResizeArray.
              let result = ResizeArray<_> ()
  
              let mutable queue = this
  