{"record":{"id":"55a5ee5c1eaa8b5e","repo":"sqlmapproject/sqlmap","slug":"s-d-55a5ee","errorCode":null,"errorMessage":"%s < %d","messagePattern":"%s < %d","errorType":"exception","errorClass":"NumericOutOfRange","httpStatus":null,"severity":"error","filePath":"extra/esperanto/extraction.py","lineNumber":185,"sourceCode":"                                win = half\n                            else:\n                                win = win[len(win) // 2:]\n                        return win[0]\n                    base += window\n                raise NumericOutOfRange(\"%s not in [%d,%d]\" % (expr, lo, hi))\n            for v in range(lo, hi + 1):             # no ordered op and no IN: '=' scan\n                if self._ask(\"%s=%d\" % (expr, v)):\n                    return v\n            raise NumericOutOfRange(\"%s not in [%d,%d]\" % (expr, lo, hi))\n        # ordered comparators (gt / between / operator-free rung): prove range first\n        if self._comparator == \"between\":\n            if not self._ask(\"%s BETWEEN %d AND %d\" % (expr, lo, hi)):\n                raise NumericOutOfRange(\"%s not in [%d,%d]\" % (expr, lo, hi))\n        else:                                       # gt or operator-free rung ('>' semantics)\n            if self._gtNum(expr, hi, hi):\n                raise NumericOutOfRange(\"%s > %d\" % (expr, hi))\n            if not self._gtNum(expr, lo - 1, hi):   # expr <= lo-1 -> below range (any sign of lo)\n                raise NumericOutOfRange(\"%s < %d\" % (expr, lo))\n        low, high = lo, min(max(lo, 8), hi)         # exponential climb keeps small values cheap\n        while high < hi and self._gtNum(expr, high, hi):\n            low, high = high + 1, min(high * 2, hi)\n        while low < high:\n            mid = (low + high) // 2\n            if self._gtNum(expr, mid, hi):\n                low = mid + 1\n            else:\n                high = mid\n        return low\n\n    def _bisectCodes(self, code, codes):\n        # ordered bisection over a sorted code list (restricted alphabet)\n        lo, hi = 0, len(codes) - 1\n        top = codes[hi]\n        while lo < hi:\n            mid = (lo + hi) // 2\n            if self._gtNum(code, codes[mid], top):","sourceCodeStart":167,"sourceCodeEnd":203,"githubUrl":"https://github.com/sqlmapproject/sqlmap/blob/0a35b20e3953d341be6c7ac75ccb0b3362540c8d/extra/esperanto/extraction.py#L167-L203","documentation":"Error \"%s < %d\" thrown in sqlmapproject/sqlmap.","triggerScenarios":"Thrown at extra/esperanto/extraction.py:185 when the library encounters an invalid state.","commonSituations":"See trigger scenarios.","solutions":[],"exampleFix":null,"handlingStrategy":null,"validationCode":null,"typeGuard":null,"tryCatchPattern":null,"preventionTips":[],"tags":[],"backgroundTag":null,"analyzedSha":"0a35b20e3953d341be6c7ac75ccb0b3362540c8d","analyzedAt":"2026-08-26T23:02:52.002Z","schemaVersion":2},"datasetVersion":"2026-08-27T03:17:27.898Z"}