anchor.diff:              else None
           go ipos x
   
  +        /// Multiple Edge designs possible, for now use simple dictionary over sorted array w/ binary search
   
           // let rec go l r = 
           //     if l > r then 
  
positive.code:         if i = fin then
              node.Add path.Value.[i] (MatchMap( fMap , None ))
          else
              if path.Value.[i] = '%' then
                  let fmtChar = path.Value.[i + 1] ///HACK fix out of bounds gap
                  if formatStringMap.ContainsKey fmtChar then
                      let nMatchMap = fmtChar :: fMap
                      let newNodeBranch = Node(EmptyMap)
                      node.RouteFn <- MatchMap( nMatchMap , Some newNodeBranch )
                      go (i + 2) newNodeBranch nMatchMap
                  else
  
negative.code: 
          let pathLen = path.Length
  
  
          let findClosure (path:string) ipos (inode:Node) =
              let pathLen = path.Length
  