You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

322 lines
11 KiB

  1. /* Range object implementation */
  2. #include "Python.h"
  3. typedef struct {
  4. PyObject_HEAD
  5. long start;
  6. long step;
  7. long len;
  8. } rangeobject;
  9. /* Return number of items in range (lo, hi, step). step != 0
  10. * required. The result always fits in an unsigned long.
  11. */
  12. static unsigned long
  13. get_len_of_range(long lo, long hi, long step)
  14. {
  15. /* -------------------------------------------------------------
  16. If step > 0 and lo >= hi, or step < 0 and lo <= hi, the range is empty.
  17. Else for step > 0, if n values are in the range, the last one is
  18. lo + (n-1)*step, which must be <= hi-1. Rearranging,
  19. n <= (hi - lo - 1)/step + 1, so taking the floor of the RHS gives
  20. the proper value. Since lo < hi in this case, hi-lo-1 >= 0, so
  21. the RHS is non-negative and so truncation is the same as the
  22. floor. Letting M be the largest positive long, the worst case
  23. for the RHS numerator is hi=M, lo=-M-1, and then
  24. hi-lo-1 = M-(-M-1)-1 = 2*M. Therefore unsigned long has enough
  25. precision to compute the RHS exactly. The analysis for step < 0
  26. is similar.
  27. ---------------------------------------------------------------*/
  28. assert(step != 0);
  29. if (step > 0 && lo < hi)
  30. return 1UL + (hi - 1UL - lo) / step;
  31. else if (step < 0 && lo > hi)
  32. return 1UL + (lo - 1UL - hi) / (0UL - step);
  33. else
  34. return 0UL;
  35. }
  36. static PyObject *
  37. range_new(PyTypeObject *type, PyObject *args, PyObject *kw)
  38. {
  39. rangeobject *obj;
  40. long ilow = 0, ihigh = 0, istep = 1;
  41. unsigned long n;
  42. if (!_PyArg_NoKeywords("xrange()", kw))
  43. return NULL;
  44. if (PyTuple_Size(args) <= 1) {
  45. if (!PyArg_ParseTuple(args,
  46. "l;xrange() requires 1-3 int arguments",
  47. &ihigh))
  48. return NULL;
  49. }
  50. else {
  51. if (!PyArg_ParseTuple(args,
  52. "ll|l;xrange() requires 1-3 int arguments",
  53. &ilow, &ihigh, &istep))
  54. return NULL;
  55. }
  56. if (istep == 0) {
  57. PyErr_SetString(PyExc_ValueError, "xrange() arg 3 must not be zero");
  58. return NULL;
  59. }
  60. n = get_len_of_range(ilow, ihigh, istep);
  61. if (n > (unsigned long)LONG_MAX || (long)n > PY_SSIZE_T_MAX) {
  62. PyErr_SetString(PyExc_OverflowError,
  63. "xrange() result has too many items");
  64. return NULL;
  65. }
  66. obj = PyObject_New(rangeobject, &PyRange_Type);
  67. if (obj == NULL)
  68. return NULL;
  69. obj->start = ilow;
  70. obj->len = (long)n;
  71. obj->step = istep;
  72. return (PyObject *) obj;
  73. }
  74. PyDoc_STRVAR(range_doc,
  75. "xrange([start,] stop[, step]) -> xrange object\n\
  76. \n\
  77. Like range(), but instead of returning a list, returns an object that\n\
  78. generates the numbers in the range on demand. For looping, this is \n\
  79. slightly faster than range() and more memory efficient.");
  80. static PyObject *
  81. range_item(rangeobject *r, Py_ssize_t i)
  82. {
  83. if (i < 0 || i >= r->len) {
  84. PyErr_SetString(PyExc_IndexError,
  85. "xrange object index out of range");
  86. return NULL;
  87. }
  88. /* do calculation entirely using unsigned longs, to avoid
  89. undefined behaviour due to signed overflow. */
  90. return PyInt_FromLong((long)(r->start + (unsigned long)i * r->step));
  91. }
  92. static Py_ssize_t
  93. range_length(rangeobject *r)
  94. {
  95. return (Py_ssize_t)(r->len);
  96. }
  97. static PyObject *
  98. range_repr(rangeobject *r)
  99. {
  100. PyObject *rtn;
  101. if (r->start == 0 && r->step == 1)
  102. rtn = PyString_FromFormat("xrange(%ld)",
  103. r->start + r->len * r->step);
  104. else if (r->step == 1)
  105. rtn = PyString_FromFormat("xrange(%ld, %ld)",
  106. r->start,
  107. r->start + r->len * r->step);
  108. else
  109. rtn = PyString_FromFormat("xrange(%ld, %ld, %ld)",
  110. r->start,
  111. r->start + r->len * r->step,
  112. r->step);
  113. return rtn;
  114. }
  115. /* Pickling support */
  116. static PyObject *
  117. range_reduce(rangeobject *r, PyObject *args)
  118. {
  119. return Py_BuildValue("(O(iii))", Py_TYPE(r),
  120. r->start,
  121. r->start + r->len * r->step,
  122. r->step);
  123. }
  124. static PySequenceMethods range_as_sequence = {
  125. (lenfunc)range_length, /* sq_length */
  126. 0, /* sq_concat */
  127. 0, /* sq_repeat */
  128. (ssizeargfunc)range_item, /* sq_item */
  129. 0, /* sq_slice */
  130. };
  131. static PyObject * range_iter(PyObject *seq);
  132. static PyObject * range_reverse(PyObject *seq);
  133. PyDoc_STRVAR(reverse_doc,
  134. "Returns a reverse iterator.");
  135. static PyMethodDef range_methods[] = {
  136. {"__reversed__", (PyCFunction)range_reverse, METH_NOARGS, reverse_doc},
  137. {"__reduce__", (PyCFunction)range_reduce, METH_VARARGS},
  138. {NULL, NULL} /* sentinel */
  139. };
  140. PyTypeObject PyRange_Type = {
  141. PyObject_HEAD_INIT(&PyType_Type)
  142. 0, /* Number of items for varobject */
  143. "xrange", /* Name of this type */
  144. sizeof(rangeobject), /* Basic object size */
  145. 0, /* Item size for varobject */
  146. (destructor)PyObject_Del, /* tp_dealloc */
  147. 0, /* tp_print */
  148. 0, /* tp_getattr */
  149. 0, /* tp_setattr */
  150. 0, /* tp_compare */
  151. (reprfunc)range_repr, /* tp_repr */
  152. 0, /* tp_as_number */
  153. &range_as_sequence, /* tp_as_sequence */
  154. 0, /* tp_as_mapping */
  155. 0, /* tp_hash */
  156. 0, /* tp_call */
  157. 0, /* tp_str */
  158. PyObject_GenericGetAttr, /* tp_getattro */
  159. 0, /* tp_setattro */
  160. 0, /* tp_as_buffer */
  161. Py_TPFLAGS_DEFAULT, /* tp_flags */
  162. range_doc, /* tp_doc */
  163. 0, /* tp_traverse */
  164. 0, /* tp_clear */
  165. 0, /* tp_richcompare */
  166. 0, /* tp_weaklistoffset */
  167. range_iter, /* tp_iter */
  168. 0, /* tp_iternext */
  169. range_methods, /* tp_methods */
  170. 0, /* tp_members */
  171. 0, /* tp_getset */
  172. 0, /* tp_base */
  173. 0, /* tp_dict */
  174. 0, /* tp_descr_get */
  175. 0, /* tp_descr_set */
  176. 0, /* tp_dictoffset */
  177. 0, /* tp_init */
  178. 0, /* tp_alloc */
  179. range_new, /* tp_new */
  180. };
  181. /*********************** Xrange Iterator **************************/
  182. typedef struct {
  183. PyObject_HEAD
  184. long index;
  185. long start;
  186. long step;
  187. long len;
  188. } rangeiterobject;
  189. static PyObject *
  190. rangeiter_next(rangeiterobject *r)
  191. {
  192. if (r->index < r->len)
  193. return PyInt_FromLong(r->start + (r->index++) * r->step);
  194. return NULL;
  195. }
  196. static PyObject *
  197. rangeiter_len(rangeiterobject *r)
  198. {
  199. return PyInt_FromLong(r->len - r->index);
  200. }
  201. PyDoc_STRVAR(length_hint_doc, "Private method returning an estimate of len(list(it)).");
  202. static PyMethodDef rangeiter_methods[] = {
  203. {"__length_hint__", (PyCFunction)rangeiter_len, METH_NOARGS, length_hint_doc},
  204. {NULL, NULL} /* sentinel */
  205. };
  206. static PyTypeObject Pyrangeiter_Type = {
  207. PyObject_HEAD_INIT(&PyType_Type)
  208. 0, /* ob_size */
  209. "rangeiterator", /* tp_name */
  210. sizeof(rangeiterobject), /* tp_basicsize */
  211. 0, /* tp_itemsize */
  212. /* methods */
  213. (destructor)PyObject_Del, /* tp_dealloc */
  214. 0, /* tp_print */
  215. 0, /* tp_getattr */
  216. 0, /* tp_setattr */
  217. 0, /* tp_compare */
  218. 0, /* tp_repr */
  219. 0, /* tp_as_number */
  220. 0, /* tp_as_sequence */
  221. 0, /* tp_as_mapping */
  222. 0, /* tp_hash */
  223. 0, /* tp_call */
  224. 0, /* tp_str */
  225. PyObject_GenericGetAttr, /* tp_getattro */
  226. 0, /* tp_setattro */
  227. 0, /* tp_as_buffer */
  228. Py_TPFLAGS_DEFAULT, /* tp_flags */
  229. 0, /* tp_doc */
  230. 0, /* tp_traverse */
  231. 0, /* tp_clear */
  232. 0, /* tp_richcompare */
  233. 0, /* tp_weaklistoffset */
  234. PyObject_SelfIter, /* tp_iter */
  235. (iternextfunc)rangeiter_next, /* tp_iternext */
  236. rangeiter_methods, /* tp_methods */
  237. 0,
  238. };
  239. static PyObject *
  240. range_iter(PyObject *seq)
  241. {
  242. rangeiterobject *it;
  243. if (!PyRange_Check(seq)) {
  244. PyErr_BadInternalCall();
  245. return NULL;
  246. }
  247. it = PyObject_New(rangeiterobject, &Pyrangeiter_Type);
  248. if (it == NULL)
  249. return NULL;
  250. it->index = 0;
  251. it->start = ((rangeobject *)seq)->start;
  252. it->step = ((rangeobject *)seq)->step;
  253. it->len = ((rangeobject *)seq)->len;
  254. return (PyObject *)it;
  255. }
  256. static PyObject *
  257. range_reverse(PyObject *seq)
  258. {
  259. rangeiterobject *it;
  260. long start, step, len;
  261. if (!PyRange_Check(seq)) {
  262. PyErr_BadInternalCall();
  263. return NULL;
  264. }
  265. it = PyObject_New(rangeiterobject, &Pyrangeiter_Type);
  266. if (it == NULL)
  267. return NULL;
  268. start = ((rangeobject *)seq)->start;
  269. step = ((rangeobject *)seq)->step;
  270. len = ((rangeobject *)seq)->len;
  271. it->index = 0;
  272. it->len = len;
  273. /* the casts below guard against signed overflow by turning it
  274. into unsigned overflow instead. The correctness of this
  275. code still depends on conversion from unsigned long to long
  276. wrapping modulo ULONG_MAX+1, which isn't guaranteed (see
  277. C99 6.3.1.3p3) but seems to hold in practice for all
  278. platforms we're likely to meet.
  279. If step == LONG_MIN then we still end up with LONG_MIN
  280. after negation; but this works out, since we've still got
  281. the correct value modulo ULONG_MAX+1, and the range_item
  282. calculation is also done modulo ULONG_MAX+1.
  283. */
  284. it->start = (long)(start + (unsigned long)(len-1) * step);
  285. it->step = (long)(0UL-step);
  286. return (PyObject *)it;
  287. }