* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<
* """
* Initialize intbitset.
*/
static PyObject *__pyx_n_Error;
static PyObject *__pyx_n_ValueError;
static PyObject *__pyx_n_tostring;
static PyObject *__pyx_n_decompress;
static PyObject *__pyx_n_Exception;
static PyObject *__pyx_n_max;
static PyObject *__pyx_n_OverflowError;
static PyObject *__pyx_n_TypeError;
static PyObject *__pyx_k14p;
static PyObject *__pyx_k15p;
static PyObject *__pyx_k16p;
static PyObject *__pyx_k18p;
static PyObject *__pyx_k19p;
static PyObject *__pyx_k20p;
static PyObject *__pyx_k21p;
static PyObject *__pyx_k22p;
static PyObject *__pyx_k23p;
static PyObject *__pyx_k24p;
static PyObject *__pyx_builtin_ValueError;
static PyObject *__pyx_builtin_Exception;
static PyObject *__pyx_builtin_max;
static PyObject *__pyx_builtin_OverflowError;
static PyObject *__pyx_builtin_TypeError;
static char __pyx_k14[] = "rhs can't be negative";
static char __pyx_k15[] = "Buffer error!!!";
static char __pyx_k16[] = "rhs is corrupted: %s";
static char __pyx_k18[] = "Can't integers bigger than %s";
static char __pyx_k19[] = "Negative numbers, not allowed";
static char __pyx_k20[] = "Elements must be <= %s";
static char __pyx_k21[] = "Negative numbers, not allowed";
static char __pyx_k22[] = "Elements must be <= %s";
static char __pyx_k23[] = "retrieving integers from rhs is impossible: %s";
static char __pyx_k24[] = "rhs is of unknown type %s";
static int __pyx_pf_9intbitset_9intbitset___cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_9intbitset_9intbitset___cinit__[] = "\n Initialize intbitset.\n * rhs can be:\n - int/long for creating allocating empty intbitset that will hold at least\n rhs elements, before being resized\n - intbitset for cloning\n - str for retrieving an intbitset that was dumped into a string\n - array for retrieving an intbitset that was dumped into a string stored\n in an array\n - sequence made of integers for copying all the elements from the\n sequence. If minsize is specified than it is initially allocated\n enough space to hold up to minsize integers, otherwise the biggest\n element of the sequence will be used.\n * preallocate is a suggested initial upper bound on the numbers that will be\n stored, by looking at rhs a sequence of number.\n * trailing_bits is 1, then the set will contain \"all\" the positive integers\n * no_allocate is used internally and should never be set.\n after the biggest one added with rhs.\n ";
static int __pyx_pf_9intbitset_9intbitset___cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
static char __pyx_doc_9intbitset_9intbitset_difference[] = "Return the difference of two intbitsets as a new set.\n (i.e. all elements that are in this intbitset but not the other.)\n ";
static char __pyx_doc_9intbitset_9intbitset_discard[] = "Remove an element from a intbitset if it is a member.\n If the element is not a member, do nothing.";
static char __pyx_doc_9intbitset_9intbitset_intersection[] = "Return the intersection of two intbitsets as a new set.\n (i.e. all elements that are in both intbitsets.)\n ";
static char __pyx_doc_9intbitset_9intbitset_union[] = "Return the union of two intbitsets as a new set.\n (i.e. all elements that are in either intbitsets.)\n ";
static char __pyx_doc_9intbitset_9intbitset_symmetric_difference[] = "Return the symmetric difference of two sets as a new set.\n (i.e. all elements that are in exactly one of the sets.)\n ";
static char __pyx_doc_9intbitset_9intbitset_symmetric_difference_update[] = "Update an intbitset with the symmetric difference of itself and another.\n ";
static char __pyx_doc_9intbitset_9intbitset_fastload[] = "Load a compressed string representation produced by a previous call\n to the fastdump method into the current intbitset. The previous content\n will be replaced.";
static char __pyx_doc_9intbitset_9intbitset_remove[] = "Remove an element from a set; it must be a member.\n If the element is not a member, raise a KeyError.\n ";
static char __pyx_doc_9intbitset_9intbitset_update_with_signs[] = "Given a dictionary rhs whose keys are integers, remove all the integers\n whose value are less than 0 and add every integer whose value is 0 or more";
static char __pyx_doc_9intbitset_9intbitset_get_sorted_element[] = "Return element at position index in the sorted representation of the\n set. Note that index must be less than len(self)";
static char __pyx_doc_9intbitset_9intbitset_to_sorted_list[] = "Return a sublist of the sorted representation of the set.\n Note, negative indices are not supported.";
static char __pyx_doc_9intbitset_9intbitset_is_infinite[] = "Return True if the intbitset is infinite. (i.e. trailing_bits=True\n was used in the constructor.)";
static char __pyx_doc_9intbitset_9intbitset_extract_finite_list[] = "Return a finite list of elements sufficient to be passed to intbitset\n constructor toghether with the proper value of trailing_bits in order\n to reproduce this intbitset. At least up_to integer are looked for when\n they are inside the intbitset but not necessarily needed to build the\n intbitset";
"\n Defines an intbitset data object to hold unordered sets of\n unsigned integers with ultra fast set operations, implemented via\n bit vectors and Python C extension to optimize speed and memory\n usage.\n\n Emulates the Python built-in set class interface with some\n additional specific methods such as its own fast dump and load\n marshalling functions. Uses real bits to optimize memory usage,\n so may have issues with endianness if you transport serialized\n bitsets between various machine architectures.\n\n\n ", /*tp_doc*/
* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<
* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<
* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<
* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<
* def __cinit__(self, rhs=0, int preallocate=-1, int trailing_bits=0, bint sanity_checks=CFG_INTBITSET_ENABLE_SANITY_CHECKS, int no_allocate=0): # <<<<<<<<<<<<<<