anchor.diff:          ||> Array.fold (fun queue el ->
               queue.Enqueue el)
   
  -    /// Create a sequence containing the elements of the Queue in order.
  +    /// <summary>Create a sequence containing the elements of the Queue in order.</summary>
  +    /// <returns></returns>
       member this.ToSeq () : seq<'T> =
           // OPTIMIZATION : If the queue is empty return immediately.
           if this.IsEmpty then
  
positive.code:         ||> List.fold (fun queue el ->
              queue.Enqueue el)
  
      /// Creates a Queue from the elements of an array.
      static member OfArray array : Queue<'T> =
          // Preconditions
          checkNonNull "array" array
  
negative.code: 
          queue.GetLength ()
  
      /// <summary>Returns a new Queue with the object added to the end of the given Queue.</summary>
      /// <param name="value"></param>
      /// <param name="queue"></param>
      /// <returns></returns>
      [<CompiledName("Enqueue")>]
      let inline enqueue value (queue : Queue<'T>) =
          // Preconditions
  