Deep Link Route Resolver | mysimulator.uk

Incoming Deep Link

Precedence Rule

Traversal speed 1.0×

Resolution Result

Press "Resolve route" to trace a URL through the trie.

Nodes visited

Est. match time

0 µs

Registered Routes

How it works

Mobile deep-link routers store their registered paths in a radix trie: each URL segment (product, :id, reviews …) is one node, and a path is registered by walking/creating a node per segment, marking the final node as a route terminus.

match(node, segments, i):
  if i == len(segments): return node.isEnd ? SUCCESS : FAIL
  seg = segments[i]
  for child in orderedChildren(node):   # static child(ren) before :param child
    if child.matches(seg):
      result = match(child, segments, i+1)
      if result == SUCCESS: return SUCCESS   # else backtrack, try next child
  return FAIL

Precedence — when both a literal child (e.g. settings) and a parameter child (:id) can accept the same segment, a correctly implemented router always tries the static child first. Flip the toggle to param-first and re-resolve /user/settings: the trie now matches /user/:id with id=settings instead of the intended /user/settings page — a real routing bug class in Android Navigation/iOS universal-link tables when patterns overlap.

Backtracking — if a branch is entered but dead-ends (no terminal route at the required depth), the matcher climbs back to the parent and tries the next sibling before giving up; each re-visit still counts toward nodes visited, which is why an unmatched deep link (falling back to the web/App-Store page) can cost more traversal steps than a clean match.

Cost per hop is O(1) map/array lookup, so overall match time is O(depth of the path) — the estimate here uses 40 µs per node visited, in line with published benchmarks for production path-matching routers.

Static segment Parameter segment (:id) Matched route Backtracked dead end Traveling request

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.