anchor.diff:                  queue <- queue'
   
               result.ToArray ()
  +
  +    //
  +    member this.ToList () : 'T list =
  +        // OPTIMIZATION : If the queue is empty return immediately.
  +        if this.IsEmpty then
  +            List.empty
  +        else
  +            let mutable resultList = []
  +            let mutable queue = this
  +            while not <| queue.IsEmpty do
  +                let item, queue' = queue.Dequeue ()
  +                resultList <- item :: resultList
  +                queue <- queue'
  +
  +            List.rev resultList
   
       //
       static member private Rotate (xs : LazyList<'T>, ys : 'T list, rys : LazyList<'T>) =
  
positive.code:         queue.Dequeue ()
  
      //
      let inline toArray (queue : Queue<'T>) : 'T[] =
          // Preconditions
          checkNonNull "queue" queue
  
negative.code: 
      //
      member this.ToArray () : 'T[] =
          // OPTIMIZATION : If the queue is empty return immediately.
          if this.IsEmpty then
              Array.empty
          else
  