anchor.diff:              raise <| new InvalidOperationException("The Deque is empty")
   
           count <- count - 1
  -        buffer.[this.toBufferIndex(this.Count)]
  +        buffer.[toBufferIndex(this.Count)]
   
       /// Gets the value at the specified index of the Deque
       member this.Get(index) =
           if index >= this.Count then
               raise <| new IndexOutOfRangeException("The supplied index is greater than the Count")
   
  -        buffer.[this.toBufferIndex(index)]
  +        buffer.[toBufferIndex(index)]
   
       /// Gets the element at the front
       member this.First =
           if count = 0 then
               raise <| new InvalidOperationException("The Deque is empty")
   
  -        buffer.[this.toBufferIndex(0)]
  +        buffer.[toBufferIndex(0)]
   
       /// Gets the element at the end
       member this.Last =
           if count = 0 then
               raise <| new InvalidOperationException("The Deque is empty")
   
  -        buffer.[this.toBufferIndex(count - 1)]
  +        buffer.[toBufferIndex(count - 1)]
   
       interface System.Collections.Generic.IEnumerable<'T> with
           member this.GetEnumerator() =
  -          this.iterate().GetEnumerator()
  +          iterate().GetEnumerator()
   
       interface System.Collections.IEnumerable with
           member this.GetEnumerator () =
  -          (this.iterate().GetEnumerator())
  +          (iterate().GetEnumerator())
               :> System.Collections.IEnumerator        
  
positive.code:     let mutable count = 0
      let mutable capacityClosestPowerOfTwoMinusOne = 0
  
      /// Creates a new Deque with the default capacity
      new() = Deque<'T>(16)
  
  
negative.code:     /// Gets whether or not the Deque is empty.
      member this.IsEmpty = this.Count = 0
  
  
      /// Adds the provided item to the back of the Deque.
      member this.Add(item) =
          if this.Count >= this.Capacity then
              doubleCapacity()
  
          buffer.[toBufferIndex(startOffset + this.Count)] <- item
          count <- count + 1
  
      /// Removes an item from the front of the Deque and returns it.
  