anchor.diff:  
   [<Test>]
   let ``merge should merge if both heaps have the same ordering`` () =
  -    fsCheck <| fun { Heap = heap1; Items = orig1 } { Heap = heap2; Items = orig2 } ->
  +    fsCheck <| fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) ->
           heap1.IsDescending = heap2.IsDescending ==>
           lazy(
               SkewBinomialHeap.merge heap1 heap2 
  
positive.code: 
  //************* TESTS *****************
  //Only tested the functions on the SkewBinomialHeap module for now, later I could test the remaining functions and methods
  
  [<Test>]
  let ``toSeq returns all the elements`` () =
  
negative.code:         return {Heap = heap; Items = list; Desc = desc}}
      
      static member private Mixed<'T when 'T: comparison> (): Gen<HeapData<'T, 'T>> =
          Gen.frequency [200, SkewBinomialHeapGenerators.EmptyOnly<'T> (None); 800, SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)]
  
      //Distribute the cases, so the tests that receive two heaps and need both to have the same isDescending don't exhaust the arguments, ex: the merge tests
      static member private TwoMixed<'T when 'T: comparison> (): Gen<HeapData<'T, 'T> * HeapData<'T, 'T>> =
          Gen.frequency [
              500, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (None); SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)] |> Gen.two
              250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some true); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some true)] |> Gen.two
              250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some false); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some false)] |> Gen.two
              ]
  
      static member ComparableAndComparable() = SkewBinomialHeapGenerators.Mixed<IComparable> () |> Arb.fromGen
  
  