sqlmapproject/sqlmap · error · NumericOutOfRange
%s > %d
Error message
%s > %d
What it means
Error "%s > %d" thrown in sqlmapproject/sqlmap.
Source
Thrown at extra/esperanto/extraction.py:183
half = win[:len(win) // 2]
if self._ask("%s IN (%s)" % (expr, ",".join(str(v) for v in half))):
win = half
else:
win = win[len(win) // 2:]
return win[0]
base += window
raise NumericOutOfRange("%s not in [%d,%d]" % (expr, lo, hi))
for v in range(lo, hi + 1): # no ordered op and no IN: '=' scan
if self._ask("%s=%d" % (expr, v)):
return v
raise NumericOutOfRange("%s not in [%d,%d]" % (expr, lo, hi))
# ordered comparators (gt / between / operator-free rung): prove range first
if self._comparator == "between":
if not self._ask("%s BETWEEN %d AND %d" % (expr, lo, hi)):
raise NumericOutOfRange("%s not in [%d,%d]" % (expr, lo, hi))
else: # gt or operator-free rung ('>' semantics)
if self._gtNum(expr, hi, hi):
raise NumericOutOfRange("%s > %d" % (expr, hi))
if not self._gtNum(expr, lo - 1, hi): # expr <= lo-1 -> below range (any sign of lo)
raise NumericOutOfRange("%s < %d" % (expr, lo))
low, high = lo, min(max(lo, 8), hi) # exponential climb keeps small values cheap
while high < hi and self._gtNum(expr, high, hi):
low, high = high + 1, min(high * 2, hi)
while low < high:
mid = (low + high) // 2
if self._gtNum(expr, mid, hi):
low = mid + 1
else:
high = mid
return low
def _bisectCodes(self, code, codes):
# ordered bisection over a sorted code list (restricted alphabet)
lo, hi = 0, len(codes) - 1
top = codes[hi]
while lo < hi:View on GitHub (pinned to 0a35b20e39)
When it happens
Trigger: Thrown at extra/esperanto/extraction.py:183 when the library encounters an invalid state.
Common situations: See trigger scenarios.
AI-assisted analysis of sqlmapproject/sqlmap@0a35b20e39 (2026-08-26).
Data as JSON: /api/errors/75a68d0a2aa8775b.
Report an issue: GitHub.