anchor.diff:      let private evaluateWigner (xValue:float) =
           System.Math.PI*0.5*xValue*System.Math.E**(-System.Math.PI*0.25*xValue*xValue)    
   
  -    let private nearesNeighbourSpacing egvLength (uEgv:seq<float>) = 
  +    let private nearestNeighbourSpacing egvLength (uEgv:seq<float>) = 
           uEgv
           |> Seq.map (fun x -> x * float egvLength)
           |> Seq.sort
  
positive.code:     // bwQuantile uses % data to calculate a more robust histogram
      let compute (bwQuantile : float) accuracy (sigCriterion : float) (m:float[,]) =
  
          let rec stepSearch left right =
              let thr = left + right / 2.
              let chi =
                  m
                  |> Array2D.map (fun v -> if abs v > thr then v else 0.)
                  |> computeChiSquared bwQuantile
  
              if left - right > accuracy then 
                  if chi.PValue <= sigCriterion  then
                      // jump left
                      stepSearch  left thr
                  else
                      stepSearch thr right
              else
                  thr,chi
                  
          stepSearch 0. 1.
  
  
  
  
negative.code: 
          let nnSpacing =
              unfoldedEgv
              |> nearestNeighbourSpacing unfoldedEgv.Length
              |> Seq.toArray
          
          let histo =
  