entrytree_map_path_ f (e:et) lll@(l:ll) rrr@(r:rr) | r<l =
   case entrytree_map_path_ f et lll ((r+1):rr) of
       Nothing -> Nothing
       Just et_ -> Just (e:et_)
entrytree_map_path_ f (e:et) lll@(l:ll) rrr@(r:rr) | r<l =
   case entrytree_map_path_ f et lll ((r+1):rr) of
       Nothing -> Nothing
       Just et_ -> Just (e:et_)
entrytree_map_path_ f (e:et) lll@(l:ll) rrr@(r:rr) | r<l =
   case entrytree_map_path_ f et lll ((r+1):rr) of
       Nothing -> Nothing
       Just et_ -> Just (e:et_)