anchor.diff:                          arr.Add a
                           a <- Array.zeroCreate blockSize
                           index <- 0
  +        if index <> 0
  +        then
  +            arr.Add a
           let l = arr.Count
  -        let resArr = Array.zeroCreate (l * 2)
  +        let resArr = Array.zeroCreate l
           for i = 0 to l - 1 do
               resArr.[i] <- arr.[i]
           bra.SetArrays resArr
  
positive.code:     ///Applies a function to each element of the collection, threading an accumulator argument through the computation.
      member this.Fold (folder : 'State -> 'T -> 'State) (state : 'State) : 'State =
          let mutable state = state
          for i in 0..active do
              let r = Array.fold folder state arrays.[i]
              state <- r 
          state
              
      ///Returns a new collection containing only the elements of the collection for which the given predicate returns true.
  
negative.code: ﻿namespace FSharpx.Collections.Experimental
  
  /// Resize array fith fixed size block memory allocation.
  /// Provide more optimal space usage for huge arrays than standard ResizeArray.
  /// Basic version created by Avdyukhin Dmitry <dimonbv@gmail.com>
  open System.Collections
  open System.Collections.Generic
              
  