anchor.diff:                      |> box |> Some 
                   else go (pos + 1)   // continue iter
               else None   // Invalid Character in path
  -<<<<<<< HEAD
  +
       //Start Parse taking into account sign operator
  -=======
  -
  ->>>>>>> af9d8165df9925304fe56ea2190dce8bec2a0110
       match path.[ipos] with
       | '-' -> negNumber <- true ; go (ipos + 1)
       | '+' -> go (ipos + 1)
  
positive.code: let private  charParse (path:string) ipos fpos = path.[ipos] |> box |> Some // this is not ideal method (but uncommonly used)
  
  let private boolParse (path:string) ipos fpos = 
  =======
  /// Range Parsers that quickly try parse over matched range (all fpos checked before running)
  
  let stringParse (path:string) ipos fpos = path.Substring(ipos,fpos - ipos) |> box |> Some
  
  let charParse (path:string) ipos fpos = path.[ipos] |> box |> Some // this is not ideal method (but uncommonly used)
  let boolParse (path:string) ipos fpos = 
  >>>>>>> af9d8165df9925304fe56ea2190dce8bec2a0110
      match path.[ipos] with
      | 't' | 'T' | 'y' | 'Y' -> true  |> box |> Some
      | 'f' | 'F' | 'n' | 'N' -> false |> box |> Some
      | _ -> None
  <<<<<<< HEAD
  
  let private intParse (path:string) ipos fpos =
  =======
  let intParse (path:string) ipos fpos =
  >>>>>>> af9d8165df9925304fe56ea2190dce8bec2a0110
      let mutable result = 0
      let mutable negNumber = false
      let rec go pos =
  
negative.code:     ]
  
  // implimenation of Trie Node
  // assumptions: memory and compile time not relevant, all about execution speed, initially testing with Dictionary edges
  
  type Node(iRouteFn:RouteCont<'T>) = 
      let edges = Dictionary<char,Node>()
  