anchor.diff:              notImpl "LruCache::.ctor(uint32, seq<'Key, 'T>)"
               // TEMP : This is necessary because of the exception being raised (above).
               // It can be removed whenever this code path is implemented.
  -            LruCache (HashMap.empty, IntMap.empty, 0u, 0)
  +            LruCache (HashMap.empty, IntMap.empty, 0u, 0u)
   
       /// Is the cache empty?
       member __.IsEmpty
  
positive.code: 
      //
      member this.Add (key : 'Key, value : 'T) : LruCache<'Key, 'T> =
          // NOTE : Checked.add MUST be used when incrementing 'count'!
          notImpl "LruCache.Add"
  
      //
      member this.Remove (key : 'Key) : LruCache<'Key, 'T> =
          snd <| this.Extract key
  
      //
      member private __.Extract (key : 'Key) : KeyValuePair<'Key, 'T> option * LruCache<'Key, 'T> =
          notImpl "LruCache.Extract"
      
      //
      member this.ChangeCapacity (newCapacity : uint32) : LruCache<'Key, 'T> =
  
negative.code:         if capacity = 0u then
              // Unfortunately, we can't just return the empty cache instance,
              // we must actually call a constructor.
              LruCache (HashMap.empty, IntMap.empty, 0u, 0u)
          else
              // OPTIMIZE : Try to cast the sequence to array or list;
              // if it succeeds use the specialized method for that type for better performance.
  