anchor.diff:                          let x = subL - 1 - count
                           areEq <- s.[i+count] = sub.[count] && s.[i + x] = sub.[x]
                           count <- count + 1
  -                    if areEq then res.[i] <- 1uy
  +                    if areEq then
  +                        let ov = b.[0] <!+> 1
  +                        res.[ov] <- i
           @>
   
       let length = s.Length
  
positive.code: //    res //|> Array.filter (fun x -> x <> 0uy)
  
  
  let findSubstr (s:array<byte>) (sub:array<byte>) =
      let hashCalc1 =
          <@
              fun (rng:_1D) (s:array<_>) (res:array<_>) subL l ->
  
negative.code: 
      let command =
          <@
              fun (rng:_1D) (s:array<_>) (sub:array<_>) (res:array<_>) (b:array<_>) sL subL ->
                  let i = rng.GlobalID0
                  //let _sub = sub
                  if i <= sL - subL
  