code: def facetintervallookupone(table, key, start='start', stop='stop',
                             value=None, include_stop=False, strict=True):
      
      
      trees = facettupletrees(table, key, start=start, stop=stop, value=value)
      out = dict()
      for k in trees:
          out[k] = IntervalTreeLookupOne(trees[k], include_stop=include_stop,
                                         strict=strict)
      return out
docs: Construct a faceted interval lookup for the given table, returning at most
      one result for each query.
      
      If ``strict=True``, queries returning more than one result will
      raise a `DuplicateKeyError`. If ``strict=False`` and there is
      more than one result, the first result is returned.