anchor.diff:  
           queue.GetLength ()
   
  -    /// add to rear of queue
  +    /// Returns a new Queue with the object added to the end of the given Queue.
       [<CompiledName("Enqueue")>]
       let inline enqueue value (queue : Queue<'T>) =
           // Preconditions
           checkNonNull "queue" queue
  -
  +        
           queue.Enqueue value
   
  -    /// add to front of queue
  +    /// Returns a new Queue with the object added to the front of the given Queue.
       [<CompiledName("EnqueueFront")>]
  -    let inline enqueuef value (queue : Queue<'T>) =
  +    let inline enqueueFront value (queue : Queue<'T>) =
           // Preconditions
           checkNonNull "queue" queue
   
           queue.EnqueueFront value
   
  -    /// take from front of queue
  +    /// Removes and returns the object at the beginning of the Queue.
       [<CompiledName("Dequeue")>]
       let inline dequeue (queue : Queue<'T>) =
           // Preconditions
  
positive.code:         
          queue.ToList ()
  
      //
      [<CompiledName("ToArray")>]
      let inline toArray (queue : Queue<'T>) : 'T[] =
          // Preconditions
  
negative.code: 
              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
  