/* Generated by Cython 0.25.2 */

/* BEGIN: Cython Metadata
{
    "distutils": {
        "depends": [
            "daedalus/pdconfig.h", 
            "daedalus/wrapper.h"
        ], 
        "extra_compile_args": [
            "-std=c++11", 
            "-Wno-error=format-security"
        ], 
        "include_dirs": [
            "daedalus/src"
        ], 
        "language": "c++"
    }, 
    "module_name": "daedalus._maze"
}
END: Cython Metadata */

#define PY_SSIZE_T_CLEAN
#include "Python.h"
#ifndef Py_PYTHON_H
    #error Python headers needed to compile C extensions, please install development version of Python.
#elif PY_VERSION_HEX < 0x02060000 || (0x03000000 <= PY_VERSION_HEX && PY_VERSION_HEX < 0x03020000)
    #error Cython requires Python 2.6+ or Python 3.2+.
#else
#define CYTHON_ABI "0_25_2"
#include <stddef.h>
#ifndef offsetof
  #define offsetof(type, member) ( (size_t) & ((type*)0) -> member )
#endif
#if !defined(WIN32) && !defined(MS_WINDOWS)
  #ifndef __stdcall
    #define __stdcall
  #endif
  #ifndef __cdecl
    #define __cdecl
  #endif
  #ifndef __fastcall
    #define __fastcall
  #endif
#endif
#ifndef DL_IMPORT
  #define DL_IMPORT(t) t
#endif
#ifndef DL_EXPORT
  #define DL_EXPORT(t) t
#endif
#ifndef HAVE_LONG_LONG
  #if PY_VERSION_HEX >= 0x03030000 || (PY_MAJOR_VERSION == 2 && PY_VERSION_HEX >= 0x02070000)
    #define HAVE_LONG_LONG
  #endif
#endif
#ifndef PY_LONG_LONG
  #define PY_LONG_LONG LONG_LONG
#endif
#ifndef Py_HUGE_VAL
  #define Py_HUGE_VAL HUGE_VAL
#endif
#ifdef PYPY_VERSION
  #define CYTHON_COMPILING_IN_PYPY 1
  #define CYTHON_COMPILING_IN_PYSTON 0
  #define CYTHON_COMPILING_IN_CPYTHON 0
  #undef CYTHON_USE_TYPE_SLOTS
  #define CYTHON_USE_TYPE_SLOTS 0
  #undef CYTHON_USE_ASYNC_SLOTS
  #define CYTHON_USE_ASYNC_SLOTS 0
  #undef CYTHON_USE_PYLIST_INTERNALS
  #define CYTHON_USE_PYLIST_INTERNALS 0
  #undef CYTHON_USE_UNICODE_INTERNALS
  #define CYTHON_USE_UNICODE_INTERNALS 0
  #undef CYTHON_USE_UNICODE_WRITER
  #define CYTHON_USE_UNICODE_WRITER 0
  #undef CYTHON_USE_PYLONG_INTERNALS
  #define CYTHON_USE_PYLONG_INTERNALS 0
  #undef CYTHON_AVOID_BORROWED_REFS
  #define CYTHON_AVOID_BORROWED_REFS 1
  #undef CYTHON_ASSUME_SAFE_MACROS
  #define CYTHON_ASSUME_SAFE_MACROS 0
  #undef CYTHON_UNPACK_METHODS
  #define CYTHON_UNPACK_METHODS 0
  #undef CYTHON_FAST_THREAD_STATE
  #define CYTHON_FAST_THREAD_STATE 0
  #undef CYTHON_FAST_PYCALL
  #define CYTHON_FAST_PYCALL 0
#elif defined(PYSTON_VERSION)
  #define CYTHON_COMPILING_IN_PYPY 0
  #define CYTHON_COMPILING_IN_PYSTON 1
  #define CYTHON_COMPILING_IN_CPYTHON 0
  #ifndef CYTHON_USE_TYPE_SLOTS
    #define CYTHON_USE_TYPE_SLOTS 1
  #endif
  #undef CYTHON_USE_ASYNC_SLOTS
  #define CYTHON_USE_ASYNC_SLOTS 0
  #undef CYTHON_USE_PYLIST_INTERNALS
  #define CYTHON_USE_PYLIST_INTERNALS 0
  #ifndef CYTHON_USE_UNICODE_INTERNALS
    #define CYTHON_USE_UNICODE_INTERNALS 1
  #endif
  #undef CYTHON_USE_UNICODE_WRITER
  #define CYTHON_USE_UNICODE_WRITER 0
  #undef CYTHON_USE_PYLONG_INTERNALS
  #define CYTHON_USE_PYLONG_INTERNALS 0
  #ifndef CYTHON_AVOID_BORROWED_REFS
    #define CYTHON_AVOID_BORROWED_REFS 0
  #endif
  #ifndef CYTHON_ASSUME_SAFE_MACROS
    #define CYTHON_ASSUME_SAFE_MACROS 1
  #endif
  #ifndef CYTHON_UNPACK_METHODS
    #define CYTHON_UNPACK_METHODS 1
  #endif
  #undef CYTHON_FAST_THREAD_STATE
  #define CYTHON_FAST_THREAD_STATE 0
  #undef CYTHON_FAST_PYCALL
  #define CYTHON_FAST_PYCALL 0
#else
  #define CYTHON_COMPILING_IN_PYPY 0
  #define CYTHON_COMPILING_IN_PYSTON 0
  #define CYTHON_COMPILING_IN_CPYTHON 1
  #ifndef CYTHON_USE_TYPE_SLOTS
    #define CYTHON_USE_TYPE_SLOTS 1
  #endif
  #if PY_MAJOR_VERSION < 3
    #undef CYTHON_USE_ASYNC_SLOTS
    #define CYTHON_USE_ASYNC_SLOTS 0
  #elif !defined(CYTHON_USE_ASYNC_SLOTS)
    #define CYTHON_USE_ASYNC_SLOTS 1
  #endif
  #if PY_VERSION_HEX < 0x02070000
    #undef CYTHON_USE_PYLONG_INTERNALS
    #define CYTHON_USE_PYLONG_INTERNALS 0
  #elif !defined(CYTHON_USE_PYLONG_INTERNALS)
    #define CYTHON_USE_PYLONG_INTERNALS 1
  #endif
  #ifndef CYTHON_USE_PYLIST_INTERNALS
    #define CYTHON_USE_PYLIST_INTERNALS 1
  #endif
  #ifndef CYTHON_USE_UNICODE_INTERNALS
    #define CYTHON_USE_UNICODE_INTERNALS 1
  #endif
  #if PY_VERSION_HEX < 0x030300F0
    #undef CYTHON_USE_UNICODE_WRITER
    #define CYTHON_USE_UNICODE_WRITER 0
  #elif !defined(CYTHON_USE_UNICODE_WRITER)
    #define CYTHON_USE_UNICODE_WRITER 1
  #endif
  #ifndef CYTHON_AVOID_BORROWED_REFS
    #define CYTHON_AVOID_BORROWED_REFS 0
  #endif
  #ifndef CYTHON_ASSUME_SAFE_MACROS
    #define CYTHON_ASSUME_SAFE_MACROS 1
  #endif
  #ifndef CYTHON_UNPACK_METHODS
    #define CYTHON_UNPACK_METHODS 1
  #endif
  #ifndef CYTHON_FAST_THREAD_STATE
    #define CYTHON_FAST_THREAD_STATE 1
  #endif
  #ifndef CYTHON_FAST_PYCALL
    #define CYTHON_FAST_PYCALL 1
  #endif
#endif
#if !defined(CYTHON_FAST_PYCCALL)
#define CYTHON_FAST_PYCCALL  (CYTHON_FAST_PYCALL && PY_VERSION_HEX >= 0x030600B1)
#endif
#if CYTHON_USE_PYLONG_INTERNALS
  #include "longintrepr.h"
  #undef SHIFT
  #undef BASE
  #undef MASK
#endif
#if CYTHON_COMPILING_IN_PYPY && PY_VERSION_HEX < 0x02070600 && !defined(Py_OptimizeFlag)
  #define Py_OptimizeFlag 0
#endif
#define __PYX_BUILD_PY_SSIZE_T "n"
#define CYTHON_FORMAT_SSIZE_T "z"
#if PY_MAJOR_VERSION < 3
  #define __Pyx_BUILTIN_MODULE_NAME "__builtin__"
  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\
          PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)
  #define __Pyx_DefaultClassType PyClass_Type
#else
  #define __Pyx_BUILTIN_MODULE_NAME "builtins"
  #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)\
          PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos)
  #define __Pyx_DefaultClassType PyType_Type
#endif
#ifndef Py_TPFLAGS_CHECKTYPES
  #define Py_TPFLAGS_CHECKTYPES 0
#endif
#ifndef Py_TPFLAGS_HAVE_INDEX
  #define Py_TPFLAGS_HAVE_INDEX 0
#endif
#ifndef Py_TPFLAGS_HAVE_NEWBUFFER
  #define Py_TPFLAGS_HAVE_NEWBUFFER 0
#endif
#ifndef Py_TPFLAGS_HAVE_FINALIZE
  #define Py_TPFLAGS_HAVE_FINALIZE 0
#endif
#ifndef METH_FASTCALL
  #define METH_FASTCALL 0x80
  typedef PyObject *(*__Pyx_PyCFunctionFast) (PyObject *self, PyObject **args,
                                              Py_ssize_t nargs, PyObject *kwnames);
#else
  #define __Pyx_PyCFunctionFast _PyCFunctionFast
#endif
#if CYTHON_FAST_PYCCALL
#define __Pyx_PyFastCFunction_Check(func)\
    ((PyCFunction_Check(func) && (METH_FASTCALL == (PyCFunction_GET_FLAGS(func) & ~(METH_CLASS | METH_STATIC | METH_COEXIST)))))
#else
#define __Pyx_PyFastCFunction_Check(func) 0
#endif
#if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND)
  #define CYTHON_PEP393_ENABLED 1
  #define __Pyx_PyUnicode_READY(op)       (likely(PyUnicode_IS_READY(op)) ?\
                                              0 : _PyUnicode_Ready((PyObject *)(op)))
  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_LENGTH(u)
  #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i)
  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   PyUnicode_MAX_CHAR_VALUE(u)
  #define __Pyx_PyUnicode_KIND(u)         PyUnicode_KIND(u)
  #define __Pyx_PyUnicode_DATA(u)         PyUnicode_DATA(u)
  #define __Pyx_PyUnicode_READ(k, d, i)   PyUnicode_READ(k, d, i)
  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  PyUnicode_WRITE(k, d, i, ch)
  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != (likely(PyUnicode_IS_READY(u)) ? PyUnicode_GET_LENGTH(u) : PyUnicode_GET_SIZE(u)))
#else
  #define CYTHON_PEP393_ENABLED 0
  #define PyUnicode_1BYTE_KIND  1
  #define PyUnicode_2BYTE_KIND  2
  #define PyUnicode_4BYTE_KIND  4
  #define __Pyx_PyUnicode_READY(op)       (0)
  #define __Pyx_PyUnicode_GET_LENGTH(u)   PyUnicode_GET_SIZE(u)
  #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i]))
  #define __Pyx_PyUnicode_MAX_CHAR_VALUE(u)   ((sizeof(Py_UNICODE) == 2) ? 65535 : 1114111)
  #define __Pyx_PyUnicode_KIND(u)         (sizeof(Py_UNICODE))
  #define __Pyx_PyUnicode_DATA(u)         ((void*)PyUnicode_AS_UNICODE(u))
  #define __Pyx_PyUnicode_READ(k, d, i)   ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i]))
  #define __Pyx_PyUnicode_WRITE(k, d, i, ch)  (((void)(k)), ((Py_UNICODE*)d)[i] = ch)
  #define __Pyx_PyUnicode_IS_TRUE(u)      (0 != PyUnicode_GET_SIZE(u))
#endif
#if CYTHON_COMPILING_IN_PYPY
  #define __Pyx_PyUnicode_Concat(a, b)      PyNumber_Add(a, b)
  #define __Pyx_PyUnicode_ConcatSafe(a, b)  PyNumber_Add(a, b)
#else
  #define __Pyx_PyUnicode_Concat(a, b)      PyUnicode_Concat(a, b)
  #define __Pyx_PyUnicode_ConcatSafe(a, b)  ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ?\
      PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b))
#endif
#if CYTHON_COMPILING_IN_PYPY && !defined(PyUnicode_Contains)
  #define PyUnicode_Contains(u, s)  PySequence_Contains(u, s)
#endif
#if CYTHON_COMPILING_IN_PYPY && !defined(PyByteArray_Check)
  #define PyByteArray_Check(obj)  PyObject_TypeCheck(obj, &PyByteArray_Type)
#endif
#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Format)
  #define PyObject_Format(obj, fmt)  PyObject_CallMethod(obj, "__format__", "O", fmt)
#endif
#if CYTHON_COMPILING_IN_PYPY && !defined(PyObject_Malloc)
  #define PyObject_Malloc(s)   PyMem_Malloc(s)
  #define PyObject_Free(p)     PyMem_Free(p)
  #define PyObject_Realloc(p)  PyMem_Realloc(p)
#endif
#if CYTHON_COMPILING_IN_PYSTON
  #define __Pyx_PyCode_HasFreeVars(co)  PyCode_HasFreeVars(co)
  #define __Pyx_PyFrame_SetLineNumber(frame, lineno) PyFrame_SetLineNumber(frame, lineno)
#else
  #define __Pyx_PyCode_HasFreeVars(co)  (PyCode_GetNumFree(co) > 0)
  #define __Pyx_PyFrame_SetLineNumber(frame, lineno)  (frame)->f_lineno = (lineno)
#endif
#define __Pyx_PyString_FormatSafe(a, b)   ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b))
#define __Pyx_PyUnicode_FormatSafe(a, b)  ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b))
#if PY_MAJOR_VERSION >= 3
  #define __Pyx_PyString_Format(a, b)  PyUnicode_Format(a, b)
#else
  #define __Pyx_PyString_Format(a, b)  PyString_Format(a, b)
#endif
#if PY_MAJOR_VERSION < 3 && !defined(PyObject_ASCII)
  #define PyObject_ASCII(o)            PyObject_Repr(o)
#endif
#if PY_MAJOR_VERSION >= 3
  #define PyBaseString_Type            PyUnicode_Type
  #define PyStringObject               PyUnicodeObject
  #define PyString_Type                PyUnicode_Type
  #define PyString_Check               PyUnicode_Check
  #define PyString_CheckExact          PyUnicode_CheckExact
#endif
#if PY_MAJOR_VERSION >= 3
  #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj)
  #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj)
#else
  #define __Pyx_PyBaseString_Check(obj) (PyString_Check(obj) || PyUnicode_Check(obj))
  #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj))
#endif
#ifndef PySet_CheckExact
  #define PySet_CheckExact(obj)        (Py_TYPE(obj) == &PySet_Type)
#endif
#define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type)
#define __Pyx_PyException_Check(obj) __Pyx_TypeCheck(obj, PyExc_Exception)
#if PY_MAJOR_VERSION >= 3
  #define PyIntObject                  PyLongObject
  #define PyInt_Type                   PyLong_Type
  #define PyInt_Check(op)              PyLong_Check(op)
  #define PyInt_CheckExact(op)         PyLong_CheckExact(op)
  #define PyInt_FromString             PyLong_FromString
  #define PyInt_FromUnicode            PyLong_FromUnicode
  #define PyInt_FromLong               PyLong_FromLong
  #define PyInt_FromSize_t             PyLong_FromSize_t
  #define PyInt_FromSsize_t            PyLong_FromSsize_t
  #define PyInt_AsLong                 PyLong_AsLong
  #define PyInt_AS_LONG                PyLong_AS_LONG
  #define PyInt_AsSsize_t              PyLong_AsSsize_t
  #define PyInt_AsUnsignedLongMask     PyLong_AsUnsignedLongMask
  #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask
  #define PyNumber_Int                 PyNumber_Long
#endif
#if PY_MAJOR_VERSION >= 3
  #define PyBoolObject                 PyLongObject
#endif
#if PY_MAJOR_VERSION >= 3 && CYTHON_COMPILING_IN_PYPY
  #ifndef PyUnicode_InternFromString
    #define PyUnicode_InternFromString(s) PyUnicode_FromString(s)
  #endif
#endif
#if PY_VERSION_HEX < 0x030200A4
  typedef long Py_hash_t;
  #define __Pyx_PyInt_FromHash_t PyInt_FromLong
  #define __Pyx_PyInt_AsHash_t   PyInt_AsLong
#else
  #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t
  #define __Pyx_PyInt_AsHash_t   PyInt_AsSsize_t
#endif
#if PY_MAJOR_VERSION >= 3
  #define __Pyx_PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func))
#else
  #define __Pyx_PyMethod_New(func, self, klass) PyMethod_New(func, self, klass)
#endif
#if CYTHON_USE_ASYNC_SLOTS
  #if PY_VERSION_HEX >= 0x030500B1
    #define __Pyx_PyAsyncMethodsStruct PyAsyncMethods
    #define __Pyx_PyType_AsAsync(obj) (Py_TYPE(obj)->tp_as_async)
  #else
    typedef struct {
        unaryfunc am_await;
        unaryfunc am_aiter;
        unaryfunc am_anext;
    } __Pyx_PyAsyncMethodsStruct;
    #define __Pyx_PyType_AsAsync(obj) ((__Pyx_PyAsyncMethodsStruct*) (Py_TYPE(obj)->tp_reserved))
  #endif
#else
  #define __Pyx_PyType_AsAsync(obj) NULL
#endif
#ifndef CYTHON_RESTRICT
  #if defined(__GNUC__)
    #define CYTHON_RESTRICT __restrict__
  #elif defined(_MSC_VER) && _MSC_VER >= 1400
    #define CYTHON_RESTRICT __restrict
  #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
    #define CYTHON_RESTRICT restrict
  #else
    #define CYTHON_RESTRICT
  #endif
#endif
#ifndef CYTHON_UNUSED
# if defined(__GNUC__)
#   if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
#     define CYTHON_UNUSED __attribute__ ((__unused__))
#   else
#     define CYTHON_UNUSED
#   endif
# elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER))
#   define CYTHON_UNUSED __attribute__ ((__unused__))
# else
#   define CYTHON_UNUSED
# endif
#endif
#ifndef CYTHON_MAYBE_UNUSED_VAR
#  if defined(__cplusplus)
     template<class T> void CYTHON_MAYBE_UNUSED_VAR( const T& ) { }
#  else
#    define CYTHON_MAYBE_UNUSED_VAR(x) (void)(x)
#  endif
#endif
#ifndef CYTHON_NCP_UNUSED
# if CYTHON_COMPILING_IN_CPYTHON
#  define CYTHON_NCP_UNUSED
# else
#  define CYTHON_NCP_UNUSED CYTHON_UNUSED
# endif
#endif
#define __Pyx_void_to_None(void_result) ((void)(void_result), Py_INCREF(Py_None), Py_None)

#ifndef __cplusplus
  #error "Cython files generated with the C++ option must be compiled with a C++ compiler."
#endif
#ifndef CYTHON_INLINE
  #if defined(__clang__)
    #define CYTHON_INLINE __inline__ __attribute__ ((__unused__))
  #else
    #define CYTHON_INLINE inline
  #endif
#endif
template<typename T>
void __Pyx_call_destructor(T& x) {
    x.~T();
}
template<typename T>
class __Pyx_FakeReference {
  public:
    __Pyx_FakeReference() : ptr(NULL) { }
    __Pyx_FakeReference(const T& ref) : ptr(const_cast<T*>(&ref)) { }
    T *operator->() { return ptr; }
    T *operator&() { return ptr; }
    operator T&() { return *ptr; }
    template<typename U> bool operator ==(U other) { return *ptr == other; }
    template<typename U> bool operator !=(U other) { return *ptr != other; }
  private:
    T *ptr;
};

#if defined(WIN32) || defined(MS_WINDOWS)
  #define _USE_MATH_DEFINES
#endif
#include <math.h>
#ifdef NAN
#define __PYX_NAN() ((float) NAN)
#else
static CYTHON_INLINE float __PYX_NAN() {
  float value;
  memset(&value, 0xFF, sizeof(value));
  return value;
}
#endif
#if defined(__CYGWIN__) && defined(_LDBL_EQ_DBL)
#define __Pyx_truncl trunc
#else
#define __Pyx_truncl truncl
#endif


#define __PYX_ERR(f_index, lineno, Ln_error) \
{ \
  __pyx_filename = __pyx_f[f_index]; __pyx_lineno = lineno; __pyx_clineno = __LINE__; goto Ln_error; \
}

#if PY_MAJOR_VERSION >= 3
  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_TrueDivide(x,y)
  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceTrueDivide(x,y)
#else
  #define __Pyx_PyNumber_Divide(x,y)         PyNumber_Divide(x,y)
  #define __Pyx_PyNumber_InPlaceDivide(x,y)  PyNumber_InPlaceDivide(x,y)
#endif

#ifndef __PYX_EXTERN_C
  #ifdef __cplusplus
    #define __PYX_EXTERN_C extern "C"
  #else
    #define __PYX_EXTERN_C extern
  #endif
#endif

#define __PYX_HAVE__daedalus___maze
#define __PYX_HAVE_API__daedalus___maze
#include "pdconfig.h"
#include "wrapper.h"
#ifdef _OPENMP
#include <omp.h>
#endif /* _OPENMP */

#ifdef PYREX_WITHOUT_ASSERTIONS
#define CYTHON_WITHOUT_ASSERTIONS
#endif

typedef struct {PyObject **p; const char *s; const Py_ssize_t n; const char* encoding;
                const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry;

#define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0
#define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0
#define __PYX_DEFAULT_STRING_ENCODING ""
#define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString
#define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize
#define __Pyx_uchar_cast(c) ((unsigned char)c)
#define __Pyx_long_cast(x) ((long)x)
#define __Pyx_fits_Py_ssize_t(v, type, is_signed)  (\
    (sizeof(type) < sizeof(Py_ssize_t))  ||\
    (sizeof(type) > sizeof(Py_ssize_t) &&\
          likely(v < (type)PY_SSIZE_T_MAX ||\
                 v == (type)PY_SSIZE_T_MAX)  &&\
          (!is_signed || likely(v > (type)PY_SSIZE_T_MIN ||\
                                v == (type)PY_SSIZE_T_MIN)))  ||\
    (sizeof(type) == sizeof(Py_ssize_t) &&\
          (is_signed || likely(v < (type)PY_SSIZE_T_MAX ||\
                               v == (type)PY_SSIZE_T_MAX)))  )
#if defined (__cplusplus) && __cplusplus >= 201103L
    #include <cstdlib>
    #define __Pyx_sst_abs(value) std::abs(value)
#elif SIZEOF_INT >= SIZEOF_SIZE_T
    #define __Pyx_sst_abs(value) abs(value)
#elif SIZEOF_LONG >= SIZEOF_SIZE_T
    #define __Pyx_sst_abs(value) labs(value)
#elif defined (_MSC_VER) && defined (_M_X64)
    #define __Pyx_sst_abs(value) _abs64(value)
#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
    #define __Pyx_sst_abs(value) llabs(value)
#elif defined (__GNUC__)
    #define __Pyx_sst_abs(value) __builtin_llabs(value)
#else
    #define __Pyx_sst_abs(value) ((value<0) ? -value : value)
#endif
static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject*);
static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length);
#define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s))
#define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l)
#define __Pyx_PyBytes_FromString        PyBytes_FromString
#define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize
static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char*);
#if PY_MAJOR_VERSION < 3
    #define __Pyx_PyStr_FromString        __Pyx_PyBytes_FromString
    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize
#else
    #define __Pyx_PyStr_FromString        __Pyx_PyUnicode_FromString
    #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize
#endif
#define __Pyx_PyObject_AsSString(s)    ((signed char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsUString(s)    ((unsigned char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_FromCString(s)  __Pyx_PyObject_FromString((const char*)s)
#define __Pyx_PyBytes_FromCString(s)   __Pyx_PyBytes_FromString((const char*)s)
#define __Pyx_PyByteArray_FromCString(s)   __Pyx_PyByteArray_FromString((const char*)s)
#define __Pyx_PyStr_FromCString(s)     __Pyx_PyStr_FromString((const char*)s)
#define __Pyx_PyUnicode_FromCString(s) __Pyx_PyUnicode_FromString((const char*)s)
#if PY_MAJOR_VERSION < 3
static CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u)
{
    const Py_UNICODE *u_end = u;
    while (*u_end++) ;
    return (size_t)(u_end - u - 1);
}
#else
#define __Pyx_Py_UNICODE_strlen Py_UNICODE_strlen
#endif
#define __Pyx_PyUnicode_FromUnicode(u)       PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u))
#define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode
#define __Pyx_PyUnicode_AsUnicode            PyUnicode_AsUnicode
#define __Pyx_NewRef(obj) (Py_INCREF(obj), obj)
#define __Pyx_Owned_Py_None(b) __Pyx_NewRef(Py_None)
#define __Pyx_PyBool_FromLong(b) ((b) ? __Pyx_NewRef(Py_True) : __Pyx_NewRef(Py_False))
static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);
static CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x);
static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);
static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);
#if CYTHON_ASSUME_SAFE_MACROS
#define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x))
#else
#define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x)
#endif
#define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x))
#if PY_MAJOR_VERSION >= 3
#define __Pyx_PyNumber_Int(x) (PyLong_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Long(x))
#else
#define __Pyx_PyNumber_Int(x) (PyInt_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Int(x))
#endif
#define __Pyx_PyNumber_Float(x) (PyFloat_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Float(x))
#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII
static int __Pyx_sys_getdefaultencoding_not_ascii;
static int __Pyx_init_sys_getdefaultencoding_params(void) {
    PyObject* sys;
    PyObject* default_encoding = NULL;
    PyObject* ascii_chars_u = NULL;
    PyObject* ascii_chars_b = NULL;
    const char* default_encoding_c;
    sys = PyImport_ImportModule("sys");
    if (!sys) goto bad;
    default_encoding = PyObject_CallMethod(sys, (char*) "getdefaultencoding", NULL);
    Py_DECREF(sys);
    if (!default_encoding) goto bad;
    default_encoding_c = PyBytes_AsString(default_encoding);
    if (!default_encoding_c) goto bad;
    if (strcmp(default_encoding_c, "ascii") == 0) {
        __Pyx_sys_getdefaultencoding_not_ascii = 0;
    } else {
        char ascii_chars[128];
        int c;
        for (c = 0; c < 128; c++) {
            ascii_chars[c] = c;
        }
        __Pyx_sys_getdefaultencoding_not_ascii = 1;
        ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL);
        if (!ascii_chars_u) goto bad;
        ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL);
        if (!ascii_chars_b || !PyBytes_Check(ascii_chars_b) || memcmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) {
            PyErr_Format(
                PyExc_ValueError,
                "This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.",
                default_encoding_c);
            goto bad;
        }
        Py_DECREF(ascii_chars_u);
        Py_DECREF(ascii_chars_b);
    }
    Py_DECREF(default_encoding);
    return 0;
bad:
    Py_XDECREF(default_encoding);
    Py_XDECREF(ascii_chars_u);
    Py_XDECREF(ascii_chars_b);
    return -1;
}
#endif
#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3
#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL)
#else
#define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL)
#if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT
static char* __PYX_DEFAULT_STRING_ENCODING;
static int __Pyx_init_sys_getdefaultencoding_params(void) {
    PyObject* sys;
    PyObject* default_encoding = NULL;
    char* default_encoding_c;
    sys = PyImport_ImportModule("sys");
    if (!sys) goto bad;
    default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL);
    Py_DECREF(sys);
    if (!default_encoding) goto bad;
    default_encoding_c = PyBytes_AsString(default_encoding);
    if (!default_encoding_c) goto bad;
    __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c));
    if (!__PYX_DEFAULT_STRING_ENCODING) goto bad;
    strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c);
    Py_DECREF(default_encoding);
    return 0;
bad:
    Py_XDECREF(default_encoding);
    return -1;
}
#endif
#endif


/* Test for GCC > 2.95 */
#if defined(__GNUC__)     && (__GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)))
  #define likely(x)   __builtin_expect(!!(x), 1)
  #define unlikely(x) __builtin_expect(!!(x), 0)
#else /* !__GNUC__ or GCC < 2.95 */
  #define likely(x)   (x)
  #define unlikely(x) (x)
#endif /* __GNUC__ */

static PyObject *__pyx_m;
static PyObject *__pyx_d;
static PyObject *__pyx_b;
static PyObject *__pyx_empty_tuple;
static PyObject *__pyx_empty_bytes;
static PyObject *__pyx_empty_unicode;
static int __pyx_lineno;
static int __pyx_clineno = 0;
static const char * __pyx_cfilenm= __FILE__;
static const char *__pyx_filename;


static const char *__pyx_f[] = {
  "daedalus/_maze.pyx",
};

/*--- Type declarations ---*/
struct __pyx_obj_8daedalus_5_maze_Maze;
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__;
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count;
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr;

/* "daedalus/_maze.pyx":175
 *     pass
 * 
 * cdef class Maze(object):             # <<<<<<<<<<<<<<
 *     '''
 *     A monochrome daedalus Maze object.
 */
struct __pyx_obj_8daedalus_5_maze_Maze {
  PyObject_HEAD
  CMaz *_maze;
  int _xEntrance;
  int _yEntrance;
  int _xExit;
  int _yExit;
};


/* "daedalus/_maze.pyx":239
 *         return False
 * 
 *     def __iter__(self):             # <<<<<<<<<<<<<<
 *         i = 0
 *         try:
 */
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ {
  PyObject_HEAD
  PyObject *__pyx_v_i;
  struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self;
  PyObject *__pyx_v_v;
  PyObject *__pyx_t_0;
  PyObject *__pyx_t_1;
  PyObject *__pyx_t_2;
};


/* "daedalus/_maze.pyx":270
 *         raise ValueError
 * 
 *     def count(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.count(value) -> integer -- return number of occurrences of
 */
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count {
  PyObject_HEAD
  struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self;
  PyObject *__pyx_v_value;
};


/* "daedalus/_maze.pyx":279
 *         :rtype: int
 *         '''
 *         return sum(1 for v in self if v == value)             # <<<<<<<<<<<<<<
 * 
 *     @property
 */
struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr {
  PyObject_HEAD
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *__pyx_outer_scope;
  PyObject *__pyx_v_v;
  PyObject *__pyx_t_0;
  Py_ssize_t __pyx_t_1;
  PyObject *(*__pyx_t_2)(PyObject *);
};


/* --- Runtime support code (head) --- */
/* Refnanny.proto */
#ifndef CYTHON_REFNANNY
  #define CYTHON_REFNANNY 0
#endif
#if CYTHON_REFNANNY
  typedef struct {
    void (*INCREF)(void*, PyObject*, int);
    void (*DECREF)(void*, PyObject*, int);
    void (*GOTREF)(void*, PyObject*, int);
    void (*GIVEREF)(void*, PyObject*, int);
    void* (*SetupContext)(const char*, int, const char*);
    void (*FinishContext)(void**);
  } __Pyx_RefNannyAPIStruct;
  static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL;
  static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname);
  #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL;
#ifdef WITH_THREAD
  #define __Pyx_RefNannySetupContext(name, acquire_gil)\
          if (acquire_gil) {\
              PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure();\
              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\
              PyGILState_Release(__pyx_gilstate_save);\
          } else {\
              __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__);\
          }
#else
  #define __Pyx_RefNannySetupContext(name, acquire_gil)\
          __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__)
#endif
  #define __Pyx_RefNannyFinishContext()\
          __Pyx_RefNanny->FinishContext(&__pyx_refnanny)
  #define __Pyx_INCREF(r)  __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__)
  #define __Pyx_DECREF(r)  __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__)
  #define __Pyx_GOTREF(r)  __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__)
  #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__)
  #define __Pyx_XINCREF(r)  do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0)
  #define __Pyx_XDECREF(r)  do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0)
  #define __Pyx_XGOTREF(r)  do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0)
  #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0)
#else
  #define __Pyx_RefNannyDeclarations
  #define __Pyx_RefNannySetupContext(name, acquire_gil)
  #define __Pyx_RefNannyFinishContext()
  #define __Pyx_INCREF(r) Py_INCREF(r)
  #define __Pyx_DECREF(r) Py_DECREF(r)
  #define __Pyx_GOTREF(r)
  #define __Pyx_GIVEREF(r)
  #define __Pyx_XINCREF(r) Py_XINCREF(r)
  #define __Pyx_XDECREF(r) Py_XDECREF(r)
  #define __Pyx_XGOTREF(r)
  #define __Pyx_XGIVEREF(r)
#endif
#define __Pyx_XDECREF_SET(r, v) do {\
        PyObject *tmp = (PyObject *) r;\
        r = v; __Pyx_XDECREF(tmp);\
    } while (0)
#define __Pyx_DECREF_SET(r, v) do {\
        PyObject *tmp = (PyObject *) r;\
        r = v; __Pyx_DECREF(tmp);\
    } while (0)
#define __Pyx_CLEAR(r)    do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0)
#define __Pyx_XCLEAR(r)   do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0)

/* PyObjectGetAttrStr.proto */
#if CYTHON_USE_TYPE_SLOTS
static CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) {
    PyTypeObject* tp = Py_TYPE(obj);
    if (likely(tp->tp_getattro))
        return tp->tp_getattro(obj, attr_name);
#if PY_MAJOR_VERSION < 3
    if (likely(tp->tp_getattr))
        return tp->tp_getattr(obj, PyString_AS_STRING(attr_name));
#endif
    return PyObject_GetAttr(obj, attr_name);
}
#else
#define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n)
#endif

/* GetBuiltinName.proto */
static PyObject *__Pyx_GetBuiltinName(PyObject *name);

/* RaiseArgTupleInvalid.proto */
static void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact,
    Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found);

/* RaiseDoubleKeywords.proto */
static void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name);

/* ParseKeywords.proto */
static int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[],\
    PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args,\
    const char* function_name);

/* PyObjectCall.proto */
#if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw);
#else
#define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw)
#endif

/* PyThreadStateGet.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_PyThreadState_declare  PyThreadState *__pyx_tstate;
#define __Pyx_PyThreadState_assign  __pyx_tstate = PyThreadState_GET();
#else
#define __Pyx_PyThreadState_declare
#define __Pyx_PyThreadState_assign
#endif

/* PyErrFetchRestore.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_ErrRestoreWithState(type, value, tb)  __Pyx_ErrRestoreInState(PyThreadState_GET(), type, value, tb)
#define __Pyx_ErrFetchWithState(type, value, tb)    __Pyx_ErrFetchInState(PyThreadState_GET(), type, value, tb)
#define __Pyx_ErrRestore(type, value, tb)  __Pyx_ErrRestoreInState(__pyx_tstate, type, value, tb)
#define __Pyx_ErrFetch(type, value, tb)    __Pyx_ErrFetchInState(__pyx_tstate, type, value, tb)
static CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);
static CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);
#else
#define __Pyx_ErrRestoreWithState(type, value, tb)  PyErr_Restore(type, value, tb)
#define __Pyx_ErrFetchWithState(type, value, tb)  PyErr_Fetch(type, value, tb)
#define __Pyx_ErrRestore(type, value, tb)  PyErr_Restore(type, value, tb)
#define __Pyx_ErrFetch(type, value, tb)  PyErr_Fetch(type, value, tb)
#endif

/* RaiseException.proto */
static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause);

/* GetModuleGlobalName.proto */
static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name);

/* ListCompAppend.proto */
#if CYTHON_USE_PYLIST_INTERNALS && CYTHON_ASSUME_SAFE_MACROS
static CYTHON_INLINE int __Pyx_ListComp_Append(PyObject* list, PyObject* x) {
    PyListObject* L = (PyListObject*) list;
    Py_ssize_t len = Py_SIZE(list);
    if (likely(L->allocated > len)) {
        Py_INCREF(x);
        PyList_SET_ITEM(list, len, x);
        Py_SIZE(list) = len+1;
        return 0;
    }
    return PyList_Append(list, x);
}
#else
#define __Pyx_ListComp_Append(L,x) PyList_Append(L,x)
#endif

/* PyFunctionFastCall.proto */
#if CYTHON_FAST_PYCALL
#define __Pyx_PyFunction_FastCall(func, args, nargs)\
    __Pyx_PyFunction_FastCallDict((func), (args), (nargs), NULL)
#if 1 || PY_VERSION_HEX < 0x030600B1
static PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs);
#else
#define __Pyx_PyFunction_FastCallDict(func, args, nargs, kwargs) _PyFunction_FastCallDict(func, args, nargs, kwargs)
#endif
#endif

/* PyCFunctionFastCall.proto */
#if CYTHON_FAST_PYCCALL
static CYTHON_INLINE PyObject *__Pyx_PyCFunction_FastCall(PyObject *func, PyObject **args, Py_ssize_t nargs);
#else
#define __Pyx_PyCFunction_FastCall(func, args, nargs)  (assert(0), NULL)
#endif

/* RaiseTooManyValuesToUnpack.proto */
static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected);

/* RaiseNeedMoreValuesToUnpack.proto */
static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index);

/* IterFinish.proto */
static CYTHON_INLINE int __Pyx_IterFinish(void);

/* UnpackItemEndCheck.proto */
static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected);

/* PyIntBinop.proto */
#if !CYTHON_COMPILING_IN_PYPY
static PyObject* __Pyx_PyInt_AddObjC(PyObject *op1, PyObject *op2, long intval, int inplace);
#else
#define __Pyx_PyInt_AddObjC(op1, op2, intval, inplace)\
    (inplace ? PyNumber_InPlaceAdd(op1, op2) : PyNumber_Add(op1, op2))
#endif

/* SaveResetException.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_ExceptionSave(type, value, tb)  __Pyx__ExceptionSave(__pyx_tstate, type, value, tb)
static CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);
#define __Pyx_ExceptionReset(type, value, tb)  __Pyx__ExceptionReset(__pyx_tstate, type, value, tb)
static CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb);
#else
#define __Pyx_ExceptionSave(type, value, tb)   PyErr_GetExcInfo(type, value, tb)
#define __Pyx_ExceptionReset(type, value, tb)  PyErr_SetExcInfo(type, value, tb)
#endif

/* PyErrExceptionMatches.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_PyErr_ExceptionMatches(err) __Pyx_PyErr_ExceptionMatchesInState(__pyx_tstate, err)
static CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err);
#else
#define __Pyx_PyErr_ExceptionMatches(err)  PyErr_ExceptionMatches(err)
#endif

/* GetException.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_GetException(type, value, tb)  __Pyx__GetException(__pyx_tstate, type, value, tb)
static int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);
#else
static int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb);
#endif

/* None.proto */
static CYTHON_INLINE void __Pyx_RaiseClosureNameError(const char *varname);

/* PyObjectCallMethO.proto */
#if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg);
#endif

/* PyObjectCallOneArg.proto */
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg);

/* PyObjectCallNoArg.proto */
#if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func);
#else
#define __Pyx_PyObject_CallNoArg(func) __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL)
#endif

/* IncludeStringH.proto */
#include <string.h>

/* CalculateMetaclass.proto */
static PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases);

/* Py3ClassCreate.proto */
static PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name, PyObject *qualname,
                                           PyObject *mkw, PyObject *modname, PyObject *doc);
static PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases, PyObject *dict,
                                      PyObject *mkw, int calculate_metaclass, int allow_py2_metaclass);

/* GetNameInClass.proto */
static PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name);

/* CodeObjectCache.proto */
typedef struct {
    PyCodeObject* code_object;
    int code_line;
} __Pyx_CodeObjectCacheEntry;
struct __Pyx_CodeObjectCache {
    int count;
    int max_count;
    __Pyx_CodeObjectCacheEntry* entries;
};
static struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL};
static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line);
static PyCodeObject *__pyx_find_code_object(int code_line);
static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object);

/* AddTraceback.proto */
static void __Pyx_AddTraceback(const char *funcname, int c_line,
                               int py_line, const char *filename);

/* CIntToPy.proto */
static CYTHON_INLINE PyObject* __Pyx_PyInt_From_KV(KV value);

/* CIntToPy.proto */
static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value);

/* CIntFromPy.proto */
static CYTHON_INLINE unsigned int __Pyx_PyInt_As_unsigned_int(PyObject *);

/* CIntFromPy.proto */
static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *);

/* CIntFromPy.proto */
static CYTHON_INLINE KV __Pyx_PyInt_As_KV(PyObject *);

/* CIntToPy.proto */
static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value);

/* CIntFromPy.proto */
static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *);

/* FetchCommonType.proto */
static PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type);

/* SwapException.proto */
#if CYTHON_FAST_THREAD_STATE
#define __Pyx_ExceptionSwap(type, value, tb)  __Pyx__ExceptionSwap(__pyx_tstate, type, value, tb)
static CYTHON_INLINE void __Pyx__ExceptionSwap(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb);
#else
static CYTHON_INLINE void __Pyx_ExceptionSwap(PyObject **type, PyObject **value, PyObject **tb);
#endif

/* PyObjectCallMethod1.proto */
static PyObject* __Pyx_PyObject_CallMethod1(PyObject* obj, PyObject* method_name, PyObject* arg);

/* CoroutineBase.proto */
typedef PyObject *(*__pyx_coroutine_body_t)(PyObject *, PyObject *);
typedef struct {
    PyObject_HEAD
    __pyx_coroutine_body_t body;
    PyObject *closure;
    PyObject *exc_type;
    PyObject *exc_value;
    PyObject *exc_traceback;
    PyObject *gi_weakreflist;
    PyObject *classobj;
    PyObject *yieldfrom;
    PyObject *gi_name;
    PyObject *gi_qualname;
    PyObject *gi_modulename;
    int resume_label;
    char is_running;
} __pyx_CoroutineObject;
static __pyx_CoroutineObject *__Pyx__Coroutine_New(
    PyTypeObject *type, __pyx_coroutine_body_t body, PyObject *closure,
    PyObject *name, PyObject *qualname, PyObject *module_name);
static int __Pyx_Coroutine_clear(PyObject *self);
#if 1 || PY_VERSION_HEX < 0x030300B0
static int __Pyx_PyGen_FetchStopIterationValue(PyObject **pvalue);
#else
#define __Pyx_PyGen_FetchStopIterationValue(pvalue) PyGen_FetchStopIterationValue(pvalue)
#endif

/* PatchModuleWithCoroutine.proto */
static PyObject* __Pyx_Coroutine_patch_module(PyObject* module, const char* py_code);

/* PatchGeneratorABC.proto */
static int __Pyx_patch_abc(void);

/* Generator.proto */
#define __Pyx_Generator_USED
static PyTypeObject *__pyx_GeneratorType = 0;
#define __Pyx_Generator_CheckExact(obj) (Py_TYPE(obj) == __pyx_GeneratorType)
#define __Pyx_Generator_New(body, closure, name, qualname, module_name)\
    __Pyx__Coroutine_New(__pyx_GeneratorType, body, closure, name, qualname, module_name)
static PyObject *__Pyx_Generator_Next(PyObject *self);
static int __pyx_Generator_init(void);

/* CheckBinaryVersion.proto */
static int __Pyx_check_binary_version(void);

/* InitStrings.proto */
static int __Pyx_InitStrings(__Pyx_StringTabEntry *t);


/* Module declarations from 'libcpp' */

/* Module declarations from 'daedalus._maze' */
static PyTypeObject *__pyx_ptype_8daedalus_5_maze_Maze = 0;
static PyTypeObject *__pyx_ptype_8daedalus_5_maze___pyx_scope_struct____iter__ = 0;
static PyTypeObject *__pyx_ptype_8daedalus_5_maze___pyx_scope_struct_1_count = 0;
static PyTypeObject *__pyx_ptype_8daedalus_5_maze___pyx_scope_struct_2_genexpr = 0;
#define __Pyx_MODULE_NAME "daedalus._maze"
int __pyx_module_is_main_daedalus___maze = 0;

/* Implementation of 'daedalus._maze' */
static PyObject *__pyx_builtin_staticmethod;
static PyObject *__pyx_builtin_ValueError;
static PyObject *__pyx_builtin_range;
static PyObject *__pyx_builtin_map;
static PyObject *__pyx_builtin_IndexError;
static PyObject *__pyx_builtin_enumerate;
static PyObject *__pyx_builtin_sum;
static const char __pyx_k_x[] = "x";
static const char __pyx_k_y[] = "y";
static const char __pyx_k_c2[] = "c2";
static const char __pyx_k_c3[] = "c3";
static const char __pyx_k_rv[] = "rv";
static const char __pyx_k_doc[] = "__doc__";
static const char __pyx_k_get[] = "get";
static const char __pyx_k_map[] = "map";
static const char __pyx_k_sum[] = "sum";
static const char __pyx_k_args[] = "args";
static const char __pyx_k_iter[] = "__iter__";
static const char __pyx_k_kvOn[] = "kvOn";
static const char __pyx_k_main[] = "__main__";
static const char __pyx_k_send[] = "send";
static const char __pyx_k_test[] = "__test__";
static const char __pyx_k_close[] = "close";
static const char __pyx_k_fWall[] = "fWall";
static const char __pyx_k_kvOff[] = "kvOff";
static const char __pyx_k_range[] = "range";
static const char __pyx_k_throw[] = "throw";
static const char __pyx_k_width[] = "width";
static const char __pyx_k_Maze_x[] = "<Maze: {}x{}>";
static const char __pyx_k_fClear[] = "fClear";
static const char __pyx_k_fRiver[] = "fRiver";
static const char __pyx_k_format[] = "format";
static const char __pyx_k_height[] = "height";
static const char __pyx_k_module[] = "__module__";
static const char __pyx_k_cSpiral[] = "cSpiral";
static const char __pyx_k_genexpr[] = "genexpr";
static const char __pyx_k_prepare[] = "__prepare__";
static const char __pyx_k_fTextTab[] = "fTextTab";
static const char __pyx_k_filename[] = "filename";
static const char __pyx_k_nForsAdd[] = "nForsAdd";
static const char __pyx_k_qualname[] = "__qualname__";
static const char __pyx_k_MazeError[] = "MazeError";
static const char __pyx_k_enumerate[] = "enumerate";
static const char __pyx_k_fLineChar[] = "fLineChar";
static const char __pyx_k_fTextClip[] = "fTextClip";
static const char __pyx_k_fTreeWall[] = "fTreeWall";
static const char __pyx_k_metaclass[] = "__metaclass__";
static const char __pyx_k_nForsInit[] = "nForsInit";
static const char __pyx_k_IndexError[] = "IndexError";
static const char __pyx_k_ValueError[] = "ValueError";
static const char __pyx_k_cRandomAdd[] = "cRandomAdd";
static const char __pyx_k_nTreeRiver[] = "nTreeRiver";
static const char __pyx_k_COLOR_BLACK[] = "COLOR_BLACK";
static const char __pyx_k_COLOR_WHITE[] = "COLOR_WHITE";
static const char __pyx_k_Maze___iter[] = "Maze.__iter__";
static const char __pyx_k_cSpiralWall[] = "cSpiralWall";
static const char __pyx_k_fKruskalPic[] = "fKruskalPic";
static const char __pyx_k_fTreeRandom[] = "fTreeRandom";
static const char __pyx_k_fTiltDiamond[] = "fTiltDiamond";
static const char __pyx_k_nEntrancePos[] = "nEntrancePos";
static const char __pyx_k_staticmethod[] = "staticmethod";
static const char __pyx_k_daedalus__maze[] = "daedalus._maze";
static const char __pyx_k_negative_width[] = "negative width";
static const char __pyx_k_ENTRANCE_CORNER[] = "ENTRANCE_CORNER";
static const char __pyx_k_ENTRANCE_MIDDLE[] = "ENTRANCE_MIDDLE";
static const char __pyx_k_ENTRANCE_RANDOM[] = "ENTRANCE_RANDOM";
static const char __pyx_k_negative_height[] = "negative height";
static const char __pyx_k_ENTRANCE_BALANCED[] = "ENTRANCE_BALANCED";
static const char __pyx_k_No_filename_given[] = "No filename given.";
static const char __pyx_k_handle_save_retval[] = "_handle_save_retval";
static const char __pyx_k_store_back_globals[] = "_store_back_globals";
static const char __pyx_k_Could_not_open_file[] = "Could not open file.";
static const char __pyx_k_Unknown_save_command[] = "Unknown save command.";
static const char __pyx_k_count_locals_genexpr[] = "count.<locals>.genexpr";
static const char __pyx_k_Could_not_resize_the_Maze[] = "Could not resize the Maze.";
static const char __pyx_k_x_coordinate_out_of_range[] = "x coordinate out of range";
static const char __pyx_k_y_coordinate_out_of_range[] = "y coordinate out of range";
static const char __pyx_k_Could_not_create_Prim_Maze[] = "Could not create Prim Maze.";
static const char __pyx_k_Could_not_create_Tree_Maze[] = "Could not create Tree Maze.";
static const char __pyx_k_Could_not_create_Braid_Maze[] = "Could not create Braid Maze.";
static const char __pyx_k_Could_not_create_Eller_Maze[] = "Could not create Eller Maze.";
static const char __pyx_k_Could_not_create_Prim2_Maze[] = "Could not create Prim2 Maze.";
static const char __pyx_k_Could_not_create_Binary_Maze[] = "Could not create Binary Maze.";
static const char __pyx_k_Could_not_create_Forest_Maze[] = "Could not create Forest Maze.";
static const char __pyx_k_Could_not_create_Spiral_Maze[] = "Could not create Spiral Maze.";
static const char __pyx_k_Could_not_create_Wilson_Maze[] = "Could not create Wilson Maze.";
static const char __pyx_k_Could_not_create_Kruskal_Maze[] = "Could not create Kruskal Maze.";
static const char __pyx_k_Could_not_create_Perfect_Maze[] = "Could not create Perfect Maze.";
static const char __pyx_k_Maze_not_properly_constructed[] = "Maze not properly constructed.";
static const char __pyx_k_Could_not_create_Diagonal_Maze[] = "Could not create Diagonal Maze.";
static const char __pyx_k_Could_not_create_Division_Maze[] = "Could not create Division Maze.";
static const char __pyx_k_Could_not_create_Perfect2_Maze[] = "Could not create Perfect2 Maze.";
static const char __pyx_k_Could_not_construct_Maze_object[] = "Could not construct Maze object.";
static const char __pyx_k_Could_not_create_BraidTilt_Maze[] = "Could not create BraidTilt Maze.";
static const char __pyx_k_Could_not_create_Recursive_Maze[] = "Could not create Recursive Maze.";
static const char __pyx_k_Could_not_create_Unicursal_Maze[] = "Could not create Unicursal Maze.";
static const char __pyx_k_Users_wroberts_dev_pydaedalus_d[] = "/Users/wroberts/dev/pydaedalus/daedalus/_maze.pyx";
static const char __pyx_k_Wrapper_for_the_daedalus_monoch[] = "\nWrapper for the daedalus monochrome maze functionality.\n\nmaze = Maze(63, 63)\nmaze.create_perfect()\nmaze.resize(31, 61)\nmaze.create_perfect()\nmaze.save_bitmap('test.bmp')\nmaze.save_text('test.txt')\n";
static const char __pyx_k_An_error_while_performing_an_act[] = "An error while performing an action on a Maze object.";
static const char __pyx_k_Could_not_create_AldousBroder_Ma[] = "Could not create AldousBroder Maze.";
static const char __pyx_k_Could_not_create_BraidEller_Maze[] = "Could not create BraidEller Maze.";
static const char __pyx_k_Could_not_create_Sidewinder_Maze[] = "Could not create Sidewinder Maze.";
static const char __pyx_k_Unknown_return_value_from_Maze_s[] = "Unknown return value from Maze save function.";
static const char __pyx_k_key_must_be_an_integer_or_a_tupl[] = "key must be an integer or a tuple of two integers";
static PyObject *__pyx_kp_s_An_error_while_performing_an_act;
static PyObject *__pyx_n_s_COLOR_BLACK;
static PyObject *__pyx_n_s_COLOR_WHITE;
static PyObject *__pyx_kp_s_Could_not_construct_Maze_object;
static PyObject *__pyx_kp_s_Could_not_create_AldousBroder_Ma;
static PyObject *__pyx_kp_s_Could_not_create_Binary_Maze;
static PyObject *__pyx_kp_s_Could_not_create_BraidEller_Maze;
static PyObject *__pyx_kp_s_Could_not_create_BraidTilt_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Braid_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Diagonal_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Division_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Eller_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Forest_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Kruskal_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Perfect2_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Perfect_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Prim2_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Prim_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Recursive_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Sidewinder_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Spiral_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Tree_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Unicursal_Maze;
static PyObject *__pyx_kp_s_Could_not_create_Wilson_Maze;
static PyObject *__pyx_kp_s_Could_not_open_file;
static PyObject *__pyx_kp_s_Could_not_resize_the_Maze;
static PyObject *__pyx_n_s_ENTRANCE_BALANCED;
static PyObject *__pyx_n_s_ENTRANCE_CORNER;
static PyObject *__pyx_n_s_ENTRANCE_MIDDLE;
static PyObject *__pyx_n_s_ENTRANCE_RANDOM;
static PyObject *__pyx_n_s_IndexError;
static PyObject *__pyx_n_s_MazeError;
static PyObject *__pyx_n_s_Maze___iter;
static PyObject *__pyx_kp_s_Maze_not_properly_constructed;
static PyObject *__pyx_kp_s_Maze_x;
static PyObject *__pyx_kp_s_No_filename_given;
static PyObject *__pyx_kp_s_Unknown_return_value_from_Maze_s;
static PyObject *__pyx_kp_s_Unknown_save_command;
static PyObject *__pyx_kp_s_Users_wroberts_dev_pydaedalus_d;
static PyObject *__pyx_n_s_ValueError;
static PyObject *__pyx_n_s_args;
static PyObject *__pyx_n_s_c2;
static PyObject *__pyx_n_s_c3;
static PyObject *__pyx_n_s_cRandomAdd;
static PyObject *__pyx_n_s_cSpiral;
static PyObject *__pyx_n_s_cSpiralWall;
static PyObject *__pyx_n_s_close;
static PyObject *__pyx_n_s_count_locals_genexpr;
static PyObject *__pyx_n_s_daedalus__maze;
static PyObject *__pyx_n_s_doc;
static PyObject *__pyx_n_s_enumerate;
static PyObject *__pyx_n_s_fClear;
static PyObject *__pyx_n_s_fKruskalPic;
static PyObject *__pyx_n_s_fLineChar;
static PyObject *__pyx_n_s_fRiver;
static PyObject *__pyx_n_s_fTextClip;
static PyObject *__pyx_n_s_fTextTab;
static PyObject *__pyx_n_s_fTiltDiamond;
static PyObject *__pyx_n_s_fTreeRandom;
static PyObject *__pyx_n_s_fTreeWall;
static PyObject *__pyx_n_s_fWall;
static PyObject *__pyx_n_s_filename;
static PyObject *__pyx_n_s_format;
static PyObject *__pyx_n_s_genexpr;
static PyObject *__pyx_n_s_get;
static PyObject *__pyx_n_s_handle_save_retval;
static PyObject *__pyx_n_s_height;
static PyObject *__pyx_n_s_iter;
static PyObject *__pyx_kp_s_key_must_be_an_integer_or_a_tupl;
static PyObject *__pyx_n_s_kvOff;
static PyObject *__pyx_n_s_kvOn;
static PyObject *__pyx_n_s_main;
static PyObject *__pyx_n_s_map;
static PyObject *__pyx_n_s_metaclass;
static PyObject *__pyx_n_s_module;
static PyObject *__pyx_n_s_nEntrancePos;
static PyObject *__pyx_n_s_nForsAdd;
static PyObject *__pyx_n_s_nForsInit;
static PyObject *__pyx_n_s_nTreeRiver;
static PyObject *__pyx_kp_s_negative_height;
static PyObject *__pyx_kp_s_negative_width;
static PyObject *__pyx_n_s_prepare;
static PyObject *__pyx_n_s_qualname;
static PyObject *__pyx_n_s_range;
static PyObject *__pyx_n_s_rv;
static PyObject *__pyx_n_s_send;
static PyObject *__pyx_n_s_staticmethod;
static PyObject *__pyx_n_s_store_back_globals;
static PyObject *__pyx_n_s_sum;
static PyObject *__pyx_n_s_test;
static PyObject *__pyx_n_s_throw;
static PyObject *__pyx_n_s_width;
static PyObject *__pyx_n_s_x;
static PyObject *__pyx_kp_s_x_coordinate_out_of_range;
static PyObject *__pyx_n_s_y;
static PyObject *__pyx_kp_s_y_coordinate_out_of_range;
static int __pyx_pf_8daedalus_5_maze_4Maze___cinit__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_width, PyObject *__pyx_v_height); /* proto */
static void __pyx_pf_8daedalus_5_maze_4Maze_2__dealloc__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static Py_ssize_t __pyx_pf_8daedalus_5_maze_4Maze_4__len__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_6__getitem__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_key); /* proto */
static int __pyx_pf_8daedalus_5_maze_4Maze_8__contains__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_10__iter__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_13__str__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_15__repr__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_17index(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_5count_genexpr(PyObject *__pyx_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_19count(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_5width___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_6height___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_8entrance___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_4exit___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_21get(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_x, PyObject *__pyx_v_y); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_23create_perfect(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_25create_perfect2(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_27create_braid(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_29create_braid_tilt(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTiltDiamond, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_31create_spiral(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_cSpiral, PyObject *__pyx_v_cSpiralWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_33create_diagonal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_35create_recursive(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_37create_prim(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_39create_prim2(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_41create_kruskal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fClear, CYTHON_UNUSED PyObject *__pyx_v_c2, CYTHON_UNUSED PyObject *__pyx_v_c3, PyObject *__pyx_v_fKruskalPic, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_43create_tree(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos, PyObject *__pyx_v_nTreeRiver); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_45create_forest(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fWall, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos, PyObject *__pyx_v_nForsAdd, PyObject *__pyx_v_nForsInit, PyObject *__pyx_v_nTreeRiver); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_47create_aldous_broder(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_49create_wilson(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_51create_eller(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_53create_braid_eller(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_55create_division(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_57create_binary(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_59create_sidewinder(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_61create_unicursal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_63resize(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_width, PyObject *__pyx_v_height); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_65_handle_save_retval(PyObject *__pyx_v_rv); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_67_store_back_globals(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_69save_bitmap(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_filename, PyObject *__pyx_v_kvOn, PyObject *__pyx_v_kvOff); /* proto */
static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_71save_text(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_filename, PyObject *__pyx_v_fTextClip, PyObject *__pyx_v_fLineChar, PyObject *__pyx_v_fTextTab); /* proto */
static PyObject *__pyx_tp_new_8daedalus_5_maze_Maze(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/
static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct____iter__(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/
static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_1_count(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/
static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_2_genexpr(PyTypeObject *t, PyObject *a, PyObject *k); /*proto*/
static PyObject *__pyx_int_0;
static PyObject *__pyx_int_1;
static PyObject *__pyx_int_10;
static PyObject *__pyx_int_15;
static PyObject *__pyx_int_neg_100;
static PyObject *__pyx_k__7;
static PyObject *__pyx_k__9;
static PyObject *__pyx_k__11;
static PyObject *__pyx_k__13;
static PyObject *__pyx_k__15;
static PyObject *__pyx_k__17;
static PyObject *__pyx_k__19;
static PyObject *__pyx_k__21;
static PyObject *__pyx_k__23;
static PyObject *__pyx_k__25;
static PyObject *__pyx_k__27;
static PyObject *__pyx_k__29;
static PyObject *__pyx_k__31;
static PyObject *__pyx_k__33;
static PyObject *__pyx_k__35;
static PyObject *__pyx_k__37;
static PyObject *__pyx_k__39;
static PyObject *__pyx_k__41;
static PyObject *__pyx_k__43;
static PyObject *__pyx_k__45;
static PyObject *__pyx_k__55;
static PyObject *__pyx_k__56;
static PyObject *__pyx_tuple_;
static PyObject *__pyx_tuple__2;
static PyObject *__pyx_tuple__3;
static PyObject *__pyx_tuple__4;
static PyObject *__pyx_tuple__5;
static PyObject *__pyx_tuple__6;
static PyObject *__pyx_tuple__8;
static PyObject *__pyx_tuple__10;
static PyObject *__pyx_tuple__12;
static PyObject *__pyx_tuple__14;
static PyObject *__pyx_tuple__16;
static PyObject *__pyx_tuple__18;
static PyObject *__pyx_tuple__20;
static PyObject *__pyx_tuple__22;
static PyObject *__pyx_tuple__24;
static PyObject *__pyx_tuple__26;
static PyObject *__pyx_tuple__28;
static PyObject *__pyx_tuple__30;
static PyObject *__pyx_tuple__32;
static PyObject *__pyx_tuple__34;
static PyObject *__pyx_tuple__36;
static PyObject *__pyx_tuple__38;
static PyObject *__pyx_tuple__40;
static PyObject *__pyx_tuple__42;
static PyObject *__pyx_tuple__44;
static PyObject *__pyx_tuple__46;
static PyObject *__pyx_tuple__47;
static PyObject *__pyx_tuple__48;
static PyObject *__pyx_tuple__49;
static PyObject *__pyx_tuple__50;
static PyObject *__pyx_tuple__51;
static PyObject *__pyx_tuple__52;
static PyObject *__pyx_tuple__53;
static PyObject *__pyx_tuple__54;
static PyObject *__pyx_tuple__57;
static PyObject *__pyx_codeobj__58;

/* "daedalus/_maze.pyx":191
 *     cdef int _yExit
 * 
 *     def __cinit__(self, width, height):             # <<<<<<<<<<<<<<
 *         '''
 *         Maze constructor.
 */

/* Python wrapper */
static int __pyx_pw_8daedalus_5_maze_4Maze_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static int __pyx_pw_8daedalus_5_maze_4Maze_1__cinit__(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_width = 0;
  PyObject *__pyx_v_height = 0;
  int __pyx_r;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__cinit__ (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_width,&__pyx_n_s_height,0};
    PyObject* values[2] = {0,0};
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_width)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_height)) != 0)) kw_args--;
        else {
          __Pyx_RaiseArgtupleInvalid("__cinit__", 1, 2, 2, 1); __PYX_ERR(0, 191, __pyx_L3_error)
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "__cinit__") < 0)) __PYX_ERR(0, 191, __pyx_L3_error)
      }
    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {
      goto __pyx_L5_argtuple_error;
    } else {
      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
    }
    __pyx_v_width = values[0];
    __pyx_v_height = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("__cinit__", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 191, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.__cinit__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return -1;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze___cinit__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_width, __pyx_v_height);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static int __pyx_pf_8daedalus_5_maze_4Maze___cinit__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_width, PyObject *__pyx_v_height) {
  int __pyx_r;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  int __pyx_t_2;
  unsigned int __pyx_t_3;
  unsigned int __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("__cinit__", 0);

  /* "daedalus/_maze.pyx":198
 *         :param int height: Odd integer, 3 or greater
 *         '''
 *         if width < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative width')
 *         if height < 0:
 */
  __pyx_t_1 = PyObject_RichCompare(__pyx_v_width, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 198, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 198, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":199
 *         '''
 *         if width < 0:
 *             raise ValueError('negative width')             # <<<<<<<<<<<<<<
 *         if height < 0:
 *             raise ValueError('negative height')
 */
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 199, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 199, __pyx_L1_error)

    /* "daedalus/_maze.pyx":198
 *         :param int height: Odd integer, 3 or greater
 *         '''
 *         if width < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative width')
 *         if height < 0:
 */
  }

  /* "daedalus/_maze.pyx":200
 *         if width < 0:
 *             raise ValueError('negative width')
 *         if height < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative height')
 *         # if width % 2 != 1:
 */
  __pyx_t_1 = PyObject_RichCompare(__pyx_v_height, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 200, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 200, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":201
 *             raise ValueError('negative width')
 *         if height < 0:
 *             raise ValueError('negative height')             # <<<<<<<<<<<<<<
 *         # if width % 2 != 1:
 *         #     raise ValueError('width must be odd')
 */
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 201, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 201, __pyx_L1_error)

    /* "daedalus/_maze.pyx":200
 *         if width < 0:
 *             raise ValueError('negative width')
 *         if height < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative height')
 *         # if width % 2 != 1:
 */
  }

  /* "daedalus/_maze.pyx":206
 *         # if height % 2 != 1:
 *         #     raise ValueError('height must be odd')
 *         self._xEntrance = 0             # <<<<<<<<<<<<<<
 *         self._yEntrance = 0
 *         self._xExit = 0
 */
  __pyx_v_self->_xEntrance = 0;

  /* "daedalus/_maze.pyx":207
 *         #     raise ValueError('height must be odd')
 *         self._xEntrance = 0
 *         self._yEntrance = 0             # <<<<<<<<<<<<<<
 *         self._xExit = 0
 *         self._yExit = 0
 */
  __pyx_v_self->_yEntrance = 0;

  /* "daedalus/_maze.pyx":208
 *         self._xEntrance = 0
 *         self._yEntrance = 0
 *         self._xExit = 0             # <<<<<<<<<<<<<<
 *         self._yExit = 0
 *         self._maze = cpp_Constructor(width, height)
 */
  __pyx_v_self->_xExit = 0;

  /* "daedalus/_maze.pyx":209
 *         self._yEntrance = 0
 *         self._xExit = 0
 *         self._yExit = 0             # <<<<<<<<<<<<<<
 *         self._maze = cpp_Constructor(width, height)
 *         if self._maze is NULL:
 */
  __pyx_v_self->_yExit = 0;

  /* "daedalus/_maze.pyx":210
 *         self._xExit = 0
 *         self._yExit = 0
 *         self._maze = cpp_Constructor(width, height)             # <<<<<<<<<<<<<<
 *         if self._maze is NULL:
 *             raise MazeError('Could not construct Maze object.')
 */
  __pyx_t_3 = __Pyx_PyInt_As_unsigned_int(__pyx_v_width); if (unlikely((__pyx_t_3 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 210, __pyx_L1_error)
  __pyx_t_4 = __Pyx_PyInt_As_unsigned_int(__pyx_v_height); if (unlikely((__pyx_t_4 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 210, __pyx_L1_error)
  __pyx_v_self->_maze = cpp_Constructor(__pyx_t_3, __pyx_t_4);

  /* "daedalus/_maze.pyx":211
 *         self._yExit = 0
 *         self._maze = cpp_Constructor(width, height)
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not construct Maze object.')
 * 
 */
  __pyx_t_2 = ((__pyx_v_self->_maze == NULL) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":212
 *         self._maze = cpp_Constructor(width, height)
 *         if self._maze is NULL:
 *             raise MazeError('Could not construct Maze object.')             # <<<<<<<<<<<<<<
 * 
 *     def __dealloc__(self):
 */
    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 212, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 212, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 212, __pyx_L1_error)

    /* "daedalus/_maze.pyx":211
 *         self._yExit = 0
 *         self._maze = cpp_Constructor(width, height)
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not construct Maze object.')
 * 
 */
  }

  /* "daedalus/_maze.pyx":191
 *     cdef int _yExit
 * 
 *     def __cinit__(self, width, height):             # <<<<<<<<<<<<<<
 *         '''
 *         Maze constructor.
 */

  /* function exit code */
  __pyx_r = 0;
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.__cinit__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = -1;
  __pyx_L0:;
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":214
 *             raise MazeError('Could not construct Maze object.')
 * 
 *     def __dealloc__(self):             # <<<<<<<<<<<<<<
 *         '''Destructor.'''
 *         if self._maze is not NULL:
 */

/* Python wrapper */
static void __pyx_pw_8daedalus_5_maze_4Maze_3__dealloc__(PyObject *__pyx_v_self); /*proto*/
static void __pyx_pw_8daedalus_5_maze_4Maze_3__dealloc__(PyObject *__pyx_v_self) {
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__dealloc__ (wrapper)", 0);
  __pyx_pf_8daedalus_5_maze_4Maze_2__dealloc__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
}

static void __pyx_pf_8daedalus_5_maze_4Maze_2__dealloc__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  __Pyx_RefNannySetupContext("__dealloc__", 0);

  /* "daedalus/_maze.pyx":216
 *     def __dealloc__(self):
 *         '''Destructor.'''
 *         if self._maze is not NULL:             # <<<<<<<<<<<<<<
 *             cpp_Destructor(self._maze)
 *             self._maze = NULL
 */
  __pyx_t_1 = ((__pyx_v_self->_maze != NULL) != 0);
  if (__pyx_t_1) {

    /* "daedalus/_maze.pyx":217
 *         '''Destructor.'''
 *         if self._maze is not NULL:
 *             cpp_Destructor(self._maze)             # <<<<<<<<<<<<<<
 *             self._maze = NULL
 * 
 */
    cpp_Destructor(__pyx_v_self->_maze);

    /* "daedalus/_maze.pyx":218
 *         if self._maze is not NULL:
 *             cpp_Destructor(self._maze)
 *             self._maze = NULL             # <<<<<<<<<<<<<<
 * 
 *     def __len__(self):
 */
    __pyx_v_self->_maze = NULL;

    /* "daedalus/_maze.pyx":216
 *     def __dealloc__(self):
 *         '''Destructor.'''
 *         if self._maze is not NULL:             # <<<<<<<<<<<<<<
 *             cpp_Destructor(self._maze)
 *             self._maze = NULL
 */
  }

  /* "daedalus/_maze.pyx":214
 *             raise MazeError('Could not construct Maze object.')
 * 
 *     def __dealloc__(self):             # <<<<<<<<<<<<<<
 *         '''Destructor.'''
 *         if self._maze is not NULL:
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
}

/* "daedalus/_maze.pyx":220
 *             self._maze = NULL
 * 
 *     def __len__(self):             # <<<<<<<<<<<<<<
 *         return self.height
 * 
 */

/* Python wrapper */
static Py_ssize_t __pyx_pw_8daedalus_5_maze_4Maze_5__len__(PyObject *__pyx_v_self); /*proto*/
static Py_ssize_t __pyx_pw_8daedalus_5_maze_4Maze_5__len__(PyObject *__pyx_v_self) {
  Py_ssize_t __pyx_r;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__len__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_4__len__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static Py_ssize_t __pyx_pf_8daedalus_5_maze_4Maze_4__len__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  Py_ssize_t __pyx_r;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  Py_ssize_t __pyx_t_2;
  __Pyx_RefNannySetupContext("__len__", 0);

  /* "daedalus/_maze.pyx":221
 * 
 *     def __len__(self):
 *         return self.height             # <<<<<<<<<<<<<<
 * 
 *     def __getitem__(self, key):
 */
  __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_height); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 221, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = __Pyx_PyIndex_AsSsize_t(__pyx_t_1); if (unlikely((__pyx_t_2 == (Py_ssize_t)-1) && PyErr_Occurred())) __PYX_ERR(0, 221, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_r = __pyx_t_2;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":220
 *             self._maze = NULL
 * 
 *     def __len__(self):             # <<<<<<<<<<<<<<
 *         return self.height
 * 
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_AddTraceback("daedalus._maze.Maze.__len__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = -1;
  __pyx_L0:;
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":223
 *         return self.height
 * 
 *     def __getitem__(self, key):             # <<<<<<<<<<<<<<
 *         if isinstance(key, int):
 *             y = key
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_7__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_7__getitem__(PyObject *__pyx_v_self, PyObject *__pyx_v_key) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__getitem__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_6__getitem__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), ((PyObject *)__pyx_v_key));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_6__getitem__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_key) {
  PyObject *__pyx_v_y = NULL;
  PyObject *__pyx_v_x = NULL;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  Py_ssize_t __pyx_t_6;
  PyObject *(*__pyx_t_7)(PyObject *);
  PyObject *__pyx_t_8 = NULL;
  PyObject *__pyx_t_9 = NULL;
  int __pyx_t_10;
  PyObject *__pyx_t_11 = NULL;
  int __pyx_t_12;
  PyObject *(*__pyx_t_13)(PyObject *);
  __Pyx_RefNannySetupContext("__getitem__", 0);

  /* "daedalus/_maze.pyx":224
 * 
 *     def __getitem__(self, key):
 *         if isinstance(key, int):             # <<<<<<<<<<<<<<
 *             y = key
 *             return [int(self.get(x, y)) for x in range(self.width)]
 */
  __pyx_t_1 = PyInt_Check(__pyx_v_key); 
  __pyx_t_2 = (__pyx_t_1 != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":225
 *     def __getitem__(self, key):
 *         if isinstance(key, int):
 *             y = key             # <<<<<<<<<<<<<<
 *             return [int(self.get(x, y)) for x in range(self.width)]
 *         else:
 */
    __Pyx_INCREF(__pyx_v_key);
    __pyx_v_y = __pyx_v_key;

    /* "daedalus/_maze.pyx":226
 *         if isinstance(key, int):
 *             y = key
 *             return [int(self.get(x, y)) for x in range(self.width)]             # <<<<<<<<<<<<<<
 *         else:
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:
 */
    __Pyx_XDECREF(__pyx_r);
    __pyx_t_3 = PyList_New(0); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 226, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_width); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 226, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_GIVEREF(__pyx_t_4);
    PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_4);
    __pyx_t_4 = 0;
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_range, __pyx_t_5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    if (likely(PyList_CheckExact(__pyx_t_4)) || PyTuple_CheckExact(__pyx_t_4)) {
      __pyx_t_5 = __pyx_t_4; __Pyx_INCREF(__pyx_t_5); __pyx_t_6 = 0;
      __pyx_t_7 = NULL;
    } else {
      __pyx_t_6 = -1; __pyx_t_5 = PyObject_GetIter(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 226, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_5);
      __pyx_t_7 = Py_TYPE(__pyx_t_5)->tp_iternext; if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 226, __pyx_L1_error)
    }
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    for (;;) {
      if (likely(!__pyx_t_7)) {
        if (likely(PyList_CheckExact(__pyx_t_5))) {
          if (__pyx_t_6 >= PyList_GET_SIZE(__pyx_t_5)) break;
          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
          __pyx_t_4 = PyList_GET_ITEM(__pyx_t_5, __pyx_t_6); __Pyx_INCREF(__pyx_t_4); __pyx_t_6++; if (unlikely(0 < 0)) __PYX_ERR(0, 226, __pyx_L1_error)
          #else
          __pyx_t_4 = PySequence_ITEM(__pyx_t_5, __pyx_t_6); __pyx_t_6++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
          __Pyx_GOTREF(__pyx_t_4);
          #endif
        } else {
          if (__pyx_t_6 >= PyTuple_GET_SIZE(__pyx_t_5)) break;
          #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
          __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_5, __pyx_t_6); __Pyx_INCREF(__pyx_t_4); __pyx_t_6++; if (unlikely(0 < 0)) __PYX_ERR(0, 226, __pyx_L1_error)
          #else
          __pyx_t_4 = PySequence_ITEM(__pyx_t_5, __pyx_t_6); __pyx_t_6++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
          __Pyx_GOTREF(__pyx_t_4);
          #endif
        }
      } else {
        __pyx_t_4 = __pyx_t_7(__pyx_t_5);
        if (unlikely(!__pyx_t_4)) {
          PyObject* exc_type = PyErr_Occurred();
          if (exc_type) {
            if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();
            else __PYX_ERR(0, 226, __pyx_L1_error)
          }
          break;
        }
        __Pyx_GOTREF(__pyx_t_4);
      }
      __Pyx_XDECREF_SET(__pyx_v_x, __pyx_t_4);
      __pyx_t_4 = 0;
      __pyx_t_8 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 226, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_8);
      __pyx_t_9 = NULL;
      __pyx_t_10 = 0;
      if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_8))) {
        __pyx_t_9 = PyMethod_GET_SELF(__pyx_t_8);
        if (likely(__pyx_t_9)) {
          PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_8);
          __Pyx_INCREF(__pyx_t_9);
          __Pyx_INCREF(function);
          __Pyx_DECREF_SET(__pyx_t_8, function);
          __pyx_t_10 = 1;
        }
      }
      #if CYTHON_FAST_PYCALL
      if (PyFunction_Check(__pyx_t_8)) {
        PyObject *__pyx_temp[3] = {__pyx_t_9, __pyx_v_x, __pyx_v_y};
        __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_8, __pyx_temp+1-__pyx_t_10, 2+__pyx_t_10); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;
        __Pyx_GOTREF(__pyx_t_4);
      } else
      #endif
      #if CYTHON_FAST_PYCCALL
      if (__Pyx_PyFastCFunction_Check(__pyx_t_8)) {
        PyObject *__pyx_temp[3] = {__pyx_t_9, __pyx_v_x, __pyx_v_y};
        __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_8, __pyx_temp+1-__pyx_t_10, 2+__pyx_t_10); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
        __Pyx_XDECREF(__pyx_t_9); __pyx_t_9 = 0;
        __Pyx_GOTREF(__pyx_t_4);
      } else
      #endif
      {
        __pyx_t_11 = PyTuple_New(2+__pyx_t_10); if (unlikely(!__pyx_t_11)) __PYX_ERR(0, 226, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_11);
        if (__pyx_t_9) {
          __Pyx_GIVEREF(__pyx_t_9); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_9); __pyx_t_9 = NULL;
        }
        __Pyx_INCREF(__pyx_v_x);
        __Pyx_GIVEREF(__pyx_v_x);
        PyTuple_SET_ITEM(__pyx_t_11, 0+__pyx_t_10, __pyx_v_x);
        __Pyx_INCREF(__pyx_v_y);
        __Pyx_GIVEREF(__pyx_v_y);
        PyTuple_SET_ITEM(__pyx_t_11, 1+__pyx_t_10, __pyx_v_y);
        __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_11, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 226, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_4);
        __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;
      }
      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
      __pyx_t_8 = __Pyx_PyNumber_Int(__pyx_t_4); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 226, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_8);
      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
      if (unlikely(__Pyx_ListComp_Append(__pyx_t_3, (PyObject*)__pyx_t_8))) __PYX_ERR(0, 226, __pyx_L1_error)
      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
    }
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __pyx_r = __pyx_t_3;
    __pyx_t_3 = 0;
    goto __pyx_L0;

    /* "daedalus/_maze.pyx":224
 * 
 *     def __getitem__(self, key):
 *         if isinstance(key, int):             # <<<<<<<<<<<<<<
 *             y = key
 *             return [int(self.get(x, y)) for x in range(self.width)]
 */
  }

  /* "daedalus/_maze.pyx":228
 *             return [int(self.get(x, y)) for x in range(self.width)]
 *         else:
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:             # <<<<<<<<<<<<<<
 *                 raise ValueError('key must be an integer or a tuple of two integers')
 *             (x,y) = key
 */
  /*else*/ {
    __pyx_t_1 = PyTuple_Check(__pyx_v_key); 
    __pyx_t_12 = ((!(__pyx_t_1 != 0)) != 0);
    if (__pyx_t_12) {
    } else {
      __pyx_t_2 = __pyx_t_12;
      goto __pyx_L7_bool_binop_done;
    }
    __pyx_t_6 = PyObject_Length(__pyx_v_key); if (unlikely(__pyx_t_6 == -1)) __PYX_ERR(0, 228, __pyx_L1_error)
    __pyx_t_12 = ((__pyx_t_6 == 2) != 0);
    if (__pyx_t_12) {
    } else {
      __pyx_t_2 = __pyx_t_12;
      goto __pyx_L7_bool_binop_done;
    }
    __pyx_t_3 = PyTuple_New(2); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __Pyx_INCREF(((PyObject *)(&PyType_Type)));
    __Pyx_GIVEREF(((PyObject *)(&PyType_Type)));
    PyTuple_SET_ITEM(__pyx_t_3, 0, ((PyObject *)(&PyType_Type)));
    __Pyx_INCREF(__pyx_v_key);
    __Pyx_GIVEREF(__pyx_v_key);
    PyTuple_SET_ITEM(__pyx_t_3, 1, __pyx_v_key);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_map, __pyx_t_3, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __pyx_t_3 = PySet_New(__pyx_t_5); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __pyx_t_5 = PySequence_List(__pyx_t_3); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __pyx_t_3 = PyList_New(1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __Pyx_INCREF(((PyObject *)(&PyInt_Type)));
    __Pyx_GIVEREF(((PyObject *)(&PyInt_Type)));
    PyList_SET_ITEM(__pyx_t_3, 0, ((PyObject *)(&PyInt_Type)));
    __pyx_t_8 = PyObject_RichCompare(__pyx_t_5, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_8); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __pyx_t_12 = __Pyx_PyObject_IsTrue(__pyx_t_8); if (unlikely(__pyx_t_12 < 0)) __PYX_ERR(0, 228, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
    __pyx_t_2 = __pyx_t_12;
    __pyx_L7_bool_binop_done:;
    if (__pyx_t_2) {

      /* "daedalus/_maze.pyx":229
 *         else:
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:
 *                 raise ValueError('key must be an integer or a tuple of two integers')             # <<<<<<<<<<<<<<
 *             (x,y) = key
 *             return self.get(x,y)
 */
      __pyx_t_8 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 229, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_8);
      __Pyx_Raise(__pyx_t_8, 0, 0, 0);
      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
      __PYX_ERR(0, 229, __pyx_L1_error)

      /* "daedalus/_maze.pyx":228
 *             return [int(self.get(x, y)) for x in range(self.width)]
 *         else:
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:             # <<<<<<<<<<<<<<
 *                 raise ValueError('key must be an integer or a tuple of two integers')
 *             (x,y) = key
 */
    }

    /* "daedalus/_maze.pyx":230
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:
 *                 raise ValueError('key must be an integer or a tuple of two integers')
 *             (x,y) = key             # <<<<<<<<<<<<<<
 *             return self.get(x,y)
 * 
 */
    if ((likely(PyTuple_CheckExact(__pyx_v_key))) || (PyList_CheckExact(__pyx_v_key))) {
      PyObject* sequence = __pyx_v_key;
      #if !CYTHON_COMPILING_IN_PYPY
      Py_ssize_t size = Py_SIZE(sequence);
      #else
      Py_ssize_t size = PySequence_Size(sequence);
      #endif
      if (unlikely(size != 2)) {
        if (size > 2) __Pyx_RaiseTooManyValuesError(2);
        else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size);
        __PYX_ERR(0, 230, __pyx_L1_error)
      }
      #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
      if (likely(PyTuple_CheckExact(sequence))) {
        __pyx_t_8 = PyTuple_GET_ITEM(sequence, 0); 
        __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); 
      } else {
        __pyx_t_8 = PyList_GET_ITEM(sequence, 0); 
        __pyx_t_3 = PyList_GET_ITEM(sequence, 1); 
      }
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(__pyx_t_3);
      #else
      __pyx_t_8 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 230, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_8);
      __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 230, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_3);
      #endif
    } else {
      Py_ssize_t index = -1;
      __pyx_t_5 = PyObject_GetIter(__pyx_v_key); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 230, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_5);
      __pyx_t_13 = Py_TYPE(__pyx_t_5)->tp_iternext;
      index = 0; __pyx_t_8 = __pyx_t_13(__pyx_t_5); if (unlikely(!__pyx_t_8)) goto __pyx_L10_unpacking_failed;
      __Pyx_GOTREF(__pyx_t_8);
      index = 1; __pyx_t_3 = __pyx_t_13(__pyx_t_5); if (unlikely(!__pyx_t_3)) goto __pyx_L10_unpacking_failed;
      __Pyx_GOTREF(__pyx_t_3);
      if (__Pyx_IternextUnpackEndCheck(__pyx_t_13(__pyx_t_5), 2) < 0) __PYX_ERR(0, 230, __pyx_L1_error)
      __pyx_t_13 = NULL;
      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
      goto __pyx_L11_unpacking_done;
      __pyx_L10_unpacking_failed:;
      __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
      __pyx_t_13 = NULL;
      if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index);
      __PYX_ERR(0, 230, __pyx_L1_error)
      __pyx_L11_unpacking_done:;
    }
    __pyx_v_x = __pyx_t_8;
    __pyx_t_8 = 0;
    __pyx_v_y = __pyx_t_3;
    __pyx_t_3 = 0;

    /* "daedalus/_maze.pyx":231
 *                 raise ValueError('key must be an integer or a tuple of two integers')
 *             (x,y) = key
 *             return self.get(x,y)             # <<<<<<<<<<<<<<
 * 
 *     def __contains__(self, value):
 */
    __Pyx_XDECREF(__pyx_r);
    __pyx_t_8 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_get); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 231, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_8);
    __pyx_t_5 = NULL;
    __pyx_t_10 = 0;
    if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_8))) {
      __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_8);
      if (likely(__pyx_t_5)) {
        PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_8);
        __Pyx_INCREF(__pyx_t_5);
        __Pyx_INCREF(function);
        __Pyx_DECREF_SET(__pyx_t_8, function);
        __pyx_t_10 = 1;
      }
    }
    #if CYTHON_FAST_PYCALL
    if (PyFunction_Check(__pyx_t_8)) {
      PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_x, __pyx_v_y};
      __pyx_t_3 = __Pyx_PyFunction_FastCall(__pyx_t_8, __pyx_temp+1-__pyx_t_10, 2+__pyx_t_10); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 231, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;
      __Pyx_GOTREF(__pyx_t_3);
    } else
    #endif
    #if CYTHON_FAST_PYCCALL
    if (__Pyx_PyFastCFunction_Check(__pyx_t_8)) {
      PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_v_x, __pyx_v_y};
      __pyx_t_3 = __Pyx_PyCFunction_FastCall(__pyx_t_8, __pyx_temp+1-__pyx_t_10, 2+__pyx_t_10); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 231, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;
      __Pyx_GOTREF(__pyx_t_3);
    } else
    #endif
    {
      __pyx_t_4 = PyTuple_New(2+__pyx_t_10); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 231, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_4);
      if (__pyx_t_5) {
        __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_5); __pyx_t_5 = NULL;
      }
      __Pyx_INCREF(__pyx_v_x);
      __Pyx_GIVEREF(__pyx_v_x);
      PyTuple_SET_ITEM(__pyx_t_4, 0+__pyx_t_10, __pyx_v_x);
      __Pyx_INCREF(__pyx_v_y);
      __Pyx_GIVEREF(__pyx_v_y);
      PyTuple_SET_ITEM(__pyx_t_4, 1+__pyx_t_10, __pyx_v_y);
      __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 231, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_3);
      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    }
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
    __pyx_r = __pyx_t_3;
    __pyx_t_3 = 0;
    goto __pyx_L0;
  }

  /* "daedalus/_maze.pyx":223
 *         return self.height
 * 
 *     def __getitem__(self, key):             # <<<<<<<<<<<<<<
 *         if isinstance(key, int):
 *             y = key
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_XDECREF(__pyx_t_9);
  __Pyx_XDECREF(__pyx_t_11);
  __Pyx_AddTraceback("daedalus._maze.Maze.__getitem__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XDECREF(__pyx_v_y);
  __Pyx_XDECREF(__pyx_v_x);
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":233
 *             return self.get(x,y)
 * 
 *     def __contains__(self, value):             # <<<<<<<<<<<<<<
 *         for v in self:
 *             if v == value:
 */

/* Python wrapper */
static int __pyx_pw_8daedalus_5_maze_4Maze_9__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_value); /*proto*/
static int __pyx_pw_8daedalus_5_maze_4Maze_9__contains__(PyObject *__pyx_v_self, PyObject *__pyx_v_value) {
  int __pyx_r;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__contains__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_8__contains__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), ((PyObject *)__pyx_v_value));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static int __pyx_pf_8daedalus_5_maze_4Maze_8__contains__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value) {
  PyObject *__pyx_v_v = NULL;
  int __pyx_r;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  Py_ssize_t __pyx_t_2;
  PyObject *(*__pyx_t_3)(PyObject *);
  PyObject *__pyx_t_4 = NULL;
  int __pyx_t_5;
  __Pyx_RefNannySetupContext("__contains__", 0);

  /* "daedalus/_maze.pyx":234
 * 
 *     def __contains__(self, value):
 *         for v in self:             # <<<<<<<<<<<<<<
 *             if v == value:
 *                 return True
 */
  if (likely(PyList_CheckExact(((PyObject *)__pyx_v_self))) || PyTuple_CheckExact(((PyObject *)__pyx_v_self))) {
    __pyx_t_1 = ((PyObject *)__pyx_v_self); __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;
    __pyx_t_3 = NULL;
  } else {
    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 234, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 234, __pyx_L1_error)
  }
  for (;;) {
    if (likely(!__pyx_t_3)) {
      if (likely(PyList_CheckExact(__pyx_t_1))) {
        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(0, 234, __pyx_L1_error)
        #else
        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 234, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_4);
        #endif
      } else {
        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(0, 234, __pyx_L1_error)
        #else
        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 234, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_4);
        #endif
      }
    } else {
      __pyx_t_4 = __pyx_t_3(__pyx_t_1);
      if (unlikely(!__pyx_t_4)) {
        PyObject* exc_type = PyErr_Occurred();
        if (exc_type) {
          if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();
          else __PYX_ERR(0, 234, __pyx_L1_error)
        }
        break;
      }
      __Pyx_GOTREF(__pyx_t_4);
    }
    __Pyx_XDECREF_SET(__pyx_v_v, __pyx_t_4);
    __pyx_t_4 = 0;

    /* "daedalus/_maze.pyx":235
 *     def __contains__(self, value):
 *         for v in self:
 *             if v == value:             # <<<<<<<<<<<<<<
 *                 return True
 *         return False
 */
    __pyx_t_4 = PyObject_RichCompare(__pyx_v_v, __pyx_v_value, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 235, __pyx_L1_error)
    __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_5 < 0)) __PYX_ERR(0, 235, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    if (__pyx_t_5) {

      /* "daedalus/_maze.pyx":236
 *         for v in self:
 *             if v == value:
 *                 return True             # <<<<<<<<<<<<<<
 *         return False
 * 
 */
      __pyx_r = 1;
      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
      goto __pyx_L0;

      /* "daedalus/_maze.pyx":235
 *     def __contains__(self, value):
 *         for v in self:
 *             if v == value:             # <<<<<<<<<<<<<<
 *                 return True
 *         return False
 */
    }

    /* "daedalus/_maze.pyx":234
 * 
 *     def __contains__(self, value):
 *         for v in self:             # <<<<<<<<<<<<<<
 *             if v == value:
 *                 return True
 */
  }
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":237
 *             if v == value:
 *                 return True
 *         return False             # <<<<<<<<<<<<<<
 * 
 *     def __iter__(self):
 */
  __pyx_r = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":233
 *             return self.get(x,y)
 * 
 *     def __contains__(self, value):             # <<<<<<<<<<<<<<
 *         for v in self:
 *             if v == value:
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_AddTraceback("daedalus._maze.Maze.__contains__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = -1;
  __pyx_L0:;
  __Pyx_XDECREF(__pyx_v_v);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}
static PyObject *__pyx_gb_8daedalus_5_maze_4Maze_12generator(__pyx_CoroutineObject *__pyx_generator, PyObject *__pyx_sent_value); /* proto */

/* "daedalus/_maze.pyx":239
 *         return False
 * 
 *     def __iter__(self):             # <<<<<<<<<<<<<<
 *         i = 0
 *         try:
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_11__iter__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_11__iter__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__iter__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_10__iter__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_10__iter__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *__pyx_cur_scope;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__iter__", 0);
  __pyx_cur_scope = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct____iter__(__pyx_ptype_8daedalus_5_maze___pyx_scope_struct____iter__, __pyx_empty_tuple, NULL);
  if (unlikely(!__pyx_cur_scope)) {
    __pyx_cur_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)Py_None);
    __Pyx_INCREF(Py_None);
    __PYX_ERR(0, 239, __pyx_L1_error)
  } else {
    __Pyx_GOTREF(__pyx_cur_scope);
  }
  __pyx_cur_scope->__pyx_v_self = __pyx_v_self;
  __Pyx_INCREF((PyObject *)__pyx_cur_scope->__pyx_v_self);
  __Pyx_GIVEREF((PyObject *)__pyx_cur_scope->__pyx_v_self);
  {
    __pyx_CoroutineObject *gen = __Pyx_Generator_New((__pyx_coroutine_body_t) __pyx_gb_8daedalus_5_maze_4Maze_12generator, (PyObject *) __pyx_cur_scope, __pyx_n_s_iter, __pyx_n_s_Maze___iter, __pyx_n_s_daedalus__maze); if (unlikely(!gen)) __PYX_ERR(0, 239, __pyx_L1_error)
    __Pyx_DECREF(__pyx_cur_scope);
    __Pyx_RefNannyFinishContext();
    return (PyObject *) gen;
  }

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.__iter__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __Pyx_DECREF(((PyObject *)__pyx_cur_scope));
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_gb_8daedalus_5_maze_4Maze_12generator(__pyx_CoroutineObject *__pyx_generator, PyObject *__pyx_sent_value) /* generator body */
{
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *__pyx_cur_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)__pyx_generator->closure);
  PyObject *__pyx_r = NULL;
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  int __pyx_t_5;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("None", 0);
  switch (__pyx_generator->resume_label) {
    case 0: goto __pyx_L3_first_run;
    case 1: goto __pyx_L14_resume_from_yield;
    default: /* CPython raises the right error here */
    __Pyx_RefNannyFinishContext();
    return NULL;
  }
  __pyx_L3_first_run:;
  if (unlikely(!__pyx_sent_value)) __PYX_ERR(0, 239, __pyx_L1_error)

  /* "daedalus/_maze.pyx":240
 * 
 *     def __iter__(self):
 *         i = 0             # <<<<<<<<<<<<<<
 *         try:
 *             while True:
 */
  __Pyx_INCREF(__pyx_int_0);
  __Pyx_GIVEREF(__pyx_int_0);
  __pyx_cur_scope->__pyx_v_i = __pyx_int_0;

  /* "daedalus/_maze.pyx":241
 *     def __iter__(self):
 *         i = 0
 *         try:             # <<<<<<<<<<<<<<
 *             while True:
 *                 v = self[i]
 */
  {
    __Pyx_PyThreadState_declare
    __Pyx_PyThreadState_assign
    __Pyx_ExceptionSave(&__pyx_t_1, &__pyx_t_2, &__pyx_t_3);
    __Pyx_XGOTREF(__pyx_t_1);
    __Pyx_XGOTREF(__pyx_t_2);
    __Pyx_XGOTREF(__pyx_t_3);
    /*try:*/ {

      /* "daedalus/_maze.pyx":242
 *         i = 0
 *         try:
 *             while True:             # <<<<<<<<<<<<<<
 *                 v = self[i]
 *                 yield v
 */
      while (1) {

        /* "daedalus/_maze.pyx":243
 *         try:
 *             while True:
 *                 v = self[i]             # <<<<<<<<<<<<<<
 *                 yield v
 *                 i += 1
 */
        __pyx_t_4 = PyObject_GetItem(((PyObject *)__pyx_cur_scope->__pyx_v_self), __pyx_cur_scope->__pyx_v_i); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 243, __pyx_L4_error)
        __Pyx_GOTREF(__pyx_t_4);
        __Pyx_XGOTREF(__pyx_cur_scope->__pyx_v_v);
        __Pyx_XDECREF_SET(__pyx_cur_scope->__pyx_v_v, __pyx_t_4);
        __Pyx_GIVEREF(__pyx_t_4);
        __pyx_t_4 = 0;

        /* "daedalus/_maze.pyx":244
 *             while True:
 *                 v = self[i]
 *                 yield v             # <<<<<<<<<<<<<<
 *                 i += 1
 *         except IndexError:
 */
        __Pyx_INCREF(__pyx_cur_scope->__pyx_v_v);
        __pyx_r = __pyx_cur_scope->__pyx_v_v;
        __Pyx_XGIVEREF(__pyx_t_1);
        __pyx_cur_scope->__pyx_t_0 = __pyx_t_1;
        __Pyx_XGIVEREF(__pyx_t_2);
        __pyx_cur_scope->__pyx_t_1 = __pyx_t_2;
        __Pyx_XGIVEREF(__pyx_t_3);
        __pyx_cur_scope->__pyx_t_2 = __pyx_t_3;
        __Pyx_XGIVEREF(__pyx_r);
        __Pyx_RefNannyFinishContext();
        /* return from generator, yielding value */
        __pyx_generator->resume_label = 1;
        return __pyx_r;
        __pyx_L14_resume_from_yield:;
        __pyx_t_1 = __pyx_cur_scope->__pyx_t_0;
        __pyx_cur_scope->__pyx_t_0 = 0;
        __Pyx_XGOTREF(__pyx_t_1);
        __pyx_t_2 = __pyx_cur_scope->__pyx_t_1;
        __pyx_cur_scope->__pyx_t_1 = 0;
        __Pyx_XGOTREF(__pyx_t_2);
        __pyx_t_3 = __pyx_cur_scope->__pyx_t_2;
        __pyx_cur_scope->__pyx_t_2 = 0;
        __Pyx_XGOTREF(__pyx_t_3);
        if (unlikely(!__pyx_sent_value)) __PYX_ERR(0, 244, __pyx_L4_error)

        /* "daedalus/_maze.pyx":245
 *                 v = self[i]
 *                 yield v
 *                 i += 1             # <<<<<<<<<<<<<<
 *         except IndexError:
 *             return
 */
        __pyx_t_4 = __Pyx_PyInt_AddObjC(__pyx_cur_scope->__pyx_v_i, __pyx_int_1, 1, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 245, __pyx_L4_error)
        __Pyx_GOTREF(__pyx_t_4);
        __Pyx_GOTREF(__pyx_cur_scope->__pyx_v_i);
        __Pyx_DECREF_SET(__pyx_cur_scope->__pyx_v_i, __pyx_t_4);
        __Pyx_GIVEREF(__pyx_t_4);
        __pyx_t_4 = 0;
      }

      /* "daedalus/_maze.pyx":241
 *     def __iter__(self):
 *         i = 0
 *         try:             # <<<<<<<<<<<<<<
 *             while True:
 *                 v = self[i]
 */
    }
    __Pyx_XDECREF(__pyx_t_1); __pyx_t_1 = 0;
    __Pyx_XDECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_XDECREF(__pyx_t_3); __pyx_t_3 = 0;
    goto __pyx_L11_try_end;
    __pyx_L4_error:;
    __Pyx_PyThreadState_assign
    __Pyx_XDECREF(__pyx_t_4); __pyx_t_4 = 0;

    /* "daedalus/_maze.pyx":246
 *                 yield v
 *                 i += 1
 *         except IndexError:             # <<<<<<<<<<<<<<
 *             return
 * 
 */
    __pyx_t_5 = __Pyx_PyErr_ExceptionMatches(__pyx_builtin_IndexError);
    if (__pyx_t_5) {
      __Pyx_AddTraceback("daedalus._maze.Maze.__iter__", __pyx_clineno, __pyx_lineno, __pyx_filename);
      if (__Pyx_GetException(&__pyx_t_4, &__pyx_t_6, &__pyx_t_7) < 0) __PYX_ERR(0, 246, __pyx_L6_except_error)
      __Pyx_GOTREF(__pyx_t_4);
      __Pyx_GOTREF(__pyx_t_6);
      __Pyx_GOTREF(__pyx_t_7);

      /* "daedalus/_maze.pyx":247
 *                 i += 1
 *         except IndexError:
 *             return             # <<<<<<<<<<<<<<
 * 
 *     def __str__(self):
 */
      __Pyx_XDECREF(__pyx_r);
      __pyx_r = NULL;
      __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
      goto __pyx_L7_except_return;
    }
    goto __pyx_L6_except_error;
    __pyx_L6_except_error:;

    /* "daedalus/_maze.pyx":241
 *     def __iter__(self):
 *         i = 0
 *         try:             # <<<<<<<<<<<<<<
 *             while True:
 *                 v = self[i]
 */
    __Pyx_PyThreadState_assign
    __Pyx_XGIVEREF(__pyx_t_1);
    __Pyx_XGIVEREF(__pyx_t_2);
    __Pyx_XGIVEREF(__pyx_t_3);
    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);
    goto __pyx_L1_error;
    __pyx_L7_except_return:;
    __Pyx_PyThreadState_assign
    __Pyx_XGIVEREF(__pyx_t_1);
    __Pyx_XGIVEREF(__pyx_t_2);
    __Pyx_XGIVEREF(__pyx_t_3);
    __Pyx_ExceptionReset(__pyx_t_1, __pyx_t_2, __pyx_t_3);
    goto __pyx_L0;
    __pyx_L11_try_end:;
  }
  CYTHON_MAYBE_UNUSED_VAR(__pyx_cur_scope);

  /* "daedalus/_maze.pyx":239
 *         return False
 * 
 *     def __iter__(self):             # <<<<<<<<<<<<<<
 *         i = 0
 *         try:
 */

  /* function exit code */
  PyErr_SetNone(PyExc_StopIteration);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_AddTraceback("__iter__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_L0:;
  __Pyx_XDECREF(__pyx_r); __pyx_r = 0;
  __pyx_generator->resume_label = -1;
  __Pyx_Coroutine_clear((PyObject*)__pyx_generator);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":249
 *             return
 * 
 *     def __str__(self):             # <<<<<<<<<<<<<<
 *         return '<Maze: {}x{}>'.format(self.width, self.height)
 * 
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_14__str__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_14__str__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__str__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_13__str__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_13__str__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  int __pyx_t_6;
  PyObject *__pyx_t_7 = NULL;
  __Pyx_RefNannySetupContext("__str__", 0);

  /* "daedalus/_maze.pyx":250
 * 
 *     def __str__(self):
 *         return '<Maze: {}x{}>'.format(self.width, self.height)             # <<<<<<<<<<<<<<
 * 
 *     def __repr__(self):
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_kp_s_Maze_x, __pyx_n_s_format); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 250, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_width); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 250, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_height); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 250, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_5 = NULL;
  __pyx_t_6 = 0;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_2))) {
    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_2);
    if (likely(__pyx_t_5)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_2);
      __Pyx_INCREF(__pyx_t_5);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_2, function);
      __pyx_t_6 = 1;
    }
  }
  #if CYTHON_FAST_PYCALL
  if (PyFunction_Check(__pyx_t_2)) {
    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};
    __pyx_t_1 = __Pyx_PyFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 250, __pyx_L1_error)
    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  } else
  #endif
  #if CYTHON_FAST_PYCCALL
  if (__Pyx_PyFastCFunction_Check(__pyx_t_2)) {
    PyObject *__pyx_temp[3] = {__pyx_t_5, __pyx_t_3, __pyx_t_4};
    __pyx_t_1 = __Pyx_PyCFunction_FastCall(__pyx_t_2, __pyx_temp+1-__pyx_t_6, 2+__pyx_t_6); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 250, __pyx_L1_error)
    __Pyx_XDECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  } else
  #endif
  {
    __pyx_t_7 = PyTuple_New(2+__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 250, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_7);
    if (__pyx_t_5) {
      __Pyx_GIVEREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_5); __pyx_t_5 = NULL;
    }
    __Pyx_GIVEREF(__pyx_t_3);
    PyTuple_SET_ITEM(__pyx_t_7, 0+__pyx_t_6, __pyx_t_3);
    __Pyx_GIVEREF(__pyx_t_4);
    PyTuple_SET_ITEM(__pyx_t_7, 1+__pyx_t_6, __pyx_t_4);
    __pyx_t_3 = 0;
    __pyx_t_4 = 0;
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_7, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 250, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
  }
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __pyx_r = __pyx_t_1;
  __pyx_t_1 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":249
 *             return
 * 
 *     def __str__(self):             # <<<<<<<<<<<<<<
 *         return '<Maze: {}x{}>'.format(self.width, self.height)
 * 
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_AddTraceback("daedalus._maze.Maze.__str__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":252
 *         return '<Maze: {}x{}>'.format(self.width, self.height)
 * 
 *     def __repr__(self):             # <<<<<<<<<<<<<<
 *         return str(self)
 * 
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_16__repr__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_16__repr__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__repr__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_15__repr__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_15__repr__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  __Pyx_RefNannySetupContext("__repr__", 0);

  /* "daedalus/_maze.pyx":253
 * 
 *     def __repr__(self):
 *         return str(self)             # <<<<<<<<<<<<<<
 * 
 *     def index(self, value):
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 253, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __Pyx_INCREF(((PyObject *)__pyx_v_self));
  __Pyx_GIVEREF(((PyObject *)__pyx_v_self));
  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)__pyx_v_self));
  __pyx_t_2 = __Pyx_PyObject_Call(((PyObject *)(&PyString_Type)), __pyx_t_1, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 253, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_r = __pyx_t_2;
  __pyx_t_2 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":252
 *         return '<Maze: {}x{}>'.format(self.width, self.height)
 * 
 *     def __repr__(self):             # <<<<<<<<<<<<<<
 *         return str(self)
 * 
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_AddTraceback("daedalus._maze.Maze.__repr__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":255
 *         return str(self)
 * 
 *     def index(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.index(value) -> integer -- return first index of value.  Raises
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_18index(PyObject *__pyx_v_self, PyObject *__pyx_v_value); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_17index[] = "\n        S.index(value) -> integer -- return first index of value.  Raises\n        ValueError if the value is not present.\n\n        :param value: A value to search for in this Maze\n        :return: The index of the location in this Maze where `value` is first found\n        :rtype: int\n        :raises ValueError: If `value` is not found in this Maze\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_18index(PyObject *__pyx_v_self, PyObject *__pyx_v_value) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("index (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_17index(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), ((PyObject *)__pyx_v_value));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_17index(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value) {
  PyObject *__pyx_v_i = NULL;
  PyObject *__pyx_v_v = NULL;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  Py_ssize_t __pyx_t_3;
  PyObject *(*__pyx_t_4)(PyObject *);
  PyObject *__pyx_t_5 = NULL;
  int __pyx_t_6;
  __Pyx_RefNannySetupContext("index", 0);

  /* "daedalus/_maze.pyx":265
 *         :raises ValueError: If `value` is not found in this Maze
 *         '''
 *         for i, v in enumerate(self):             # <<<<<<<<<<<<<<
 *             if v == value:
 *                 return i
 */
  __Pyx_INCREF(__pyx_int_0);
  __pyx_t_1 = __pyx_int_0;
  if (likely(PyList_CheckExact(((PyObject *)__pyx_v_self))) || PyTuple_CheckExact(((PyObject *)__pyx_v_self))) {
    __pyx_t_2 = ((PyObject *)__pyx_v_self); __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0;
    __pyx_t_4 = NULL;
  } else {
    __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(((PyObject *)__pyx_v_self)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 265, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 265, __pyx_L1_error)
  }
  for (;;) {
    if (likely(!__pyx_t_4)) {
      if (likely(PyList_CheckExact(__pyx_t_2))) {
        if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_5 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 265, __pyx_L1_error)
        #else
        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 265, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_5);
        #endif
      } else {
        if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_5 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) __PYX_ERR(0, 265, __pyx_L1_error)
        #else
        __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 265, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_5);
        #endif
      }
    } else {
      __pyx_t_5 = __pyx_t_4(__pyx_t_2);
      if (unlikely(!__pyx_t_5)) {
        PyObject* exc_type = PyErr_Occurred();
        if (exc_type) {
          if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();
          else __PYX_ERR(0, 265, __pyx_L1_error)
        }
        break;
      }
      __Pyx_GOTREF(__pyx_t_5);
    }
    __Pyx_XDECREF_SET(__pyx_v_v, __pyx_t_5);
    __pyx_t_5 = 0;
    __Pyx_INCREF(__pyx_t_1);
    __Pyx_XDECREF_SET(__pyx_v_i, __pyx_t_1);
    __pyx_t_5 = __Pyx_PyInt_AddObjC(__pyx_t_1, __pyx_int_1, 1, 0); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 265, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_1);
    __pyx_t_1 = __pyx_t_5;
    __pyx_t_5 = 0;

    /* "daedalus/_maze.pyx":266
 *         '''
 *         for i, v in enumerate(self):
 *             if v == value:             # <<<<<<<<<<<<<<
 *                 return i
 *         raise ValueError
 */
    __pyx_t_5 = PyObject_RichCompare(__pyx_v_v, __pyx_v_value, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 266, __pyx_L1_error)
    __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) __PYX_ERR(0, 266, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    if (__pyx_t_6) {

      /* "daedalus/_maze.pyx":267
 *         for i, v in enumerate(self):
 *             if v == value:
 *                 return i             # <<<<<<<<<<<<<<
 *         raise ValueError
 * 
 */
      __Pyx_XDECREF(__pyx_r);
      __Pyx_INCREF(__pyx_v_i);
      __pyx_r = __pyx_v_i;
      __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
      __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
      goto __pyx_L0;

      /* "daedalus/_maze.pyx":266
 *         '''
 *         for i, v in enumerate(self):
 *             if v == value:             # <<<<<<<<<<<<<<
 *                 return i
 *         raise ValueError
 */
    }

    /* "daedalus/_maze.pyx":265
 *         :raises ValueError: If `value` is not found in this Maze
 *         '''
 *         for i, v in enumerate(self):             # <<<<<<<<<<<<<<
 *             if v == value:
 *                 return i
 */
  }
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":268
 *             if v == value:
 *                 return i
 *         raise ValueError             # <<<<<<<<<<<<<<
 * 
 *     def count(self, value):
 */
  __Pyx_Raise(__pyx_builtin_ValueError, 0, 0, 0);
  __PYX_ERR(0, 268, __pyx_L1_error)

  /* "daedalus/_maze.pyx":255
 *         return str(self)
 * 
 *     def index(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.index(value) -> integer -- return first index of value.  Raises
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.index", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XDECREF(__pyx_v_i);
  __Pyx_XDECREF(__pyx_v_v);
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":270
 *         raise ValueError
 * 
 *     def count(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.count(value) -> integer -- return number of occurrences of
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_20count(PyObject *__pyx_v_self, PyObject *__pyx_v_value); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_19count[] = "\n        S.count(value) -> integer -- return number of occurrences of\n        value.\n\n        :param value: A value to count in this Maze\n        :return: The number of times `value` is found in this Maze.\n        :rtype: int\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_20count(PyObject *__pyx_v_self, PyObject *__pyx_v_value) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("count (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_19count(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), ((PyObject *)__pyx_v_value));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}
static PyObject *__pyx_gb_8daedalus_5_maze_4Maze_5count_2generator1(__pyx_CoroutineObject *__pyx_generator, PyObject *__pyx_sent_value); /* proto */

/* "daedalus/_maze.pyx":279
 *         :rtype: int
 *         '''
 *         return sum(1 for v in self if v == value)             # <<<<<<<<<<<<<<
 * 
 *     @property
 */

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_5count_genexpr(PyObject *__pyx_self) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *__pyx_cur_scope;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("genexpr", 0);
  __pyx_cur_scope = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_2_genexpr(__pyx_ptype_8daedalus_5_maze___pyx_scope_struct_2_genexpr, __pyx_empty_tuple, NULL);
  if (unlikely(!__pyx_cur_scope)) {
    __pyx_cur_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)Py_None);
    __Pyx_INCREF(Py_None);
    __PYX_ERR(0, 279, __pyx_L1_error)
  } else {
    __Pyx_GOTREF(__pyx_cur_scope);
  }
  __pyx_cur_scope->__pyx_outer_scope = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *) __pyx_self;
  __Pyx_INCREF(((PyObject *)__pyx_cur_scope->__pyx_outer_scope));
  __Pyx_GIVEREF(__pyx_cur_scope->__pyx_outer_scope);
  {
    __pyx_CoroutineObject *gen = __Pyx_Generator_New((__pyx_coroutine_body_t) __pyx_gb_8daedalus_5_maze_4Maze_5count_2generator1, (PyObject *) __pyx_cur_scope, __pyx_n_s_genexpr, __pyx_n_s_count_locals_genexpr, __pyx_n_s_daedalus__maze); if (unlikely(!gen)) __PYX_ERR(0, 279, __pyx_L1_error)
    __Pyx_DECREF(__pyx_cur_scope);
    __Pyx_RefNannyFinishContext();
    return (PyObject *) gen;
  }

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.count.genexpr", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __Pyx_DECREF(((PyObject *)__pyx_cur_scope));
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_gb_8daedalus_5_maze_4Maze_5count_2generator1(__pyx_CoroutineObject *__pyx_generator, PyObject *__pyx_sent_value) /* generator body */
{
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *__pyx_cur_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)__pyx_generator->closure);
  PyObject *__pyx_r = NULL;
  PyObject *__pyx_t_1 = NULL;
  Py_ssize_t __pyx_t_2;
  PyObject *(*__pyx_t_3)(PyObject *);
  PyObject *__pyx_t_4 = NULL;
  int __pyx_t_5;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("None", 0);
  switch (__pyx_generator->resume_label) {
    case 0: goto __pyx_L3_first_run;
    case 1: goto __pyx_L7_resume_from_yield;
    default: /* CPython raises the right error here */
    __Pyx_RefNannyFinishContext();
    return NULL;
  }
  __pyx_L3_first_run:;
  if (unlikely(!__pyx_sent_value)) __PYX_ERR(0, 279, __pyx_L1_error)
  if (unlikely(!__pyx_cur_scope->__pyx_outer_scope->__pyx_v_self)) { __Pyx_RaiseClosureNameError("self"); __PYX_ERR(0, 279, __pyx_L1_error) }
  if (likely(PyList_CheckExact(((PyObject *)__pyx_cur_scope->__pyx_outer_scope->__pyx_v_self))) || PyTuple_CheckExact(((PyObject *)__pyx_cur_scope->__pyx_outer_scope->__pyx_v_self))) {
    __pyx_t_1 = ((PyObject *)__pyx_cur_scope->__pyx_outer_scope->__pyx_v_self); __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0;
    __pyx_t_3 = NULL;
  } else {
    __pyx_t_2 = -1; __pyx_t_1 = PyObject_GetIter(((PyObject *)__pyx_cur_scope->__pyx_outer_scope->__pyx_v_self)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 279, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __pyx_t_3 = Py_TYPE(__pyx_t_1)->tp_iternext; if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 279, __pyx_L1_error)
  }
  for (;;) {
    if (likely(!__pyx_t_3)) {
      if (likely(PyList_CheckExact(__pyx_t_1))) {
        if (__pyx_t_2 >= PyList_GET_SIZE(__pyx_t_1)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_4 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(0, 279, __pyx_L1_error)
        #else
        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 279, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_4);
        #endif
      } else {
        if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break;
        #if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
        __pyx_t_4 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_4); __pyx_t_2++; if (unlikely(0 < 0)) __PYX_ERR(0, 279, __pyx_L1_error)
        #else
        __pyx_t_4 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 279, __pyx_L1_error)
        __Pyx_GOTREF(__pyx_t_4);
        #endif
      }
    } else {
      __pyx_t_4 = __pyx_t_3(__pyx_t_1);
      if (unlikely(!__pyx_t_4)) {
        PyObject* exc_type = PyErr_Occurred();
        if (exc_type) {
          if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear();
          else __PYX_ERR(0, 279, __pyx_L1_error)
        }
        break;
      }
      __Pyx_GOTREF(__pyx_t_4);
    }
    __Pyx_XGOTREF(__pyx_cur_scope->__pyx_v_v);
    __Pyx_XDECREF_SET(__pyx_cur_scope->__pyx_v_v, __pyx_t_4);
    __Pyx_GIVEREF(__pyx_t_4);
    __pyx_t_4 = 0;
    if (unlikely(!__pyx_cur_scope->__pyx_outer_scope->__pyx_v_value)) { __Pyx_RaiseClosureNameError("value"); __PYX_ERR(0, 279, __pyx_L1_error) }
    __pyx_t_4 = PyObject_RichCompare(__pyx_cur_scope->__pyx_v_v, __pyx_cur_scope->__pyx_outer_scope->__pyx_v_value, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 279, __pyx_L1_error)
    __pyx_t_5 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_5 < 0)) __PYX_ERR(0, 279, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    if (__pyx_t_5) {
      __Pyx_INCREF(__pyx_int_1);
      __pyx_r = __pyx_int_1;
      __Pyx_XGIVEREF(__pyx_t_1);
      __pyx_cur_scope->__pyx_t_0 = __pyx_t_1;
      __pyx_cur_scope->__pyx_t_1 = __pyx_t_2;
      __pyx_cur_scope->__pyx_t_2 = __pyx_t_3;
      __Pyx_XGIVEREF(__pyx_r);
      __Pyx_RefNannyFinishContext();
      /* return from generator, yielding value */
      __pyx_generator->resume_label = 1;
      return __pyx_r;
      __pyx_L7_resume_from_yield:;
      __pyx_t_1 = __pyx_cur_scope->__pyx_t_0;
      __pyx_cur_scope->__pyx_t_0 = 0;
      __Pyx_XGOTREF(__pyx_t_1);
      __pyx_t_2 = __pyx_cur_scope->__pyx_t_1;
      __pyx_t_3 = __pyx_cur_scope->__pyx_t_2;
      if (unlikely(!__pyx_sent_value)) __PYX_ERR(0, 279, __pyx_L1_error)
    }
  }
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  CYTHON_MAYBE_UNUSED_VAR(__pyx_cur_scope);

  /* function exit code */
  PyErr_SetNone(PyExc_StopIteration);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_AddTraceback("genexpr", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_L0:;
  __Pyx_XDECREF(__pyx_r); __pyx_r = 0;
  __pyx_generator->resume_label = -1;
  __Pyx_Coroutine_clear((PyObject*)__pyx_generator);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":270
 *         raise ValueError
 * 
 *     def count(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.count(value) -> integer -- return number of occurrences of
 */

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_19count(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_value) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *__pyx_cur_scope;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  __Pyx_RefNannySetupContext("count", 0);
  __pyx_cur_scope = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_1_count(__pyx_ptype_8daedalus_5_maze___pyx_scope_struct_1_count, __pyx_empty_tuple, NULL);
  if (unlikely(!__pyx_cur_scope)) {
    __pyx_cur_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)Py_None);
    __Pyx_INCREF(Py_None);
    __PYX_ERR(0, 270, __pyx_L1_error)
  } else {
    __Pyx_GOTREF(__pyx_cur_scope);
  }
  __pyx_cur_scope->__pyx_v_self = __pyx_v_self;
  __Pyx_INCREF((PyObject *)__pyx_cur_scope->__pyx_v_self);
  __Pyx_GIVEREF((PyObject *)__pyx_cur_scope->__pyx_v_self);
  __pyx_cur_scope->__pyx_v_value = __pyx_v_value;
  __Pyx_INCREF(__pyx_cur_scope->__pyx_v_value);
  __Pyx_GIVEREF(__pyx_cur_scope->__pyx_v_value);

  /* "daedalus/_maze.pyx":279
 *         :rtype: int
 *         '''
 *         return sum(1 for v in self if v == value)             # <<<<<<<<<<<<<<
 * 
 *     @property
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_1 = __pyx_pf_8daedalus_5_maze_4Maze_5count_genexpr(((PyObject*)__pyx_cur_scope)); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 279, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 279, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __Pyx_GIVEREF(__pyx_t_1);
  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);
  __pyx_t_1 = 0;
  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_sum, __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 279, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __pyx_r = __pyx_t_1;
  __pyx_t_1 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":270
 *         raise ValueError
 * 
 *     def count(self, value):             # <<<<<<<<<<<<<<
 *         '''
 *         S.count(value) -> integer -- return number of occurrences of
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_AddTraceback("daedalus._maze.Maze.count", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_DECREF(((PyObject *)__pyx_cur_scope));
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":282
 * 
 *     @property
 *     def width(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's width.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_5width_1__get__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_5width_1__get__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__get__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_5width___get__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_5width___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  PyObject *__pyx_t_2 = NULL;
  __Pyx_RefNannySetupContext("__get__", 0);

  /* "daedalus/_maze.pyx":286
 *         Returns this Maze's width.
 *         '''
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             return 0
 *         return self._maze.m_x
 */
  __pyx_t_1 = ((__pyx_v_self->_maze == NULL) != 0);
  if (__pyx_t_1) {

    /* "daedalus/_maze.pyx":287
 *         '''
 *         if self._maze is NULL:
 *             return 0             # <<<<<<<<<<<<<<
 *         return self._maze.m_x
 * 
 */
    __Pyx_XDECREF(__pyx_r);
    __Pyx_INCREF(__pyx_int_0);
    __pyx_r = __pyx_int_0;
    goto __pyx_L0;

    /* "daedalus/_maze.pyx":286
 *         Returns this Maze's width.
 *         '''
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             return 0
 *         return self._maze.m_x
 */
  }

  /* "daedalus/_maze.pyx":288
 *         if self._maze is NULL:
 *             return 0
 *         return self._maze.m_x             # <<<<<<<<<<<<<<
 * 
 *     @property
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_self->_maze->m_x); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 288, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_r = __pyx_t_2;
  __pyx_t_2 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":282
 * 
 *     @property
 *     def width(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's width.
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_AddTraceback("daedalus._maze.Maze.width.__get__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":291
 * 
 *     @property
 *     def height(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's height.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_6height_1__get__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_6height_1__get__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__get__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_6height___get__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_6height___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  PyObject *__pyx_t_2 = NULL;
  __Pyx_RefNannySetupContext("__get__", 0);

  /* "daedalus/_maze.pyx":295
 *         Returns this Maze's height.
 *         '''
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             return 0
 *         return self._maze.m_y
 */
  __pyx_t_1 = ((__pyx_v_self->_maze == NULL) != 0);
  if (__pyx_t_1) {

    /* "daedalus/_maze.pyx":296
 *         '''
 *         if self._maze is NULL:
 *             return 0             # <<<<<<<<<<<<<<
 *         return self._maze.m_y
 * 
 */
    __Pyx_XDECREF(__pyx_r);
    __Pyx_INCREF(__pyx_int_0);
    __pyx_r = __pyx_int_0;
    goto __pyx_L0;

    /* "daedalus/_maze.pyx":295
 *         Returns this Maze's height.
 *         '''
 *         if self._maze is NULL:             # <<<<<<<<<<<<<<
 *             return 0
 *         return self._maze.m_y
 */
  }

  /* "daedalus/_maze.pyx":297
 *         if self._maze is NULL:
 *             return 0
 *         return self._maze.m_y             # <<<<<<<<<<<<<<
 * 
 *     @property
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_self->_maze->m_y); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 297, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_r = __pyx_t_2;
  __pyx_t_2 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":291
 * 
 *     @property
 *     def height(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's height.
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_AddTraceback("daedalus._maze.Maze.height.__get__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":300
 * 
 *     @property
 *     def entrance(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's entrance location as a tuple (x,y).
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_8entrance_1__get__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_8entrance_1__get__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__get__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_8entrance___get__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_8entrance___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  PyObject *__pyx_t_3 = NULL;
  __Pyx_RefNannySetupContext("__get__", 0);

  /* "daedalus/_maze.pyx":304
 *         Returns this Maze's entrance location as a tuple (x,y).
 *         '''
 *         return (self._xEntrance, self._yEntrance)             # <<<<<<<<<<<<<<
 * 
 *     @property
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_self->_xEntrance); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 304, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_self->_yEntrance); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 304, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_t_3 = PyTuple_New(2); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 304, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __Pyx_GIVEREF(__pyx_t_1);
  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1);
  __Pyx_GIVEREF(__pyx_t_2);
  PyTuple_SET_ITEM(__pyx_t_3, 1, __pyx_t_2);
  __pyx_t_1 = 0;
  __pyx_t_2 = 0;
  __pyx_r = __pyx_t_3;
  __pyx_t_3 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":300
 * 
 *     @property
 *     def entrance(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's entrance location as a tuple (x,y).
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_AddTraceback("daedalus._maze.Maze.entrance.__get__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":307
 * 
 *     @property
 *     def exit(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's exit location as a tuple (x,y).
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_4exit_1__get__(PyObject *__pyx_v_self); /*proto*/
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_4exit_1__get__(PyObject *__pyx_v_self) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__get__ (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_4exit___get__(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_4exit___get__(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  PyObject *__pyx_t_3 = NULL;
  __Pyx_RefNannySetupContext("__get__", 0);

  /* "daedalus/_maze.pyx":311
 *         Returns this Maze's exit location as a tuple (x,y).
 *         '''
 *         return (self._xExit, self._yExit)             # <<<<<<<<<<<<<<
 * 
 *     def get(self, x, y):
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_self->_xExit); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 311, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_self->_yExit); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 311, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_t_3 = PyTuple_New(2); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 311, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __Pyx_GIVEREF(__pyx_t_1);
  PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1);
  __Pyx_GIVEREF(__pyx_t_2);
  PyTuple_SET_ITEM(__pyx_t_3, 1, __pyx_t_2);
  __pyx_t_1 = 0;
  __pyx_t_2 = 0;
  __pyx_r = __pyx_t_3;
  __pyx_t_3 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":307
 * 
 *     @property
 *     def exit(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Returns this Maze's exit location as a tuple (x,y).
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_AddTraceback("daedalus._maze.Maze.exit.__get__", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":313
 *         return (self._xExit, self._yExit)
 * 
 *     def get(self, x, y):             # <<<<<<<<<<<<<<
 *         '''
 *         Gets the monochrome pixel value at the coordinate (x,y) on this
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_22get(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_21get[] = "\n        Gets the monochrome pixel value at the coordinate (x,y) on this\n        Maze.\n\n        :param int x: The x-coordinate of the pixel to get\n        :param int y: The y-coordinate of the pixel to get\n        :return: True if the given pixel is on, False if it is off.\n        :rtype: bool\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_22get(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_x = 0;
  PyObject *__pyx_v_y = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("get (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_x,&__pyx_n_s_y,0};
    PyObject* values[2] = {0,0};
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_x)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_y)) != 0)) kw_args--;
        else {
          __Pyx_RaiseArgtupleInvalid("get", 1, 2, 2, 1); __PYX_ERR(0, 313, __pyx_L3_error)
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "get") < 0)) __PYX_ERR(0, 313, __pyx_L3_error)
      }
    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {
      goto __pyx_L5_argtuple_error;
    } else {
      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
    }
    __pyx_v_x = values[0];
    __pyx_v_y = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("get", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 313, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.get", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_21get(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_x, __pyx_v_y);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_21get(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_x, PyObject *__pyx_v_y) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  PyObject *__pyx_t_2 = NULL;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  unsigned int __pyx_t_5;
  unsigned int __pyx_t_6;
  __Pyx_RefNannySetupContext("get", 0);

  /* "daedalus/_maze.pyx":323
 *         :rtype: bool
 *         '''
 *         if x < 0 or self.width <= x:             # <<<<<<<<<<<<<<
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:
 */
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_x, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 323, __pyx_L1_error)
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 323, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (!__pyx_t_3) {
  } else {
    __pyx_t_1 = __pyx_t_3;
    goto __pyx_L4_bool_binop_done;
  }
  __pyx_t_2 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_width); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 323, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_t_4 = PyObject_RichCompare(__pyx_t_2, __pyx_v_x, Py_LE); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 323, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 323, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __pyx_t_1 = __pyx_t_3;
  __pyx_L4_bool_binop_done:;
  if (__pyx_t_1) {

    /* "daedalus/_maze.pyx":324
 *         '''
 *         if x < 0 or self.width <= x:
 *             raise IndexError('x coordinate out of range')             # <<<<<<<<<<<<<<
 *         if y < 0 or self.height <= y:
 *             raise IndexError('y coordinate out of range')
 */
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_IndexError, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 324, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_Raise(__pyx_t_4, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __PYX_ERR(0, 324, __pyx_L1_error)

    /* "daedalus/_maze.pyx":323
 *         :rtype: bool
 *         '''
 *         if x < 0 or self.width <= x:             # <<<<<<<<<<<<<<
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:
 */
  }

  /* "daedalus/_maze.pyx":325
 *         if x < 0 or self.width <= x:
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:             # <<<<<<<<<<<<<<
 *             raise IndexError('y coordinate out of range')
 *         return cpp_Get(self._maze, x, y)
 */
  __pyx_t_4 = PyObject_RichCompare(__pyx_v_y, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 325, __pyx_L1_error)
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 325, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  if (!__pyx_t_3) {
  } else {
    __pyx_t_1 = __pyx_t_3;
    goto __pyx_L7_bool_binop_done;
  }
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_height); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 325, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_2 = PyObject_RichCompare(__pyx_t_4, __pyx_v_y, Py_LE); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 325, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 325, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __pyx_t_1 = __pyx_t_3;
  __pyx_L7_bool_binop_done:;
  if (__pyx_t_1) {

    /* "daedalus/_maze.pyx":326
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:
 *             raise IndexError('y coordinate out of range')             # <<<<<<<<<<<<<<
 *         return cpp_Get(self._maze, x, y)
 * 
 */
    __pyx_t_2 = __Pyx_PyObject_Call(__pyx_builtin_IndexError, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 326, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __Pyx_Raise(__pyx_t_2, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __PYX_ERR(0, 326, __pyx_L1_error)

    /* "daedalus/_maze.pyx":325
 *         if x < 0 or self.width <= x:
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:             # <<<<<<<<<<<<<<
 *             raise IndexError('y coordinate out of range')
 *         return cpp_Get(self._maze, x, y)
 */
  }

  /* "daedalus/_maze.pyx":327
 *         if y < 0 or self.height <= y:
 *             raise IndexError('y coordinate out of range')
 *         return cpp_Get(self._maze, x, y)             # <<<<<<<<<<<<<<
 * 
 *     def create_perfect(self,
 */
  __Pyx_XDECREF(__pyx_r);
  __pyx_t_5 = __Pyx_PyInt_As_unsigned_int(__pyx_v_x); if (unlikely((__pyx_t_5 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 327, __pyx_L1_error)
  __pyx_t_6 = __Pyx_PyInt_As_unsigned_int(__pyx_v_y); if (unlikely((__pyx_t_6 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 327, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyBool_FromLong(cpp_Get(__pyx_v_self->_maze, __pyx_t_5, __pyx_t_6)); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 327, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_r = __pyx_t_2;
  __pyx_t_2 = 0;
  goto __pyx_L0;

  /* "daedalus/_maze.pyx":313
 *         return (self._xExit, self._yExit)
 * 
 *     def get(self, x, y):             # <<<<<<<<<<<<<<
 *         '''
 *         Gets the monochrome pixel value at the coordinate (x,y) on this
 */

  /* function exit code */
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_AddTraceback("daedalus._maze.Maze.get", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":329
 *         return cpp_Get(self._maze, x, y)
 * 
 *     def create_perfect(self,             # <<<<<<<<<<<<<<
 *                        fRiver=True,
 *                        fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_24create_perfect(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_23create_perfect[] = "\n        Overwrites the contents of this Maze to create a perfect maze\n        using the Hunt and Kill algorithm.\n\n        Create a new perfect Maze in the bitmap using the Hunt and\n        Kill algorithm, by carving passages.\n\n        :param bool fRiver: If set, creates a Maze with a relatively\n            high \"river\" factor (with relatively longer passages between\n            junctions and fewer but longer dead ends).  Defaults to True.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_24create_perfect(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fRiver = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_perfect (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fRiver,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[3] = {0,0,0};

    /* "daedalus/_maze.pyx":330
 * 
 *     def create_perfect(self,
 *                        fRiver=True,             # <<<<<<<<<<<<<<
 *                        fTreeWall=False,
 *                        nEntrancePos=ENTRANCE_RANDOM):
 */
    values[0] = ((PyObject *)Py_True);

    /* "daedalus/_maze.pyx":331
 *     def create_perfect(self,
 *                        fRiver=True,
 *                        fTreeWall=False,             # <<<<<<<<<<<<<<
 *                        nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[1] = ((PyObject *)Py_False);
    values[2] = __pyx_k__7;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fRiver);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[2] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_perfect") < 0)) __PYX_ERR(0, 329, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fRiver = values[0];
    __pyx_v_fTreeWall = values[1];
    __pyx_v_nEntrancePos = values[2];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_perfect", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 329, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_perfect", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_23create_perfect(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fRiver, __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":329
 *         return cpp_Get(self._maze, x, y)
 * 
 *     def create_perfect(self,             # <<<<<<<<<<<<<<
 *                        fRiver=True,
 *                        fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_23create_perfect(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  bool __pyx_t_2;
  int __pyx_t_3;
  int __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  __Pyx_RefNannySetupContext("create_perfect", 0);

  /* "daedalus/_maze.pyx":356
 *         '''
 *         if not cpp_CreateMazePerfect(self._maze,
 *                                      fRiver,             # <<<<<<<<<<<<<<
 *                                      True,
 *                                      True,
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fRiver); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 356, __pyx_L1_error)

  /* "daedalus/_maze.pyx":360
 *                                      True,
 *                                      False,
 *                                      fTreeWall,             # <<<<<<<<<<<<<<
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Perfect Maze.')
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 360, __pyx_L1_error)

  /* "daedalus/_maze.pyx":361
 *                                      False,
 *                                      fTreeWall,
 *                                      nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Perfect Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_3 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_3 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 361, __pyx_L1_error)

  /* "daedalus/_maze.pyx":355
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePerfect(self._maze,             # <<<<<<<<<<<<<<
 *                                      fRiver,
 *                                      True,
 */
  __pyx_t_4 = ((!(cpp_CreateMazePerfect(__pyx_v_self->_maze, __pyx_t_1, 1, 1, 0, __pyx_t_2, __pyx_t_3) != 0)) != 0);
  if (__pyx_t_4) {

    /* "daedalus/_maze.pyx":362
 *                                      fTreeWall,
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Perfect Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 362, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 362, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_Raise(__pyx_t_6, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __PYX_ERR(0, 362, __pyx_L1_error)

    /* "daedalus/_maze.pyx":355
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePerfect(self._maze,             # <<<<<<<<<<<<<<
 *                                      fRiver,
 *                                      True,
 */
  }

  /* "daedalus/_maze.pyx":363
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Perfect Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_perfect2(self,
 */
  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 363, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_5);
  __pyx_t_7 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {
    __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);
    if (likely(__pyx_t_7)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);
      __Pyx_INCREF(__pyx_t_7);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_5, function);
    }
  }
  if (__pyx_t_7) {
    __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 363, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
  } else {
    __pyx_t_6 = __Pyx_PyObject_CallNoArg(__pyx_t_5); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 363, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_6);
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;

  /* "daedalus/_maze.pyx":329
 *         return cpp_Get(self._maze, x, y)
 * 
 *     def create_perfect(self,             # <<<<<<<<<<<<<<
 *                        fRiver=True,
 *                        fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_perfect", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":365
 *         self._store_back_globals()
 * 
 *     def create_perfect2(self,             # <<<<<<<<<<<<<<
 *                         fRiver=True,
 *                         nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_26create_perfect2(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_25create_perfect2[] = "\n        Overwrites the contents of this Maze to create a Perfect2 maze.\n\n        Create a new perfect Maze in the bitmap using the Hunt and\n        Kill algorithm, by adding walls.\n\n        :param bool fRiver: If set, creates a Maze with a relatively\n            high \"river\" factor (with relatively longer passages between\n            junctions and fewer but longer dead ends).  Defaults to True.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_26create_perfect2(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fRiver = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_perfect2 (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fRiver,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":366
 * 
 *     def create_perfect2(self,
 *                         fRiver=True,             # <<<<<<<<<<<<<<
 *                         nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_True);
    values[1] = __pyx_k__9;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fRiver);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_perfect2") < 0)) __PYX_ERR(0, 365, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fRiver = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_perfect2", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 365, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_perfect2", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_25create_perfect2(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fRiver, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":365
 *         self._store_back_globals()
 * 
 *     def create_perfect2(self,             # <<<<<<<<<<<<<<
 *                         fRiver=True,
 *                         nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_25create_perfect2(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_perfect2", 0);

  /* "daedalus/_maze.pyx":387
 *         '''
 *         if not cpp_CreateMazePerfect2(self._maze,
 *                                       fRiver,             # <<<<<<<<<<<<<<
 *                                       False,
 *                                       nEntrancePos):
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fRiver); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 387, __pyx_L1_error)

  /* "daedalus/_maze.pyx":389
 *                                       fRiver,
 *                                       False,
 *                                       nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Perfect2 Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 389, __pyx_L1_error)

  /* "daedalus/_maze.pyx":386
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePerfect2(self._maze,             # <<<<<<<<<<<<<<
 *                                       fRiver,
 *                                       False,
 */
  __pyx_t_3 = ((!(cpp_CreateMazePerfect2(__pyx_v_self->_maze, __pyx_t_1, 0, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":390
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Perfect2 Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 390, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__10, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 390, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 390, __pyx_L1_error)

    /* "daedalus/_maze.pyx":386
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePerfect2(self._maze,             # <<<<<<<<<<<<<<
 *                                       fRiver,
 *                                       False,
 */
  }

  /* "daedalus/_maze.pyx":391
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Perfect2 Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_braid(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 391, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 391, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 391, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":365
 *         self._store_back_globals()
 * 
 *     def create_perfect2(self,             # <<<<<<<<<<<<<<
 *                         fRiver=True,
 *                         nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_perfect2", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":393
 *         self._store_back_globals()
 * 
 *     def create_braid(self,             # <<<<<<<<<<<<<<
 *                      nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_28create_braid(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_27create_braid[] = "\n        Overwrites the contents of this Maze to create a Braid maze.\n\n        Create a new braid Maze in the bitmap, i.e. a Maze without any\n        dead ends, using a wall adding algorithm.\n\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_28create_braid(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_braid (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nEntrancePos,0};
    PyObject* values[1] = {0};
    values[0] = __pyx_k__11;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[0] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_braid") < 0)) __PYX_ERR(0, 393, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_nEntrancePos = values[0];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_braid", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 393, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_27create_braid(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_27create_braid(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("create_braid", 0);

  /* "daedalus/_maze.pyx":412
 *         if not cpp_CreateMazeBraid(self._maze,
 *                                    False,
 *                                    nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Braid Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 412, __pyx_L1_error)

  /* "daedalus/_maze.pyx":410
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraid(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    nEntrancePos):
 */
  __pyx_t_2 = ((!(cpp_CreateMazeBraid(__pyx_v_self->_maze, 0, __pyx_t_1) != 0)) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":413
 *                                    False,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Braid Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 413, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__12, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 413, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_Raise(__pyx_t_4, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __PYX_ERR(0, 413, __pyx_L1_error)

    /* "daedalus/_maze.pyx":410
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraid(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    nEntrancePos):
 */
  }

  /* "daedalus/_maze.pyx":414
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Braid Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_braid_tilt(self,
 */
  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 414, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_5 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_3))) {
    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);
    if (likely(__pyx_t_5)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);
      __Pyx_INCREF(__pyx_t_5);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_3, function);
    }
  }
  if (__pyx_t_5) {
    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 414, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  } else {
    __pyx_t_4 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 414, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_4);
  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;

  /* "daedalus/_maze.pyx":393
 *         self._store_back_globals()
 * 
 *     def create_braid(self,             # <<<<<<<<<<<<<<
 *                      nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":416
 *         self._store_back_globals()
 * 
 *     def create_braid_tilt(self,             # <<<<<<<<<<<<<<
 *                           fTiltDiamond=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_30create_braid_tilt(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_29create_braid_tilt[] = "\n        Overwrites the contents of this Maze to create a BraidTilt maze.\n\n        Create a new braid Maze in the bitmap using a binary\n        algorithm, i.e.  starting with a template based on the Tilt\n        Maze pattern.\n\n        :param bool fTiltDiamond: defaults to False\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_30create_braid_tilt(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTiltDiamond = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_braid_tilt (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTiltDiamond,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":417
 * 
 *     def create_braid_tilt(self,
 *                           fTiltDiamond=False,             # <<<<<<<<<<<<<<
 *                           nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__13;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTiltDiamond);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_braid_tilt") < 0)) __PYX_ERR(0, 416, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTiltDiamond = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_braid_tilt", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 416, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid_tilt", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_29create_braid_tilt(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTiltDiamond, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":416
 *         self._store_back_globals()
 * 
 *     def create_braid_tilt(self,             # <<<<<<<<<<<<<<
 *                           fTiltDiamond=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_29create_braid_tilt(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTiltDiamond, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_braid_tilt", 0);

  /* "daedalus/_maze.pyx":438
 *         if not cpp_CreateMazeBraidTilt(self._maze,
 *                                        False,
 *                                        fTiltDiamond,             # <<<<<<<<<<<<<<
 *                                        nEntrancePos):
 *             raise MazeError('Could not create BraidTilt Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTiltDiamond); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 438, __pyx_L1_error)

  /* "daedalus/_maze.pyx":439
 *                                        False,
 *                                        fTiltDiamond,
 *                                        nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create BraidTilt Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 439, __pyx_L1_error)

  /* "daedalus/_maze.pyx":436
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraidTilt(self._maze,             # <<<<<<<<<<<<<<
 *                                        False,
 *                                        fTiltDiamond,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeBraidTilt(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":440
 *                                        fTiltDiamond,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create BraidTilt Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 440, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__14, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 440, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 440, __pyx_L1_error)

    /* "daedalus/_maze.pyx":436
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraidTilt(self._maze,             # <<<<<<<<<<<<<<
 *                                        False,
 *                                        fTiltDiamond,
 */
  }

  /* "daedalus/_maze.pyx":441
 *                                        nEntrancePos):
 *             raise MazeError('Could not create BraidTilt Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_spiral(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 441, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 441, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 441, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":416
 *         self._store_back_globals()
 * 
 *     def create_braid_tilt(self,             # <<<<<<<<<<<<<<
 *                           fTiltDiamond=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid_tilt", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":443
 *         self._store_back_globals()
 * 
 *     def create_spiral(self,             # <<<<<<<<<<<<<<
 *                       cRandomAdd=0,
 *                       cSpiral=15,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_32create_spiral(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_31create_spiral[] = "\n        Overwrites the contents of this Maze to create a Spiral maze.\n\n        Create a new spiral Maze in the bitmap, formed of interlocking\n        spirals.\n\n        :param int cRandomAdd: The number of random walls and passages\n            to add to the maze.  A high number will make the maze more\n            random and less like its base design, while a large negative\n            number will make the maze be its base design with longer\n            passages and dead ends.  Defaults to 0.\n        :param int cSpiral: The maximum number of spirals that can be\n            drawn at once.  Larger numbers make the maze have many\n            smaller spirals; smaller number make the maze have fewer,\n            larger spirals.  Defaults to 15.\n        :param int cSpiralWall: The maximum number of walls that can\n            be drawn at once around each spiral.  Larger numbers make\n            spirals have many passages that rapidly spiral away from\n            the centre, while smaller values make spirals with fewer\n            passages that go around the centre more times. Defaults to\n            15.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_32create_spiral(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_cRandomAdd = 0;
  PyObject *__pyx_v_cSpiral = 0;
  PyObject *__pyx_v_cSpiralWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_spiral (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cRandomAdd,&__pyx_n_s_cSpiral,&__pyx_n_s_cSpiralWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[4] = {0,0,0,0};
    values[0] = ((PyObject *)__pyx_int_0);
    values[1] = ((PyObject *)__pyx_int_15);
    values[2] = ((PyObject *)__pyx_int_15);
    values[3] = __pyx_k__15;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cRandomAdd);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cSpiral);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cSpiralWall);
          if (value) { values[2] = value; kw_args--; }
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[3] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_spiral") < 0)) __PYX_ERR(0, 443, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_cRandomAdd = values[0];
    __pyx_v_cSpiral = values[1];
    __pyx_v_cSpiralWall = values[2];
    __pyx_v_nEntrancePos = values[3];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_spiral", 0, 0, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 443, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_spiral", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_31create_spiral(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_cRandomAdd, __pyx_v_cSpiral, __pyx_v_cSpiralWall, __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_31create_spiral(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_cSpiral, PyObject *__pyx_v_cSpiralWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  int __pyx_t_4;
  int __pyx_t_5;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  __Pyx_RefNannySetupContext("create_spiral", 0);

  /* "daedalus/_maze.pyx":479
 *         '''
 *         if not cpp_CreateMazeSpiral(self._maze,
 *                                     cRandomAdd,             # <<<<<<<<<<<<<<
 *                                     cSpiral,
 *                                     cSpiralWall,
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_cRandomAdd); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 479, __pyx_L1_error)

  /* "daedalus/_maze.pyx":480
 *         if not cpp_CreateMazeSpiral(self._maze,
 *                                     cRandomAdd,
 *                                     cSpiral,             # <<<<<<<<<<<<<<
 *                                     cSpiralWall,
 *                                     False,
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_cSpiral); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 480, __pyx_L1_error)

  /* "daedalus/_maze.pyx":481
 *                                     cRandomAdd,
 *                                     cSpiral,
 *                                     cSpiralWall,             # <<<<<<<<<<<<<<
 *                                     False,
 *                                     nEntrancePos):
 */
  __pyx_t_3 = __Pyx_PyInt_As_int(__pyx_v_cSpiralWall); if (unlikely((__pyx_t_3 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 481, __pyx_L1_error)

  /* "daedalus/_maze.pyx":483
 *                                     cSpiralWall,
 *                                     False,
 *                                     nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Spiral Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 483, __pyx_L1_error)

  /* "daedalus/_maze.pyx":478
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeSpiral(self._maze,             # <<<<<<<<<<<<<<
 *                                     cRandomAdd,
 *                                     cSpiral,
 */
  __pyx_t_5 = ((!(cpp_CreateMazeSpiral(__pyx_v_self->_maze, __pyx_t_1, __pyx_t_2, __pyx_t_3, 0, __pyx_t_4) != 0)) != 0);
  if (__pyx_t_5) {

    /* "daedalus/_maze.pyx":484
 *                                     False,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Spiral Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 484, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_tuple__16, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 484, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_7);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __Pyx_Raise(__pyx_t_7, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    __PYX_ERR(0, 484, __pyx_L1_error)

    /* "daedalus/_maze.pyx":478
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeSpiral(self._maze,             # <<<<<<<<<<<<<<
 *                                     cRandomAdd,
 *                                     cSpiral,
 */
  }

  /* "daedalus/_maze.pyx":485
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Spiral Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_diagonal(self,
 */
  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 485, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_8 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {
    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);
    if (likely(__pyx_t_8)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_6, function);
    }
  }
  if (__pyx_t_8) {
    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 485, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
  } else {
    __pyx_t_7 = __Pyx_PyObject_CallNoArg(__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 485, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_7);
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;

  /* "daedalus/_maze.pyx":443
 *         self._store_back_globals()
 * 
 *     def create_spiral(self,             # <<<<<<<<<<<<<<
 *                       cRandomAdd=0,
 *                       cSpiral=15,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_spiral", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":487
 *         self._store_back_globals()
 * 
 *     def create_diagonal(self,             # <<<<<<<<<<<<<<
 *                         cRandomAdd=0,
 *                         nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_34create_diagonal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_33create_diagonal[] = "\n        Overwrites the contents of this Maze to create a Diagonal maze.\n\n        Create a Maze with a diagonal bias, where many walls look like\n        stairs.\n\n        :param int cRandomAdd: The number of random walls and passages\n            to add to the maze.  A high number will make the maze more\n            random and less like its base design, while a large negative\n            number will make the maze be its base design with longer\n            passages and dead ends.  Defaults to 0.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_34create_diagonal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_cRandomAdd = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_diagonal (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cRandomAdd,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};
    values[0] = ((PyObject *)__pyx_int_0);
    values[1] = __pyx_k__17;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cRandomAdd);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_diagonal") < 0)) __PYX_ERR(0, 487, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_cRandomAdd = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_diagonal", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 487, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_diagonal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_33create_diagonal(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_cRandomAdd, __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_33create_diagonal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_diagonal", 0);

  /* "daedalus/_maze.pyx":511
 *         '''
 *         if not cpp_CreateMazeDiagonal(self._maze,
 *                                       cRandomAdd,             # <<<<<<<<<<<<<<
 *                                       False,
 *                                       nEntrancePos):
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_cRandomAdd); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 511, __pyx_L1_error)

  /* "daedalus/_maze.pyx":513
 *                                       cRandomAdd,
 *                                       False,
 *                                       nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Diagonal Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 513, __pyx_L1_error)

  /* "daedalus/_maze.pyx":510
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeDiagonal(self._maze,             # <<<<<<<<<<<<<<
 *                                       cRandomAdd,
 *                                       False,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeDiagonal(__pyx_v_self->_maze, __pyx_t_1, 0, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":514
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Diagonal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 514, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__18, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 514, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 514, __pyx_L1_error)

    /* "daedalus/_maze.pyx":510
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeDiagonal(self._maze,             # <<<<<<<<<<<<<<
 *                                       cRandomAdd,
 *                                       False,
 */
  }

  /* "daedalus/_maze.pyx":515
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Diagonal Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_recursive(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 515, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 515, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 515, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":487
 *         self._store_back_globals()
 * 
 *     def create_diagonal(self,             # <<<<<<<<<<<<<<
 *                         cRandomAdd=0,
 *                         nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_diagonal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":517
 *         self._store_back_globals()
 * 
 *     def create_recursive(self,             # <<<<<<<<<<<<<<
 *                          nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_36create_recursive(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_35create_recursive[] = "\n        Overwrites the contents of this Maze to create a Recursive maze.\n\n        Create a new perfect Maze in the bitmap using the Recursive\n        Backtracking algorithm. This carves passages.\n\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_36create_recursive(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_recursive (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nEntrancePos,0};
    PyObject* values[1] = {0};
    values[0] = __pyx_k__19;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[0] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_recursive") < 0)) __PYX_ERR(0, 517, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_nEntrancePos = values[0];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_recursive", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 517, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_recursive", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_35create_recursive(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_35create_recursive(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("create_recursive", 0);

  /* "daedalus/_maze.pyx":536
 *         if not cpp_CreateMazeRecursive(self._maze,
 *                                        False,
 *                                        nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Recursive Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 536, __pyx_L1_error)

  /* "daedalus/_maze.pyx":534
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeRecursive(self._maze,             # <<<<<<<<<<<<<<
 *                                        False,
 *                                        nEntrancePos):
 */
  __pyx_t_2 = ((!(cpp_CreateMazeRecursive(__pyx_v_self->_maze, 0, __pyx_t_1) != 0)) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":537
 *                                        False,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Recursive Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 537, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__20, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 537, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_Raise(__pyx_t_4, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __PYX_ERR(0, 537, __pyx_L1_error)

    /* "daedalus/_maze.pyx":534
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeRecursive(self._maze,             # <<<<<<<<<<<<<<
 *                                        False,
 *                                        nEntrancePos):
 */
  }

  /* "daedalus/_maze.pyx":538
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Recursive Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_prim(self,
 */
  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 538, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_5 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_3))) {
    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);
    if (likely(__pyx_t_5)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);
      __Pyx_INCREF(__pyx_t_5);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_3, function);
    }
  }
  if (__pyx_t_5) {
    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 538, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  } else {
    __pyx_t_4 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 538, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_4);
  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;

  /* "daedalus/_maze.pyx":517
 *         self._store_back_globals()
 * 
 *     def create_recursive(self,             # <<<<<<<<<<<<<<
 *                          nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_recursive", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":540
 *         self._store_back_globals()
 * 
 *     def create_prim(self,             # <<<<<<<<<<<<<<
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_38create_prim(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_37create_prim[] = "\n        Overwrites the contents of this Maze to create a Prim maze.\n\n        Create a new perfect Maze in the bitmap using a modified\n        version of Prim's algorithm. This can carve passages or add\n        walls.\n\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_38create_prim(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_prim (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":541
 * 
 *     def create_prim(self,
 *                     fTreeWall=False,             # <<<<<<<<<<<<<<
 *                     nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__21;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_prim") < 0)) __PYX_ERR(0, 540, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeWall = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_prim", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 540, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_prim", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_37create_prim(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":540
 *         self._store_back_globals()
 * 
 *     def create_prim(self,             # <<<<<<<<<<<<<<
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_37create_prim(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_prim", 0);

  /* "daedalus/_maze.pyx":564
 *         if not cpp_CreateMazePrim(self._maze,
 *                                   False,
 *                                   fTreeWall,             # <<<<<<<<<<<<<<
 *                                   nEntrancePos):
 *             raise MazeError('Could not create Prim Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 564, __pyx_L1_error)

  /* "daedalus/_maze.pyx":565
 *                                   False,
 *                                   fTreeWall,
 *                                   nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Prim Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 565, __pyx_L1_error)

  /* "daedalus/_maze.pyx":562
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePrim(self._maze,             # <<<<<<<<<<<<<<
 *                                   False,
 *                                   fTreeWall,
 */
  __pyx_t_3 = ((!(cpp_CreateMazePrim(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":566
 *                                   fTreeWall,
 *                                   nEntrancePos):
 *             raise MazeError('Could not create Prim Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 566, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__22, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 566, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 566, __pyx_L1_error)

    /* "daedalus/_maze.pyx":562
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePrim(self._maze,             # <<<<<<<<<<<<<<
 *                                   False,
 *                                   fTreeWall,
 */
  }

  /* "daedalus/_maze.pyx":567
 *                                   nEntrancePos):
 *             raise MazeError('Could not create Prim Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_prim2(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 567, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 567, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 567, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":540
 *         self._store_back_globals()
 * 
 *     def create_prim(self,             # <<<<<<<<<<<<<<
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_prim", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":569
 *         self._store_back_globals()
 * 
 *     def create_prim2(self,             # <<<<<<<<<<<<<<
 *                      fTreeRandom=True,
 *                      fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_40create_prim2(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_39create_prim2[] = "\n        Overwrites the contents of this Maze to create a Prim2 maze.\n\n        Create a new perfect Maze in the bitmap using full or\n        simplified versions of Prim's algorithm. This can carve\n        passages or add walls.\n\n        :param bool fTreeRandom: If False, the algorithm will tend to\n            create Mazes with long and windy solutions; if True, the\n            solution will tend to be shorter and more direct.\n            Defaults to True.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_40create_prim2(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeRandom = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_prim2 (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeRandom,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[3] = {0,0,0};

    /* "daedalus/_maze.pyx":570
 * 
 *     def create_prim2(self,
 *                      fTreeRandom=True,             # <<<<<<<<<<<<<<
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):
 */
    values[0] = ((PyObject *)Py_True);

    /* "daedalus/_maze.pyx":571
 *     def create_prim2(self,
 *                      fTreeRandom=True,
 *                      fTreeWall=False,             # <<<<<<<<<<<<<<
 *                      nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[1] = ((PyObject *)Py_False);
    values[2] = __pyx_k__23;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeRandom);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[2] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_prim2") < 0)) __PYX_ERR(0, 569, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeRandom = values[0];
    __pyx_v_fTreeWall = values[1];
    __pyx_v_nEntrancePos = values[2];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_prim2", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 569, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_prim2", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_39create_prim2(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeRandom, __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":569
 *         self._store_back_globals()
 * 
 *     def create_prim2(self,             # <<<<<<<<<<<<<<
 *                      fTreeRandom=True,
 *                      fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_39create_prim2(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  bool __pyx_t_2;
  int __pyx_t_3;
  int __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  __Pyx_RefNannySetupContext("create_prim2", 0);

  /* "daedalus/_maze.pyx":598
 *         if not cpp_CreateMazePrim2(self._maze,
 *                                    False,
 *                                    fTreeRandom,             # <<<<<<<<<<<<<<
 *                                    fTreeWall,
 *                                    nEntrancePos):
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeRandom); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 598, __pyx_L1_error)

  /* "daedalus/_maze.pyx":599
 *                                    False,
 *                                    fTreeRandom,
 *                                    fTreeWall,             # <<<<<<<<<<<<<<
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Prim2 Maze.')
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 599, __pyx_L1_error)

  /* "daedalus/_maze.pyx":600
 *                                    fTreeRandom,
 *                                    fTreeWall,
 *                                    nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Prim2 Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_3 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_3 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 600, __pyx_L1_error)

  /* "daedalus/_maze.pyx":596
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePrim2(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    fTreeRandom,
 */
  __pyx_t_4 = ((!(cpp_CreateMazePrim2(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2, __pyx_t_3) != 0)) != 0);
  if (__pyx_t_4) {

    /* "daedalus/_maze.pyx":601
 *                                    fTreeWall,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Prim2 Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 601, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_tuple__24, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 601, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_Raise(__pyx_t_6, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __PYX_ERR(0, 601, __pyx_L1_error)

    /* "daedalus/_maze.pyx":596
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazePrim2(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    fTreeRandom,
 */
  }

  /* "daedalus/_maze.pyx":602
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Prim2 Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_kruskal(self, fClear, c2, c3,
 */
  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 602, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_5);
  __pyx_t_7 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {
    __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);
    if (likely(__pyx_t_7)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);
      __Pyx_INCREF(__pyx_t_7);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_5, function);
    }
  }
  if (__pyx_t_7) {
    __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 602, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
  } else {
    __pyx_t_6 = __Pyx_PyObject_CallNoArg(__pyx_t_5); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 602, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_6);
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;

  /* "daedalus/_maze.pyx":569
 *         self._store_back_globals()
 * 
 *     def create_prim2(self,             # <<<<<<<<<<<<<<
 *                      fTreeRandom=True,
 *                      fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_prim2", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":604
 *         self._store_back_globals()
 * 
 *     def create_kruskal(self, fClear, c2, c3,             # <<<<<<<<<<<<<<
 *                        fKruskalPic=False,
 *                        fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_42create_kruskal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_41create_kruskal[] = "\n        Overwrites the contents of this Maze to create a Kruskal maze.\n\n        Create a new perfect Maze in the bitmap using Kruskal's\n        algorithm. This can carve passages or add walls.\n\n        :param bool fKruskalPic: defaults to False\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_42create_kruskal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fClear = 0;
  CYTHON_UNUSED PyObject *__pyx_v_c2 = 0;
  CYTHON_UNUSED PyObject *__pyx_v_c3 = 0;
  PyObject *__pyx_v_fKruskalPic = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_kruskal (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fClear,&__pyx_n_s_c2,&__pyx_n_s_c3,&__pyx_n_s_fKruskalPic,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[6] = {0,0,0,0,0,0};

    /* "daedalus/_maze.pyx":605
 * 
 *     def create_kruskal(self, fClear, c2, c3,
 *                        fKruskalPic=False,             # <<<<<<<<<<<<<<
 *                        fTreeWall=False,
 *                        nEntrancePos=ENTRANCE_RANDOM):
 */
    values[3] = ((PyObject *)Py_False);

    /* "daedalus/_maze.pyx":606
 *     def create_kruskal(self, fClear, c2, c3,
 *                        fKruskalPic=False,
 *                        fTreeWall=False,             # <<<<<<<<<<<<<<
 *                        nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[4] = ((PyObject *)Py_False);
    values[5] = __pyx_k__25;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);
        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fClear)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_c2)) != 0)) kw_args--;
        else {
          __Pyx_RaiseArgtupleInvalid("create_kruskal", 0, 3, 6, 1); __PYX_ERR(0, 604, __pyx_L3_error)
        }
        case  2:
        if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_c3)) != 0)) kw_args--;
        else {
          __Pyx_RaiseArgtupleInvalid("create_kruskal", 0, 3, 6, 2); __PYX_ERR(0, 604, __pyx_L3_error)
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fKruskalPic);
          if (value) { values[3] = value; kw_args--; }
        }
        case  4:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[4] = value; kw_args--; }
        }
        case  5:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[5] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_kruskal") < 0)) __PYX_ERR(0, 604, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);
        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fClear = values[0];
    __pyx_v_c2 = values[1];
    __pyx_v_c3 = values[2];
    __pyx_v_fKruskalPic = values[3];
    __pyx_v_fTreeWall = values[4];
    __pyx_v_nEntrancePos = values[5];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_kruskal", 0, 3, 6, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 604, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_kruskal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_41create_kruskal(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fClear, __pyx_v_c2, __pyx_v_c3, __pyx_v_fKruskalPic, __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":604
 *         self._store_back_globals()
 * 
 *     def create_kruskal(self, fClear, c2, c3,             # <<<<<<<<<<<<<<
 *                        fKruskalPic=False,
 *                        fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_41create_kruskal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fClear, CYTHON_UNUSED PyObject *__pyx_v_c2, CYTHON_UNUSED PyObject *__pyx_v_c3, PyObject *__pyx_v_fKruskalPic, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  CCol *__pyx_v_cpp_c2;
  CCol *__pyx_v_cpp_c3;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  bool __pyx_t_2;
  bool __pyx_t_3;
  int __pyx_t_4;
  int __pyx_t_5;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  __Pyx_RefNannySetupContext("create_kruskal", 0);

  /* "daedalus/_maze.pyx":628
 *         '''
 *         # TODO
 *         cdef CCol *cpp_c2 = NULL             # <<<<<<<<<<<<<<
 *         cdef CCol *cpp_c3 = NULL
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,
 */
  __pyx_v_cpp_c2 = NULL;

  /* "daedalus/_maze.pyx":629
 *         # TODO
 *         cdef CCol *cpp_c2 = NULL
 *         cdef CCol *cpp_c3 = NULL             # <<<<<<<<<<<<<<
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,
 *                                      fKruskalPic,
 */
  __pyx_v_cpp_c3 = NULL;

  /* "daedalus/_maze.pyx":630
 *         cdef CCol *cpp_c2 = NULL
 *         cdef CCol *cpp_c3 = NULL
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,             # <<<<<<<<<<<<<<
 *                                      fKruskalPic,
 *                                      False,
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fClear); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 630, __pyx_L1_error)

  /* "daedalus/_maze.pyx":631
 *         cdef CCol *cpp_c3 = NULL
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,
 *                                      fKruskalPic,             # <<<<<<<<<<<<<<
 *                                      False,
 *                                      fTreeWall,
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fKruskalPic); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 631, __pyx_L1_error)

  /* "daedalus/_maze.pyx":633
 *                                      fKruskalPic,
 *                                      False,
 *                                      fTreeWall,             # <<<<<<<<<<<<<<
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Kruskal Maze.')
 */
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_3 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 633, __pyx_L1_error)

  /* "daedalus/_maze.pyx":634
 *                                      False,
 *                                      fTreeWall,
 *                                      nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Kruskal Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 634, __pyx_L1_error)

  /* "daedalus/_maze.pyx":630
 *         cdef CCol *cpp_c2 = NULL
 *         cdef CCol *cpp_c3 = NULL
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,             # <<<<<<<<<<<<<<
 *                                      fKruskalPic,
 *                                      False,
 */
  __pyx_t_5 = ((!(cpp_CreateMazeKruskal(__pyx_v_self->_maze, __pyx_t_1, __pyx_v_cpp_c2, __pyx_v_cpp_c3, __pyx_t_2, 0, __pyx_t_3, __pyx_t_4) != 0)) != 0);
  if (__pyx_t_5) {

    /* "daedalus/_maze.pyx":635
 *                                      fTreeWall,
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Kruskal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 635, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_tuple__26, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 635, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_7);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __Pyx_Raise(__pyx_t_7, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    __PYX_ERR(0, 635, __pyx_L1_error)

    /* "daedalus/_maze.pyx":630
 *         cdef CCol *cpp_c2 = NULL
 *         cdef CCol *cpp_c3 = NULL
 *         if not cpp_CreateMazeKruskal(self._maze, fClear, cpp_c2, cpp_c3,             # <<<<<<<<<<<<<<
 *                                      fKruskalPic,
 *                                      False,
 */
  }

  /* "daedalus/_maze.pyx":636
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Kruskal Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_tree(self,
 */
  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 636, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_8 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {
    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);
    if (likely(__pyx_t_8)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_6, function);
    }
  }
  if (__pyx_t_8) {
    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 636, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
  } else {
    __pyx_t_7 = __Pyx_PyObject_CallNoArg(__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 636, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_7);
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;

  /* "daedalus/_maze.pyx":604
 *         self._store_back_globals()
 * 
 *     def create_kruskal(self, fClear, c2, c3,             # <<<<<<<<<<<<<<
 *                        fKruskalPic=False,
 *                        fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_kruskal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":638
 *         self._store_back_globals()
 * 
 *     def create_tree(self,             # <<<<<<<<<<<<<<
 *                     fTreeRandom=True,
 *                     fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_44create_tree(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_43create_tree[] = "\n        Overwrites the contents of this Maze to create a Tree maze.\n\n        Create a new perfect Maze in the bitmap using the Growing Tree\n        algorithm.  This can carve passages or add walls.\n\n        :param bool fTreeRandom: If False, the algorithm will tend to\n            create Mazes with long and windy solutions; if True, the\n            solution will tend to be shorter and more direct.\n            Defaults to True.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :param int nTreeRiver: with fTreeRandom set to False, this\n            determines how many of the most recent sections to choose\n            from; higher values give less windy solutions.  With\n            fTreeRandom set to True, higher values of this param give\n            more windy solutions.  Defaults to 10.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_44create_tree(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeRandom = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_v_nTreeRiver = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_tree (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeRandom,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,&__pyx_n_s_nTreeRiver,0};
    PyObject* values[4] = {0,0,0,0};

    /* "daedalus/_maze.pyx":639
 * 
 *     def create_tree(self,
 *                     fTreeRandom=True,             # <<<<<<<<<<<<<<
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM,
 */
    values[0] = ((PyObject *)Py_True);

    /* "daedalus/_maze.pyx":640
 *     def create_tree(self,
 *                     fTreeRandom=True,
 *                     fTreeWall=False,             # <<<<<<<<<<<<<<
 *                     nEntrancePos=ENTRANCE_RANDOM,
 *                     nTreeRiver=10):
 */
    values[1] = ((PyObject *)Py_False);
    values[2] = __pyx_k__27;
    values[3] = ((PyObject *)__pyx_int_10);
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeRandom);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[2] = value; kw_args--; }
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nTreeRiver);
          if (value) { values[3] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_tree") < 0)) __PYX_ERR(0, 638, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeRandom = values[0];
    __pyx_v_fTreeWall = values[1];
    __pyx_v_nEntrancePos = values[2];
    __pyx_v_nTreeRiver = values[3];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_tree", 0, 0, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 638, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_tree", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_43create_tree(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeRandom, __pyx_v_fTreeWall, __pyx_v_nEntrancePos, __pyx_v_nTreeRiver);

  /* "daedalus/_maze.pyx":638
 *         self._store_back_globals()
 * 
 *     def create_tree(self,             # <<<<<<<<<<<<<<
 *                     fTreeRandom=True,
 *                     fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_43create_tree(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos, PyObject *__pyx_v_nTreeRiver) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  bool __pyx_t_2;
  int __pyx_t_3;
  int __pyx_t_4;
  int __pyx_t_5;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  __Pyx_RefNannySetupContext("create_tree", 0);

  /* "daedalus/_maze.pyx":672
 *         if not cpp_CreateMazeTree(self._maze,
 *                                   False,
 *                                   fTreeRandom,             # <<<<<<<<<<<<<<
 *                                   fTreeWall,
 *                                   nEntrancePos,
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeRandom); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 672, __pyx_L1_error)

  /* "daedalus/_maze.pyx":673
 *                                   False,
 *                                   fTreeRandom,
 *                                   fTreeWall,             # <<<<<<<<<<<<<<
 *                                   nEntrancePos,
 *                                   nTreeRiver):
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 673, __pyx_L1_error)

  /* "daedalus/_maze.pyx":674
 *                                   fTreeRandom,
 *                                   fTreeWall,
 *                                   nEntrancePos,             # <<<<<<<<<<<<<<
 *                                   nTreeRiver):
 *             raise MazeError('Could not create Tree Maze.')
 */
  __pyx_t_3 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_3 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 674, __pyx_L1_error)

  /* "daedalus/_maze.pyx":675
 *                                   fTreeWall,
 *                                   nEntrancePos,
 *                                   nTreeRiver):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Tree Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_v_nTreeRiver); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 675, __pyx_L1_error)

  /* "daedalus/_maze.pyx":670
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeTree(self._maze,             # <<<<<<<<<<<<<<
 *                                   False,
 *                                   fTreeRandom,
 */
  __pyx_t_5 = ((!(cpp_CreateMazeTree(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2, __pyx_t_3, __pyx_t_4) != 0)) != 0);
  if (__pyx_t_5) {

    /* "daedalus/_maze.pyx":676
 *                                   nEntrancePos,
 *                                   nTreeRiver):
 *             raise MazeError('Could not create Tree Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 676, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_tuple__28, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 676, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_7);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __Pyx_Raise(__pyx_t_7, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    __PYX_ERR(0, 676, __pyx_L1_error)

    /* "daedalus/_maze.pyx":670
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeTree(self._maze,             # <<<<<<<<<<<<<<
 *                                   False,
 *                                   fTreeRandom,
 */
  }

  /* "daedalus/_maze.pyx":677
 *                                   nTreeRiver):
 *             raise MazeError('Could not create Tree Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_forest(self, fWall,
 */
  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 677, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_8 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {
    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);
    if (likely(__pyx_t_8)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_6, function);
    }
  }
  if (__pyx_t_8) {
    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 677, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
  } else {
    __pyx_t_7 = __Pyx_PyObject_CallNoArg(__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 677, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_7);
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;

  /* "daedalus/_maze.pyx":638
 *         self._store_back_globals()
 * 
 *     def create_tree(self,             # <<<<<<<<<<<<<<
 *                     fTreeRandom=True,
 *                     fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_tree", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":679
 *         self._store_back_globals()
 * 
 *     def create_forest(self, fWall,             # <<<<<<<<<<<<<<
 *                       fTreeRandom=True,
 *                       fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_46create_forest(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_45create_forest[] = "\n        Overwrites the contents of this Maze to create a Forest maze.\n\n        Create a new perfect Maze in the bitmap using the Growing\n        Forest algorithm.  This can carve passages or add walls.\n\n        The Growing Forest algorithm is basically multiple instances\n        of the Growing Tree algorithm running at the same time.\n\n        :param bool fTreeRandom: If False, the algorithm will tend to\n            create Mazes with long and windy solutions; if True, the\n            solution will tend to be shorter and more direct.\n            Defaults to True.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :param int nForsAdd: Indicates the number of instances to add\n            each time a cell is added to the Maze: If positive, the\n            field indicates the exact number of instances to add, and,\n            if negative, indicates that one instance should be added\n            every X cells. Defaults to -100.\n        :param int nForsInit: The number of instances to begin with.\n            If positive, the field indicates the exact number of\n            instances, and, if negative, the field indicates that one\n            in X cells should start out as instances. Defaults to 1.\n            If both nForsInit is 1 and nForsAdd is 0, then this\n            function behaves like the Growing Tree algorithm.\n        :param int nTreeRiver: with fTreeRando""m set to False, this\n            determines how many of the most recent sections to choose\n            from; higher values give less windy solutions.  With\n            fTreeRandom set to True, higher values of this param give\n            more windy solutions.  Defaults to 10.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_46create_forest(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fWall = 0;
  PyObject *__pyx_v_fTreeRandom = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_v_nForsAdd = 0;
  PyObject *__pyx_v_nForsInit = 0;
  PyObject *__pyx_v_nTreeRiver = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_forest (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fWall,&__pyx_n_s_fTreeRandom,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,&__pyx_n_s_nForsAdd,&__pyx_n_s_nForsInit,&__pyx_n_s_nTreeRiver,0};
    PyObject* values[7] = {0,0,0,0,0,0,0};

    /* "daedalus/_maze.pyx":680
 * 
 *     def create_forest(self, fWall,
 *                       fTreeRandom=True,             # <<<<<<<<<<<<<<
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM,
 */
    values[1] = ((PyObject *)Py_True);

    /* "daedalus/_maze.pyx":681
 *     def create_forest(self, fWall,
 *                       fTreeRandom=True,
 *                       fTreeWall=False,             # <<<<<<<<<<<<<<
 *                       nEntrancePos=ENTRANCE_RANDOM,
 *                       nForsAdd=-100,
 */
    values[2] = ((PyObject *)Py_False);
    values[3] = __pyx_k__29;
    values[4] = ((PyObject *)__pyx_int_neg_100);
    values[5] = ((PyObject *)__pyx_int_1);
    values[6] = ((PyObject *)__pyx_int_10);
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);
        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);
        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fWall)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeRandom);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[2] = value; kw_args--; }
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[3] = value; kw_args--; }
        }
        case  4:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nForsAdd);
          if (value) { values[4] = value; kw_args--; }
        }
        case  5:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nForsInit);
          if (value) { values[5] = value; kw_args--; }
        }
        case  6:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nTreeRiver);
          if (value) { values[6] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_forest") < 0)) __PYX_ERR(0, 679, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6);
        case  6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5);
        case  5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4);
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fWall = values[0];
    __pyx_v_fTreeRandom = values[1];
    __pyx_v_fTreeWall = values[2];
    __pyx_v_nEntrancePos = values[3];
    __pyx_v_nForsAdd = values[4];
    __pyx_v_nForsInit = values[5];
    __pyx_v_nTreeRiver = values[6];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_forest", 0, 1, 7, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 679, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_forest", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_45create_forest(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fWall, __pyx_v_fTreeRandom, __pyx_v_fTreeWall, __pyx_v_nEntrancePos, __pyx_v_nForsAdd, __pyx_v_nForsInit, __pyx_v_nTreeRiver);

  /* "daedalus/_maze.pyx":679
 *         self._store_back_globals()
 * 
 *     def create_forest(self, fWall,             # <<<<<<<<<<<<<<
 *                       fTreeRandom=True,
 *                       fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_45create_forest(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fWall, PyObject *__pyx_v_fTreeRandom, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos, PyObject *__pyx_v_nForsAdd, PyObject *__pyx_v_nForsInit, PyObject *__pyx_v_nTreeRiver) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  bool __pyx_t_2;
  bool __pyx_t_3;
  int __pyx_t_4;
  int __pyx_t_5;
  int __pyx_t_6;
  int __pyx_t_7;
  int __pyx_t_8;
  PyObject *__pyx_t_9 = NULL;
  PyObject *__pyx_t_10 = NULL;
  PyObject *__pyx_t_11 = NULL;
  __Pyx_RefNannySetupContext("create_forest", 0);

  /* "daedalus/_maze.pyx":727
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeForest(self._maze, fWall,             # <<<<<<<<<<<<<<
 *                                     True,
 *                                     False,
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 727, __pyx_L1_error)

  /* "daedalus/_maze.pyx":730
 *                                     True,
 *                                     False,
 *                                     fTreeRandom,             # <<<<<<<<<<<<<<
 *                                     fTreeWall,
 *                                     nEntrancePos,
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeRandom); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 730, __pyx_L1_error)

  /* "daedalus/_maze.pyx":731
 *                                     False,
 *                                     fTreeRandom,
 *                                     fTreeWall,             # <<<<<<<<<<<<<<
 *                                     nEntrancePos,
 *                                     nForsAdd,
 */
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_3 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 731, __pyx_L1_error)

  /* "daedalus/_maze.pyx":732
 *                                     fTreeRandom,
 *                                     fTreeWall,
 *                                     nEntrancePos,             # <<<<<<<<<<<<<<
 *                                     nForsAdd,
 *                                     nForsInit,
 */
  __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 732, __pyx_L1_error)

  /* "daedalus/_maze.pyx":733
 *                                     fTreeWall,
 *                                     nEntrancePos,
 *                                     nForsAdd,             # <<<<<<<<<<<<<<
 *                                     nForsInit,
 *                                     nTreeRiver):
 */
  __pyx_t_5 = __Pyx_PyInt_As_int(__pyx_v_nForsAdd); if (unlikely((__pyx_t_5 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 733, __pyx_L1_error)

  /* "daedalus/_maze.pyx":734
 *                                     nEntrancePos,
 *                                     nForsAdd,
 *                                     nForsInit,             # <<<<<<<<<<<<<<
 *                                     nTreeRiver):
 *             raise MazeError('Could not create Forest Maze.')
 */
  __pyx_t_6 = __Pyx_PyInt_As_int(__pyx_v_nForsInit); if (unlikely((__pyx_t_6 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 734, __pyx_L1_error)

  /* "daedalus/_maze.pyx":735
 *                                     nForsAdd,
 *                                     nForsInit,
 *                                     nTreeRiver):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Forest Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_v_nTreeRiver); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 735, __pyx_L1_error)

  /* "daedalus/_maze.pyx":727
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeForest(self._maze, fWall,             # <<<<<<<<<<<<<<
 *                                     True,
 *                                     False,
 */
  __pyx_t_8 = ((!(cpp_CreateMazeForest(__pyx_v_self->_maze, __pyx_t_1, 1, 0, __pyx_t_2, __pyx_t_3, __pyx_t_4, __pyx_t_5, __pyx_t_6, __pyx_t_7) != 0)) != 0);
  if (__pyx_t_8) {

    /* "daedalus/_maze.pyx":736
 *                                     nForsInit,
 *                                     nTreeRiver):
 *             raise MazeError('Could not create Forest Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_9 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 736, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_9);
    __pyx_t_10 = __Pyx_PyObject_Call(__pyx_t_9, __pyx_tuple__30, NULL); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 736, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_10);
    __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;
    __Pyx_Raise(__pyx_t_10, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;
    __PYX_ERR(0, 736, __pyx_L1_error)

    /* "daedalus/_maze.pyx":727
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeForest(self._maze, fWall,             # <<<<<<<<<<<<<<
 *                                     True,
 *                                     False,
 */
  }

  /* "daedalus/_maze.pyx":737
 *                                     nTreeRiver):
 *             raise MazeError('Could not create Forest Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_aldous_broder(self,
 */
  __pyx_t_9 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 737, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_9);
  __pyx_t_11 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_9))) {
    __pyx_t_11 = PyMethod_GET_SELF(__pyx_t_9);
    if (likely(__pyx_t_11)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_9);
      __Pyx_INCREF(__pyx_t_11);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_9, function);
    }
  }
  if (__pyx_t_11) {
    __pyx_t_10 = __Pyx_PyObject_CallOneArg(__pyx_t_9, __pyx_t_11); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 737, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0;
  } else {
    __pyx_t_10 = __Pyx_PyObject_CallNoArg(__pyx_t_9); if (unlikely(!__pyx_t_10)) __PYX_ERR(0, 737, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_10);
  __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;
  __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0;

  /* "daedalus/_maze.pyx":679
 *         self._store_back_globals()
 * 
 *     def create_forest(self, fWall,             # <<<<<<<<<<<<<<
 *                       fTreeRandom=True,
 *                       fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_9);
  __Pyx_XDECREF(__pyx_t_10);
  __Pyx_XDECREF(__pyx_t_11);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_forest", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":739
 *         self._store_back_globals()
 * 
 *     def create_aldous_broder(self,             # <<<<<<<<<<<<<<
 *                              fTreeWall=False,
 *                              nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_48create_aldous_broder(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_47create_aldous_broder[] = "\n        Overwrites the contents of this Maze to create a AldousBroder maze.\n\n        Create a new perfect Maze in the bitmap using the\n        Aldous-Broder algorithm.  This can carve passages or add\n        walls. This is the simplest unbiased algorithm for creating\n        perfect Mazes.\n\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_48create_aldous_broder(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_aldous_broder (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":740
 * 
 *     def create_aldous_broder(self,
 *                              fTreeWall=False,             # <<<<<<<<<<<<<<
 *                              nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__31;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_aldous_broder") < 0)) __PYX_ERR(0, 739, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeWall = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_aldous_broder", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 739, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_aldous_broder", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_47create_aldous_broder(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":739
 *         self._store_back_globals()
 * 
 *     def create_aldous_broder(self,             # <<<<<<<<<<<<<<
 *                              fTreeWall=False,
 *                              nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_47create_aldous_broder(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_aldous_broder", 0);

  /* "daedalus/_maze.pyx":764
 *         if not cpp_CreateMazeAldousBroder(self._maze,
 *                                           False,
 *                                           fTreeWall,             # <<<<<<<<<<<<<<
 *                                           nEntrancePos):
 *             raise MazeError('Could not create AldousBroder Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 764, __pyx_L1_error)

  /* "daedalus/_maze.pyx":765
 *                                           False,
 *                                           fTreeWall,
 *                                           nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create AldousBroder Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 765, __pyx_L1_error)

  /* "daedalus/_maze.pyx":762
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeAldousBroder(self._maze,             # <<<<<<<<<<<<<<
 *                                           False,
 *                                           fTreeWall,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeAldousBroder(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":766
 *                                           fTreeWall,
 *                                           nEntrancePos):
 *             raise MazeError('Could not create AldousBroder Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 766, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__32, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 766, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 766, __pyx_L1_error)

    /* "daedalus/_maze.pyx":762
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeAldousBroder(self._maze,             # <<<<<<<<<<<<<<
 *                                           False,
 *                                           fTreeWall,
 */
  }

  /* "daedalus/_maze.pyx":767
 *                                           nEntrancePos):
 *             raise MazeError('Could not create AldousBroder Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_wilson(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 767, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 767, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 767, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":739
 *         self._store_back_globals()
 * 
 *     def create_aldous_broder(self,             # <<<<<<<<<<<<<<
 *                              fTreeWall=False,
 *                              nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_aldous_broder", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":769
 *         self._store_back_globals()
 * 
 *     def create_wilson(self,             # <<<<<<<<<<<<<<
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_50create_wilson(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_49create_wilson[] = "\n        Overwrites the contents of this Maze to create a Wilson maze.\n\n        Create a new perfect Maze in the bitmap using Wilson's\n        algorithm. This can carve passages or add walls. Like the\n        Aldous-Broder algorithm, this generates all possible Mazes\n        with equal probability, however this runs about five times\n        faster on average.\n\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_50create_wilson(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_wilson (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":770
 * 
 *     def create_wilson(self,
 *                       fTreeWall=False,             # <<<<<<<<<<<<<<
 *                       nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__33;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_wilson") < 0)) __PYX_ERR(0, 769, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeWall = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_wilson", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 769, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_wilson", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_49create_wilson(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":769
 *         self._store_back_globals()
 * 
 *     def create_wilson(self,             # <<<<<<<<<<<<<<
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_49create_wilson(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_wilson", 0);

  /* "daedalus/_maze.pyx":795
 *         if not cpp_CreateMazeWilson(self._maze,
 *                                     False,
 *                                     fTreeWall,             # <<<<<<<<<<<<<<
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Wilson Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 795, __pyx_L1_error)

  /* "daedalus/_maze.pyx":796
 *                                     False,
 *                                     fTreeWall,
 *                                     nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Wilson Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 796, __pyx_L1_error)

  /* "daedalus/_maze.pyx":793
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeWilson(self._maze,             # <<<<<<<<<<<<<<
 *                                     False,
 *                                     fTreeWall,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeWilson(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":797
 *                                     fTreeWall,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Wilson Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 797, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__34, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 797, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 797, __pyx_L1_error)

    /* "daedalus/_maze.pyx":793
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeWilson(self._maze,             # <<<<<<<<<<<<<<
 *                                     False,
 *                                     fTreeWall,
 */
  }

  /* "daedalus/_maze.pyx":798
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Wilson Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_eller(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 798, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 798, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 798, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":769
 *         self._store_back_globals()
 * 
 *     def create_wilson(self,             # <<<<<<<<<<<<<<
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_wilson", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":800
 *         self._store_back_globals()
 * 
 *     def create_eller(self,             # <<<<<<<<<<<<<<
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_52create_eller(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_51create_eller[] = "\n        Overwrites the contents of this Maze to create a Eller maze.\n\n        Create a new perfect Maze in the bitmap using Eller's\n        algorithm. This can carve passages or add walls. This is the\n        fastest algorithm for creating general perfect Mazes, and runs\n        over twice as fast as any of the others.\n\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_52create_eller(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_eller (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":801
 * 
 *     def create_eller(self,
 *                      fTreeWall=False,             # <<<<<<<<<<<<<<
 *                      nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__35;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_eller") < 0)) __PYX_ERR(0, 800, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeWall = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_eller", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 800, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_eller", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_51create_eller(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":800
 *         self._store_back_globals()
 * 
 *     def create_eller(self,             # <<<<<<<<<<<<<<
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_51create_eller(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_eller", 0);

  /* "daedalus/_maze.pyx":825
 *         if not cpp_CreateMazeEller(self._maze,
 *                                    False,
 *                                    fTreeWall,             # <<<<<<<<<<<<<<
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Eller Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 825, __pyx_L1_error)

  /* "daedalus/_maze.pyx":826
 *                                    False,
 *                                    fTreeWall,
 *                                    nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Eller Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 826, __pyx_L1_error)

  /* "daedalus/_maze.pyx":823
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeEller(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    fTreeWall,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeEller(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":827
 *                                    fTreeWall,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Eller Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 827, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__36, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 827, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 827, __pyx_L1_error)

    /* "daedalus/_maze.pyx":823
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeEller(self._maze,             # <<<<<<<<<<<<<<
 *                                    False,
 *                                    fTreeWall,
 */
  }

  /* "daedalus/_maze.pyx":828
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Eller Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_braid_eller(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 828, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 828, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 828, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":800
 *         self._store_back_globals()
 * 
 *     def create_eller(self,             # <<<<<<<<<<<<<<
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_eller", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":830
 *         self._store_back_globals()
 * 
 *     def create_braid_eller(self,             # <<<<<<<<<<<<<<
 *                            nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_54create_braid_eller(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_53create_braid_eller[] = "\n        Overwrites the contents of this Maze to create a BraidEller maze.\n\n        Create a new braid Maze in a bitmap using a variation of\n        Eller's Algorithm.\n\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_54create_braid_eller(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_braid_eller (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nEntrancePos,0};
    PyObject* values[1] = {0};
    values[0] = __pyx_k__37;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[0] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_braid_eller") < 0)) __PYX_ERR(0, 830, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_nEntrancePos = values[0];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_braid_eller", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 830, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid_eller", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_53create_braid_eller(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_53create_braid_eller(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("create_braid_eller", 0);

  /* "daedalus/_maze.pyx":849
 *         if not cpp_CreateMazeBraidEller(self._maze,
 *                                         False,
 *                                         nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create BraidEller Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 849, __pyx_L1_error)

  /* "daedalus/_maze.pyx":847
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraidEller(self._maze,             # <<<<<<<<<<<<<<
 *                                         False,
 *                                         nEntrancePos):
 */
  __pyx_t_2 = ((!(cpp_CreateMazeBraidEller(__pyx_v_self->_maze, 0, __pyx_t_1) != 0)) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":850
 *                                         False,
 *                                         nEntrancePos):
 *             raise MazeError('Could not create BraidEller Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 850, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__38, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 850, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_Raise(__pyx_t_4, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __PYX_ERR(0, 850, __pyx_L1_error)

    /* "daedalus/_maze.pyx":847
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBraidEller(self._maze,             # <<<<<<<<<<<<<<
 *                                         False,
 *                                         nEntrancePos):
 */
  }

  /* "daedalus/_maze.pyx":851
 *                                         nEntrancePos):
 *             raise MazeError('Could not create BraidEller Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_division(self,
 */
  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 851, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_5 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_3))) {
    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);
    if (likely(__pyx_t_5)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);
      __Pyx_INCREF(__pyx_t_5);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_3, function);
    }
  }
  if (__pyx_t_5) {
    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 851, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  } else {
    __pyx_t_4 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 851, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_4);
  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;

  /* "daedalus/_maze.pyx":830
 *         self._store_back_globals()
 * 
 *     def create_braid_eller(self,             # <<<<<<<<<<<<<<
 *                            nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_braid_eller", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":853
 *         self._store_back_globals()
 * 
 *     def create_division(self,             # <<<<<<<<<<<<<<
 *                         nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_56create_division(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_55create_division[] = "\n        Overwrites the contents of this Maze to create a Division maze.\n\n        Create a new perfect Maze in the bitmap using recursive\n        division. This always adds walls, recursively dividing the\n        Maze into smaller rectangles.\n\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_56create_division(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_division (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nEntrancePos,0};
    PyObject* values[1] = {0};
    values[0] = __pyx_k__39;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[0] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_division") < 0)) __PYX_ERR(0, 853, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_nEntrancePos = values[0];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_division", 0, 0, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 853, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_division", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_55create_division(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_nEntrancePos);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_55create_division(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  int __pyx_t_2;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("create_division", 0);

  /* "daedalus/_maze.pyx":873
 *         if not cpp_CreateMazeDivision(self._maze,
 *                                       False,
 *                                       nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Division Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 873, __pyx_L1_error)

  /* "daedalus/_maze.pyx":871
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeDivision(self._maze,             # <<<<<<<<<<<<<<
 *                                       False,
 *                                       nEntrancePos):
 */
  __pyx_t_2 = ((!(cpp_CreateMazeDivision(__pyx_v_self->_maze, 0, __pyx_t_1) != 0)) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":874
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Division Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 874, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_3);
    __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_tuple__40, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 874, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
    __Pyx_Raise(__pyx_t_4, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __PYX_ERR(0, 874, __pyx_L1_error)

    /* "daedalus/_maze.pyx":871
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeDivision(self._maze,             # <<<<<<<<<<<<<<
 *                                       False,
 *                                       nEntrancePos):
 */
  }

  /* "daedalus/_maze.pyx":875
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Division Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_binary(self,
 */
  __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 875, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_5 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_3))) {
    __pyx_t_5 = PyMethod_GET_SELF(__pyx_t_3);
    if (likely(__pyx_t_5)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_3);
      __Pyx_INCREF(__pyx_t_5);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_3, function);
    }
  }
  if (__pyx_t_5) {
    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_3, __pyx_t_5); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 875, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  } else {
    __pyx_t_4 = __Pyx_PyObject_CallNoArg(__pyx_t_3); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 875, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_4);
  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;

  /* "daedalus/_maze.pyx":853
 *         self._store_back_globals()
 * 
 *     def create_division(self,             # <<<<<<<<<<<<<<
 *                         nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_division", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":877
 *         self._store_back_globals()
 * 
 *     def create_binary(self,             # <<<<<<<<<<<<<<
 *                       cRandomAdd=0,
 *                       fTreeWall=False,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_58create_binary(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_57create_binary[] = "\n        Overwrites the contents of this Maze to create a Binary maze.\n\n        Create a new perfect Maze in the bitmap using the Binary Tree\n        algorithm.  This can carve passages or add walls. This is the\n        simplest algorithm of any type for creating perfect\n        Mazes.\n\n        :param int cRandomAdd: The number of random walls and passages\n            to add to the maze.  A high number will make the maze more\n            random and less like its base design, while a large negative\n            number will make the maze be its base design with longer\n            passages and dead ends.  Defaults to 0.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_58create_binary(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_cRandomAdd = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_binary (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cRandomAdd,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[3] = {0,0,0};
    values[0] = ((PyObject *)__pyx_int_0);

    /* "daedalus/_maze.pyx":879
 *     def create_binary(self,
 *                       cRandomAdd=0,
 *                       fTreeWall=False,             # <<<<<<<<<<<<<<
 *                       nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[1] = ((PyObject *)Py_False);
    values[2] = __pyx_k__41;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cRandomAdd);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[2] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_binary") < 0)) __PYX_ERR(0, 877, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_cRandomAdd = values[0];
    __pyx_v_fTreeWall = values[1];
    __pyx_v_nEntrancePos = values[2];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_binary", 0, 0, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 877, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_binary", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_57create_binary(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_cRandomAdd, __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":877
 *         self._store_back_globals()
 * 
 *     def create_binary(self,             # <<<<<<<<<<<<<<
 *                       cRandomAdd=0,
 *                       fTreeWall=False,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_57create_binary(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  bool __pyx_t_2;
  int __pyx_t_3;
  int __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  __Pyx_RefNannySetupContext("create_binary", 0);

  /* "daedalus/_maze.pyx":907
 *         '''
 *         if not cpp_CreateMazeBinary(self._maze,
 *                                     cRandomAdd,             # <<<<<<<<<<<<<<
 *                                     False,
 *                                     fTreeWall,
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_cRandomAdd); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 907, __pyx_L1_error)

  /* "daedalus/_maze.pyx":909
 *                                     cRandomAdd,
 *                                     False,
 *                                     fTreeWall,             # <<<<<<<<<<<<<<
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Binary Maze.')
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 909, __pyx_L1_error)

  /* "daedalus/_maze.pyx":910
 *                                     False,
 *                                     fTreeWall,
 *                                     nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Binary Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_3 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_3 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 910, __pyx_L1_error)

  /* "daedalus/_maze.pyx":906
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBinary(self._maze,             # <<<<<<<<<<<<<<
 *                                     cRandomAdd,
 *                                     False,
 */
  __pyx_t_4 = ((!(cpp_CreateMazeBinary(__pyx_v_self->_maze, __pyx_t_1, 0, __pyx_t_2, __pyx_t_3) != 0)) != 0);
  if (__pyx_t_4) {

    /* "daedalus/_maze.pyx":911
 *                                     fTreeWall,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Binary Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 911, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_tuple__42, NULL); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 911, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __Pyx_Raise(__pyx_t_6, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __PYX_ERR(0, 911, __pyx_L1_error)

    /* "daedalus/_maze.pyx":906
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeBinary(self._maze,             # <<<<<<<<<<<<<<
 *                                     cRandomAdd,
 *                                     False,
 */
  }

  /* "daedalus/_maze.pyx":912
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Binary Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_sidewinder(self,
 */
  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 912, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_5);
  __pyx_t_7 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {
    __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);
    if (likely(__pyx_t_7)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);
      __Pyx_INCREF(__pyx_t_7);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_5, function);
    }
  }
  if (__pyx_t_7) {
    __pyx_t_6 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 912, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
  } else {
    __pyx_t_6 = __Pyx_PyObject_CallNoArg(__pyx_t_5); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 912, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_6);
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;

  /* "daedalus/_maze.pyx":877
 *         self._store_back_globals()
 * 
 *     def create_binary(self,             # <<<<<<<<<<<<<<
 *                       cRandomAdd=0,
 *                       fTreeWall=False,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_binary", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":914
 *         self._store_back_globals()
 * 
 *     def create_sidewinder(self,             # <<<<<<<<<<<<<<
 *                           fTreeWall=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_60create_sidewinder(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_59create_sidewinder[] = "\n        Overwrites the contents of this Maze to create a Sidewinder maze.\n\n        Create a new perfect Maze in the bitmap using the Sidewinder\n        algorithm.  This can carve passages or add walls.\n\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_60create_sidewinder(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_sidewinder (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[2] = {0,0};

    /* "daedalus/_maze.pyx":915
 * 
 *     def create_sidewinder(self,
 *                           fTreeWall=False,             # <<<<<<<<<<<<<<
 *                           nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[0] = ((PyObject *)Py_False);
    values[1] = __pyx_k__43;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[1] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_sidewinder") < 0)) __PYX_ERR(0, 914, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_fTreeWall = values[0];
    __pyx_v_nEntrancePos = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_sidewinder", 0, 0, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 914, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_sidewinder", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_59create_sidewinder(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":914
 *         self._store_back_globals()
 * 
 *     def create_sidewinder(self,             # <<<<<<<<<<<<<<
 *                           fTreeWall=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_59create_sidewinder(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  bool __pyx_t_1;
  int __pyx_t_2;
  int __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  __Pyx_RefNannySetupContext("create_sidewinder", 0);

  /* "daedalus/_maze.pyx":937
 *         if not cpp_CreateMazeSidewinder(self._maze,
 *                                         False,
 *                                         fTreeWall,             # <<<<<<<<<<<<<<
 *                                         nEntrancePos):
 *             raise MazeError('Could not create Sidewinder Maze.')
 */
  __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_1 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 937, __pyx_L1_error)

  /* "daedalus/_maze.pyx":938
 *                                         False,
 *                                         fTreeWall,
 *                                         nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Sidewinder Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 938, __pyx_L1_error)

  /* "daedalus/_maze.pyx":935
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeSidewinder(self._maze,             # <<<<<<<<<<<<<<
 *                                         False,
 *                                         fTreeWall,
 */
  __pyx_t_3 = ((!(cpp_CreateMazeSidewinder(__pyx_v_self->_maze, 0, __pyx_t_1, __pyx_t_2) != 0)) != 0);
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":939
 *                                         fTreeWall,
 *                                         nEntrancePos):
 *             raise MazeError('Could not create Sidewinder Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 939, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_4);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_tuple__44, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 939, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 939, __pyx_L1_error)

    /* "daedalus/_maze.pyx":935
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeSidewinder(self._maze,             # <<<<<<<<<<<<<<
 *                                         False,
 *                                         fTreeWall,
 */
  }

  /* "daedalus/_maze.pyx":940
 *                                         nEntrancePos):
 *             raise MazeError('Could not create Sidewinder Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def create_unicursal(self,
 */
  __pyx_t_4 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 940, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  __pyx_t_6 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_4))) {
    __pyx_t_6 = PyMethod_GET_SELF(__pyx_t_4);
    if (likely(__pyx_t_6)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_4);
      __Pyx_INCREF(__pyx_t_6);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_4, function);
    }
  }
  if (__pyx_t_6) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_4, __pyx_t_6); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 940, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  } else {
    __pyx_t_5 = __Pyx_PyObject_CallNoArg(__pyx_t_4); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 940, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_5);
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":914
 *         self._store_back_globals()
 * 
 *     def create_sidewinder(self,             # <<<<<<<<<<<<<<
 *                           fTreeWall=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_sidewinder", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":942
 *         self._store_back_globals()
 * 
 *     def create_unicursal(self,             # <<<<<<<<<<<<<<
 *                          cRandomAdd=0,
 *                          fRiver=True,
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_62create_unicursal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_61create_unicursal[] = "\n        Overwrites the contents of this Maze to create a Unicursal maze.\n\n        Create a new Unicursal Maze in the bitmap, i.e. a Maze without\n        junctions.\n\n        :param int cRandomAdd: The number of random walls and passages\n            to add to the maze.  A high number will make the maze more\n            random and less like its base design, while a large negative\n            number will make the maze be its base design with longer\n            passages and dead ends.  Defaults to 0.\n        :param bool fRiver: If set, creates a Maze with a relatively\n            high \"river\" factor (with relatively longer passages between\n            junctions and fewer but longer dead ends).  Defaults to True.\n        :param bool fTreeWall: If true, creates the Maze by adding\n            walls; if false, creates the Maze by carving passages.\n            Defaults to False.\n        :param int nEntrancePos: One of ENTRANCE_CORNER (entrance is\n            in the upper-left corner, and the exit in the lower-right),\n            ENTRANCE_MIDDLE (entrance and exit are in the middle of the\n            top and bottom edges), ENTRANCE_BALANCED (entrance and exit\n            are placed randomly, but are horizontally \"balanced\"),\n            ENTRANCE_RANDOM (entrance and exit are placed randomly).\n            Defaults to ENTRANCE_RANDOM.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_62create_unicursal(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_cRandomAdd = 0;
  PyObject *__pyx_v_fRiver = 0;
  PyObject *__pyx_v_fTreeWall = 0;
  PyObject *__pyx_v_nEntrancePos = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("create_unicursal (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_cRandomAdd,&__pyx_n_s_fRiver,&__pyx_n_s_fTreeWall,&__pyx_n_s_nEntrancePos,0};
    PyObject* values[4] = {0,0,0,0};
    values[0] = ((PyObject *)__pyx_int_0);

    /* "daedalus/_maze.pyx":944
 *     def create_unicursal(self,
 *                          cRandomAdd=0,
 *                          fRiver=True,             # <<<<<<<<<<<<<<
 *                          fTreeWall=False,
 *                          nEntrancePos=ENTRANCE_RANDOM):
 */
    values[1] = ((PyObject *)Py_True);

    /* "daedalus/_maze.pyx":945
 *                          cRandomAdd=0,
 *                          fRiver=True,
 *                          fTreeWall=False,             # <<<<<<<<<<<<<<
 *                          nEntrancePos=ENTRANCE_RANDOM):
 *         '''
 */
    values[2] = ((PyObject *)Py_False);
    values[3] = __pyx_k__45;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_cRandomAdd);
          if (value) { values[0] = value; kw_args--; }
        }
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fRiver);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTreeWall);
          if (value) { values[2] = value; kw_args--; }
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nEntrancePos);
          if (value) { values[3] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "create_unicursal") < 0)) __PYX_ERR(0, 942, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_cRandomAdd = values[0];
    __pyx_v_fRiver = values[1];
    __pyx_v_fTreeWall = values[2];
    __pyx_v_nEntrancePos = values[3];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("create_unicursal", 0, 0, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 942, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.create_unicursal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_61create_unicursal(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_cRandomAdd, __pyx_v_fRiver, __pyx_v_fTreeWall, __pyx_v_nEntrancePos);

  /* "daedalus/_maze.pyx":942
 *         self._store_back_globals()
 * 
 *     def create_unicursal(self,             # <<<<<<<<<<<<<<
 *                          cRandomAdd=0,
 *                          fRiver=True,
 */

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_61create_unicursal(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_cRandomAdd, PyObject *__pyx_v_fRiver, PyObject *__pyx_v_fTreeWall, PyObject *__pyx_v_nEntrancePos) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  bool __pyx_t_2;
  bool __pyx_t_3;
  int __pyx_t_4;
  int __pyx_t_5;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  __Pyx_RefNannySetupContext("create_unicursal", 0);

  /* "daedalus/_maze.pyx":974
 *         '''
 *         if not cpp_CreateMazeUnicursal(self._maze,
 *                                        cRandomAdd,             # <<<<<<<<<<<<<<
 *                                        fRiver,
 *                                        True,
 */
  __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_cRandomAdd); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 974, __pyx_L1_error)

  /* "daedalus/_maze.pyx":975
 *         if not cpp_CreateMazeUnicursal(self._maze,
 *                                        cRandomAdd,
 *                                        fRiver,             # <<<<<<<<<<<<<<
 *                                        True,
 *                                        True,
 */
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fRiver); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 975, __pyx_L1_error)

  /* "daedalus/_maze.pyx":979
 *                                        True,
 *                                        False,
 *                                        fTreeWall,             # <<<<<<<<<<<<<<
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Unicursal Maze.')
 */
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_v_fTreeWall); if (unlikely((__pyx_t_3 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 979, __pyx_L1_error)

  /* "daedalus/_maze.pyx":980
 *                                        False,
 *                                        fTreeWall,
 *                                        nEntrancePos):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not create Unicursal Maze.')
 *         self._store_back_globals()
 */
  __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_v_nEntrancePos); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) __PYX_ERR(0, 980, __pyx_L1_error)

  /* "daedalus/_maze.pyx":973
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeUnicursal(self._maze,             # <<<<<<<<<<<<<<
 *                                        cRandomAdd,
 *                                        fRiver,
 */
  __pyx_t_5 = ((!(cpp_CreateMazeUnicursal(__pyx_v_self->_maze, __pyx_t_1, __pyx_t_2, 1, 1, 0, __pyx_t_3, __pyx_t_4) != 0)) != 0);
  if (__pyx_t_5) {

    /* "daedalus/_maze.pyx":981
 *                                        fTreeWall,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Unicursal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
    __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 981, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_6);
    __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_tuple__46, NULL); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 981, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_7);
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __Pyx_Raise(__pyx_t_7, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    __PYX_ERR(0, 981, __pyx_L1_error)

    /* "daedalus/_maze.pyx":973
 *         :rtype: None
 *         '''
 *         if not cpp_CreateMazeUnicursal(self._maze,             # <<<<<<<<<<<<<<
 *                                        cRandomAdd,
 *                                        fRiver,
 */
  }

  /* "daedalus/_maze.pyx":982
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Unicursal Maze.')
 *         self._store_back_globals()             # <<<<<<<<<<<<<<
 * 
 *     def resize(self, width, height):
 */
  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_store_back_globals); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 982, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_8 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {
    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);
    if (likely(__pyx_t_8)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_6, function);
    }
  }
  if (__pyx_t_8) {
    __pyx_t_7 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 982, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
  } else {
    __pyx_t_7 = __Pyx_PyObject_CallNoArg(__pyx_t_6); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 982, __pyx_L1_error)
  }
  __Pyx_GOTREF(__pyx_t_7);
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;

  /* "daedalus/_maze.pyx":942
 *         self._store_back_globals()
 * 
 *     def create_unicursal(self,             # <<<<<<<<<<<<<<
 *                          cRandomAdd=0,
 *                          fRiver=True,
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_AddTraceback("daedalus._maze.Maze.create_unicursal", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":984
 *         self._store_back_globals()
 * 
 *     def resize(self, width, height):             # <<<<<<<<<<<<<<
 *         '''
 *         Truncates or pads out this Maze to attain the given size.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_64resize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_63resize[] = "\n        Truncates or pads out this Maze to attain the given size.\n\n        :param int width: Odd integer, 3 or greater\n        :param int height: Odd integer, 3 or greater\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_64resize(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_width = 0;
  PyObject *__pyx_v_height = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("resize (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_width,&__pyx_n_s_height,0};
    PyObject* values[2] = {0,0};
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_width)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_height)) != 0)) kw_args--;
        else {
          __Pyx_RaiseArgtupleInvalid("resize", 1, 2, 2, 1); __PYX_ERR(0, 984, __pyx_L3_error)
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "resize") < 0)) __PYX_ERR(0, 984, __pyx_L3_error)
      }
    } else if (PyTuple_GET_SIZE(__pyx_args) != 2) {
      goto __pyx_L5_argtuple_error;
    } else {
      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
      values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
    }
    __pyx_v_width = values[0];
    __pyx_v_height = values[1];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("resize", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 984, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.resize", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_63resize(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_width, __pyx_v_height);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_63resize(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_width, PyObject *__pyx_v_height) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  int __pyx_t_2;
  unsigned int __pyx_t_3;
  unsigned int __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  __Pyx_RefNannySetupContext("resize", 0);

  /* "daedalus/_maze.pyx":992
 *         :rtype: None
 *         '''
 *         if width < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative width')
 *         if height < 0:
 */
  __pyx_t_1 = PyObject_RichCompare(__pyx_v_width, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 992, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 992, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":993
 *         '''
 *         if width < 0:
 *             raise ValueError('negative width')             # <<<<<<<<<<<<<<
 *         if height < 0:
 *             raise ValueError('negative height')
 */
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__47, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 993, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 993, __pyx_L1_error)

    /* "daedalus/_maze.pyx":992
 *         :rtype: None
 *         '''
 *         if width < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative width')
 *         if height < 0:
 */
  }

  /* "daedalus/_maze.pyx":994
 *         if width < 0:
 *             raise ValueError('negative width')
 *         if height < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative height')
 *         # if width % 2 != 1:
 */
  __pyx_t_1 = PyObject_RichCompare(__pyx_v_height, __pyx_int_0, Py_LT); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 994, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_2 < 0)) __PYX_ERR(0, 994, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":995
 *             raise ValueError('negative width')
 *         if height < 0:
 *             raise ValueError('negative height')             # <<<<<<<<<<<<<<
 *         # if width % 2 != 1:
 *         #     raise ValueError('width must be odd')
 */
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__48, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 995, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 995, __pyx_L1_error)

    /* "daedalus/_maze.pyx":994
 *         if width < 0:
 *             raise ValueError('negative width')
 *         if height < 0:             # <<<<<<<<<<<<<<
 *             raise ValueError('negative height')
 *         # if width % 2 != 1:
 */
  }

  /* "daedalus/_maze.pyx":1000
 *         # if height % 2 != 1:
 *         #     raise ValueError('height must be odd')
 *         if not cpp_Resize(self._maze, width, height):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not resize the Maze.')
 * 
 */
  __pyx_t_3 = __Pyx_PyInt_As_unsigned_int(__pyx_v_width); if (unlikely((__pyx_t_3 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 1000, __pyx_L1_error)
  __pyx_t_4 = __Pyx_PyInt_As_unsigned_int(__pyx_v_height); if (unlikely((__pyx_t_4 == (unsigned int)-1) && PyErr_Occurred())) __PYX_ERR(0, 1000, __pyx_L1_error)
  __pyx_t_2 = ((!(cpp_Resize(__pyx_v_self->_maze, __pyx_t_3, __pyx_t_4) != 0)) != 0);
  if (__pyx_t_2) {

    /* "daedalus/_maze.pyx":1001
 *         #     raise ValueError('height must be odd')
 *         if not cpp_Resize(self._maze, width, height):
 *             raise MazeError('Could not resize the Maze.')             # <<<<<<<<<<<<<<
 * 
 *     @staticmethod
 */
    __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1001, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_tuple__49, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1001, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_5);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __Pyx_Raise(__pyx_t_5, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
    __PYX_ERR(0, 1001, __pyx_L1_error)

    /* "daedalus/_maze.pyx":1000
 *         # if height % 2 != 1:
 *         #     raise ValueError('height must be odd')
 *         if not cpp_Resize(self._maze, width, height):             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not resize the Maze.')
 * 
 */
  }

  /* "daedalus/_maze.pyx":984
 *         self._store_back_globals()
 * 
 *     def resize(self, width, height):             # <<<<<<<<<<<<<<
 *         '''
 *         Truncates or pads out this Maze to attain the given size.
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_AddTraceback("daedalus._maze.Maze.resize", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":1004
 * 
 *     @staticmethod
 *     def _handle_save_retval(rv):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper method to handle return values from the Save* methods.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_66_handle_save_retval(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_65_handle_save_retval[] = "\n        Helper method to handle return values from the Save* methods.\n\n        :param int rv: the value returned from the Save* method.\n        :rtype: None\n        ";
static PyMethodDef __pyx_mdef_8daedalus_5_maze_4Maze_66_handle_save_retval = {"_handle_save_retval", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_66_handle_save_retval, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_65_handle_save_retval};
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_66_handle_save_retval(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_rv = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("_handle_save_retval (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_rv,0};
    PyObject* values[1] = {0};
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_rv)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "_handle_save_retval") < 0)) __PYX_ERR(0, 1004, __pyx_L3_error)
      }
    } else if (PyTuple_GET_SIZE(__pyx_args) != 1) {
      goto __pyx_L5_argtuple_error;
    } else {
      values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
    }
    __pyx_v_rv = values[0];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("_handle_save_retval", 1, 1, 1, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1004, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze._handle_save_retval", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_65_handle_save_retval(__pyx_v_rv);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_65_handle_save_retval(PyObject *__pyx_v_rv) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  int __pyx_t_3;
  __Pyx_RefNannySetupContext("_handle_save_retval", 0);

  /* "daedalus/_maze.pyx":1011
 *         :rtype: None
 *         '''
 *         if rv == SAVE_NO_MAZE_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(SAVE_NO_MAZE_ERROR); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1011, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_rv, __pyx_t_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1011, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 1011, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":1012
 *         '''
 *         if rv == SAVE_NO_MAZE_ERROR:
 *             raise MazeError('Maze not properly constructed.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')
 */
    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1012, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__50, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1012, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 1012, __pyx_L1_error)

    /* "daedalus/_maze.pyx":1011
 *         :rtype: None
 *         '''
 *         if rv == SAVE_NO_MAZE_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 */
  }

  /* "daedalus/_maze.pyx":1013
 *         if rv == SAVE_NO_MAZE_ERROR:
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(SAVE_NO_FILENAME_GIVEN_ERROR); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1013, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_rv, __pyx_t_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1013, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 1013, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":1014
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')
 */
    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1014, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__51, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1014, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 1014, __pyx_L1_error)

    /* "daedalus/_maze.pyx":1013
 *         if rv == SAVE_NO_MAZE_ERROR:
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 */
  }

  /* "daedalus/_maze.pyx":1015
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(SAVE_FILE_OPEN_ERROR); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1015, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_rv, __pyx_t_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1015, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 1015, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":1016
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 *             raise MazeError('Unknown save command.')
 */
    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1016, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__52, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1016, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 1016, __pyx_L1_error)

    /* "daedalus/_maze.pyx":1015
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 */
  }

  /* "daedalus/_maze.pyx":1017
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Unknown save command.')
 *         elif rv == SAVE_SUCCESS:
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(SAVE_UNKNOWN_CMD_ERROR); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1017, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_rv, __pyx_t_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1017, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 1017, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (__pyx_t_3) {

    /* "daedalus/_maze.pyx":1018
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 *             raise MazeError('Unknown save command.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_SUCCESS:
 *             pass
 */
    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1018, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__53, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1018, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 1018, __pyx_L1_error)

    /* "daedalus/_maze.pyx":1017
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:             # <<<<<<<<<<<<<<
 *             raise MazeError('Unknown save command.')
 *         elif rv == SAVE_SUCCESS:
 */
  }

  /* "daedalus/_maze.pyx":1019
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 *             raise MazeError('Unknown save command.')
 *         elif rv == SAVE_SUCCESS:             # <<<<<<<<<<<<<<
 *             pass
 *         else:
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(SAVE_SUCCESS); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1019, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_t_2 = PyObject_RichCompare(__pyx_v_rv, __pyx_t_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1019, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_3 < 0)) __PYX_ERR(0, 1019, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (__pyx_t_3) {
    goto __pyx_L3;
  }

  /* "daedalus/_maze.pyx":1022
 *             pass
 *         else:
 *             raise MazeError('Unknown return value from Maze save function.')             # <<<<<<<<<<<<<<
 * 
 *     def _store_back_globals(self):
 */
  /*else*/ {
    __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_MazeError); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1022, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_2);
    __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_tuple__54, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1022, __pyx_L1_error)
    __Pyx_GOTREF(__pyx_t_1);
    __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
    __Pyx_Raise(__pyx_t_1, 0, 0, 0);
    __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
    __PYX_ERR(0, 1022, __pyx_L1_error)
  }
  __pyx_L3:;

  /* "daedalus/_maze.pyx":1004
 * 
 *     @staticmethod
 *     def _handle_save_retval(rv):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper method to handle return values from the Save* methods.
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_AddTraceback("daedalus._maze.Maze._handle_save_retval", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":1024
 *             raise MazeError('Unknown return value from Maze save function.')
 * 
 *     def _store_back_globals(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper function to retrieve global variable values and store them
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_68_store_back_globals(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_67_store_back_globals[] = "\n        Helper function to retrieve global variable values and store them\n        into this instance after creating a maze.\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_68_store_back_globals(PyObject *__pyx_v_self, CYTHON_UNUSED PyObject *unused) {
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("_store_back_globals (wrapper)", 0);
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_67_store_back_globals(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self));

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_67_store_back_globals(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self) {
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  int __pyx_t_1;
  __Pyx_RefNannySetupContext("_store_back_globals", 0);

  /* "daedalus/_maze.pyx":1029
 *         into this instance after creating a maze.
 *         '''
 *         self._xEntrance = ms.xEntrance             # <<<<<<<<<<<<<<
 *         self._yEntrance = ms.yEntrance
 *         self._xExit     = ms.xExit
 */
  __pyx_t_1 = ms.xEntrance;
  __pyx_v_self->_xEntrance = __pyx_t_1;

  /* "daedalus/_maze.pyx":1030
 *         '''
 *         self._xEntrance = ms.xEntrance
 *         self._yEntrance = ms.yEntrance             # <<<<<<<<<<<<<<
 *         self._xExit     = ms.xExit
 *         self._yExit     = ms.yExit
 */
  __pyx_t_1 = ms.yEntrance;
  __pyx_v_self->_yEntrance = __pyx_t_1;

  /* "daedalus/_maze.pyx":1031
 *         self._xEntrance = ms.xEntrance
 *         self._yEntrance = ms.yEntrance
 *         self._xExit     = ms.xExit             # <<<<<<<<<<<<<<
 *         self._yExit     = ms.yExit
 * 
 */
  __pyx_t_1 = ms.xExit;
  __pyx_v_self->_xExit = __pyx_t_1;

  /* "daedalus/_maze.pyx":1032
 *         self._yEntrance = ms.yEntrance
 *         self._xExit     = ms.xExit
 *         self._yExit     = ms.yExit             # <<<<<<<<<<<<<<
 * 
 *     def save_bitmap(self, filename, kvOn=COLOR_WHITE, kvOff=COLOR_BLACK):
 */
  __pyx_t_1 = ms.yExit;
  __pyx_v_self->_yExit = __pyx_t_1;

  /* "daedalus/_maze.pyx":1024
 *             raise MazeError('Unknown return value from Maze save function.')
 * 
 *     def _store_back_globals(self):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper function to retrieve global variable values and store them
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":1034
 *         self._yExit     = ms.yExit
 * 
 *     def save_bitmap(self, filename, kvOn=COLOR_WHITE, kvOff=COLOR_BLACK):             # <<<<<<<<<<<<<<
 *         '''
 *         Saves this Maze object as a bitmap to the given path.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_70save_bitmap(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_69save_bitmap[] = "\n        Saves this Maze object as a bitmap to the given path.\n\n        :param str filename: The name of the file to write the bitmap\n            to.\n        :param int kvOn: The colour to draw wall pixels.  Defaults to\n            white (COLOR_WHITE).\n        :param int kvOff: The colour to draw passage pixels.  Defaults\n            to black (COLOR_BLACK).\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_70save_bitmap(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_filename = 0;
  PyObject *__pyx_v_kvOn = 0;
  PyObject *__pyx_v_kvOff = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("save_bitmap (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_kvOn,&__pyx_n_s_kvOff,0};
    PyObject* values[3] = {0,0,0};
    values[1] = __pyx_k__55;
    values[2] = __pyx_k__56;
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_kvOn);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_kvOff);
          if (value) { values[2] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "save_bitmap") < 0)) __PYX_ERR(0, 1034, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_filename = values[0];
    __pyx_v_kvOn = values[1];
    __pyx_v_kvOff = values[2];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("save_bitmap", 0, 1, 3, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1034, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.save_bitmap", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_69save_bitmap(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_filename, __pyx_v_kvOn, __pyx_v_kvOff);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_69save_bitmap(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_filename, PyObject *__pyx_v_kvOn, PyObject *__pyx_v_kvOff) {
  int __pyx_v_retval;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  char const *__pyx_t_1;
  KV __pyx_t_2;
  KV __pyx_t_3;
  PyObject *__pyx_t_4 = NULL;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  __Pyx_RefNannySetupContext("save_bitmap", 0);

  /* "daedalus/_maze.pyx":1046
 *         :rtype: None
 *         '''
 *         retval = cpp_SaveBitmap(self._maze, filename, kvOn, kvOff)             # <<<<<<<<<<<<<<
 *         self._handle_save_retval(retval)
 * 
 */
  __pyx_t_1 = __Pyx_PyObject_AsString(__pyx_v_filename); if (unlikely((!__pyx_t_1) && PyErr_Occurred())) __PYX_ERR(0, 1046, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyInt_As_KV(__pyx_v_kvOn); if (unlikely((__pyx_t_2 == ((KV)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1046, __pyx_L1_error)
  __pyx_t_3 = __Pyx_PyInt_As_KV(__pyx_v_kvOff); if (unlikely((__pyx_t_3 == ((KV)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1046, __pyx_L1_error)
  __pyx_v_retval = cpp_SaveBitmap(__pyx_v_self->_maze, __pyx_t_1, __pyx_t_2, __pyx_t_3);

  /* "daedalus/_maze.pyx":1047
 *         '''
 *         retval = cpp_SaveBitmap(self._maze, filename, kvOn, kvOff)
 *         self._handle_save_retval(retval)             # <<<<<<<<<<<<<<
 * 
 *     def save_text(self, filename, fTextClip=True, fLineChar=False, fTextTab=False):
 */
  __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_handle_save_retval); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1047, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_5);
  __pyx_t_6 = __Pyx_PyInt_From_int(__pyx_v_retval); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1047, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_7 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_5))) {
    __pyx_t_7 = PyMethod_GET_SELF(__pyx_t_5);
    if (likely(__pyx_t_7)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_5);
      __Pyx_INCREF(__pyx_t_7);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_5, function);
    }
  }
  if (!__pyx_t_7) {
    __pyx_t_4 = __Pyx_PyObject_CallOneArg(__pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1047, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    __Pyx_GOTREF(__pyx_t_4);
  } else {
    #if CYTHON_FAST_PYCALL
    if (PyFunction_Check(__pyx_t_5)) {
      PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};
      __pyx_t_4 = __Pyx_PyFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1047, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;
      __Pyx_GOTREF(__pyx_t_4);
      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    } else
    #endif
    #if CYTHON_FAST_PYCCALL
    if (__Pyx_PyFastCFunction_Check(__pyx_t_5)) {
      PyObject *__pyx_temp[2] = {__pyx_t_7, __pyx_t_6};
      __pyx_t_4 = __Pyx_PyCFunction_FastCall(__pyx_t_5, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1047, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_7); __pyx_t_7 = 0;
      __Pyx_GOTREF(__pyx_t_4);
      __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
    } else
    #endif
    {
      __pyx_t_8 = PyTuple_New(1+1); if (unlikely(!__pyx_t_8)) __PYX_ERR(0, 1047, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_8);
      __Pyx_GIVEREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_7); __pyx_t_7 = NULL;
      __Pyx_GIVEREF(__pyx_t_6);
      PyTuple_SET_ITEM(__pyx_t_8, 0+1, __pyx_t_6);
      __pyx_t_6 = 0;
      __pyx_t_4 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_8, NULL); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 1047, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_4);
      __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0;
    }
  }
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;

  /* "daedalus/_maze.pyx":1034
 *         self._yExit     = ms.yExit
 * 
 *     def save_bitmap(self, filename, kvOn=COLOR_WHITE, kvOff=COLOR_BLACK):             # <<<<<<<<<<<<<<
 *         '''
 *         Saves this Maze object as a bitmap to the given path.
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_4);
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_AddTraceback("daedalus._maze.Maze.save_bitmap", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

/* "daedalus/_maze.pyx":1049
 *         self._handle_save_retval(retval)
 * 
 *     def save_text(self, filename, fTextClip=True, fLineChar=False, fTextTab=False):             # <<<<<<<<<<<<<<
 *         '''
 *         Saves this Maze object formatted in ASCII text to the given path.
 */

/* Python wrapper */
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_72save_text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/
static char __pyx_doc_8daedalus_5_maze_4Maze_71save_text[] = "\n        Saves this Maze object formatted in ASCII text to the given path.\n\n        :param str filename: the name of the file to write the ASCII\n            representation to\n        :param bool fTextClip: If this flag is set, lines in the file\n            will never end with spaces (trailing space characters are\n            dropped). defaults to True\n        :param bool fLineChar: If this flag is set, maze walls are\n            drawn using horizontal (-) and vertical (|) lines, and\n            intersections (+).  If not, walls are drawn using hash\n            characters (#). Defaults to False.\n        :param bool fTextTab: Insert a tab between each\n            character. Defaults to False.\n        :rtype: None\n        ";
static PyObject *__pyx_pw_8daedalus_5_maze_4Maze_72save_text(PyObject *__pyx_v_self, PyObject *__pyx_args, PyObject *__pyx_kwds) {
  PyObject *__pyx_v_filename = 0;
  PyObject *__pyx_v_fTextClip = 0;
  PyObject *__pyx_v_fLineChar = 0;
  PyObject *__pyx_v_fTextTab = 0;
  PyObject *__pyx_r = 0;
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("save_text (wrapper)", 0);
  {
    static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_filename,&__pyx_n_s_fTextClip,&__pyx_n_s_fLineChar,&__pyx_n_s_fTextTab,0};
    PyObject* values[4] = {0,0,0,0};
    values[1] = ((PyObject *)Py_True);
    values[2] = ((PyObject *)Py_False);
    values[3] = ((PyObject *)Py_False);
    if (unlikely(__pyx_kwds)) {
      Py_ssize_t kw_args;
      const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args);
      switch (pos_args) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        case  0: break;
        default: goto __pyx_L5_argtuple_error;
      }
      kw_args = PyDict_Size(__pyx_kwds);
      switch (pos_args) {
        case  0:
        if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_filename)) != 0)) kw_args--;
        else goto __pyx_L5_argtuple_error;
        case  1:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTextClip);
          if (value) { values[1] = value; kw_args--; }
        }
        case  2:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fLineChar);
          if (value) { values[2] = value; kw_args--; }
        }
        case  3:
        if (kw_args > 0) {
          PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fTextTab);
          if (value) { values[3] = value; kw_args--; }
        }
      }
      if (unlikely(kw_args > 0)) {
        if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "save_text") < 0)) __PYX_ERR(0, 1049, __pyx_L3_error)
      }
    } else {
      switch (PyTuple_GET_SIZE(__pyx_args)) {
        case  4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3);
        case  3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2);
        case  2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1);
        case  1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0);
        break;
        default: goto __pyx_L5_argtuple_error;
      }
    }
    __pyx_v_filename = values[0];
    __pyx_v_fTextClip = values[1];
    __pyx_v_fLineChar = values[2];
    __pyx_v_fTextTab = values[3];
  }
  goto __pyx_L4_argument_unpacking_done;
  __pyx_L5_argtuple_error:;
  __Pyx_RaiseArgtupleInvalid("save_text", 0, 1, 4, PyTuple_GET_SIZE(__pyx_args)); __PYX_ERR(0, 1049, __pyx_L3_error)
  __pyx_L3_error:;
  __Pyx_AddTraceback("daedalus._maze.Maze.save_text", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __Pyx_RefNannyFinishContext();
  return NULL;
  __pyx_L4_argument_unpacking_done:;
  __pyx_r = __pyx_pf_8daedalus_5_maze_4Maze_71save_text(((struct __pyx_obj_8daedalus_5_maze_Maze *)__pyx_v_self), __pyx_v_filename, __pyx_v_fTextClip, __pyx_v_fLineChar, __pyx_v_fTextTab);

  /* function exit code */
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_pf_8daedalus_5_maze_4Maze_71save_text(struct __pyx_obj_8daedalus_5_maze_Maze *__pyx_v_self, PyObject *__pyx_v_filename, PyObject *__pyx_v_fTextClip, PyObject *__pyx_v_fLineChar, PyObject *__pyx_v_fTextTab) {
  int __pyx_v_retval;
  PyObject *__pyx_r = NULL;
  __Pyx_RefNannyDeclarations
  char const *__pyx_t_1;
  bool __pyx_t_2;
  bool __pyx_t_3;
  bool __pyx_t_4;
  PyObject *__pyx_t_5 = NULL;
  PyObject *__pyx_t_6 = NULL;
  PyObject *__pyx_t_7 = NULL;
  PyObject *__pyx_t_8 = NULL;
  PyObject *__pyx_t_9 = NULL;
  __Pyx_RefNannySetupContext("save_text", 0);

  /* "daedalus/_maze.pyx":1066
 *         :rtype: None
 *         '''
 *         retval =  cpp_SaveText(self._maze, filename, fTextClip, fLineChar, fTextTab)             # <<<<<<<<<<<<<<
 *         self._handle_save_retval(retval)
 */
  __pyx_t_1 = __Pyx_PyObject_AsString(__pyx_v_filename); if (unlikely((!__pyx_t_1) && PyErr_Occurred())) __PYX_ERR(0, 1066, __pyx_L1_error)
  __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_fTextClip); if (unlikely((__pyx_t_2 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1066, __pyx_L1_error)
  __pyx_t_3 = __Pyx_PyObject_IsTrue(__pyx_v_fLineChar); if (unlikely((__pyx_t_3 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1066, __pyx_L1_error)
  __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_v_fTextTab); if (unlikely((__pyx_t_4 == ((bool)-1)) && PyErr_Occurred())) __PYX_ERR(0, 1066, __pyx_L1_error)
  __pyx_v_retval = cpp_SaveText(__pyx_v_self->_maze, __pyx_t_1, __pyx_t_2, __pyx_t_3, __pyx_t_4);

  /* "daedalus/_maze.pyx":1067
 *         '''
 *         retval =  cpp_SaveText(self._maze, filename, fTextClip, fLineChar, fTextTab)
 *         self._handle_save_retval(retval)             # <<<<<<<<<<<<<<
 */
  __pyx_t_6 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_self), __pyx_n_s_handle_save_retval); if (unlikely(!__pyx_t_6)) __PYX_ERR(0, 1067, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_6);
  __pyx_t_7 = __Pyx_PyInt_From_int(__pyx_v_retval); if (unlikely(!__pyx_t_7)) __PYX_ERR(0, 1067, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_7);
  __pyx_t_8 = NULL;
  if (CYTHON_UNPACK_METHODS && likely(PyMethod_Check(__pyx_t_6))) {
    __pyx_t_8 = PyMethod_GET_SELF(__pyx_t_6);
    if (likely(__pyx_t_8)) {
      PyObject* function = PyMethod_GET_FUNCTION(__pyx_t_6);
      __Pyx_INCREF(__pyx_t_8);
      __Pyx_INCREF(function);
      __Pyx_DECREF_SET(__pyx_t_6, function);
    }
  }
  if (!__pyx_t_8) {
    __pyx_t_5 = __Pyx_PyObject_CallOneArg(__pyx_t_6, __pyx_t_7); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1067, __pyx_L1_error)
    __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    __Pyx_GOTREF(__pyx_t_5);
  } else {
    #if CYTHON_FAST_PYCALL
    if (PyFunction_Check(__pyx_t_6)) {
      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_7};
      __pyx_t_5 = __Pyx_PyFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1067, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;
      __Pyx_GOTREF(__pyx_t_5);
      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    } else
    #endif
    #if CYTHON_FAST_PYCCALL
    if (__Pyx_PyFastCFunction_Check(__pyx_t_6)) {
      PyObject *__pyx_temp[2] = {__pyx_t_8, __pyx_t_7};
      __pyx_t_5 = __Pyx_PyCFunction_FastCall(__pyx_t_6, __pyx_temp+1-1, 1+1); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1067, __pyx_L1_error)
      __Pyx_XDECREF(__pyx_t_8); __pyx_t_8 = 0;
      __Pyx_GOTREF(__pyx_t_5);
      __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0;
    } else
    #endif
    {
      __pyx_t_9 = PyTuple_New(1+1); if (unlikely(!__pyx_t_9)) __PYX_ERR(0, 1067, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_9);
      __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_8); __pyx_t_8 = NULL;
      __Pyx_GIVEREF(__pyx_t_7);
      PyTuple_SET_ITEM(__pyx_t_9, 0+1, __pyx_t_7);
      __pyx_t_7 = 0;
      __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_9, NULL); if (unlikely(!__pyx_t_5)) __PYX_ERR(0, 1067, __pyx_L1_error)
      __Pyx_GOTREF(__pyx_t_5);
      __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0;
    }
  }
  __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0;
  __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0;

  /* "daedalus/_maze.pyx":1049
 *         self._handle_save_retval(retval)
 * 
 *     def save_text(self, filename, fTextClip=True, fLineChar=False, fTextTab=False):             # <<<<<<<<<<<<<<
 *         '''
 *         Saves this Maze object formatted in ASCII text to the given path.
 */

  /* function exit code */
  __pyx_r = Py_None; __Pyx_INCREF(Py_None);
  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_5);
  __Pyx_XDECREF(__pyx_t_6);
  __Pyx_XDECREF(__pyx_t_7);
  __Pyx_XDECREF(__pyx_t_8);
  __Pyx_XDECREF(__pyx_t_9);
  __Pyx_AddTraceback("daedalus._maze.Maze.save_text", __pyx_clineno, __pyx_lineno, __pyx_filename);
  __pyx_r = NULL;
  __pyx_L0:;
  __Pyx_XGIVEREF(__pyx_r);
  __Pyx_RefNannyFinishContext();
  return __pyx_r;
}

static PyObject *__pyx_tp_new_8daedalus_5_maze_Maze(PyTypeObject *t, PyObject *a, PyObject *k) {
  PyObject *o;
  if (likely((t->tp_flags & Py_TPFLAGS_IS_ABSTRACT) == 0)) {
    o = (*t->tp_alloc)(t, 0);
  } else {
    o = (PyObject *) PyBaseObject_Type.tp_new(t, __pyx_empty_tuple, 0);
  }
  if (unlikely(!o)) return 0;
  if (unlikely(__pyx_pw_8daedalus_5_maze_4Maze_1__cinit__(o, a, k) < 0)) goto bad;
  return o;
  bad:
  Py_DECREF(o); o = 0;
  return NULL;
}

static void __pyx_tp_dealloc_8daedalus_5_maze_Maze(PyObject *o) {
  #if PY_VERSION_HEX >= 0x030400a1
  if (unlikely(Py_TYPE(o)->tp_finalize) && (!PyType_IS_GC(Py_TYPE(o)) || !_PyGC_FINALIZED(o))) {
    if (PyObject_CallFinalizerFromDealloc(o)) return;
  }
  #endif
  {
    PyObject *etype, *eval, *etb;
    PyErr_Fetch(&etype, &eval, &etb);
    ++Py_REFCNT(o);
    __pyx_pw_8daedalus_5_maze_4Maze_3__dealloc__(o);
    --Py_REFCNT(o);
    PyErr_Restore(etype, eval, etb);
  }
  (*Py_TYPE(o)->tp_free)(o);
}
static PyObject *__pyx_sq_item_8daedalus_5_maze_Maze(PyObject *o, Py_ssize_t i) {
  PyObject *r;
  PyObject *x = PyInt_FromSsize_t(i); if(!x) return 0;
  r = Py_TYPE(o)->tp_as_mapping->mp_subscript(o, x);
  Py_DECREF(x);
  return r;
}

static PyObject *__pyx_getprop_8daedalus_5_maze_4Maze_width(PyObject *o, CYTHON_UNUSED void *x) {
  return __pyx_pw_8daedalus_5_maze_4Maze_5width_1__get__(o);
}

static PyObject *__pyx_getprop_8daedalus_5_maze_4Maze_height(PyObject *o, CYTHON_UNUSED void *x) {
  return __pyx_pw_8daedalus_5_maze_4Maze_6height_1__get__(o);
}

static PyObject *__pyx_getprop_8daedalus_5_maze_4Maze_entrance(PyObject *o, CYTHON_UNUSED void *x) {
  return __pyx_pw_8daedalus_5_maze_4Maze_8entrance_1__get__(o);
}

static PyObject *__pyx_getprop_8daedalus_5_maze_4Maze_exit(PyObject *o, CYTHON_UNUSED void *x) {
  return __pyx_pw_8daedalus_5_maze_4Maze_4exit_1__get__(o);
}

static PyMethodDef __pyx_methods_8daedalus_5_maze_Maze[] = {
  {"index", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_18index, METH_O, __pyx_doc_8daedalus_5_maze_4Maze_17index},
  {"count", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_20count, METH_O, __pyx_doc_8daedalus_5_maze_4Maze_19count},
  {"get", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_22get, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_21get},
  {"create_perfect", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_24create_perfect, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_23create_perfect},
  {"create_perfect2", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_26create_perfect2, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_25create_perfect2},
  {"create_braid", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_28create_braid, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_27create_braid},
  {"create_braid_tilt", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_30create_braid_tilt, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_29create_braid_tilt},
  {"create_spiral", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_32create_spiral, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_31create_spiral},
  {"create_diagonal", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_34create_diagonal, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_33create_diagonal},
  {"create_recursive", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_36create_recursive, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_35create_recursive},
  {"create_prim", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_38create_prim, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_37create_prim},
  {"create_prim2", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_40create_prim2, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_39create_prim2},
  {"create_kruskal", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_42create_kruskal, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_41create_kruskal},
  {"create_tree", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_44create_tree, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_43create_tree},
  {"create_forest", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_46create_forest, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_45create_forest},
  {"create_aldous_broder", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_48create_aldous_broder, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_47create_aldous_broder},
  {"create_wilson", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_50create_wilson, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_49create_wilson},
  {"create_eller", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_52create_eller, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_51create_eller},
  {"create_braid_eller", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_54create_braid_eller, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_53create_braid_eller},
  {"create_division", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_56create_division, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_55create_division},
  {"create_binary", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_58create_binary, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_57create_binary},
  {"create_sidewinder", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_60create_sidewinder, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_59create_sidewinder},
  {"create_unicursal", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_62create_unicursal, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_61create_unicursal},
  {"resize", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_64resize, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_63resize},
  {"_handle_save_retval", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_66_handle_save_retval, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_65_handle_save_retval},
  {"_store_back_globals", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_68_store_back_globals, METH_NOARGS, __pyx_doc_8daedalus_5_maze_4Maze_67_store_back_globals},
  {"save_bitmap", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_70save_bitmap, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_69save_bitmap},
  {"save_text", (PyCFunction)__pyx_pw_8daedalus_5_maze_4Maze_72save_text, METH_VARARGS|METH_KEYWORDS, __pyx_doc_8daedalus_5_maze_4Maze_71save_text},
  {0, 0, 0, 0}
};

static struct PyGetSetDef __pyx_getsets_8daedalus_5_maze_Maze[] = {
  {(char *)"width", __pyx_getprop_8daedalus_5_maze_4Maze_width, 0, (char *)"\n        Returns this Maze's width.\n        ", 0},
  {(char *)"height", __pyx_getprop_8daedalus_5_maze_4Maze_height, 0, (char *)"\n        Returns this Maze's height.\n        ", 0},
  {(char *)"entrance", __pyx_getprop_8daedalus_5_maze_4Maze_entrance, 0, (char *)"\n        Returns this Maze's entrance location as a tuple (x,y).\n        ", 0},
  {(char *)"exit", __pyx_getprop_8daedalus_5_maze_4Maze_exit, 0, (char *)"\n        Returns this Maze's exit location as a tuple (x,y).\n        ", 0},
  {0, 0, 0, 0, 0}
};

static PySequenceMethods __pyx_tp_as_sequence_Maze = {
  __pyx_pw_8daedalus_5_maze_4Maze_5__len__, /*sq_length*/
  0, /*sq_concat*/
  0, /*sq_repeat*/
  __pyx_sq_item_8daedalus_5_maze_Maze, /*sq_item*/
  0, /*sq_slice*/
  0, /*sq_ass_item*/
  0, /*sq_ass_slice*/
  __pyx_pw_8daedalus_5_maze_4Maze_9__contains__, /*sq_contains*/
  0, /*sq_inplace_concat*/
  0, /*sq_inplace_repeat*/
};

static PyMappingMethods __pyx_tp_as_mapping_Maze = {
  __pyx_pw_8daedalus_5_maze_4Maze_5__len__, /*mp_length*/
  __pyx_pw_8daedalus_5_maze_4Maze_7__getitem__, /*mp_subscript*/
  0, /*mp_ass_subscript*/
};

static PyTypeObject __pyx_type_8daedalus_5_maze_Maze = {
  PyVarObject_HEAD_INIT(0, 0)
  "daedalus._maze.Maze", /*tp_name*/
  sizeof(struct __pyx_obj_8daedalus_5_maze_Maze), /*tp_basicsize*/
  0, /*tp_itemsize*/
  __pyx_tp_dealloc_8daedalus_5_maze_Maze, /*tp_dealloc*/
  0, /*tp_print*/
  0, /*tp_getattr*/
  0, /*tp_setattr*/
  #if PY_MAJOR_VERSION < 3
  0, /*tp_compare*/
  #endif
  #if PY_MAJOR_VERSION >= 3
  0, /*tp_as_async*/
  #endif
  __pyx_pw_8daedalus_5_maze_4Maze_16__repr__, /*tp_repr*/
  0, /*tp_as_number*/
  &__pyx_tp_as_sequence_Maze, /*tp_as_sequence*/
  &__pyx_tp_as_mapping_Maze, /*tp_as_mapping*/
  0, /*tp_hash*/
  0, /*tp_call*/
  __pyx_pw_8daedalus_5_maze_4Maze_14__str__, /*tp_str*/
  0, /*tp_getattro*/
  0, /*tp_setattro*/
  0, /*tp_as_buffer*/
  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_BASETYPE, /*tp_flags*/
  "\n    A monochrome daedalus Maze object.\n\n    Even-numbered rows and columns in the Maze are walls, and\n    odd-numbered rows and columns are passages.\n\n    Walls are \"on\" pixels and passages are \"off\" pixels.\n    ", /*tp_doc*/
  0, /*tp_traverse*/
  0, /*tp_clear*/
  0, /*tp_richcompare*/
  0, /*tp_weaklistoffset*/
  __pyx_pw_8daedalus_5_maze_4Maze_11__iter__, /*tp_iter*/
  0, /*tp_iternext*/
  __pyx_methods_8daedalus_5_maze_Maze, /*tp_methods*/
  0, /*tp_members*/
  __pyx_getsets_8daedalus_5_maze_Maze, /*tp_getset*/
  0, /*tp_base*/
  0, /*tp_dict*/
  0, /*tp_descr_get*/
  0, /*tp_descr_set*/
  0, /*tp_dictoffset*/
  0, /*tp_init*/
  0, /*tp_alloc*/
  __pyx_tp_new_8daedalus_5_maze_Maze, /*tp_new*/
  0, /*tp_free*/
  0, /*tp_is_gc*/
  0, /*tp_bases*/
  0, /*tp_mro*/
  0, /*tp_cache*/
  0, /*tp_subclasses*/
  0, /*tp_weaklist*/
  0, /*tp_del*/
  0, /*tp_version_tag*/
  #if PY_VERSION_HEX >= 0x030400a1
  0, /*tp_finalize*/
  #endif
};

static struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *__pyx_freelist_8daedalus_5_maze___pyx_scope_struct____iter__[8];
static int __pyx_freecount_8daedalus_5_maze___pyx_scope_struct____iter__ = 0;

static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct____iter__(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {
  PyObject *o;
  if (CYTHON_COMPILING_IN_CPYTHON && likely((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct____iter__ > 0) & (t->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__)))) {
    o = (PyObject*)__pyx_freelist_8daedalus_5_maze___pyx_scope_struct____iter__[--__pyx_freecount_8daedalus_5_maze___pyx_scope_struct____iter__];
    memset(o, 0, sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__));
    (void) PyObject_INIT(o, t);
    PyObject_GC_Track(o);
  } else {
    o = (*t->tp_alloc)(t, 0);
    if (unlikely(!o)) return 0;
  }
  return o;
}

static void __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct____iter__(PyObject *o) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)o;
  PyObject_GC_UnTrack(o);
  Py_CLEAR(p->__pyx_v_i);
  Py_CLEAR(p->__pyx_v_self);
  Py_CLEAR(p->__pyx_v_v);
  Py_CLEAR(p->__pyx_t_0);
  Py_CLEAR(p->__pyx_t_1);
  Py_CLEAR(p->__pyx_t_2);
  if (CYTHON_COMPILING_IN_CPYTHON && ((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct____iter__ < 8) & (Py_TYPE(o)->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__)))) {
    __pyx_freelist_8daedalus_5_maze___pyx_scope_struct____iter__[__pyx_freecount_8daedalus_5_maze___pyx_scope_struct____iter__++] = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)o);
  } else {
    (*Py_TYPE(o)->tp_free)(o);
  }
}

static int __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct____iter__(PyObject *o, visitproc v, void *a) {
  int e;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)o;
  if (p->__pyx_v_i) {
    e = (*v)(p->__pyx_v_i, a); if (e) return e;
  }
  if (p->__pyx_v_self) {
    e = (*v)(((PyObject*)p->__pyx_v_self), a); if (e) return e;
  }
  if (p->__pyx_v_v) {
    e = (*v)(p->__pyx_v_v, a); if (e) return e;
  }
  if (p->__pyx_t_0) {
    e = (*v)(p->__pyx_t_0, a); if (e) return e;
  }
  if (p->__pyx_t_1) {
    e = (*v)(p->__pyx_t_1, a); if (e) return e;
  }
  if (p->__pyx_t_2) {
    e = (*v)(p->__pyx_t_2, a); if (e) return e;
  }
  return 0;
}

static int __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct____iter__(PyObject *o) {
  PyObject* tmp;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__ *)o;
  tmp = ((PyObject*)p->__pyx_v_i);
  p->__pyx_v_i = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_v_self);
  p->__pyx_v_self = ((struct __pyx_obj_8daedalus_5_maze_Maze *)Py_None); Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_v_v);
  p->__pyx_v_v = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_t_0);
  p->__pyx_t_0 = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_t_1);
  p->__pyx_t_1 = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_t_2);
  p->__pyx_t_2 = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  return 0;
}

static PyTypeObject __pyx_type_8daedalus_5_maze___pyx_scope_struct____iter__ = {
  PyVarObject_HEAD_INIT(0, 0)
  "daedalus._maze.__pyx_scope_struct____iter__", /*tp_name*/
  sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct____iter__), /*tp_basicsize*/
  0, /*tp_itemsize*/
  __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct____iter__, /*tp_dealloc*/
  0, /*tp_print*/
  0, /*tp_getattr*/
  0, /*tp_setattr*/
  #if PY_MAJOR_VERSION < 3
  0, /*tp_compare*/
  #endif
  #if PY_MAJOR_VERSION >= 3
  0, /*tp_as_async*/
  #endif
  0, /*tp_repr*/
  0, /*tp_as_number*/
  0, /*tp_as_sequence*/
  0, /*tp_as_mapping*/
  0, /*tp_hash*/
  0, /*tp_call*/
  0, /*tp_str*/
  0, /*tp_getattro*/
  0, /*tp_setattro*/
  0, /*tp_as_buffer*/
  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_HAVE_GC, /*tp_flags*/
  0, /*tp_doc*/
  __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct____iter__, /*tp_traverse*/
  __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct____iter__, /*tp_clear*/
  0, /*tp_richcompare*/
  0, /*tp_weaklistoffset*/
  0, /*tp_iter*/
  0, /*tp_iternext*/
  0, /*tp_methods*/
  0, /*tp_members*/
  0, /*tp_getset*/
  0, /*tp_base*/
  0, /*tp_dict*/
  0, /*tp_descr_get*/
  0, /*tp_descr_set*/
  0, /*tp_dictoffset*/
  0, /*tp_init*/
  0, /*tp_alloc*/
  __pyx_tp_new_8daedalus_5_maze___pyx_scope_struct____iter__, /*tp_new*/
  0, /*tp_free*/
  0, /*tp_is_gc*/
  0, /*tp_bases*/
  0, /*tp_mro*/
  0, /*tp_cache*/
  0, /*tp_subclasses*/
  0, /*tp_weaklist*/
  0, /*tp_del*/
  0, /*tp_version_tag*/
  #if PY_VERSION_HEX >= 0x030400a1
  0, /*tp_finalize*/
  #endif
};

static struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *__pyx_freelist_8daedalus_5_maze___pyx_scope_struct_1_count[8];
static int __pyx_freecount_8daedalus_5_maze___pyx_scope_struct_1_count = 0;

static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_1_count(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {
  PyObject *o;
  if (CYTHON_COMPILING_IN_CPYTHON && likely((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_1_count > 0) & (t->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count)))) {
    o = (PyObject*)__pyx_freelist_8daedalus_5_maze___pyx_scope_struct_1_count[--__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_1_count];
    memset(o, 0, sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count));
    (void) PyObject_INIT(o, t);
    PyObject_GC_Track(o);
  } else {
    o = (*t->tp_alloc)(t, 0);
    if (unlikely(!o)) return 0;
  }
  return o;
}

static void __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct_1_count(PyObject *o) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)o;
  PyObject_GC_UnTrack(o);
  Py_CLEAR(p->__pyx_v_self);
  Py_CLEAR(p->__pyx_v_value);
  if (CYTHON_COMPILING_IN_CPYTHON && ((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_1_count < 8) & (Py_TYPE(o)->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count)))) {
    __pyx_freelist_8daedalus_5_maze___pyx_scope_struct_1_count[__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_1_count++] = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)o);
  } else {
    (*Py_TYPE(o)->tp_free)(o);
  }
}

static int __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct_1_count(PyObject *o, visitproc v, void *a) {
  int e;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)o;
  if (p->__pyx_v_self) {
    e = (*v)(((PyObject*)p->__pyx_v_self), a); if (e) return e;
  }
  if (p->__pyx_v_value) {
    e = (*v)(p->__pyx_v_value, a); if (e) return e;
  }
  return 0;
}

static int __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct_1_count(PyObject *o) {
  PyObject* tmp;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)o;
  tmp = ((PyObject*)p->__pyx_v_self);
  p->__pyx_v_self = ((struct __pyx_obj_8daedalus_5_maze_Maze *)Py_None); Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_v_value);
  p->__pyx_v_value = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  return 0;
}

static PyTypeObject __pyx_type_8daedalus_5_maze___pyx_scope_struct_1_count = {
  PyVarObject_HEAD_INIT(0, 0)
  "daedalus._maze.__pyx_scope_struct_1_count", /*tp_name*/
  sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count), /*tp_basicsize*/
  0, /*tp_itemsize*/
  __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct_1_count, /*tp_dealloc*/
  0, /*tp_print*/
  0, /*tp_getattr*/
  0, /*tp_setattr*/
  #if PY_MAJOR_VERSION < 3
  0, /*tp_compare*/
  #endif
  #if PY_MAJOR_VERSION >= 3
  0, /*tp_as_async*/
  #endif
  0, /*tp_repr*/
  0, /*tp_as_number*/
  0, /*tp_as_sequence*/
  0, /*tp_as_mapping*/
  0, /*tp_hash*/
  0, /*tp_call*/
  0, /*tp_str*/
  0, /*tp_getattro*/
  0, /*tp_setattro*/
  0, /*tp_as_buffer*/
  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_HAVE_GC, /*tp_flags*/
  0, /*tp_doc*/
  __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct_1_count, /*tp_traverse*/
  __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct_1_count, /*tp_clear*/
  0, /*tp_richcompare*/
  0, /*tp_weaklistoffset*/
  0, /*tp_iter*/
  0, /*tp_iternext*/
  0, /*tp_methods*/
  0, /*tp_members*/
  0, /*tp_getset*/
  0, /*tp_base*/
  0, /*tp_dict*/
  0, /*tp_descr_get*/
  0, /*tp_descr_set*/
  0, /*tp_dictoffset*/
  0, /*tp_init*/
  0, /*tp_alloc*/
  __pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_1_count, /*tp_new*/
  0, /*tp_free*/
  0, /*tp_is_gc*/
  0, /*tp_bases*/
  0, /*tp_mro*/
  0, /*tp_cache*/
  0, /*tp_subclasses*/
  0, /*tp_weaklist*/
  0, /*tp_del*/
  0, /*tp_version_tag*/
  #if PY_VERSION_HEX >= 0x030400a1
  0, /*tp_finalize*/
  #endif
};

static struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *__pyx_freelist_8daedalus_5_maze___pyx_scope_struct_2_genexpr[8];
static int __pyx_freecount_8daedalus_5_maze___pyx_scope_struct_2_genexpr = 0;

static PyObject *__pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_2_genexpr(PyTypeObject *t, CYTHON_UNUSED PyObject *a, CYTHON_UNUSED PyObject *k) {
  PyObject *o;
  if (CYTHON_COMPILING_IN_CPYTHON && likely((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_2_genexpr > 0) & (t->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr)))) {
    o = (PyObject*)__pyx_freelist_8daedalus_5_maze___pyx_scope_struct_2_genexpr[--__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_2_genexpr];
    memset(o, 0, sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr));
    (void) PyObject_INIT(o, t);
    PyObject_GC_Track(o);
  } else {
    o = (*t->tp_alloc)(t, 0);
    if (unlikely(!o)) return 0;
  }
  return o;
}

static void __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct_2_genexpr(PyObject *o) {
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)o;
  PyObject_GC_UnTrack(o);
  Py_CLEAR(p->__pyx_outer_scope);
  Py_CLEAR(p->__pyx_v_v);
  Py_CLEAR(p->__pyx_t_0);
  if (CYTHON_COMPILING_IN_CPYTHON && ((__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_2_genexpr < 8) & (Py_TYPE(o)->tp_basicsize == sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr)))) {
    __pyx_freelist_8daedalus_5_maze___pyx_scope_struct_2_genexpr[__pyx_freecount_8daedalus_5_maze___pyx_scope_struct_2_genexpr++] = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)o);
  } else {
    (*Py_TYPE(o)->tp_free)(o);
  }
}

static int __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct_2_genexpr(PyObject *o, visitproc v, void *a) {
  int e;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)o;
  if (p->__pyx_outer_scope) {
    e = (*v)(((PyObject*)p->__pyx_outer_scope), a); if (e) return e;
  }
  if (p->__pyx_v_v) {
    e = (*v)(p->__pyx_v_v, a); if (e) return e;
  }
  if (p->__pyx_t_0) {
    e = (*v)(p->__pyx_t_0, a); if (e) return e;
  }
  return 0;
}

static int __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct_2_genexpr(PyObject *o) {
  PyObject* tmp;
  struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *p = (struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr *)o;
  tmp = ((PyObject*)p->__pyx_outer_scope);
  p->__pyx_outer_scope = ((struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_1_count *)Py_None); Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_v_v);
  p->__pyx_v_v = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  tmp = ((PyObject*)p->__pyx_t_0);
  p->__pyx_t_0 = Py_None; Py_INCREF(Py_None);
  Py_XDECREF(tmp);
  return 0;
}

static PyTypeObject __pyx_type_8daedalus_5_maze___pyx_scope_struct_2_genexpr = {
  PyVarObject_HEAD_INIT(0, 0)
  "daedalus._maze.__pyx_scope_struct_2_genexpr", /*tp_name*/
  sizeof(struct __pyx_obj_8daedalus_5_maze___pyx_scope_struct_2_genexpr), /*tp_basicsize*/
  0, /*tp_itemsize*/
  __pyx_tp_dealloc_8daedalus_5_maze___pyx_scope_struct_2_genexpr, /*tp_dealloc*/
  0, /*tp_print*/
  0, /*tp_getattr*/
  0, /*tp_setattr*/
  #if PY_MAJOR_VERSION < 3
  0, /*tp_compare*/
  #endif
  #if PY_MAJOR_VERSION >= 3
  0, /*tp_as_async*/
  #endif
  0, /*tp_repr*/
  0, /*tp_as_number*/
  0, /*tp_as_sequence*/
  0, /*tp_as_mapping*/
  0, /*tp_hash*/
  0, /*tp_call*/
  0, /*tp_str*/
  0, /*tp_getattro*/
  0, /*tp_setattro*/
  0, /*tp_as_buffer*/
  Py_TPFLAGS_DEFAULT|Py_TPFLAGS_HAVE_VERSION_TAG|Py_TPFLAGS_CHECKTYPES|Py_TPFLAGS_HAVE_NEWBUFFER|Py_TPFLAGS_HAVE_GC, /*tp_flags*/
  0, /*tp_doc*/
  __pyx_tp_traverse_8daedalus_5_maze___pyx_scope_struct_2_genexpr, /*tp_traverse*/
  __pyx_tp_clear_8daedalus_5_maze___pyx_scope_struct_2_genexpr, /*tp_clear*/
  0, /*tp_richcompare*/
  0, /*tp_weaklistoffset*/
  0, /*tp_iter*/
  0, /*tp_iternext*/
  0, /*tp_methods*/
  0, /*tp_members*/
  0, /*tp_getset*/
  0, /*tp_base*/
  0, /*tp_dict*/
  0, /*tp_descr_get*/
  0, /*tp_descr_set*/
  0, /*tp_dictoffset*/
  0, /*tp_init*/
  0, /*tp_alloc*/
  __pyx_tp_new_8daedalus_5_maze___pyx_scope_struct_2_genexpr, /*tp_new*/
  0, /*tp_free*/
  0, /*tp_is_gc*/
  0, /*tp_bases*/
  0, /*tp_mro*/
  0, /*tp_cache*/
  0, /*tp_subclasses*/
  0, /*tp_weaklist*/
  0, /*tp_del*/
  0, /*tp_version_tag*/
  #if PY_VERSION_HEX >= 0x030400a1
  0, /*tp_finalize*/
  #endif
};

static PyMethodDef __pyx_methods[] = {
  {0, 0, 0, 0}
};

#if PY_MAJOR_VERSION >= 3
static struct PyModuleDef __pyx_moduledef = {
  #if PY_VERSION_HEX < 0x03020000
    { PyObject_HEAD_INIT(NULL) NULL, 0, NULL },
  #else
    PyModuleDef_HEAD_INIT,
  #endif
    "_maze",
    __pyx_k_Wrapper_for_the_daedalus_monoch, /* m_doc */
    -1, /* m_size */
    __pyx_methods /* m_methods */,
    NULL, /* m_reload */
    NULL, /* m_traverse */
    NULL, /* m_clear */
    NULL /* m_free */
};
#endif

static __Pyx_StringTabEntry __pyx_string_tab[] = {
  {&__pyx_kp_s_An_error_while_performing_an_act, __pyx_k_An_error_while_performing_an_act, sizeof(__pyx_k_An_error_while_performing_an_act), 0, 0, 1, 0},
  {&__pyx_n_s_COLOR_BLACK, __pyx_k_COLOR_BLACK, sizeof(__pyx_k_COLOR_BLACK), 0, 0, 1, 1},
  {&__pyx_n_s_COLOR_WHITE, __pyx_k_COLOR_WHITE, sizeof(__pyx_k_COLOR_WHITE), 0, 0, 1, 1},
  {&__pyx_kp_s_Could_not_construct_Maze_object, __pyx_k_Could_not_construct_Maze_object, sizeof(__pyx_k_Could_not_construct_Maze_object), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_AldousBroder_Ma, __pyx_k_Could_not_create_AldousBroder_Ma, sizeof(__pyx_k_Could_not_create_AldousBroder_Ma), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Binary_Maze, __pyx_k_Could_not_create_Binary_Maze, sizeof(__pyx_k_Could_not_create_Binary_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_BraidEller_Maze, __pyx_k_Could_not_create_BraidEller_Maze, sizeof(__pyx_k_Could_not_create_BraidEller_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_BraidTilt_Maze, __pyx_k_Could_not_create_BraidTilt_Maze, sizeof(__pyx_k_Could_not_create_BraidTilt_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Braid_Maze, __pyx_k_Could_not_create_Braid_Maze, sizeof(__pyx_k_Could_not_create_Braid_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Diagonal_Maze, __pyx_k_Could_not_create_Diagonal_Maze, sizeof(__pyx_k_Could_not_create_Diagonal_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Division_Maze, __pyx_k_Could_not_create_Division_Maze, sizeof(__pyx_k_Could_not_create_Division_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Eller_Maze, __pyx_k_Could_not_create_Eller_Maze, sizeof(__pyx_k_Could_not_create_Eller_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Forest_Maze, __pyx_k_Could_not_create_Forest_Maze, sizeof(__pyx_k_Could_not_create_Forest_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Kruskal_Maze, __pyx_k_Could_not_create_Kruskal_Maze, sizeof(__pyx_k_Could_not_create_Kruskal_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Perfect2_Maze, __pyx_k_Could_not_create_Perfect2_Maze, sizeof(__pyx_k_Could_not_create_Perfect2_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Perfect_Maze, __pyx_k_Could_not_create_Perfect_Maze, sizeof(__pyx_k_Could_not_create_Perfect_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Prim2_Maze, __pyx_k_Could_not_create_Prim2_Maze, sizeof(__pyx_k_Could_not_create_Prim2_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Prim_Maze, __pyx_k_Could_not_create_Prim_Maze, sizeof(__pyx_k_Could_not_create_Prim_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Recursive_Maze, __pyx_k_Could_not_create_Recursive_Maze, sizeof(__pyx_k_Could_not_create_Recursive_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Sidewinder_Maze, __pyx_k_Could_not_create_Sidewinder_Maze, sizeof(__pyx_k_Could_not_create_Sidewinder_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Spiral_Maze, __pyx_k_Could_not_create_Spiral_Maze, sizeof(__pyx_k_Could_not_create_Spiral_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Tree_Maze, __pyx_k_Could_not_create_Tree_Maze, sizeof(__pyx_k_Could_not_create_Tree_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Unicursal_Maze, __pyx_k_Could_not_create_Unicursal_Maze, sizeof(__pyx_k_Could_not_create_Unicursal_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_create_Wilson_Maze, __pyx_k_Could_not_create_Wilson_Maze, sizeof(__pyx_k_Could_not_create_Wilson_Maze), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_open_file, __pyx_k_Could_not_open_file, sizeof(__pyx_k_Could_not_open_file), 0, 0, 1, 0},
  {&__pyx_kp_s_Could_not_resize_the_Maze, __pyx_k_Could_not_resize_the_Maze, sizeof(__pyx_k_Could_not_resize_the_Maze), 0, 0, 1, 0},
  {&__pyx_n_s_ENTRANCE_BALANCED, __pyx_k_ENTRANCE_BALANCED, sizeof(__pyx_k_ENTRANCE_BALANCED), 0, 0, 1, 1},
  {&__pyx_n_s_ENTRANCE_CORNER, __pyx_k_ENTRANCE_CORNER, sizeof(__pyx_k_ENTRANCE_CORNER), 0, 0, 1, 1},
  {&__pyx_n_s_ENTRANCE_MIDDLE, __pyx_k_ENTRANCE_MIDDLE, sizeof(__pyx_k_ENTRANCE_MIDDLE), 0, 0, 1, 1},
  {&__pyx_n_s_ENTRANCE_RANDOM, __pyx_k_ENTRANCE_RANDOM, sizeof(__pyx_k_ENTRANCE_RANDOM), 0, 0, 1, 1},
  {&__pyx_n_s_IndexError, __pyx_k_IndexError, sizeof(__pyx_k_IndexError), 0, 0, 1, 1},
  {&__pyx_n_s_MazeError, __pyx_k_MazeError, sizeof(__pyx_k_MazeError), 0, 0, 1, 1},
  {&__pyx_n_s_Maze___iter, __pyx_k_Maze___iter, sizeof(__pyx_k_Maze___iter), 0, 0, 1, 1},
  {&__pyx_kp_s_Maze_not_properly_constructed, __pyx_k_Maze_not_properly_constructed, sizeof(__pyx_k_Maze_not_properly_constructed), 0, 0, 1, 0},
  {&__pyx_kp_s_Maze_x, __pyx_k_Maze_x, sizeof(__pyx_k_Maze_x), 0, 0, 1, 0},
  {&__pyx_kp_s_No_filename_given, __pyx_k_No_filename_given, sizeof(__pyx_k_No_filename_given), 0, 0, 1, 0},
  {&__pyx_kp_s_Unknown_return_value_from_Maze_s, __pyx_k_Unknown_return_value_from_Maze_s, sizeof(__pyx_k_Unknown_return_value_from_Maze_s), 0, 0, 1, 0},
  {&__pyx_kp_s_Unknown_save_command, __pyx_k_Unknown_save_command, sizeof(__pyx_k_Unknown_save_command), 0, 0, 1, 0},
  {&__pyx_kp_s_Users_wroberts_dev_pydaedalus_d, __pyx_k_Users_wroberts_dev_pydaedalus_d, sizeof(__pyx_k_Users_wroberts_dev_pydaedalus_d), 0, 0, 1, 0},
  {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1},
  {&__pyx_n_s_args, __pyx_k_args, sizeof(__pyx_k_args), 0, 0, 1, 1},
  {&__pyx_n_s_c2, __pyx_k_c2, sizeof(__pyx_k_c2), 0, 0, 1, 1},
  {&__pyx_n_s_c3, __pyx_k_c3, sizeof(__pyx_k_c3), 0, 0, 1, 1},
  {&__pyx_n_s_cRandomAdd, __pyx_k_cRandomAdd, sizeof(__pyx_k_cRandomAdd), 0, 0, 1, 1},
  {&__pyx_n_s_cSpiral, __pyx_k_cSpiral, sizeof(__pyx_k_cSpiral), 0, 0, 1, 1},
  {&__pyx_n_s_cSpiralWall, __pyx_k_cSpiralWall, sizeof(__pyx_k_cSpiralWall), 0, 0, 1, 1},
  {&__pyx_n_s_close, __pyx_k_close, sizeof(__pyx_k_close), 0, 0, 1, 1},
  {&__pyx_n_s_count_locals_genexpr, __pyx_k_count_locals_genexpr, sizeof(__pyx_k_count_locals_genexpr), 0, 0, 1, 1},
  {&__pyx_n_s_daedalus__maze, __pyx_k_daedalus__maze, sizeof(__pyx_k_daedalus__maze), 0, 0, 1, 1},
  {&__pyx_n_s_doc, __pyx_k_doc, sizeof(__pyx_k_doc), 0, 0, 1, 1},
  {&__pyx_n_s_enumerate, __pyx_k_enumerate, sizeof(__pyx_k_enumerate), 0, 0, 1, 1},
  {&__pyx_n_s_fClear, __pyx_k_fClear, sizeof(__pyx_k_fClear), 0, 0, 1, 1},
  {&__pyx_n_s_fKruskalPic, __pyx_k_fKruskalPic, sizeof(__pyx_k_fKruskalPic), 0, 0, 1, 1},
  {&__pyx_n_s_fLineChar, __pyx_k_fLineChar, sizeof(__pyx_k_fLineChar), 0, 0, 1, 1},
  {&__pyx_n_s_fRiver, __pyx_k_fRiver, sizeof(__pyx_k_fRiver), 0, 0, 1, 1},
  {&__pyx_n_s_fTextClip, __pyx_k_fTextClip, sizeof(__pyx_k_fTextClip), 0, 0, 1, 1},
  {&__pyx_n_s_fTextTab, __pyx_k_fTextTab, sizeof(__pyx_k_fTextTab), 0, 0, 1, 1},
  {&__pyx_n_s_fTiltDiamond, __pyx_k_fTiltDiamond, sizeof(__pyx_k_fTiltDiamond), 0, 0, 1, 1},
  {&__pyx_n_s_fTreeRandom, __pyx_k_fTreeRandom, sizeof(__pyx_k_fTreeRandom), 0, 0, 1, 1},
  {&__pyx_n_s_fTreeWall, __pyx_k_fTreeWall, sizeof(__pyx_k_fTreeWall), 0, 0, 1, 1},
  {&__pyx_n_s_fWall, __pyx_k_fWall, sizeof(__pyx_k_fWall), 0, 0, 1, 1},
  {&__pyx_n_s_filename, __pyx_k_filename, sizeof(__pyx_k_filename), 0, 0, 1, 1},
  {&__pyx_n_s_format, __pyx_k_format, sizeof(__pyx_k_format), 0, 0, 1, 1},
  {&__pyx_n_s_genexpr, __pyx_k_genexpr, sizeof(__pyx_k_genexpr), 0, 0, 1, 1},
  {&__pyx_n_s_get, __pyx_k_get, sizeof(__pyx_k_get), 0, 0, 1, 1},
  {&__pyx_n_s_handle_save_retval, __pyx_k_handle_save_retval, sizeof(__pyx_k_handle_save_retval), 0, 0, 1, 1},
  {&__pyx_n_s_height, __pyx_k_height, sizeof(__pyx_k_height), 0, 0, 1, 1},
  {&__pyx_n_s_iter, __pyx_k_iter, sizeof(__pyx_k_iter), 0, 0, 1, 1},
  {&__pyx_kp_s_key_must_be_an_integer_or_a_tupl, __pyx_k_key_must_be_an_integer_or_a_tupl, sizeof(__pyx_k_key_must_be_an_integer_or_a_tupl), 0, 0, 1, 0},
  {&__pyx_n_s_kvOff, __pyx_k_kvOff, sizeof(__pyx_k_kvOff), 0, 0, 1, 1},
  {&__pyx_n_s_kvOn, __pyx_k_kvOn, sizeof(__pyx_k_kvOn), 0, 0, 1, 1},
  {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1},
  {&__pyx_n_s_map, __pyx_k_map, sizeof(__pyx_k_map), 0, 0, 1, 1},
  {&__pyx_n_s_metaclass, __pyx_k_metaclass, sizeof(__pyx_k_metaclass), 0, 0, 1, 1},
  {&__pyx_n_s_module, __pyx_k_module, sizeof(__pyx_k_module), 0, 0, 1, 1},
  {&__pyx_n_s_nEntrancePos, __pyx_k_nEntrancePos, sizeof(__pyx_k_nEntrancePos), 0, 0, 1, 1},
  {&__pyx_n_s_nForsAdd, __pyx_k_nForsAdd, sizeof(__pyx_k_nForsAdd), 0, 0, 1, 1},
  {&__pyx_n_s_nForsInit, __pyx_k_nForsInit, sizeof(__pyx_k_nForsInit), 0, 0, 1, 1},
  {&__pyx_n_s_nTreeRiver, __pyx_k_nTreeRiver, sizeof(__pyx_k_nTreeRiver), 0, 0, 1, 1},
  {&__pyx_kp_s_negative_height, __pyx_k_negative_height, sizeof(__pyx_k_negative_height), 0, 0, 1, 0},
  {&__pyx_kp_s_negative_width, __pyx_k_negative_width, sizeof(__pyx_k_negative_width), 0, 0, 1, 0},
  {&__pyx_n_s_prepare, __pyx_k_prepare, sizeof(__pyx_k_prepare), 0, 0, 1, 1},
  {&__pyx_n_s_qualname, __pyx_k_qualname, sizeof(__pyx_k_qualname), 0, 0, 1, 1},
  {&__pyx_n_s_range, __pyx_k_range, sizeof(__pyx_k_range), 0, 0, 1, 1},
  {&__pyx_n_s_rv, __pyx_k_rv, sizeof(__pyx_k_rv), 0, 0, 1, 1},
  {&__pyx_n_s_send, __pyx_k_send, sizeof(__pyx_k_send), 0, 0, 1, 1},
  {&__pyx_n_s_staticmethod, __pyx_k_staticmethod, sizeof(__pyx_k_staticmethod), 0, 0, 1, 1},
  {&__pyx_n_s_store_back_globals, __pyx_k_store_back_globals, sizeof(__pyx_k_store_back_globals), 0, 0, 1, 1},
  {&__pyx_n_s_sum, __pyx_k_sum, sizeof(__pyx_k_sum), 0, 0, 1, 1},
  {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1},
  {&__pyx_n_s_throw, __pyx_k_throw, sizeof(__pyx_k_throw), 0, 0, 1, 1},
  {&__pyx_n_s_width, __pyx_k_width, sizeof(__pyx_k_width), 0, 0, 1, 1},
  {&__pyx_n_s_x, __pyx_k_x, sizeof(__pyx_k_x), 0, 0, 1, 1},
  {&__pyx_kp_s_x_coordinate_out_of_range, __pyx_k_x_coordinate_out_of_range, sizeof(__pyx_k_x_coordinate_out_of_range), 0, 0, 1, 0},
  {&__pyx_n_s_y, __pyx_k_y, sizeof(__pyx_k_y), 0, 0, 1, 1},
  {&__pyx_kp_s_y_coordinate_out_of_range, __pyx_k_y_coordinate_out_of_range, sizeof(__pyx_k_y_coordinate_out_of_range), 0, 0, 1, 0},
  {0, 0, 0, 0, 0, 0, 0}
};
static int __Pyx_InitCachedBuiltins(void) {
  __pyx_builtin_staticmethod = __Pyx_GetBuiltinName(__pyx_n_s_staticmethod); if (!__pyx_builtin_staticmethod) __PYX_ERR(0, 1003, __pyx_L1_error)
  __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) __PYX_ERR(0, 199, __pyx_L1_error)
  __pyx_builtin_range = __Pyx_GetBuiltinName(__pyx_n_s_range); if (!__pyx_builtin_range) __PYX_ERR(0, 226, __pyx_L1_error)
  __pyx_builtin_map = __Pyx_GetBuiltinName(__pyx_n_s_map); if (!__pyx_builtin_map) __PYX_ERR(0, 228, __pyx_L1_error)
  __pyx_builtin_IndexError = __Pyx_GetBuiltinName(__pyx_n_s_IndexError); if (!__pyx_builtin_IndexError) __PYX_ERR(0, 246, __pyx_L1_error)
  __pyx_builtin_enumerate = __Pyx_GetBuiltinName(__pyx_n_s_enumerate); if (!__pyx_builtin_enumerate) __PYX_ERR(0, 265, __pyx_L1_error)
  __pyx_builtin_sum = __Pyx_GetBuiltinName(__pyx_n_s_sum); if (!__pyx_builtin_sum) __PYX_ERR(0, 279, __pyx_L1_error)
  return 0;
  __pyx_L1_error:;
  return -1;
}

static int __Pyx_InitCachedConstants(void) {
  __Pyx_RefNannyDeclarations
  __Pyx_RefNannySetupContext("__Pyx_InitCachedConstants", 0);

  /* "daedalus/_maze.pyx":199
 *         '''
 *         if width < 0:
 *             raise ValueError('negative width')             # <<<<<<<<<<<<<<
 *         if height < 0:
 *             raise ValueError('negative height')
 */
  __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_negative_width); if (unlikely(!__pyx_tuple_)) __PYX_ERR(0, 199, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple_);
  __Pyx_GIVEREF(__pyx_tuple_);

  /* "daedalus/_maze.pyx":201
 *             raise ValueError('negative width')
 *         if height < 0:
 *             raise ValueError('negative height')             # <<<<<<<<<<<<<<
 *         # if width % 2 != 1:
 *         #     raise ValueError('width must be odd')
 */
  __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_negative_height); if (unlikely(!__pyx_tuple__2)) __PYX_ERR(0, 201, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__2);
  __Pyx_GIVEREF(__pyx_tuple__2);

  /* "daedalus/_maze.pyx":212
 *         self._maze = cpp_Constructor(width, height)
 *         if self._maze is NULL:
 *             raise MazeError('Could not construct Maze object.')             # <<<<<<<<<<<<<<
 * 
 *     def __dealloc__(self):
 */
  __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_s_Could_not_construct_Maze_object); if (unlikely(!__pyx_tuple__3)) __PYX_ERR(0, 212, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__3);
  __Pyx_GIVEREF(__pyx_tuple__3);

  /* "daedalus/_maze.pyx":229
 *         else:
 *             if not isinstance(key, tuple) and len(key) == 2 and list(set(map(type, key))) == [int]:
 *                 raise ValueError('key must be an integer or a tuple of two integers')             # <<<<<<<<<<<<<<
 *             (x,y) = key
 *             return self.get(x,y)
 */
  __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_s_key_must_be_an_integer_or_a_tupl); if (unlikely(!__pyx_tuple__4)) __PYX_ERR(0, 229, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__4);
  __Pyx_GIVEREF(__pyx_tuple__4);

  /* "daedalus/_maze.pyx":324
 *         '''
 *         if x < 0 or self.width <= x:
 *             raise IndexError('x coordinate out of range')             # <<<<<<<<<<<<<<
 *         if y < 0 or self.height <= y:
 *             raise IndexError('y coordinate out of range')
 */
  __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_s_x_coordinate_out_of_range); if (unlikely(!__pyx_tuple__5)) __PYX_ERR(0, 324, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__5);
  __Pyx_GIVEREF(__pyx_tuple__5);

  /* "daedalus/_maze.pyx":326
 *             raise IndexError('x coordinate out of range')
 *         if y < 0 or self.height <= y:
 *             raise IndexError('y coordinate out of range')             # <<<<<<<<<<<<<<
 *         return cpp_Get(self._maze, x, y)
 * 
 */
  __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_s_y_coordinate_out_of_range); if (unlikely(!__pyx_tuple__6)) __PYX_ERR(0, 326, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__6);
  __Pyx_GIVEREF(__pyx_tuple__6);

  /* "daedalus/_maze.pyx":362
 *                                      fTreeWall,
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Perfect Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Perfect_Maze); if (unlikely(!__pyx_tuple__8)) __PYX_ERR(0, 362, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__8);
  __Pyx_GIVEREF(__pyx_tuple__8);

  /* "daedalus/_maze.pyx":390
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Perfect2 Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__10 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Perfect2_Maze); if (unlikely(!__pyx_tuple__10)) __PYX_ERR(0, 390, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__10);
  __Pyx_GIVEREF(__pyx_tuple__10);

  /* "daedalus/_maze.pyx":413
 *                                    False,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Braid Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__12 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Braid_Maze); if (unlikely(!__pyx_tuple__12)) __PYX_ERR(0, 413, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__12);
  __Pyx_GIVEREF(__pyx_tuple__12);

  /* "daedalus/_maze.pyx":440
 *                                        fTiltDiamond,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create BraidTilt Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__14 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_BraidTilt_Maze); if (unlikely(!__pyx_tuple__14)) __PYX_ERR(0, 440, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__14);
  __Pyx_GIVEREF(__pyx_tuple__14);

  /* "daedalus/_maze.pyx":484
 *                                     False,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Spiral Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__16 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Spiral_Maze); if (unlikely(!__pyx_tuple__16)) __PYX_ERR(0, 484, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__16);
  __Pyx_GIVEREF(__pyx_tuple__16);

  /* "daedalus/_maze.pyx":514
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Diagonal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__18 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Diagonal_Maze); if (unlikely(!__pyx_tuple__18)) __PYX_ERR(0, 514, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__18);
  __Pyx_GIVEREF(__pyx_tuple__18);

  /* "daedalus/_maze.pyx":537
 *                                        False,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Recursive Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__20 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Recursive_Maze); if (unlikely(!__pyx_tuple__20)) __PYX_ERR(0, 537, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__20);
  __Pyx_GIVEREF(__pyx_tuple__20);

  /* "daedalus/_maze.pyx":566
 *                                   fTreeWall,
 *                                   nEntrancePos):
 *             raise MazeError('Could not create Prim Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__22 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Prim_Maze); if (unlikely(!__pyx_tuple__22)) __PYX_ERR(0, 566, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__22);
  __Pyx_GIVEREF(__pyx_tuple__22);

  /* "daedalus/_maze.pyx":601
 *                                    fTreeWall,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Prim2 Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__24 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Prim2_Maze); if (unlikely(!__pyx_tuple__24)) __PYX_ERR(0, 601, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__24);
  __Pyx_GIVEREF(__pyx_tuple__24);

  /* "daedalus/_maze.pyx":635
 *                                      fTreeWall,
 *                                      nEntrancePos):
 *             raise MazeError('Could not create Kruskal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__26 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Kruskal_Maze); if (unlikely(!__pyx_tuple__26)) __PYX_ERR(0, 635, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__26);
  __Pyx_GIVEREF(__pyx_tuple__26);

  /* "daedalus/_maze.pyx":676
 *                                   nEntrancePos,
 *                                   nTreeRiver):
 *             raise MazeError('Could not create Tree Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__28 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Tree_Maze); if (unlikely(!__pyx_tuple__28)) __PYX_ERR(0, 676, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__28);
  __Pyx_GIVEREF(__pyx_tuple__28);

  /* "daedalus/_maze.pyx":736
 *                                     nForsInit,
 *                                     nTreeRiver):
 *             raise MazeError('Could not create Forest Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__30 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Forest_Maze); if (unlikely(!__pyx_tuple__30)) __PYX_ERR(0, 736, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__30);
  __Pyx_GIVEREF(__pyx_tuple__30);

  /* "daedalus/_maze.pyx":766
 *                                           fTreeWall,
 *                                           nEntrancePos):
 *             raise MazeError('Could not create AldousBroder Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__32 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_AldousBroder_Ma); if (unlikely(!__pyx_tuple__32)) __PYX_ERR(0, 766, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__32);
  __Pyx_GIVEREF(__pyx_tuple__32);

  /* "daedalus/_maze.pyx":797
 *                                     fTreeWall,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Wilson Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__34 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Wilson_Maze); if (unlikely(!__pyx_tuple__34)) __PYX_ERR(0, 797, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__34);
  __Pyx_GIVEREF(__pyx_tuple__34);

  /* "daedalus/_maze.pyx":827
 *                                    fTreeWall,
 *                                    nEntrancePos):
 *             raise MazeError('Could not create Eller Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__36 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Eller_Maze); if (unlikely(!__pyx_tuple__36)) __PYX_ERR(0, 827, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__36);
  __Pyx_GIVEREF(__pyx_tuple__36);

  /* "daedalus/_maze.pyx":850
 *                                         False,
 *                                         nEntrancePos):
 *             raise MazeError('Could not create BraidEller Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__38 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_BraidEller_Maze); if (unlikely(!__pyx_tuple__38)) __PYX_ERR(0, 850, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__38);
  __Pyx_GIVEREF(__pyx_tuple__38);

  /* "daedalus/_maze.pyx":874
 *                                       False,
 *                                       nEntrancePos):
 *             raise MazeError('Could not create Division Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__40 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Division_Maze); if (unlikely(!__pyx_tuple__40)) __PYX_ERR(0, 874, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__40);
  __Pyx_GIVEREF(__pyx_tuple__40);

  /* "daedalus/_maze.pyx":911
 *                                     fTreeWall,
 *                                     nEntrancePos):
 *             raise MazeError('Could not create Binary Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__42 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Binary_Maze); if (unlikely(!__pyx_tuple__42)) __PYX_ERR(0, 911, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__42);
  __Pyx_GIVEREF(__pyx_tuple__42);

  /* "daedalus/_maze.pyx":939
 *                                         fTreeWall,
 *                                         nEntrancePos):
 *             raise MazeError('Could not create Sidewinder Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__44 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Sidewinder_Maze); if (unlikely(!__pyx_tuple__44)) __PYX_ERR(0, 939, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__44);
  __Pyx_GIVEREF(__pyx_tuple__44);

  /* "daedalus/_maze.pyx":981
 *                                        fTreeWall,
 *                                        nEntrancePos):
 *             raise MazeError('Could not create Unicursal Maze.')             # <<<<<<<<<<<<<<
 *         self._store_back_globals()
 * 
 */
  __pyx_tuple__46 = PyTuple_Pack(1, __pyx_kp_s_Could_not_create_Unicursal_Maze); if (unlikely(!__pyx_tuple__46)) __PYX_ERR(0, 981, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__46);
  __Pyx_GIVEREF(__pyx_tuple__46);

  /* "daedalus/_maze.pyx":993
 *         '''
 *         if width < 0:
 *             raise ValueError('negative width')             # <<<<<<<<<<<<<<
 *         if height < 0:
 *             raise ValueError('negative height')
 */
  __pyx_tuple__47 = PyTuple_Pack(1, __pyx_kp_s_negative_width); if (unlikely(!__pyx_tuple__47)) __PYX_ERR(0, 993, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__47);
  __Pyx_GIVEREF(__pyx_tuple__47);

  /* "daedalus/_maze.pyx":995
 *             raise ValueError('negative width')
 *         if height < 0:
 *             raise ValueError('negative height')             # <<<<<<<<<<<<<<
 *         # if width % 2 != 1:
 *         #     raise ValueError('width must be odd')
 */
  __pyx_tuple__48 = PyTuple_Pack(1, __pyx_kp_s_negative_height); if (unlikely(!__pyx_tuple__48)) __PYX_ERR(0, 995, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__48);
  __Pyx_GIVEREF(__pyx_tuple__48);

  /* "daedalus/_maze.pyx":1001
 *         #     raise ValueError('height must be odd')
 *         if not cpp_Resize(self._maze, width, height):
 *             raise MazeError('Could not resize the Maze.')             # <<<<<<<<<<<<<<
 * 
 *     @staticmethod
 */
  __pyx_tuple__49 = PyTuple_Pack(1, __pyx_kp_s_Could_not_resize_the_Maze); if (unlikely(!__pyx_tuple__49)) __PYX_ERR(0, 1001, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__49);
  __Pyx_GIVEREF(__pyx_tuple__49);

  /* "daedalus/_maze.pyx":1012
 *         '''
 *         if rv == SAVE_NO_MAZE_ERROR:
 *             raise MazeError('Maze not properly constructed.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')
 */
  __pyx_tuple__50 = PyTuple_Pack(1, __pyx_kp_s_Maze_not_properly_constructed); if (unlikely(!__pyx_tuple__50)) __PYX_ERR(0, 1012, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__50);
  __Pyx_GIVEREF(__pyx_tuple__50);

  /* "daedalus/_maze.pyx":1014
 *             raise MazeError('Maze not properly constructed.')
 *         elif rv == SAVE_NO_FILENAME_GIVEN_ERROR:
 *             raise MazeError('No filename given.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')
 */
  __pyx_tuple__51 = PyTuple_Pack(1, __pyx_kp_s_No_filename_given); if (unlikely(!__pyx_tuple__51)) __PYX_ERR(0, 1014, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__51);
  __Pyx_GIVEREF(__pyx_tuple__51);

  /* "daedalus/_maze.pyx":1016
 *             raise MazeError('No filename given.')
 *         elif rv == SAVE_FILE_OPEN_ERROR:
 *             raise MazeError('Could not open file.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 *             raise MazeError('Unknown save command.')
 */
  __pyx_tuple__52 = PyTuple_Pack(1, __pyx_kp_s_Could_not_open_file); if (unlikely(!__pyx_tuple__52)) __PYX_ERR(0, 1016, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__52);
  __Pyx_GIVEREF(__pyx_tuple__52);

  /* "daedalus/_maze.pyx":1018
 *             raise MazeError('Could not open file.')
 *         elif rv == SAVE_UNKNOWN_CMD_ERROR:
 *             raise MazeError('Unknown save command.')             # <<<<<<<<<<<<<<
 *         elif rv == SAVE_SUCCESS:
 *             pass
 */
  __pyx_tuple__53 = PyTuple_Pack(1, __pyx_kp_s_Unknown_save_command); if (unlikely(!__pyx_tuple__53)) __PYX_ERR(0, 1018, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__53);
  __Pyx_GIVEREF(__pyx_tuple__53);

  /* "daedalus/_maze.pyx":1022
 *             pass
 *         else:
 *             raise MazeError('Unknown return value from Maze save function.')             # <<<<<<<<<<<<<<
 * 
 *     def _store_back_globals(self):
 */
  __pyx_tuple__54 = PyTuple_Pack(1, __pyx_kp_s_Unknown_return_value_from_Maze_s); if (unlikely(!__pyx_tuple__54)) __PYX_ERR(0, 1022, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__54);
  __Pyx_GIVEREF(__pyx_tuple__54);

  /* "daedalus/_maze.pyx":1004
 * 
 *     @staticmethod
 *     def _handle_save_retval(rv):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper method to handle return values from the Save* methods.
 */
  __pyx_tuple__57 = PyTuple_Pack(1, __pyx_n_s_rv); if (unlikely(!__pyx_tuple__57)) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_tuple__57);
  __Pyx_GIVEREF(__pyx_tuple__57);
  __pyx_codeobj__58 = (PyObject*)__Pyx_PyCode_New(1, 0, 1, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__57, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_Users_wroberts_dev_pydaedalus_d, __pyx_n_s_handle_save_retval, 1004, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__58)) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_RefNannyFinishContext();
  return 0;
  __pyx_L1_error:;
  __Pyx_RefNannyFinishContext();
  return -1;
}

static int __Pyx_InitGlobals(void) {
  if (__Pyx_InitStrings(__pyx_string_tab) < 0) __PYX_ERR(0, 1, __pyx_L1_error);
  __pyx_int_0 = PyInt_FromLong(0); if (unlikely(!__pyx_int_0)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_int_1 = PyInt_FromLong(1); if (unlikely(!__pyx_int_1)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_int_10 = PyInt_FromLong(10); if (unlikely(!__pyx_int_10)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_int_15 = PyInt_FromLong(15); if (unlikely(!__pyx_int_15)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_int_neg_100 = PyInt_FromLong(-100); if (unlikely(!__pyx_int_neg_100)) __PYX_ERR(0, 1, __pyx_L1_error)
  return 0;
  __pyx_L1_error:;
  return -1;
}

#if PY_MAJOR_VERSION < 3
PyMODINIT_FUNC init_maze(void); /*proto*/
PyMODINIT_FUNC init_maze(void)
#else
PyMODINIT_FUNC PyInit__maze(void); /*proto*/
PyMODINIT_FUNC PyInit__maze(void)
#endif
{
  PyObject *__pyx_t_1 = NULL;
  PyObject *__pyx_t_2 = NULL;
  PyObject *__pyx_t_3 = NULL;
  PyObject *__pyx_t_4 = NULL;
  __Pyx_RefNannyDeclarations
  #if CYTHON_REFNANNY
  __Pyx_RefNanny = __Pyx_RefNannyImportAPI("refnanny");
  if (!__Pyx_RefNanny) {
      PyErr_Clear();
      __Pyx_RefNanny = __Pyx_RefNannyImportAPI("Cython.Runtime.refnanny");
      if (!__Pyx_RefNanny)
          Py_FatalError("failed to import 'refnanny' module");
  }
  #endif
  __Pyx_RefNannySetupContext("PyMODINIT_FUNC PyInit__maze(void)", 0);
  if (__Pyx_check_binary_version() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_empty_bytes = PyBytes_FromStringAndSize("", 0); if (unlikely(!__pyx_empty_bytes)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_empty_unicode = PyUnicode_FromStringAndSize("", 0); if (unlikely(!__pyx_empty_unicode)) __PYX_ERR(0, 1, __pyx_L1_error)
  #ifdef __Pyx_CyFunction_USED
  if (__pyx_CyFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  #ifdef __Pyx_FusedFunction_USED
  if (__pyx_FusedFunction_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  #ifdef __Pyx_Coroutine_USED
  if (__pyx_Coroutine_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  #ifdef __Pyx_Generator_USED
  if (__pyx_Generator_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  #ifdef __Pyx_StopAsyncIteration_USED
  if (__pyx_StopAsyncIteration_init() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  /*--- Library function declarations ---*/
  /*--- Threads initialization code ---*/
  #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS
  #ifdef WITH_THREAD /* Python build with threading support? */
  PyEval_InitThreads();
  #endif
  #endif
  /*--- Module creation code ---*/
  #if PY_MAJOR_VERSION < 3
  __pyx_m = Py_InitModule4("_maze", __pyx_methods, __pyx_k_Wrapper_for_the_daedalus_monoch, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m);
  #else
  __pyx_m = PyModule_Create(&__pyx_moduledef);
  #endif
  if (unlikely(!__pyx_m)) __PYX_ERR(0, 1, __pyx_L1_error)
  __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) __PYX_ERR(0, 1, __pyx_L1_error)
  Py_INCREF(__pyx_d);
  __pyx_b = PyImport_AddModule(__Pyx_BUILTIN_MODULE_NAME); if (unlikely(!__pyx_b)) __PYX_ERR(0, 1, __pyx_L1_error)
  #if CYTHON_COMPILING_IN_PYPY
  Py_INCREF(__pyx_b);
  #endif
  if (PyObject_SetAttrString(__pyx_m, "__builtins__", __pyx_b) < 0) __PYX_ERR(0, 1, __pyx_L1_error);
  /*--- Initialize various global constants etc. ---*/
  if (__Pyx_InitGlobals() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT)
  if (__Pyx_init_sys_getdefaultencoding_params() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif
  if (__pyx_module_is_main_daedalus___maze) {
    if (PyObject_SetAttrString(__pyx_m, "__name__", __pyx_n_s_main) < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  }
  #if PY_MAJOR_VERSION >= 3
  {
    PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) __PYX_ERR(0, 1, __pyx_L1_error)
    if (!PyDict_GetItemString(modules, "daedalus._maze")) {
      if (unlikely(PyDict_SetItemString(modules, "daedalus._maze", __pyx_m) < 0)) __PYX_ERR(0, 1, __pyx_L1_error)
    }
  }
  #endif
  /*--- Builtin init code ---*/
  if (__Pyx_InitCachedBuiltins() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  /*--- Constants init code ---*/
  if (__Pyx_InitCachedConstants() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  /*--- Global init code ---*/
  /*--- Variable export code ---*/
  /*--- Function export code ---*/
  /*--- Type init code ---*/
  if (PyType_Ready(&__pyx_type_8daedalus_5_maze_Maze) < 0) __PYX_ERR(0, 175, __pyx_L1_error)
  __pyx_type_8daedalus_5_maze_Maze.tp_print = 0;
  if (PyObject_SetAttrString(__pyx_m, "Maze", (PyObject *)&__pyx_type_8daedalus_5_maze_Maze) < 0) __PYX_ERR(0, 175, __pyx_L1_error)
  __pyx_ptype_8daedalus_5_maze_Maze = &__pyx_type_8daedalus_5_maze_Maze;
  if (PyType_Ready(&__pyx_type_8daedalus_5_maze___pyx_scope_struct____iter__) < 0) __PYX_ERR(0, 239, __pyx_L1_error)
  __pyx_type_8daedalus_5_maze___pyx_scope_struct____iter__.tp_print = 0;
  __pyx_ptype_8daedalus_5_maze___pyx_scope_struct____iter__ = &__pyx_type_8daedalus_5_maze___pyx_scope_struct____iter__;
  if (PyType_Ready(&__pyx_type_8daedalus_5_maze___pyx_scope_struct_1_count) < 0) __PYX_ERR(0, 270, __pyx_L1_error)
  __pyx_type_8daedalus_5_maze___pyx_scope_struct_1_count.tp_print = 0;
  __pyx_ptype_8daedalus_5_maze___pyx_scope_struct_1_count = &__pyx_type_8daedalus_5_maze___pyx_scope_struct_1_count;
  if (PyType_Ready(&__pyx_type_8daedalus_5_maze___pyx_scope_struct_2_genexpr) < 0) __PYX_ERR(0, 279, __pyx_L1_error)
  __pyx_type_8daedalus_5_maze___pyx_scope_struct_2_genexpr.tp_print = 0;
  __pyx_ptype_8daedalus_5_maze___pyx_scope_struct_2_genexpr = &__pyx_type_8daedalus_5_maze___pyx_scope_struct_2_genexpr;
  /*--- Type import code ---*/
  /*--- Variable import code ---*/
  /*--- Function import code ---*/
  /*--- Execution code ---*/
  #if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)
  if (__Pyx_patch_abc() < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  #endif

  /* "daedalus/_maze.pyx":162
 * 
 * # color value constants
 * COLOR_WHITE = kvWhite             # <<<<<<<<<<<<<<
 * COLOR_BLACK = kvBlack
 * 
 */
  __pyx_t_1 = __Pyx_PyInt_From_KV(kvWhite); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 162, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COLOR_WHITE, __pyx_t_1) < 0) __PYX_ERR(0, 162, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":163
 * # color value constants
 * COLOR_WHITE = kvWhite
 * COLOR_BLACK = kvBlack             # <<<<<<<<<<<<<<
 * 
 * # nEntrancePos enum constants
 */
  __pyx_t_1 = __Pyx_PyInt_From_KV(kvBlack); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 163, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_COLOR_BLACK, __pyx_t_1) < 0) __PYX_ERR(0, 163, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":166
 * 
 * # nEntrancePos enum constants
 * ENTRANCE_CORNER   = epCorner             # <<<<<<<<<<<<<<
 * ENTRANCE_MIDDLE   = epMiddle
 * ENTRANCE_BALANCED = epBalanced
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(epCorner); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 166, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENTRANCE_CORNER, __pyx_t_1) < 0) __PYX_ERR(0, 166, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":167
 * # nEntrancePos enum constants
 * ENTRANCE_CORNER   = epCorner
 * ENTRANCE_MIDDLE   = epMiddle             # <<<<<<<<<<<<<<
 * ENTRANCE_BALANCED = epBalanced
 * ENTRANCE_RANDOM   = epRandom
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(epMiddle); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 167, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENTRANCE_MIDDLE, __pyx_t_1) < 0) __PYX_ERR(0, 167, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":168
 * ENTRANCE_CORNER   = epCorner
 * ENTRANCE_MIDDLE   = epMiddle
 * ENTRANCE_BALANCED = epBalanced             # <<<<<<<<<<<<<<
 * ENTRANCE_RANDOM   = epRandom
 * 
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(epBalanced); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 168, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENTRANCE_BALANCED, __pyx_t_1) < 0) __PYX_ERR(0, 168, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":169
 * ENTRANCE_MIDDLE   = epMiddle
 * ENTRANCE_BALANCED = epBalanced
 * ENTRANCE_RANDOM   = epRandom             # <<<<<<<<<<<<<<
 * 
 * class MazeError(Exception):
 */
  __pyx_t_1 = __Pyx_PyInt_From_int(epRandom); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 169, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_ENTRANCE_RANDOM, __pyx_t_1) < 0) __PYX_ERR(0, 169, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":171
 * ENTRANCE_RANDOM   = epRandom
 * 
 * class MazeError(Exception):             # <<<<<<<<<<<<<<
 *     '''An error while performing an action on a Maze object.'''
 *     pass
 */
  __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 171, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __Pyx_INCREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));
  __Pyx_GIVEREF(((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));
  PyTuple_SET_ITEM(__pyx_t_1, 0, ((PyObject *)(&((PyTypeObject*)PyExc_Exception)[0])));
  __pyx_t_2 = __Pyx_CalculateMetaclass(NULL, __pyx_t_1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 171, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __pyx_t_3 = __Pyx_Py3MetaclassPrepare(__pyx_t_2, __pyx_t_1, __pyx_n_s_MazeError, __pyx_n_s_MazeError, (PyObject *) NULL, __pyx_n_s_daedalus__maze, __pyx_kp_s_An_error_while_performing_an_act); if (unlikely(!__pyx_t_3)) __PYX_ERR(0, 171, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_3);
  __pyx_t_4 = __Pyx_Py3ClassCreate(__pyx_t_2, __pyx_n_s_MazeError, __pyx_t_1, __pyx_t_3, NULL, 0, 1); if (unlikely(!__pyx_t_4)) __PYX_ERR(0, 171, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_4);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_MazeError, __pyx_t_4) < 0) __PYX_ERR(0, 171, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0;
  __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0;
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":332
 *                        fRiver=True,
 *                        fTreeWall=False,
 *                        nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a perfect maze
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 332, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__7 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":367
 *     def create_perfect2(self,
 *                         fRiver=True,
 *                         nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Perfect2 maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 367, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__9 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":394
 * 
 *     def create_braid(self,
 *                      nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Braid maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 394, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__11 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":418
 *     def create_braid_tilt(self,
 *                           fTiltDiamond=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a BraidTilt maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 418, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__13 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":447
 *                       cSpiral=15,
 *                       cSpiralWall=15,
 *                       nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Spiral maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 447, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__15 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":489
 *     def create_diagonal(self,
 *                         cRandomAdd=0,
 *                         nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Diagonal maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 489, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__17 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":518
 * 
 *     def create_recursive(self,
 *                          nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Recursive maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 518, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__19 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":542
 *     def create_prim(self,
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Prim maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 542, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__21 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":572
 *                      fTreeRandom=True,
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Prim2 maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 572, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__23 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":607
 *                        fKruskalPic=False,
 *                        fTreeWall=False,
 *                        nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Kruskal maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 607, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__25 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":641
 *                     fTreeRandom=True,
 *                     fTreeWall=False,
 *                     nEntrancePos=ENTRANCE_RANDOM,             # <<<<<<<<<<<<<<
 *                     nTreeRiver=10):
 *         '''
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 641, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__27 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":682
 *                       fTreeRandom=True,
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM,             # <<<<<<<<<<<<<<
 *                       nForsAdd=-100,
 *                       nForsInit=1,
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 682, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__29 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":741
 *     def create_aldous_broder(self,
 *                              fTreeWall=False,
 *                              nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a AldousBroder maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 741, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__31 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":771
 *     def create_wilson(self,
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Wilson maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 771, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__33 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":802
 *     def create_eller(self,
 *                      fTreeWall=False,
 *                      nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Eller maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 802, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__35 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":831
 * 
 *     def create_braid_eller(self,
 *                            nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a BraidEller maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 831, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__37 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":854
 * 
 *     def create_division(self,
 *                         nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Division maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 854, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__39 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":880
 *                       cRandomAdd=0,
 *                       fTreeWall=False,
 *                       nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Binary maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 880, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__41 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":916
 *     def create_sidewinder(self,
 *                           fTreeWall=False,
 *                           nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Sidewinder maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 916, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__43 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":946
 *                          fRiver=True,
 *                          fTreeWall=False,
 *                          nEntrancePos=ENTRANCE_RANDOM):             # <<<<<<<<<<<<<<
 *         '''
 *         Overwrites the contents of this Maze to create a Unicursal maze.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_ENTRANCE_RANDOM); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 946, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__45 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":1004
 * 
 *     @staticmethod
 *     def _handle_save_retval(rv):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper method to handle return values from the Save* methods.
 */
  __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_8daedalus_5_maze_4Maze_66_handle_save_retval, NULL, __pyx_n_s_daedalus__maze); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);

  /* "daedalus/_maze.pyx":1003
 *             raise MazeError('Could not resize the Maze.')
 * 
 *     @staticmethod             # <<<<<<<<<<<<<<
 *     def _handle_save_retval(rv):
 *         '''
 */
  __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1003, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __Pyx_GIVEREF(__pyx_t_1);
  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);
  __pyx_t_1 = 0;
  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_staticmethod, __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1003, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (PyDict_SetItem((PyObject *)__pyx_ptype_8daedalus_5_maze_Maze->tp_dict, __pyx_n_s_handle_save_retval, __pyx_t_1) < 0) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  PyType_Modified(__pyx_ptype_8daedalus_5_maze_Maze);

  /* "daedalus/_maze.pyx":1004
 * 
 *     @staticmethod
 *     def _handle_save_retval(rv):             # <<<<<<<<<<<<<<
 *         '''
 *         Helper method to handle return values from the Save* methods.
 */
  __pyx_t_1 = __Pyx_GetNameInClass((PyObject *)__pyx_ptype_8daedalus_5_maze_Maze, __pyx_n_s_handle_save_retval); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);

  /* "daedalus/_maze.pyx":1003
 *             raise MazeError('Could not resize the Maze.')
 * 
 *     @staticmethod             # <<<<<<<<<<<<<<
 *     def _handle_save_retval(rv):
 *         '''
 */
  __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) __PYX_ERR(0, 1003, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_2);
  __Pyx_GIVEREF(__pyx_t_1);
  PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_t_1);
  __pyx_t_1 = 0;
  __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_staticmethod, __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1003, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0;
  if (PyDict_SetItem((PyObject *)__pyx_ptype_8daedalus_5_maze_Maze->tp_dict, __pyx_n_s_handle_save_retval, __pyx_t_1) < 0) __PYX_ERR(0, 1004, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;
  PyType_Modified(__pyx_ptype_8daedalus_5_maze_Maze);

  /* "daedalus/_maze.pyx":1034
 *         self._yExit     = ms.yExit
 * 
 *     def save_bitmap(self, filename, kvOn=COLOR_WHITE, kvOff=COLOR_BLACK):             # <<<<<<<<<<<<<<
 *         '''
 *         Saves this Maze object as a bitmap to the given path.
 */
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_COLOR_WHITE); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1034, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__55 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;
  __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_COLOR_BLACK); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1034, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  __pyx_k__56 = __pyx_t_1;
  __Pyx_GIVEREF(__pyx_t_1);
  __pyx_t_1 = 0;

  /* "daedalus/_maze.pyx":1
 * #!/usr/bin/env python             # <<<<<<<<<<<<<<
 * # -*- coding: utf-8 -*-
 * 
 */
  __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) __PYX_ERR(0, 1, __pyx_L1_error)
  __Pyx_GOTREF(__pyx_t_1);
  if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) __PYX_ERR(0, 1, __pyx_L1_error)
  __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0;

  /*--- Wrapped vars code ---*/

  goto __pyx_L0;
  __pyx_L1_error:;
  __Pyx_XDECREF(__pyx_t_1);
  __Pyx_XDECREF(__pyx_t_2);
  __Pyx_XDECREF(__pyx_t_3);
  __Pyx_XDECREF(__pyx_t_4);
  if (__pyx_m) {
    if (__pyx_d) {
      __Pyx_AddTraceback("init daedalus._maze", __pyx_clineno, __pyx_lineno, __pyx_filename);
    }
    Py_DECREF(__pyx_m); __pyx_m = 0;
  } else if (!PyErr_Occurred()) {
    PyErr_SetString(PyExc_ImportError, "init daedalus._maze");
  }
  __pyx_L0:;
  __Pyx_RefNannyFinishContext();
  #if PY_MAJOR_VERSION < 3
  return;
  #else
  return __pyx_m;
  #endif
}

/* --- Runtime support code --- */
/* Refnanny */
#if CYTHON_REFNANNY
static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) {
    PyObject *m = NULL, *p = NULL;
    void *r = NULL;
    m = PyImport_ImportModule((char *)modname);
    if (!m) goto end;
    p = PyObject_GetAttrString(m, (char *)"RefNannyAPI");
    if (!p) goto end;
    r = PyLong_AsVoidPtr(p);
end:
    Py_XDECREF(p);
    Py_XDECREF(m);
    return (__Pyx_RefNannyAPIStruct *)r;
}
#endif

/* GetBuiltinName */
static PyObject *__Pyx_GetBuiltinName(PyObject *name) {
    PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name);
    if (unlikely(!result)) {
        PyErr_Format(PyExc_NameError,
#if PY_MAJOR_VERSION >= 3
            "name '%U' is not defined", name);
#else
            "name '%.200s' is not defined", PyString_AS_STRING(name));
#endif
    }
    return result;
}

/* RaiseArgTupleInvalid */
static void __Pyx_RaiseArgtupleInvalid(
    const char* func_name,
    int exact,
    Py_ssize_t num_min,
    Py_ssize_t num_max,
    Py_ssize_t num_found)
{
    Py_ssize_t num_expected;
    const char *more_or_less;
    if (num_found < num_min) {
        num_expected = num_min;
        more_or_less = "at least";
    } else {
        num_expected = num_max;
        more_or_less = "at most";
    }
    if (exact) {
        more_or_less = "exactly";
    }
    PyErr_Format(PyExc_TypeError,
                 "%.200s() takes %.8s %" CYTHON_FORMAT_SSIZE_T "d positional argument%.1s (%" CYTHON_FORMAT_SSIZE_T "d given)",
                 func_name, more_or_less, num_expected,
                 (num_expected == 1) ? "" : "s", num_found);
}

/* RaiseDoubleKeywords */
static void __Pyx_RaiseDoubleKeywordsError(
    const char* func_name,
    PyObject* kw_name)
{
    PyErr_Format(PyExc_TypeError,
        #if PY_MAJOR_VERSION >= 3
        "%s() got multiple values for keyword argument '%U'", func_name, kw_name);
        #else
        "%s() got multiple values for keyword argument '%s'", func_name,
        PyString_AsString(kw_name));
        #endif
}

/* ParseKeywords */
static int __Pyx_ParseOptionalKeywords(
    PyObject *kwds,
    PyObject **argnames[],
    PyObject *kwds2,
    PyObject *values[],
    Py_ssize_t num_pos_args,
    const char* function_name)
{
    PyObject *key = 0, *value = 0;
    Py_ssize_t pos = 0;
    PyObject*** name;
    PyObject*** first_kw_arg = argnames + num_pos_args;
    while (PyDict_Next(kwds, &pos, &key, &value)) {
        name = first_kw_arg;
        while (*name && (**name != key)) name++;
        if (*name) {
            values[name-argnames] = value;
            continue;
        }
        name = first_kw_arg;
        #if PY_MAJOR_VERSION < 3
        if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) {
            while (*name) {
                if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key))
                        && _PyString_Eq(**name, key)) {
                    values[name-argnames] = value;
                    break;
                }
                name++;
            }
            if (*name) continue;
            else {
                PyObject*** argname = argnames;
                while (argname != first_kw_arg) {
                    if ((**argname == key) || (
                            (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key))
                             && _PyString_Eq(**argname, key))) {
                        goto arg_passed_twice;
                    }
                    argname++;
                }
            }
        } else
        #endif
        if (likely(PyUnicode_Check(key))) {
            while (*name) {
                int cmp = (**name == key) ? 0 :
                #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3
                    (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 :
                #endif
                    PyUnicode_Compare(**name, key);
                if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;
                if (cmp == 0) {
                    values[name-argnames] = value;
                    break;
                }
                name++;
            }
            if (*name) continue;
            else {
                PyObject*** argname = argnames;
                while (argname != first_kw_arg) {
                    int cmp = (**argname == key) ? 0 :
                    #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3
                        (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 :
                    #endif
                        PyUnicode_Compare(**argname, key);
                    if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad;
                    if (cmp == 0) goto arg_passed_twice;
                    argname++;
                }
            }
        } else
            goto invalid_keyword_type;
        if (kwds2) {
            if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad;
        } else {
            goto invalid_keyword;
        }
    }
    return 0;
arg_passed_twice:
    __Pyx_RaiseDoubleKeywordsError(function_name, key);
    goto bad;
invalid_keyword_type:
    PyErr_Format(PyExc_TypeError,
        "%.200s() keywords must be strings", function_name);
    goto bad;
invalid_keyword:
    PyErr_Format(PyExc_TypeError,
    #if PY_MAJOR_VERSION < 3
        "%.200s() got an unexpected keyword argument '%.200s'",
        function_name, PyString_AsString(key));
    #else
        "%s() got an unexpected keyword argument '%U'",
        function_name, key);
    #endif
bad:
    return -1;
}

/* PyObjectCall */
#if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) {
    PyObject *result;
    ternaryfunc call = func->ob_type->tp_call;
    if (unlikely(!call))
        return PyObject_Call(func, arg, kw);
    if (unlikely(Py_EnterRecursiveCall((char*)" while calling a Python object")))
        return NULL;
    result = (*call)(func, arg, kw);
    Py_LeaveRecursiveCall();
    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {
        PyErr_SetString(
            PyExc_SystemError,
            "NULL result without error in PyObject_Call");
    }
    return result;
}
#endif

/* PyErrFetchRestore */
#if CYTHON_FAST_THREAD_STATE
static CYTHON_INLINE void __Pyx_ErrRestoreInState(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {
    PyObject *tmp_type, *tmp_value, *tmp_tb;
    tmp_type = tstate->curexc_type;
    tmp_value = tstate->curexc_value;
    tmp_tb = tstate->curexc_traceback;
    tstate->curexc_type = type;
    tstate->curexc_value = value;
    tstate->curexc_traceback = tb;
    Py_XDECREF(tmp_type);
    Py_XDECREF(tmp_value);
    Py_XDECREF(tmp_tb);
}
static CYTHON_INLINE void __Pyx_ErrFetchInState(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {
    *type = tstate->curexc_type;
    *value = tstate->curexc_value;
    *tb = tstate->curexc_traceback;
    tstate->curexc_type = 0;
    tstate->curexc_value = 0;
    tstate->curexc_traceback = 0;
}
#endif

/* RaiseException */
#if PY_MAJOR_VERSION < 3
static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb,
                        CYTHON_UNUSED PyObject *cause) {
    __Pyx_PyThreadState_declare
    Py_XINCREF(type);
    if (!value || value == Py_None)
        value = NULL;
    else
        Py_INCREF(value);
    if (!tb || tb == Py_None)
        tb = NULL;
    else {
        Py_INCREF(tb);
        if (!PyTraceBack_Check(tb)) {
            PyErr_SetString(PyExc_TypeError,
                "raise: arg 3 must be a traceback or None");
            goto raise_error;
        }
    }
    if (PyType_Check(type)) {
#if CYTHON_COMPILING_IN_PYPY
        if (!value) {
            Py_INCREF(Py_None);
            value = Py_None;
        }
#endif
        PyErr_NormalizeException(&type, &value, &tb);
    } else {
        if (value) {
            PyErr_SetString(PyExc_TypeError,
                "instance exception may not have a separate value");
            goto raise_error;
        }
        value = type;
        type = (PyObject*) Py_TYPE(type);
        Py_INCREF(type);
        if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) {
            PyErr_SetString(PyExc_TypeError,
                "raise: exception class must be a subclass of BaseException");
            goto raise_error;
        }
    }
    __Pyx_PyThreadState_assign
    __Pyx_ErrRestore(type, value, tb);
    return;
raise_error:
    Py_XDECREF(value);
    Py_XDECREF(type);
    Py_XDECREF(tb);
    return;
}
#else
static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) {
    PyObject* owned_instance = NULL;
    if (tb == Py_None) {
        tb = 0;
    } else if (tb && !PyTraceBack_Check(tb)) {
        PyErr_SetString(PyExc_TypeError,
            "raise: arg 3 must be a traceback or None");
        goto bad;
    }
    if (value == Py_None)
        value = 0;
    if (PyExceptionInstance_Check(type)) {
        if (value) {
            PyErr_SetString(PyExc_TypeError,
                "instance exception may not have a separate value");
            goto bad;
        }
        value = type;
        type = (PyObject*) Py_TYPE(value);
    } else if (PyExceptionClass_Check(type)) {
        PyObject *instance_class = NULL;
        if (value && PyExceptionInstance_Check(value)) {
            instance_class = (PyObject*) Py_TYPE(value);
            if (instance_class != type) {
                int is_subclass = PyObject_IsSubclass(instance_class, type);
                if (!is_subclass) {
                    instance_class = NULL;
                } else if (unlikely(is_subclass == -1)) {
                    goto bad;
                } else {
                    type = instance_class;
                }
            }
        }
        if (!instance_class) {
            PyObject *args;
            if (!value)
                args = PyTuple_New(0);
            else if (PyTuple_Check(value)) {
                Py_INCREF(value);
                args = value;
            } else
                args = PyTuple_Pack(1, value);
            if (!args)
                goto bad;
            owned_instance = PyObject_Call(type, args, NULL);
            Py_DECREF(args);
            if (!owned_instance)
                goto bad;
            value = owned_instance;
            if (!PyExceptionInstance_Check(value)) {
                PyErr_Format(PyExc_TypeError,
                             "calling %R should have returned an instance of "
                             "BaseException, not %R",
                             type, Py_TYPE(value));
                goto bad;
            }
        }
    } else {
        PyErr_SetString(PyExc_TypeError,
            "raise: exception class must be a subclass of BaseException");
        goto bad;
    }
#if PY_VERSION_HEX >= 0x03030000
    if (cause) {
#else
    if (cause && cause != Py_None) {
#endif
        PyObject *fixed_cause;
        if (cause == Py_None) {
            fixed_cause = NULL;
        } else if (PyExceptionClass_Check(cause)) {
            fixed_cause = PyObject_CallObject(cause, NULL);
            if (fixed_cause == NULL)
                goto bad;
        } else if (PyExceptionInstance_Check(cause)) {
            fixed_cause = cause;
            Py_INCREF(fixed_cause);
        } else {
            PyErr_SetString(PyExc_TypeError,
                            "exception causes must derive from "
                            "BaseException");
            goto bad;
        }
        PyException_SetCause(value, fixed_cause);
    }
    PyErr_SetObject(type, value);
    if (tb) {
#if CYTHON_COMPILING_IN_PYPY
        PyObject *tmp_type, *tmp_value, *tmp_tb;
        PyErr_Fetch(&tmp_type, &tmp_value, &tmp_tb);
        Py_INCREF(tb);
        PyErr_Restore(tmp_type, tmp_value, tb);
        Py_XDECREF(tmp_tb);
#else
        PyThreadState *tstate = PyThreadState_GET();
        PyObject* tmp_tb = tstate->curexc_traceback;
        if (tb != tmp_tb) {
            Py_INCREF(tb);
            tstate->curexc_traceback = tb;
            Py_XDECREF(tmp_tb);
        }
#endif
    }
bad:
    Py_XDECREF(owned_instance);
    return;
}
#endif

/* GetModuleGlobalName */
  static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) {
    PyObject *result;
#if !CYTHON_AVOID_BORROWED_REFS
    result = PyDict_GetItem(__pyx_d, name);
    if (likely(result)) {
        Py_INCREF(result);
    } else {
#else
    result = PyObject_GetItem(__pyx_d, name);
    if (!result) {
        PyErr_Clear();
#endif
        result = __Pyx_GetBuiltinName(name);
    }
    return result;
}

/* PyFunctionFastCall */
    #if CYTHON_FAST_PYCALL
#include "frameobject.h"
static PyObject* __Pyx_PyFunction_FastCallNoKw(PyCodeObject *co, PyObject **args, Py_ssize_t na,
                                               PyObject *globals) {
    PyFrameObject *f;
    PyThreadState *tstate = PyThreadState_GET();
    PyObject **fastlocals;
    Py_ssize_t i;
    PyObject *result;
    assert(globals != NULL);
    /* XXX Perhaps we should create a specialized
       PyFrame_New() that doesn't take locals, but does
       take builtins without sanity checking them.
       */
    assert(tstate != NULL);
    f = PyFrame_New(tstate, co, globals, NULL);
    if (f == NULL) {
        return NULL;
    }
    fastlocals = f->f_localsplus;
    for (i = 0; i < na; i++) {
        Py_INCREF(*args);
        fastlocals[i] = *args++;
    }
    result = PyEval_EvalFrameEx(f,0);
    ++tstate->recursion_depth;
    Py_DECREF(f);
    --tstate->recursion_depth;
    return result;
}
#if 1 || PY_VERSION_HEX < 0x030600B1
static PyObject *__Pyx_PyFunction_FastCallDict(PyObject *func, PyObject **args, int nargs, PyObject *kwargs) {
    PyCodeObject *co = (PyCodeObject *)PyFunction_GET_CODE(func);
    PyObject *globals = PyFunction_GET_GLOBALS(func);
    PyObject *argdefs = PyFunction_GET_DEFAULTS(func);
    PyObject *closure;
#if PY_MAJOR_VERSION >= 3
    PyObject *kwdefs;
#endif
    PyObject *kwtuple, **k;
    PyObject **d;
    Py_ssize_t nd;
    Py_ssize_t nk;
    PyObject *result;
    assert(kwargs == NULL || PyDict_Check(kwargs));
    nk = kwargs ? PyDict_Size(kwargs) : 0;
    if (Py_EnterRecursiveCall((char*)" while calling a Python object")) {
        return NULL;
    }
    if (
#if PY_MAJOR_VERSION >= 3
            co->co_kwonlyargcount == 0 &&
#endif
            likely(kwargs == NULL || nk == 0) &&
            co->co_flags == (CO_OPTIMIZED | CO_NEWLOCALS | CO_NOFREE)) {
        if (argdefs == NULL && co->co_argcount == nargs) {
            result = __Pyx_PyFunction_FastCallNoKw(co, args, nargs, globals);
            goto done;
        }
        else if (nargs == 0 && argdefs != NULL
                 && co->co_argcount == Py_SIZE(argdefs)) {
            /* function called with no arguments, but all parameters have
               a default value: use default values as arguments .*/
            args = &PyTuple_GET_ITEM(argdefs, 0);
            result =__Pyx_PyFunction_FastCallNoKw(co, args, Py_SIZE(argdefs), globals);
            goto done;
        }
    }
    if (kwargs != NULL) {
        Py_ssize_t pos, i;
        kwtuple = PyTuple_New(2 * nk);
        if (kwtuple == NULL) {
            result = NULL;
            goto done;
        }
        k = &PyTuple_GET_ITEM(kwtuple, 0);
        pos = i = 0;
        while (PyDict_Next(kwargs, &pos, &k[i], &k[i+1])) {
            Py_INCREF(k[i]);
            Py_INCREF(k[i+1]);
            i += 2;
        }
        nk = i / 2;
    }
    else {
        kwtuple = NULL;
        k = NULL;
    }
    closure = PyFunction_GET_CLOSURE(func);
#if PY_MAJOR_VERSION >= 3
    kwdefs = PyFunction_GET_KW_DEFAULTS(func);
#endif
    if (argdefs != NULL) {
        d = &PyTuple_GET_ITEM(argdefs, 0);
        nd = Py_SIZE(argdefs);
    }
    else {
        d = NULL;
        nd = 0;
    }
#if PY_MAJOR_VERSION >= 3
    result = PyEval_EvalCodeEx((PyObject*)co, globals, (PyObject *)NULL,
                               args, nargs,
                               k, (int)nk,
                               d, (int)nd, kwdefs, closure);
#else
    result = PyEval_EvalCodeEx(co, globals, (PyObject *)NULL,
                               args, nargs,
                               k, (int)nk,
                               d, (int)nd, closure);
#endif
    Py_XDECREF(kwtuple);
done:
    Py_LeaveRecursiveCall();
    return result;
}
#endif  // CPython < 3.6
#endif  // CYTHON_FAST_PYCALL

/* PyCFunctionFastCall */
    #if CYTHON_FAST_PYCCALL
static CYTHON_INLINE PyObject * __Pyx_PyCFunction_FastCall(PyObject *func_obj, PyObject **args, Py_ssize_t nargs) {
    PyCFunctionObject *func = (PyCFunctionObject*)func_obj;
    PyCFunction meth = PyCFunction_GET_FUNCTION(func);
    PyObject *self = PyCFunction_GET_SELF(func);
    assert(PyCFunction_Check(func));
    assert(METH_FASTCALL == (PyCFunction_GET_FLAGS(func) & ~(METH_CLASS | METH_STATIC | METH_COEXIST)));
    assert(nargs >= 0);
    assert(nargs == 0 || args != NULL);
    /* _PyCFunction_FastCallDict() must not be called with an exception set,
       because it may clear it (directly or indirectly) and so the
       caller loses its exception */
    assert(!PyErr_Occurred());
    return (*((__Pyx_PyCFunctionFast)meth)) (self, args, nargs, NULL);
}
#endif  // CYTHON_FAST_PYCCALL

/* RaiseTooManyValuesToUnpack */
    static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) {
    PyErr_Format(PyExc_ValueError,
                 "too many values to unpack (expected %" CYTHON_FORMAT_SSIZE_T "d)", expected);
}

/* RaiseNeedMoreValuesToUnpack */
    static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) {
    PyErr_Format(PyExc_ValueError,
                 "need more than %" CYTHON_FORMAT_SSIZE_T "d value%.1s to unpack",
                 index, (index == 1) ? "" : "s");
}

/* IterFinish */
    static CYTHON_INLINE int __Pyx_IterFinish(void) {
#if CYTHON_FAST_THREAD_STATE
    PyThreadState *tstate = PyThreadState_GET();
    PyObject* exc_type = tstate->curexc_type;
    if (unlikely(exc_type)) {
        if (likely(exc_type == PyExc_StopIteration) || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration)) {
            PyObject *exc_value, *exc_tb;
            exc_value = tstate->curexc_value;
            exc_tb = tstate->curexc_traceback;
            tstate->curexc_type = 0;
            tstate->curexc_value = 0;
            tstate->curexc_traceback = 0;
            Py_DECREF(exc_type);
            Py_XDECREF(exc_value);
            Py_XDECREF(exc_tb);
            return 0;
        } else {
            return -1;
        }
    }
    return 0;
#else
    if (unlikely(PyErr_Occurred())) {
        if (likely(PyErr_ExceptionMatches(PyExc_StopIteration))) {
            PyErr_Clear();
            return 0;
        } else {
            return -1;
        }
    }
    return 0;
#endif
}

/* UnpackItemEndCheck */
    static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected) {
    if (unlikely(retval)) {
        Py_DECREF(retval);
        __Pyx_RaiseTooManyValuesError(expected);
        return -1;
    } else {
        return __Pyx_IterFinish();
    }
    return 0;
}

/* PyIntBinop */
    #if !CYTHON_COMPILING_IN_PYPY
static PyObject* __Pyx_PyInt_AddObjC(PyObject *op1, PyObject *op2, CYTHON_UNUSED long intval, CYTHON_UNUSED int inplace) {
    #if PY_MAJOR_VERSION < 3
    if (likely(PyInt_CheckExact(op1))) {
        const long b = intval;
        long x;
        long a = PyInt_AS_LONG(op1);
            x = (long)((unsigned long)a + b);
            if (likely((x^a) >= 0 || (x^b) >= 0))
                return PyInt_FromLong(x);
            return PyLong_Type.tp_as_number->nb_add(op1, op2);
    }
    #endif
    #if CYTHON_USE_PYLONG_INTERNALS
    if (likely(PyLong_CheckExact(op1))) {
        const long b = intval;
        long a, x;
#ifdef HAVE_LONG_LONG
        const PY_LONG_LONG llb = intval;
        PY_LONG_LONG lla, llx;
#endif
        const digit* digits = ((PyLongObject*)op1)->ob_digit;
        const Py_ssize_t size = Py_SIZE(op1);
        if (likely(__Pyx_sst_abs(size) <= 1)) {
            a = likely(size) ? digits[0] : 0;
            if (size == -1) a = -a;
        } else {
            switch (size) {
                case -2:
                    if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {
                        a = -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 2 * PyLong_SHIFT) {
                        lla = -(PY_LONG_LONG) (((((unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                case 2:
                    if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {
                        a = (long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 2 * PyLong_SHIFT) {
                        lla = (PY_LONG_LONG) (((((unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                case -3:
                    if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {
                        a = -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 3 * PyLong_SHIFT) {
                        lla = -(PY_LONG_LONG) (((((((unsigned PY_LONG_LONG)digits[2]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                case 3:
                    if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {
                        a = (long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 3 * PyLong_SHIFT) {
                        lla = (PY_LONG_LONG) (((((((unsigned PY_LONG_LONG)digits[2]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                case -4:
                    if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {
                        a = -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 4 * PyLong_SHIFT) {
                        lla = -(PY_LONG_LONG) (((((((((unsigned PY_LONG_LONG)digits[3]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[2]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                case 4:
                    if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {
                        a = (long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0]));
                        break;
#ifdef HAVE_LONG_LONG
                    } else if (8 * sizeof(PY_LONG_LONG) - 1 > 4 * PyLong_SHIFT) {
                        lla = (PY_LONG_LONG) (((((((((unsigned PY_LONG_LONG)digits[3]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[2]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[1]) << PyLong_SHIFT) | (unsigned PY_LONG_LONG)digits[0]));
                        goto long_long;
#endif
                    }
                default: return PyLong_Type.tp_as_number->nb_add(op1, op2);
            }
        }
                x = a + b;
            return PyLong_FromLong(x);
#ifdef HAVE_LONG_LONG
        long_long:
                llx = lla + llb;
            return PyLong_FromLongLong(llx);
#endif
        
        
    }
    #endif
    if (PyFloat_CheckExact(op1)) {
        const long b = intval;
        double a = PyFloat_AS_DOUBLE(op1);
            double result;
            PyFPE_START_PROTECT("add", return NULL)
            result = ((double)a) + (double)b;
            PyFPE_END_PROTECT(result)
            return PyFloat_FromDouble(result);
    }
    return (inplace ? PyNumber_InPlaceAdd : PyNumber_Add)(op1, op2);
}
#endif

/* SaveResetException */
    #if CYTHON_FAST_THREAD_STATE
static CYTHON_INLINE void __Pyx__ExceptionSave(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {
    *type = tstate->exc_type;
    *value = tstate->exc_value;
    *tb = tstate->exc_traceback;
    Py_XINCREF(*type);
    Py_XINCREF(*value);
    Py_XINCREF(*tb);
}
static CYTHON_INLINE void __Pyx__ExceptionReset(PyThreadState *tstate, PyObject *type, PyObject *value, PyObject *tb) {
    PyObject *tmp_type, *tmp_value, *tmp_tb;
    tmp_type = tstate->exc_type;
    tmp_value = tstate->exc_value;
    tmp_tb = tstate->exc_traceback;
    tstate->exc_type = type;
    tstate->exc_value = value;
    tstate->exc_traceback = tb;
    Py_XDECREF(tmp_type);
    Py_XDECREF(tmp_value);
    Py_XDECREF(tmp_tb);
}
#endif

/* PyErrExceptionMatches */
    #if CYTHON_FAST_THREAD_STATE
static CYTHON_INLINE int __Pyx_PyErr_ExceptionMatchesInState(PyThreadState* tstate, PyObject* err) {
    PyObject *exc_type = tstate->curexc_type;
    if (exc_type == err) return 1;
    if (unlikely(!exc_type)) return 0;
    return PyErr_GivenExceptionMatches(exc_type, err);
}
#endif

/* GetException */
    #if CYTHON_FAST_THREAD_STATE
static int __Pyx__GetException(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {
#else
static int __Pyx_GetException(PyObject **type, PyObject **value, PyObject **tb) {
#endif
    PyObject *local_type, *local_value, *local_tb;
#if CYTHON_FAST_THREAD_STATE
    PyObject *tmp_type, *tmp_value, *tmp_tb;
    local_type = tstate->curexc_type;
    local_value = tstate->curexc_value;
    local_tb = tstate->curexc_traceback;
    tstate->curexc_type = 0;
    tstate->curexc_value = 0;
    tstate->curexc_traceback = 0;
#else
    PyErr_Fetch(&local_type, &local_value, &local_tb);
#endif
    PyErr_NormalizeException(&local_type, &local_value, &local_tb);
#if CYTHON_FAST_THREAD_STATE
    if (unlikely(tstate->curexc_type))
#else
    if (unlikely(PyErr_Occurred()))
#endif
        goto bad;
    #if PY_MAJOR_VERSION >= 3
    if (local_tb) {
        if (unlikely(PyException_SetTraceback(local_value, local_tb) < 0))
            goto bad;
    }
    #endif
    Py_XINCREF(local_tb);
    Py_XINCREF(local_type);
    Py_XINCREF(local_value);
    *type = local_type;
    *value = local_value;
    *tb = local_tb;
#if CYTHON_FAST_THREAD_STATE
    tmp_type = tstate->exc_type;
    tmp_value = tstate->exc_value;
    tmp_tb = tstate->exc_traceback;
    tstate->exc_type = local_type;
    tstate->exc_value = local_value;
    tstate->exc_traceback = local_tb;
    Py_XDECREF(tmp_type);
    Py_XDECREF(tmp_value);
    Py_XDECREF(tmp_tb);
#else
    PyErr_SetExcInfo(local_type, local_value, local_tb);
#endif
    return 0;
bad:
    *type = 0;
    *value = 0;
    *tb = 0;
    Py_XDECREF(local_type);
    Py_XDECREF(local_value);
    Py_XDECREF(local_tb);
    return -1;
}

/* None */
      static CYTHON_INLINE void __Pyx_RaiseClosureNameError(const char *varname) {
    PyErr_Format(PyExc_NameError, "free variable '%s' referenced before assignment in enclosing scope", varname);
}

/* PyObjectCallMethO */
      #if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallMethO(PyObject *func, PyObject *arg) {
    PyObject *self, *result;
    PyCFunction cfunc;
    cfunc = PyCFunction_GET_FUNCTION(func);
    self = PyCFunction_GET_SELF(func);
    if (unlikely(Py_EnterRecursiveCall((char*)" while calling a Python object")))
        return NULL;
    result = cfunc(self, arg);
    Py_LeaveRecursiveCall();
    if (unlikely(!result) && unlikely(!PyErr_Occurred())) {
        PyErr_SetString(
            PyExc_SystemError,
            "NULL result without error in PyObject_Call");
    }
    return result;
}
#endif

/* PyObjectCallOneArg */
      #if CYTHON_COMPILING_IN_CPYTHON
static PyObject* __Pyx__PyObject_CallOneArg(PyObject *func, PyObject *arg) {
    PyObject *result;
    PyObject *args = PyTuple_New(1);
    if (unlikely(!args)) return NULL;
    Py_INCREF(arg);
    PyTuple_SET_ITEM(args, 0, arg);
    result = __Pyx_PyObject_Call(func, args, NULL);
    Py_DECREF(args);
    return result;
}
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {
#if CYTHON_FAST_PYCALL
    if (PyFunction_Check(func)) {
        return __Pyx_PyFunction_FastCall(func, &arg, 1);
    }
#endif
#ifdef __Pyx_CyFunction_USED
    if (likely(PyCFunction_Check(func) || PyObject_TypeCheck(func, __pyx_CyFunctionType))) {
#else
    if (likely(PyCFunction_Check(func))) {
#endif
        if (likely(PyCFunction_GET_FLAGS(func) & METH_O)) {
            return __Pyx_PyObject_CallMethO(func, arg);
#if CYTHON_FAST_PYCCALL
        } else if (PyCFunction_GET_FLAGS(func) & METH_FASTCALL) {
            return __Pyx_PyCFunction_FastCall(func, &arg, 1);
#endif
        }
    }
    return __Pyx__PyObject_CallOneArg(func, arg);
}
#else
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallOneArg(PyObject *func, PyObject *arg) {
    PyObject *result;
    PyObject *args = PyTuple_Pack(1, arg);
    if (unlikely(!args)) return NULL;
    result = __Pyx_PyObject_Call(func, args, NULL);
    Py_DECREF(args);
    return result;
}
#endif

/* PyObjectCallNoArg */
        #if CYTHON_COMPILING_IN_CPYTHON
static CYTHON_INLINE PyObject* __Pyx_PyObject_CallNoArg(PyObject *func) {
#if CYTHON_FAST_PYCALL
    if (PyFunction_Check(func)) {
        return __Pyx_PyFunction_FastCall(func, NULL, 0);
    }
#endif
#ifdef __Pyx_CyFunction_USED
    if (likely(PyCFunction_Check(func) || PyObject_TypeCheck(func, __pyx_CyFunctionType))) {
#else
    if (likely(PyCFunction_Check(func))) {
#endif
        if (likely(PyCFunction_GET_FLAGS(func) & METH_NOARGS)) {
            return __Pyx_PyObject_CallMethO(func, NULL);
        }
    }
    return __Pyx_PyObject_Call(func, __pyx_empty_tuple, NULL);
}
#endif

/* CalculateMetaclass */
          static PyObject *__Pyx_CalculateMetaclass(PyTypeObject *metaclass, PyObject *bases) {
    Py_ssize_t i, nbases = PyTuple_GET_SIZE(bases);
    for (i=0; i < nbases; i++) {
        PyTypeObject *tmptype;
        PyObject *tmp = PyTuple_GET_ITEM(bases, i);
        tmptype = Py_TYPE(tmp);
#if PY_MAJOR_VERSION < 3
        if (tmptype == &PyClass_Type)
            continue;
#endif
        if (!metaclass) {
            metaclass = tmptype;
            continue;
        }
        if (PyType_IsSubtype(metaclass, tmptype))
            continue;
        if (PyType_IsSubtype(tmptype, metaclass)) {
            metaclass = tmptype;
            continue;
        }
        PyErr_SetString(PyExc_TypeError,
                        "metaclass conflict: "
                        "the metaclass of a derived class "
                        "must be a (non-strict) subclass "
                        "of the metaclasses of all its bases");
        return NULL;
    }
    if (!metaclass) {
#if PY_MAJOR_VERSION < 3
        metaclass = &PyClass_Type;
#else
        metaclass = &PyType_Type;
#endif
    }
    Py_INCREF((PyObject*) metaclass);
    return (PyObject*) metaclass;
}

/* Py3ClassCreate */
          static PyObject *__Pyx_Py3MetaclassPrepare(PyObject *metaclass, PyObject *bases, PyObject *name,
                                           PyObject *qualname, PyObject *mkw, PyObject *modname, PyObject *doc) {
    PyObject *ns;
    if (metaclass) {
        PyObject *prep = __Pyx_PyObject_GetAttrStr(metaclass, __pyx_n_s_prepare);
        if (prep) {
            PyObject *pargs = PyTuple_Pack(2, name, bases);
            if (unlikely(!pargs)) {
                Py_DECREF(prep);
                return NULL;
            }
            ns = PyObject_Call(prep, pargs, mkw);
            Py_DECREF(prep);
            Py_DECREF(pargs);
        } else {
            if (unlikely(!PyErr_ExceptionMatches(PyExc_AttributeError)))
                return NULL;
            PyErr_Clear();
            ns = PyDict_New();
        }
    } else {
        ns = PyDict_New();
    }
    if (unlikely(!ns))
        return NULL;
    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_module, modname) < 0)) goto bad;
    if (unlikely(PyObject_SetItem(ns, __pyx_n_s_qualname, qualname) < 0)) goto bad;
    if (unlikely(doc && PyObject_SetItem(ns, __pyx_n_s_doc, doc) < 0)) goto bad;
    return ns;
bad:
    Py_DECREF(ns);
    return NULL;
}
static PyObject *__Pyx_Py3ClassCreate(PyObject *metaclass, PyObject *name, PyObject *bases,
                                      PyObject *dict, PyObject *mkw,
                                      int calculate_metaclass, int allow_py2_metaclass) {
    PyObject *result, *margs;
    PyObject *owned_metaclass = NULL;
    if (allow_py2_metaclass) {
        owned_metaclass = PyObject_GetItem(dict, __pyx_n_s_metaclass);
        if (owned_metaclass) {
            metaclass = owned_metaclass;
        } else if (likely(PyErr_ExceptionMatches(PyExc_KeyError))) {
            PyErr_Clear();
        } else {
            return NULL;
        }
    }
    if (calculate_metaclass && (!metaclass || PyType_Check(metaclass))) {
        metaclass = __Pyx_CalculateMetaclass((PyTypeObject*) metaclass, bases);
        Py_XDECREF(owned_metaclass);
        if (unlikely(!metaclass))
            return NULL;
        owned_metaclass = metaclass;
    }
    margs = PyTuple_Pack(3, name, bases, dict);
    if (unlikely(!margs)) {
        result = NULL;
    } else {
        result = PyObject_Call(metaclass, margs, mkw);
        Py_DECREF(margs);
    }
    Py_XDECREF(owned_metaclass);
    return result;
}

/* GetNameInClass */
          static PyObject *__Pyx_GetNameInClass(PyObject *nmspace, PyObject *name) {
    PyObject *result;
    result = __Pyx_PyObject_GetAttrStr(nmspace, name);
    if (!result)
        result = __Pyx_GetModuleGlobalName(name);
    return result;
}

/* CodeObjectCache */
          static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) {
    int start = 0, mid = 0, end = count - 1;
    if (end >= 0 && code_line > entries[end].code_line) {
        return count;
    }
    while (start < end) {
        mid = start + (end - start) / 2;
        if (code_line < entries[mid].code_line) {
            end = mid;
        } else if (code_line > entries[mid].code_line) {
             start = mid + 1;
        } else {
            return mid;
        }
    }
    if (code_line <= entries[mid].code_line) {
        return mid;
    } else {
        return mid + 1;
    }
}
static PyCodeObject *__pyx_find_code_object(int code_line) {
    PyCodeObject* code_object;
    int pos;
    if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) {
        return NULL;
    }
    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);
    if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) {
        return NULL;
    }
    code_object = __pyx_code_cache.entries[pos].code_object;
    Py_INCREF(code_object);
    return code_object;
}
static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) {
    int pos, i;
    __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries;
    if (unlikely(!code_line)) {
        return;
    }
    if (unlikely(!entries)) {
        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry));
        if (likely(entries)) {
            __pyx_code_cache.entries = entries;
            __pyx_code_cache.max_count = 64;
            __pyx_code_cache.count = 1;
            entries[0].code_line = code_line;
            entries[0].code_object = code_object;
            Py_INCREF(code_object);
        }
        return;
    }
    pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line);
    if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) {
        PyCodeObject* tmp = entries[pos].code_object;
        entries[pos].code_object = code_object;
        Py_DECREF(tmp);
        return;
    }
    if (__pyx_code_cache.count == __pyx_code_cache.max_count) {
        int new_max = __pyx_code_cache.max_count + 64;
        entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc(
            __pyx_code_cache.entries, (size_t)new_max*sizeof(__Pyx_CodeObjectCacheEntry));
        if (unlikely(!entries)) {
            return;
        }
        __pyx_code_cache.entries = entries;
        __pyx_code_cache.max_count = new_max;
    }
    for (i=__pyx_code_cache.count; i>pos; i--) {
        entries[i] = entries[i-1];
    }
    entries[pos].code_line = code_line;
    entries[pos].code_object = code_object;
    __pyx_code_cache.count++;
    Py_INCREF(code_object);
}

/* AddTraceback */
          #include "compile.h"
#include "frameobject.h"
#include "traceback.h"
static PyCodeObject* __Pyx_CreateCodeObjectForTraceback(
            const char *funcname, int c_line,
            int py_line, const char *filename) {
    PyCodeObject *py_code = 0;
    PyObject *py_srcfile = 0;
    PyObject *py_funcname = 0;
    #if PY_MAJOR_VERSION < 3
    py_srcfile = PyString_FromString(filename);
    #else
    py_srcfile = PyUnicode_FromString(filename);
    #endif
    if (!py_srcfile) goto bad;
    if (c_line) {
        #if PY_MAJOR_VERSION < 3
        py_funcname = PyString_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line);
        #else
        py_funcname = PyUnicode_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line);
        #endif
    }
    else {
        #if PY_MAJOR_VERSION < 3
        py_funcname = PyString_FromString(funcname);
        #else
        py_funcname = PyUnicode_FromString(funcname);
        #endif
    }
    if (!py_funcname) goto bad;
    py_code = __Pyx_PyCode_New(
        0,
        0,
        0,
        0,
        0,
        __pyx_empty_bytes, /*PyObject *code,*/
        __pyx_empty_tuple, /*PyObject *consts,*/
        __pyx_empty_tuple, /*PyObject *names,*/
        __pyx_empty_tuple, /*PyObject *varnames,*/
        __pyx_empty_tuple, /*PyObject *freevars,*/
        __pyx_empty_tuple, /*PyObject *cellvars,*/
        py_srcfile,   /*PyObject *filename,*/
        py_funcname,  /*PyObject *name,*/
        py_line,
        __pyx_empty_bytes  /*PyObject *lnotab*/
    );
    Py_DECREF(py_srcfile);
    Py_DECREF(py_funcname);
    return py_code;
bad:
    Py_XDECREF(py_srcfile);
    Py_XDECREF(py_funcname);
    return NULL;
}
static void __Pyx_AddTraceback(const char *funcname, int c_line,
                               int py_line, const char *filename) {
    PyCodeObject *py_code = 0;
    PyFrameObject *py_frame = 0;
    py_code = __pyx_find_code_object(c_line ? c_line : py_line);
    if (!py_code) {
        py_code = __Pyx_CreateCodeObjectForTraceback(
            funcname, c_line, py_line, filename);
        if (!py_code) goto bad;
        __pyx_insert_code_object(c_line ? c_line : py_line, py_code);
    }
    py_frame = PyFrame_New(
        PyThreadState_GET(), /*PyThreadState *tstate,*/
        py_code,             /*PyCodeObject *code,*/
        __pyx_d,      /*PyObject *globals,*/
        0                    /*PyObject *locals*/
    );
    if (!py_frame) goto bad;
    __Pyx_PyFrame_SetLineNumber(py_frame, py_line);
    PyTraceBack_Here(py_frame);
bad:
    Py_XDECREF(py_code);
    Py_XDECREF(py_frame);
}

/* CIntToPy */
          static CYTHON_INLINE PyObject* __Pyx_PyInt_From_KV(KV value) {
    const KV neg_one = (KV) -1, const_zero = (KV) 0;
    const int is_unsigned = neg_one > const_zero;
    if (is_unsigned) {
        if (sizeof(KV) < sizeof(long)) {
            return PyInt_FromLong((long) value);
        } else if (sizeof(KV) <= sizeof(unsigned long)) {
            return PyLong_FromUnsignedLong((unsigned long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(KV) <= sizeof(unsigned PY_LONG_LONG)) {
            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);
#endif
        }
    } else {
        if (sizeof(KV) <= sizeof(long)) {
            return PyInt_FromLong((long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(KV) <= sizeof(PY_LONG_LONG)) {
            return PyLong_FromLongLong((PY_LONG_LONG) value);
#endif
        }
    }
    {
        int one = 1; int little = (int)*(unsigned char *)&one;
        unsigned char *bytes = (unsigned char *)&value;
        return _PyLong_FromByteArray(bytes, sizeof(KV),
                                     little, !is_unsigned);
    }
}

/* CIntToPy */
          static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) {
    const int neg_one = (int) -1, const_zero = (int) 0;
    const int is_unsigned = neg_one > const_zero;
    if (is_unsigned) {
        if (sizeof(int) < sizeof(long)) {
            return PyInt_FromLong((long) value);
        } else if (sizeof(int) <= sizeof(unsigned long)) {
            return PyLong_FromUnsignedLong((unsigned long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {
            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);
#endif
        }
    } else {
        if (sizeof(int) <= sizeof(long)) {
            return PyInt_FromLong((long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {
            return PyLong_FromLongLong((PY_LONG_LONG) value);
#endif
        }
    }
    {
        int one = 1; int little = (int)*(unsigned char *)&one;
        unsigned char *bytes = (unsigned char *)&value;
        return _PyLong_FromByteArray(bytes, sizeof(int),
                                     little, !is_unsigned);
    }
}

/* CIntFromPyVerify */
          #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func_value)\
    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 0)
#define __PYX_VERIFY_RETURN_INT_EXC(target_type, func_type, func_value)\
    __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, 1)
#define __PYX__VERIFY_RETURN_INT(target_type, func_type, func_value, exc)\
    {\
        func_type value = func_value;\
        if (sizeof(target_type) < sizeof(func_type)) {\
            if (unlikely(value != (func_type) (target_type) value)) {\
                func_type zero = 0;\
                if (exc && unlikely(value == (func_type)-1 && PyErr_Occurred()))\
                    return (target_type) -1;\
                if (is_unsigned && unlikely(value < zero))\
                    goto raise_neg_overflow;\
                else\
                    goto raise_overflow;\
            }\
        }\
        return (target_type) value;\
    }

/* CIntFromPy */
          static CYTHON_INLINE unsigned int __Pyx_PyInt_As_unsigned_int(PyObject *x) {
    const unsigned int neg_one = (unsigned int) -1, const_zero = (unsigned int) 0;
    const int is_unsigned = neg_one > const_zero;
#if PY_MAJOR_VERSION < 3
    if (likely(PyInt_Check(x))) {
        if (sizeof(unsigned int) < sizeof(long)) {
            __PYX_VERIFY_RETURN_INT(unsigned int, long, PyInt_AS_LONG(x))
        } else {
            long val = PyInt_AS_LONG(x);
            if (is_unsigned && unlikely(val < 0)) {
                goto raise_neg_overflow;
            }
            return (unsigned int) val;
        }
    } else
#endif
    if (likely(PyLong_Check(x))) {
        if (is_unsigned) {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (unsigned int) 0;
                case  1: __PYX_VERIFY_RETURN_INT(unsigned int, digit, digits[0])
                case 2:
                    if (8 * sizeof(unsigned int) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) >= 2 * PyLong_SHIFT) {
                            return (unsigned int) (((((unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0]));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(unsigned int) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) >= 3 * PyLong_SHIFT) {
                            return (unsigned int) (((((((unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0]));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(unsigned int) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) >= 4 * PyLong_SHIFT) {
                            return (unsigned int) (((((((((unsigned int)digits[3]) << PyLong_SHIFT) | (unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0]));
                        }
                    }
                    break;
            }
#endif
#if CYTHON_COMPILING_IN_CPYTHON
            if (unlikely(Py_SIZE(x) < 0)) {
                goto raise_neg_overflow;
            }
#else
            {
                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);
                if (unlikely(result < 0))
                    return (unsigned int) -1;
                if (unlikely(result == 1))
                    goto raise_neg_overflow;
            }
#endif
            if (sizeof(unsigned int) <= sizeof(unsigned long)) {
                __PYX_VERIFY_RETURN_INT_EXC(unsigned int, unsigned long, PyLong_AsUnsignedLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(unsigned int) <= sizeof(unsigned PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(unsigned int, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))
#endif
            }
        } else {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (unsigned int) 0;
                case -1: __PYX_VERIFY_RETURN_INT(unsigned int, sdigit, (sdigit) (-(sdigit)digits[0]))
                case  1: __PYX_VERIFY_RETURN_INT(unsigned int,  digit, +digits[0])
                case -2:
                    if (8 * sizeof(unsigned int) - 1 > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 2 * PyLong_SHIFT) {
                            return (unsigned int) (((unsigned int)-1)*(((((unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
                case 2:
                    if (8 * sizeof(unsigned int) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 2 * PyLong_SHIFT) {
                            return (unsigned int) ((((((unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
                case -3:
                    if (8 * sizeof(unsigned int) - 1 > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 3 * PyLong_SHIFT) {
                            return (unsigned int) (((unsigned int)-1)*(((((((unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(unsigned int) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 3 * PyLong_SHIFT) {
                            return (unsigned int) ((((((((unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
                case -4:
                    if (8 * sizeof(unsigned int) - 1 > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 4 * PyLong_SHIFT) {
                            return (unsigned int) (((unsigned int)-1)*(((((((((unsigned int)digits[3]) << PyLong_SHIFT) | (unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(unsigned int) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(unsigned int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(unsigned int) - 1 > 4 * PyLong_SHIFT) {
                            return (unsigned int) ((((((((((unsigned int)digits[3]) << PyLong_SHIFT) | (unsigned int)digits[2]) << PyLong_SHIFT) | (unsigned int)digits[1]) << PyLong_SHIFT) | (unsigned int)digits[0])));
                        }
                    }
                    break;
            }
#endif
            if (sizeof(unsigned int) <= sizeof(long)) {
                __PYX_VERIFY_RETURN_INT_EXC(unsigned int, long, PyLong_AsLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(unsigned int) <= sizeof(PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(unsigned int, PY_LONG_LONG, PyLong_AsLongLong(x))
#endif
            }
        }
        {
#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)
            PyErr_SetString(PyExc_RuntimeError,
                            "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers");
#else
            unsigned int val;
            PyObject *v = __Pyx_PyNumber_IntOrLong(x);
 #if PY_MAJOR_VERSION < 3
            if (likely(v) && !PyLong_Check(v)) {
                PyObject *tmp = v;
                v = PyNumber_Long(tmp);
                Py_DECREF(tmp);
            }
 #endif
            if (likely(v)) {
                int one = 1; int is_little = (int)*(unsigned char *)&one;
                unsigned char *bytes = (unsigned char *)&val;
                int ret = _PyLong_AsByteArray((PyLongObject *)v,
                                              bytes, sizeof(val),
                                              is_little, !is_unsigned);
                Py_DECREF(v);
                if (likely(!ret))
                    return val;
            }
#endif
            return (unsigned int) -1;
        }
    } else {
        unsigned int val;
        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);
        if (!tmp) return (unsigned int) -1;
        val = __Pyx_PyInt_As_unsigned_int(tmp);
        Py_DECREF(tmp);
        return val;
    }
raise_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "value too large to convert to unsigned int");
    return (unsigned int) -1;
raise_neg_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "can't convert negative value to unsigned int");
    return (unsigned int) -1;
}

/* CIntFromPy */
          static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) {
    const int neg_one = (int) -1, const_zero = (int) 0;
    const int is_unsigned = neg_one > const_zero;
#if PY_MAJOR_VERSION < 3
    if (likely(PyInt_Check(x))) {
        if (sizeof(int) < sizeof(long)) {
            __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG(x))
        } else {
            long val = PyInt_AS_LONG(x);
            if (is_unsigned && unlikely(val < 0)) {
                goto raise_neg_overflow;
            }
            return (int) val;
        }
    } else
#endif
    if (likely(PyLong_Check(x))) {
        if (is_unsigned) {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (int) 0;
                case  1: __PYX_VERIFY_RETURN_INT(int, digit, digits[0])
                case 2:
                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) >= 2 * PyLong_SHIFT) {
                            return (int) (((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) >= 3 * PyLong_SHIFT) {
                            return (int) (((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) >= 4 * PyLong_SHIFT) {
                            return (int) (((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0]));
                        }
                    }
                    break;
            }
#endif
#if CYTHON_COMPILING_IN_CPYTHON
            if (unlikely(Py_SIZE(x) < 0)) {
                goto raise_neg_overflow;
            }
#else
            {
                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);
                if (unlikely(result < 0))
                    return (int) -1;
                if (unlikely(result == 1))
                    goto raise_neg_overflow;
            }
#endif
            if (sizeof(int) <= sizeof(unsigned long)) {
                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned long, PyLong_AsUnsignedLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(int) <= sizeof(unsigned PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(int, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))
#endif
            }
        } else {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (int) 0;
                case -1: __PYX_VERIFY_RETURN_INT(int, sdigit, (sdigit) (-(sdigit)digits[0]))
                case  1: __PYX_VERIFY_RETURN_INT(int,  digit, +digits[0])
                case -2:
                    if (8 * sizeof(int) - 1 > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {
                            return (int) (((int)-1)*(((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
                case 2:
                    if (8 * sizeof(int) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {
                            return (int) ((((((int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
                case -3:
                    if (8 * sizeof(int) - 1 > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {
                            return (int) (((int)-1)*(((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(int) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {
                            return (int) ((((((((int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
                case -4:
                    if (8 * sizeof(int) - 1 > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {
                            return (int) (((int)-1)*(((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(int) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(int, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(int) - 1 > 4 * PyLong_SHIFT) {
                            return (int) ((((((((((int)digits[3]) << PyLong_SHIFT) | (int)digits[2]) << PyLong_SHIFT) | (int)digits[1]) << PyLong_SHIFT) | (int)digits[0])));
                        }
                    }
                    break;
            }
#endif
            if (sizeof(int) <= sizeof(long)) {
                __PYX_VERIFY_RETURN_INT_EXC(int, long, PyLong_AsLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(int) <= sizeof(PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(int, PY_LONG_LONG, PyLong_AsLongLong(x))
#endif
            }
        }
        {
#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)
            PyErr_SetString(PyExc_RuntimeError,
                            "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers");
#else
            int val;
            PyObject *v = __Pyx_PyNumber_IntOrLong(x);
 #if PY_MAJOR_VERSION < 3
            if (likely(v) && !PyLong_Check(v)) {
                PyObject *tmp = v;
                v = PyNumber_Long(tmp);
                Py_DECREF(tmp);
            }
 #endif
            if (likely(v)) {
                int one = 1; int is_little = (int)*(unsigned char *)&one;
                unsigned char *bytes = (unsigned char *)&val;
                int ret = _PyLong_AsByteArray((PyLongObject *)v,
                                              bytes, sizeof(val),
                                              is_little, !is_unsigned);
                Py_DECREF(v);
                if (likely(!ret))
                    return val;
            }
#endif
            return (int) -1;
        }
    } else {
        int val;
        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);
        if (!tmp) return (int) -1;
        val = __Pyx_PyInt_As_int(tmp);
        Py_DECREF(tmp);
        return val;
    }
raise_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "value too large to convert to int");
    return (int) -1;
raise_neg_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "can't convert negative value to int");
    return (int) -1;
}

/* CIntFromPy */
          static CYTHON_INLINE KV __Pyx_PyInt_As_KV(PyObject *x) {
    const KV neg_one = (KV) -1, const_zero = (KV) 0;
    const int is_unsigned = neg_one > const_zero;
#if PY_MAJOR_VERSION < 3
    if (likely(PyInt_Check(x))) {
        if (sizeof(KV) < sizeof(long)) {
            __PYX_VERIFY_RETURN_INT(KV, long, PyInt_AS_LONG(x))
        } else {
            long val = PyInt_AS_LONG(x);
            if (is_unsigned && unlikely(val < 0)) {
                goto raise_neg_overflow;
            }
            return (KV) val;
        }
    } else
#endif
    if (likely(PyLong_Check(x))) {
        if (is_unsigned) {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (KV) 0;
                case  1: __PYX_VERIFY_RETURN_INT(KV, digit, digits[0])
                case 2:
                    if (8 * sizeof(KV) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) >= 2 * PyLong_SHIFT) {
                            return (KV) (((((KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0]));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(KV) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) >= 3 * PyLong_SHIFT) {
                            return (KV) (((((((KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0]));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(KV) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) >= 4 * PyLong_SHIFT) {
                            return (KV) (((((((((KV)digits[3]) << PyLong_SHIFT) | (KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0]));
                        }
                    }
                    break;
            }
#endif
#if CYTHON_COMPILING_IN_CPYTHON
            if (unlikely(Py_SIZE(x) < 0)) {
                goto raise_neg_overflow;
            }
#else
            {
                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);
                if (unlikely(result < 0))
                    return (KV) -1;
                if (unlikely(result == 1))
                    goto raise_neg_overflow;
            }
#endif
            if (sizeof(KV) <= sizeof(unsigned long)) {
                __PYX_VERIFY_RETURN_INT_EXC(KV, unsigned long, PyLong_AsUnsignedLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(KV) <= sizeof(unsigned PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(KV, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))
#endif
            }
        } else {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (KV) 0;
                case -1: __PYX_VERIFY_RETURN_INT(KV, sdigit, (sdigit) (-(sdigit)digits[0]))
                case  1: __PYX_VERIFY_RETURN_INT(KV,  digit, +digits[0])
                case -2:
                    if (8 * sizeof(KV) - 1 > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 2 * PyLong_SHIFT) {
                            return (KV) (((KV)-1)*(((((KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
                case 2:
                    if (8 * sizeof(KV) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 2 * PyLong_SHIFT) {
                            return (KV) ((((((KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
                case -3:
                    if (8 * sizeof(KV) - 1 > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 3 * PyLong_SHIFT) {
                            return (KV) (((KV)-1)*(((((((KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(KV) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 3 * PyLong_SHIFT) {
                            return (KV) ((((((((KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
                case -4:
                    if (8 * sizeof(KV) - 1 > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 4 * PyLong_SHIFT) {
                            return (KV) (((KV)-1)*(((((((((KV)digits[3]) << PyLong_SHIFT) | (KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(KV) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(KV, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(KV) - 1 > 4 * PyLong_SHIFT) {
                            return (KV) ((((((((((KV)digits[3]) << PyLong_SHIFT) | (KV)digits[2]) << PyLong_SHIFT) | (KV)digits[1]) << PyLong_SHIFT) | (KV)digits[0])));
                        }
                    }
                    break;
            }
#endif
            if (sizeof(KV) <= sizeof(long)) {
                __PYX_VERIFY_RETURN_INT_EXC(KV, long, PyLong_AsLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(KV) <= sizeof(PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(KV, PY_LONG_LONG, PyLong_AsLongLong(x))
#endif
            }
        }
        {
#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)
            PyErr_SetString(PyExc_RuntimeError,
                            "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers");
#else
            KV val;
            PyObject *v = __Pyx_PyNumber_IntOrLong(x);
 #if PY_MAJOR_VERSION < 3
            if (likely(v) && !PyLong_Check(v)) {
                PyObject *tmp = v;
                v = PyNumber_Long(tmp);
                Py_DECREF(tmp);
            }
 #endif
            if (likely(v)) {
                int one = 1; int is_little = (int)*(unsigned char *)&one;
                unsigned char *bytes = (unsigned char *)&val;
                int ret = _PyLong_AsByteArray((PyLongObject *)v,
                                              bytes, sizeof(val),
                                              is_little, !is_unsigned);
                Py_DECREF(v);
                if (likely(!ret))
                    return val;
            }
#endif
            return (KV) -1;
        }
    } else {
        KV val;
        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);
        if (!tmp) return (KV) -1;
        val = __Pyx_PyInt_As_KV(tmp);
        Py_DECREF(tmp);
        return val;
    }
raise_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "value too large to convert to KV");
    return (KV) -1;
raise_neg_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "can't convert negative value to KV");
    return (KV) -1;
}

/* CIntToPy */
          static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) {
    const long neg_one = (long) -1, const_zero = (long) 0;
    const int is_unsigned = neg_one > const_zero;
    if (is_unsigned) {
        if (sizeof(long) < sizeof(long)) {
            return PyInt_FromLong((long) value);
        } else if (sizeof(long) <= sizeof(unsigned long)) {
            return PyLong_FromUnsignedLong((unsigned long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {
            return PyLong_FromUnsignedLongLong((unsigned PY_LONG_LONG) value);
#endif
        }
    } else {
        if (sizeof(long) <= sizeof(long)) {
            return PyInt_FromLong((long) value);
#ifdef HAVE_LONG_LONG
        } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {
            return PyLong_FromLongLong((PY_LONG_LONG) value);
#endif
        }
    }
    {
        int one = 1; int little = (int)*(unsigned char *)&one;
        unsigned char *bytes = (unsigned char *)&value;
        return _PyLong_FromByteArray(bytes, sizeof(long),
                                     little, !is_unsigned);
    }
}

/* CIntFromPy */
          static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) {
    const long neg_one = (long) -1, const_zero = (long) 0;
    const int is_unsigned = neg_one > const_zero;
#if PY_MAJOR_VERSION < 3
    if (likely(PyInt_Check(x))) {
        if (sizeof(long) < sizeof(long)) {
            __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG(x))
        } else {
            long val = PyInt_AS_LONG(x);
            if (is_unsigned && unlikely(val < 0)) {
                goto raise_neg_overflow;
            }
            return (long) val;
        }
    } else
#endif
    if (likely(PyLong_Check(x))) {
        if (is_unsigned) {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (long) 0;
                case  1: __PYX_VERIFY_RETURN_INT(long, digit, digits[0])
                case 2:
                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) >= 2 * PyLong_SHIFT) {
                            return (long) (((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) >= 3 * PyLong_SHIFT) {
                            return (long) (((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) >= 4 * PyLong_SHIFT) {
                            return (long) (((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0]));
                        }
                    }
                    break;
            }
#endif
#if CYTHON_COMPILING_IN_CPYTHON
            if (unlikely(Py_SIZE(x) < 0)) {
                goto raise_neg_overflow;
            }
#else
            {
                int result = PyObject_RichCompareBool(x, Py_False, Py_LT);
                if (unlikely(result < 0))
                    return (long) -1;
                if (unlikely(result == 1))
                    goto raise_neg_overflow;
            }
#endif
            if (sizeof(long) <= sizeof(unsigned long)) {
                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned long, PyLong_AsUnsignedLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(long) <= sizeof(unsigned PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(long, unsigned PY_LONG_LONG, PyLong_AsUnsignedLongLong(x))
#endif
            }
        } else {
#if CYTHON_USE_PYLONG_INTERNALS
            const digit* digits = ((PyLongObject*)x)->ob_digit;
            switch (Py_SIZE(x)) {
                case  0: return (long) 0;
                case -1: __PYX_VERIFY_RETURN_INT(long, sdigit, (sdigit) (-(sdigit)digits[0]))
                case  1: __PYX_VERIFY_RETURN_INT(long,  digit, +digits[0])
                case -2:
                    if (8 * sizeof(long) - 1 > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {
                            return (long) (((long)-1)*(((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
                case 2:
                    if (8 * sizeof(long) > 1 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 2 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {
                            return (long) ((((((long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
                case -3:
                    if (8 * sizeof(long) - 1 > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {
                            return (long) (((long)-1)*(((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
                case 3:
                    if (8 * sizeof(long) > 2 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 3 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {
                            return (long) ((((((((long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
                case -4:
                    if (8 * sizeof(long) - 1 > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, long, -(long) (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {
                            return (long) (((long)-1)*(((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
                case 4:
                    if (8 * sizeof(long) > 3 * PyLong_SHIFT) {
                        if (8 * sizeof(unsigned long) > 4 * PyLong_SHIFT) {
                            __PYX_VERIFY_RETURN_INT(long, unsigned long, (((((((((unsigned long)digits[3]) << PyLong_SHIFT) | (unsigned long)digits[2]) << PyLong_SHIFT) | (unsigned long)digits[1]) << PyLong_SHIFT) | (unsigned long)digits[0])))
                        } else if (8 * sizeof(long) - 1 > 4 * PyLong_SHIFT) {
                            return (long) ((((((((((long)digits[3]) << PyLong_SHIFT) | (long)digits[2]) << PyLong_SHIFT) | (long)digits[1]) << PyLong_SHIFT) | (long)digits[0])));
                        }
                    }
                    break;
            }
#endif
            if (sizeof(long) <= sizeof(long)) {
                __PYX_VERIFY_RETURN_INT_EXC(long, long, PyLong_AsLong(x))
#ifdef HAVE_LONG_LONG
            } else if (sizeof(long) <= sizeof(PY_LONG_LONG)) {
                __PYX_VERIFY_RETURN_INT_EXC(long, PY_LONG_LONG, PyLong_AsLongLong(x))
#endif
            }
        }
        {
#if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray)
            PyErr_SetString(PyExc_RuntimeError,
                            "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers");
#else
            long val;
            PyObject *v = __Pyx_PyNumber_IntOrLong(x);
 #if PY_MAJOR_VERSION < 3
            if (likely(v) && !PyLong_Check(v)) {
                PyObject *tmp = v;
                v = PyNumber_Long(tmp);
                Py_DECREF(tmp);
            }
 #endif
            if (likely(v)) {
                int one = 1; int is_little = (int)*(unsigned char *)&one;
                unsigned char *bytes = (unsigned char *)&val;
                int ret = _PyLong_AsByteArray((PyLongObject *)v,
                                              bytes, sizeof(val),
                                              is_little, !is_unsigned);
                Py_DECREF(v);
                if (likely(!ret))
                    return val;
            }
#endif
            return (long) -1;
        }
    } else {
        long val;
        PyObject *tmp = __Pyx_PyNumber_IntOrLong(x);
        if (!tmp) return (long) -1;
        val = __Pyx_PyInt_As_long(tmp);
        Py_DECREF(tmp);
        return val;
    }
raise_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "value too large to convert to long");
    return (long) -1;
raise_neg_overflow:
    PyErr_SetString(PyExc_OverflowError,
        "can't convert negative value to long");
    return (long) -1;
}

/* FetchCommonType */
          static PyTypeObject* __Pyx_FetchCommonType(PyTypeObject* type) {
    PyObject* fake_module;
    PyTypeObject* cached_type = NULL;
    fake_module = PyImport_AddModule((char*) "_cython_" CYTHON_ABI);
    if (!fake_module) return NULL;
    Py_INCREF(fake_module);
    cached_type = (PyTypeObject*) PyObject_GetAttrString(fake_module, type->tp_name);
    if (cached_type) {
        if (!PyType_Check((PyObject*)cached_type)) {
            PyErr_Format(PyExc_TypeError,
                "Shared Cython type %.200s is not a type object",
                type->tp_name);
            goto bad;
        }
        if (cached_type->tp_basicsize != type->tp_basicsize) {
            PyErr_Format(PyExc_TypeError,
                "Shared Cython type %.200s has the wrong size, try recompiling",
                type->tp_name);
            goto bad;
        }
    } else {
        if (!PyErr_ExceptionMatches(PyExc_AttributeError)) goto bad;
        PyErr_Clear();
        if (PyType_Ready(type) < 0) goto bad;
        if (PyObject_SetAttrString(fake_module, type->tp_name, (PyObject*) type) < 0)
            goto bad;
        Py_INCREF(type);
        cached_type = type;
    }
done:
    Py_DECREF(fake_module);
    return cached_type;
bad:
    Py_XDECREF(cached_type);
    cached_type = NULL;
    goto done;
}

/* SwapException */
          #if CYTHON_FAST_THREAD_STATE
static CYTHON_INLINE void __Pyx__ExceptionSwap(PyThreadState *tstate, PyObject **type, PyObject **value, PyObject **tb) {
    PyObject *tmp_type, *tmp_value, *tmp_tb;
    tmp_type = tstate->exc_type;
    tmp_value = tstate->exc_value;
    tmp_tb = tstate->exc_traceback;
    tstate->exc_type = *type;
    tstate->exc_value = *value;
    tstate->exc_traceback = *tb;
    *type = tmp_type;
    *value = tmp_value;
    *tb = tmp_tb;
}
#else
static CYTHON_INLINE void __Pyx_ExceptionSwap(PyObject **type, PyObject **value, PyObject **tb) {
    PyObject *tmp_type, *tmp_value, *tmp_tb;
    PyErr_GetExcInfo(&tmp_type, &tmp_value, &tmp_tb);
    PyErr_SetExcInfo(*type, *value, *tb);
    *type = tmp_type;
    *value = tmp_value;
    *tb = tmp_tb;
}
#endif

/* PyObjectCallMethod1 */
          static PyObject* __Pyx_PyObject_CallMethod1(PyObject* obj, PyObject* method_name, PyObject* arg) {
    PyObject *method, *result = NULL;
    method = __Pyx_PyObject_GetAttrStr(obj, method_name);
    if (unlikely(!method)) goto done;
#if CYTHON_UNPACK_METHODS
    if (likely(PyMethod_Check(method))) {
        PyObject *self = PyMethod_GET_SELF(method);
        if (likely(self)) {
            PyObject *args;
            PyObject *function = PyMethod_GET_FUNCTION(method);
            #if CYTHON_FAST_PYCALL
            if (PyFunction_Check(function)) {
                PyObject *args[2] = {self, arg};
                result = __Pyx_PyFunction_FastCall(function, args, 2);
                goto done;
            }
            #endif
            #if CYTHON_FAST_PYCCALL
            if (__Pyx_PyFastCFunction_Check(function)) {
                PyObject *args[2] = {self, arg};
                result = __Pyx_PyCFunction_FastCall(function, args, 2);
                goto done;
            }
            #endif
            args = PyTuple_New(2);
            if (unlikely(!args)) goto done;
            Py_INCREF(self);
            PyTuple_SET_ITEM(args, 0, self);
            Py_INCREF(arg);
            PyTuple_SET_ITEM(args, 1, arg);
            Py_INCREF(function);
            Py_DECREF(method); method = NULL;
            result = __Pyx_PyObject_Call(function, args, NULL);
            Py_DECREF(args);
            Py_DECREF(function);
            return result;
        }
    }
#endif
    result = __Pyx_PyObject_CallOneArg(method, arg);
done:
    Py_XDECREF(method);
    return result;
}

/* CoroutineBase */
          #include <structmember.h>
#include <frameobject.h>
static PyObject *__Pyx_Coroutine_Send(PyObject *self, PyObject *value);
static PyObject *__Pyx_Coroutine_Close(PyObject *self);
static PyObject *__Pyx_Coroutine_Throw(PyObject *gen, PyObject *args);
#define __Pyx_Coroutine_Undelegate(gen) Py_CLEAR((gen)->yieldfrom)
#if 1 || PY_VERSION_HEX < 0x030300B0
static int __Pyx_PyGen_FetchStopIterationValue(PyObject **pvalue) {
    PyObject *et, *ev, *tb;
    PyObject *value = NULL;
    __Pyx_PyThreadState_declare
    __Pyx_PyThreadState_assign
    __Pyx_ErrFetch(&et, &ev, &tb);
    if (!et) {
        Py_XDECREF(tb);
        Py_XDECREF(ev);
        Py_INCREF(Py_None);
        *pvalue = Py_None;
        return 0;
    }
    if (likely(et == PyExc_StopIteration)) {
        if (!ev) {
            Py_INCREF(Py_None);
            value = Py_None;
        }
#if PY_VERSION_HEX >= 0x030300A0
        else if (Py_TYPE(ev) == (PyTypeObject*)PyExc_StopIteration) {
            value = ((PyStopIterationObject *)ev)->value;
            Py_INCREF(value);
            Py_DECREF(ev);
        }
#endif
        else if (unlikely(PyTuple_Check(ev))) {
            if (PyTuple_GET_SIZE(ev) >= 1) {
#if CYTHON_ASSUME_SAFE_MACROS && !CYTHON_AVOID_BORROWED_REFS
                value = PyTuple_GET_ITEM(ev, 0);
                Py_INCREF(value);
#else
                value = PySequence_ITEM(ev, 0);
#endif
            } else {
                Py_INCREF(Py_None);
                value = Py_None;
            }
            Py_DECREF(ev);
        }
        else if (!PyObject_TypeCheck(ev, (PyTypeObject*)PyExc_StopIteration)) {
            value = ev;
        }
        if (likely(value)) {
            Py_XDECREF(tb);
            Py_DECREF(et);
            *pvalue = value;
            return 0;
        }
    } else if (!PyErr_GivenExceptionMatches(et, PyExc_StopIteration)) {
        __Pyx_ErrRestore(et, ev, tb);
        return -1;
    }
    PyErr_NormalizeException(&et, &ev, &tb);
    if (unlikely(!PyObject_TypeCheck(ev, (PyTypeObject*)PyExc_StopIteration))) {
        __Pyx_ErrRestore(et, ev, tb);
        return -1;
    }
    Py_XDECREF(tb);
    Py_DECREF(et);
#if PY_VERSION_HEX >= 0x030300A0
    value = ((PyStopIterationObject *)ev)->value;
    Py_INCREF(value);
    Py_DECREF(ev);
#else
    {
        PyObject* args = __Pyx_PyObject_GetAttrStr(ev, __pyx_n_s_args);
        Py_DECREF(ev);
        if (likely(args)) {
            value = PySequence_GetItem(args, 0);
            Py_DECREF(args);
        }
        if (unlikely(!value)) {
            __Pyx_ErrRestore(NULL, NULL, NULL);
            Py_INCREF(Py_None);
            value = Py_None;
        }
    }
#endif
    *pvalue = value;
    return 0;
}
#endif
static CYTHON_INLINE
void __Pyx_Coroutine_ExceptionClear(__pyx_CoroutineObject *self) {
    PyObject *exc_type = self->exc_type;
    PyObject *exc_value = self->exc_value;
    PyObject *exc_traceback = self->exc_traceback;
    self->exc_type = NULL;
    self->exc_value = NULL;
    self->exc_traceback = NULL;
    Py_XDECREF(exc_type);
    Py_XDECREF(exc_value);
    Py_XDECREF(exc_traceback);
}
static CYTHON_INLINE
int __Pyx_Coroutine_CheckRunning(__pyx_CoroutineObject *gen) {
    if (unlikely(gen->is_running)) {
        PyErr_SetString(PyExc_ValueError,
                        "generator already executing");
        return 1;
    }
    return 0;
}
static CYTHON_INLINE
PyObject *__Pyx_Coroutine_SendEx(__pyx_CoroutineObject *self, PyObject *value) {
    PyObject *retval;
    __Pyx_PyThreadState_declare
    assert(!self->is_running);
    if (unlikely(self->resume_label == 0)) {
        if (unlikely(value && value != Py_None)) {
            PyErr_SetString(PyExc_TypeError,
                            "can't send non-None value to a "
                            "just-started generator");
            return NULL;
        }
    }
    if (unlikely(self->resume_label == -1)) {
        PyErr_SetNone(PyExc_StopIteration);
        return NULL;
    }
    __Pyx_PyThreadState_assign
    if (value) {
#if CYTHON_COMPILING_IN_PYPY || CYTHON_COMPILING_IN_PYSTON
#else
        if (self->exc_traceback) {
            PyTracebackObject *tb = (PyTracebackObject *) self->exc_traceback;
            PyFrameObject *f = tb->tb_frame;
            Py_XINCREF(__pyx_tstate->frame);
            assert(f->f_back == NULL);
            f->f_back = __pyx_tstate->frame;
        }
#endif
        __Pyx_ExceptionSwap(&self->exc_type, &self->exc_value,
                            &self->exc_traceback);
    } else {
        __Pyx_Coroutine_ExceptionClear(self);
    }
    self->is_running = 1;
    retval = self->body((PyObject *) self, value);
    self->is_running = 0;
    if (retval) {
        __Pyx_ExceptionSwap(&self->exc_type, &self->exc_value,
                            &self->exc_traceback);
#if CYTHON_COMPILING_IN_PYPY || CYTHON_COMPILING_IN_PYSTON
#else
        if (self->exc_traceback) {
            PyTracebackObject *tb = (PyTracebackObject *) self->exc_traceback;
            PyFrameObject *f = tb->tb_frame;
            Py_CLEAR(f->f_back);
        }
#endif
    } else {
        __Pyx_Coroutine_ExceptionClear(self);
    }
    return retval;
}
static CYTHON_INLINE
PyObject *__Pyx_Coroutine_MethodReturn(PyObject *retval) {
    if (unlikely(!retval && !PyErr_Occurred())) {
        PyErr_SetNone(PyExc_StopIteration);
    }
    return retval;
}
static CYTHON_INLINE
PyObject *__Pyx_Coroutine_FinishDelegation(__pyx_CoroutineObject *gen) {
    PyObject *ret;
    PyObject *val = NULL;
    __Pyx_Coroutine_Undelegate(gen);
    __Pyx_PyGen_FetchStopIterationValue(&val);
    ret = __Pyx_Coroutine_SendEx(gen, val);
    Py_XDECREF(val);
    return ret;
}
static PyObject *__Pyx_Coroutine_Send(PyObject *self, PyObject *value) {
    PyObject *retval;
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject*) self;
    PyObject *yf = gen->yieldfrom;
    if (unlikely(__Pyx_Coroutine_CheckRunning(gen)))
        return NULL;
    if (yf) {
        PyObject *ret;
        gen->is_running = 1;
        #ifdef __Pyx_Generator_USED
        if (__Pyx_Generator_CheckExact(yf)) {
            ret = __Pyx_Coroutine_Send(yf, value);
        } else
        #endif
        #ifdef __Pyx_Coroutine_USED
        if (__Pyx_Coroutine_CheckExact(yf)) {
            ret = __Pyx_Coroutine_Send(yf, value);
        } else
        #endif
        {
            if (value == Py_None)
                ret = Py_TYPE(yf)->tp_iternext(yf);
            else
                ret = __Pyx_PyObject_CallMethod1(yf, __pyx_n_s_send, value);
        }
        gen->is_running = 0;
        if (likely(ret)) {
            return ret;
        }
        retval = __Pyx_Coroutine_FinishDelegation(gen);
    } else {
        retval = __Pyx_Coroutine_SendEx(gen, value);
    }
    return __Pyx_Coroutine_MethodReturn(retval);
}
static int __Pyx_Coroutine_CloseIter(__pyx_CoroutineObject *gen, PyObject *yf) {
    PyObject *retval = NULL;
    int err = 0;
    #ifdef __Pyx_Generator_USED
    if (__Pyx_Generator_CheckExact(yf)) {
        retval = __Pyx_Coroutine_Close(yf);
        if (!retval)
            return -1;
    } else
    #endif
    #ifdef __Pyx_Coroutine_USED
    if (__Pyx_Coroutine_CheckExact(yf)) {
        retval = __Pyx_Coroutine_Close(yf);
        if (!retval)
            return -1;
    } else
    #endif
    {
        PyObject *meth;
        gen->is_running = 1;
        meth = __Pyx_PyObject_GetAttrStr(yf, __pyx_n_s_close);
        if (unlikely(!meth)) {
            if (!PyErr_ExceptionMatches(PyExc_AttributeError)) {
                PyErr_WriteUnraisable(yf);
            }
            PyErr_Clear();
        } else {
            retval = PyObject_CallFunction(meth, NULL);
            Py_DECREF(meth);
            if (!retval)
                err = -1;
        }
        gen->is_running = 0;
    }
    Py_XDECREF(retval);
    return err;
}
static PyObject *__Pyx_Generator_Next(PyObject *self) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject*) self;
    PyObject *yf = gen->yieldfrom;
    if (unlikely(__Pyx_Coroutine_CheckRunning(gen)))
        return NULL;
    if (yf) {
        PyObject *ret;
        gen->is_running = 1;
        #ifdef __Pyx_Generator_USED
        if (__Pyx_Generator_CheckExact(yf)) {
            ret = __Pyx_Generator_Next(yf);
        } else
        #endif
            ret = Py_TYPE(yf)->tp_iternext(yf);
        gen->is_running = 0;
        if (likely(ret)) {
            return ret;
        }
        return __Pyx_Coroutine_FinishDelegation(gen);
    }
    return __Pyx_Coroutine_SendEx(gen, Py_None);
}
static PyObject *__Pyx_Coroutine_Close(PyObject *self) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    PyObject *retval, *raised_exception;
    PyObject *yf = gen->yieldfrom;
    int err = 0;
    if (unlikely(__Pyx_Coroutine_CheckRunning(gen)))
        return NULL;
    if (yf) {
        Py_INCREF(yf);
        err = __Pyx_Coroutine_CloseIter(gen, yf);
        __Pyx_Coroutine_Undelegate(gen);
        Py_DECREF(yf);
    }
    if (err == 0)
        PyErr_SetNone(PyExc_GeneratorExit);
    retval = __Pyx_Coroutine_SendEx(gen, NULL);
    if (retval) {
        Py_DECREF(retval);
        PyErr_SetString(PyExc_RuntimeError,
                        "generator ignored GeneratorExit");
        return NULL;
    }
    raised_exception = PyErr_Occurred();
    if (!raised_exception
        || raised_exception == PyExc_StopIteration
        || raised_exception == PyExc_GeneratorExit
        || PyErr_GivenExceptionMatches(raised_exception, PyExc_GeneratorExit)
        || PyErr_GivenExceptionMatches(raised_exception, PyExc_StopIteration))
    {
        if (raised_exception) PyErr_Clear();
        Py_INCREF(Py_None);
        return Py_None;
    }
    return NULL;
}
static PyObject *__Pyx_Coroutine_Throw(PyObject *self, PyObject *args) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    PyObject *typ;
    PyObject *tb = NULL;
    PyObject *val = NULL;
    PyObject *yf = gen->yieldfrom;
    if (!PyArg_UnpackTuple(args, (char *)"throw", 1, 3, &typ, &val, &tb))
        return NULL;
    if (unlikely(__Pyx_Coroutine_CheckRunning(gen)))
        return NULL;
    if (yf) {
        PyObject *ret;
        Py_INCREF(yf);
        if (PyErr_GivenExceptionMatches(typ, PyExc_GeneratorExit)) {
            int err = __Pyx_Coroutine_CloseIter(gen, yf);
            Py_DECREF(yf);
            __Pyx_Coroutine_Undelegate(gen);
            if (err < 0)
                return __Pyx_Coroutine_MethodReturn(__Pyx_Coroutine_SendEx(gen, NULL));
            goto throw_here;
        }
        gen->is_running = 1;
        #ifdef __Pyx_Generator_USED
        if (__Pyx_Generator_CheckExact(yf)) {
            ret = __Pyx_Coroutine_Throw(yf, args);
        } else
        #endif
        #ifdef __Pyx_Coroutine_USED
        if (__Pyx_Coroutine_CheckExact(yf)) {
            ret = __Pyx_Coroutine_Throw(yf, args);
        } else
        #endif
        {
            PyObject *meth = __Pyx_PyObject_GetAttrStr(yf, __pyx_n_s_throw);
            if (unlikely(!meth)) {
                Py_DECREF(yf);
                if (!PyErr_ExceptionMatches(PyExc_AttributeError)) {
                    gen->is_running = 0;
                    return NULL;
                }
                PyErr_Clear();
                __Pyx_Coroutine_Undelegate(gen);
                gen->is_running = 0;
                goto throw_here;
            }
            ret = PyObject_CallObject(meth, args);
            Py_DECREF(meth);
        }
        gen->is_running = 0;
        Py_DECREF(yf);
        if (!ret) {
            ret = __Pyx_Coroutine_FinishDelegation(gen);
        }
        return __Pyx_Coroutine_MethodReturn(ret);
    }
throw_here:
    __Pyx_Raise(typ, val, tb, NULL);
    return __Pyx_Coroutine_MethodReturn(__Pyx_Coroutine_SendEx(gen, NULL));
}
static int __Pyx_Coroutine_traverse(PyObject *self, visitproc visit, void *arg) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    Py_VISIT(gen->closure);
    Py_VISIT(gen->classobj);
    Py_VISIT(gen->yieldfrom);
    Py_VISIT(gen->exc_type);
    Py_VISIT(gen->exc_value);
    Py_VISIT(gen->exc_traceback);
    return 0;
}
static int __Pyx_Coroutine_clear(PyObject *self) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    Py_CLEAR(gen->closure);
    Py_CLEAR(gen->classobj);
    Py_CLEAR(gen->yieldfrom);
    Py_CLEAR(gen->exc_type);
    Py_CLEAR(gen->exc_value);
    Py_CLEAR(gen->exc_traceback);
    Py_CLEAR(gen->gi_name);
    Py_CLEAR(gen->gi_qualname);
    return 0;
}
static void __Pyx_Coroutine_dealloc(PyObject *self) {
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    PyObject_GC_UnTrack(gen);
    if (gen->gi_weakreflist != NULL)
        PyObject_ClearWeakRefs(self);
    if (gen->resume_label > 0) {
        PyObject_GC_Track(self);
#if PY_VERSION_HEX >= 0x030400a1
        if (PyObject_CallFinalizerFromDealloc(self))
#else
        Py_TYPE(gen)->tp_del(self);
        if (self->ob_refcnt > 0)
#endif
        {
            return;
        }
        PyObject_GC_UnTrack(self);
    }
    __Pyx_Coroutine_clear(self);
    PyObject_GC_Del(gen);
}
static void __Pyx_Coroutine_del(PyObject *self) {
    PyObject *res;
    PyObject *error_type, *error_value, *error_traceback;
    __pyx_CoroutineObject *gen = (__pyx_CoroutineObject *) self;
    __Pyx_PyThreadState_declare
    if (gen->resume_label <= 0)
        return ;
#if PY_VERSION_HEX < 0x030400a1
    assert(self->ob_refcnt == 0);
    self->ob_refcnt = 1;
#endif
    __Pyx_PyThreadState_assign
    __Pyx_ErrFetch(&error_type, &error_value, &error_traceback);
    res = __Pyx_Coroutine_Close(self);
    if (res == NULL)
        PyErr_WriteUnraisable(self);
    else
        Py_DECREF(res);
    __Pyx_ErrRestore(error_type, error_value, error_traceback);
#if PY_VERSION_HEX < 0x030400a1
    assert(self->ob_refcnt > 0);
    if (--self->ob_refcnt == 0) {
        return;
    }
    {
        Py_ssize_t refcnt = self->ob_refcnt;
        _Py_NewReference(self);
        self->ob_refcnt = refcnt;
    }
#if CYTHON_COMPILING_IN_CPYTHON
    assert(PyType_IS_GC(self->ob_type) &&
           _Py_AS_GC(self)->gc.gc_refs != _PyGC_REFS_UNTRACKED);
    _Py_DEC_REFTOTAL;
#endif
#ifdef COUNT_ALLOCS
    --Py_TYPE(self)->tp_frees;
    --Py_TYPE(self)->tp_allocs;
#endif
#endif
}
static PyObject *
__Pyx_Coroutine_get_name(__pyx_CoroutineObject *self)
{
    PyObject *name = self->gi_name;
    if (unlikely(!name)) name = Py_None;
    Py_INCREF(name);
    return name;
}
static int
__Pyx_Coroutine_set_name(__pyx_CoroutineObject *self, PyObject *value)
{
    PyObject *tmp;
#if PY_MAJOR_VERSION >= 3
    if (unlikely(value == NULL || !PyUnicode_Check(value))) {
#else
    if (unlikely(value == NULL || !PyString_Check(value))) {
#endif
        PyErr_SetString(PyExc_TypeError,
                        "__name__ must be set to a string object");
        return -1;
    }
    tmp = self->gi_name;
    Py_INCREF(value);
    self->gi_name = value;
    Py_XDECREF(tmp);
    return 0;
}
static PyObject *
__Pyx_Coroutine_get_qualname(__pyx_CoroutineObject *self)
{
    PyObject *name = self->gi_qualname;
    if (unlikely(!name)) name = Py_None;
    Py_INCREF(name);
    return name;
}
static int
__Pyx_Coroutine_set_qualname(__pyx_CoroutineObject *self, PyObject *value)
{
    PyObject *tmp;
#if PY_MAJOR_VERSION >= 3
    if (unlikely(value == NULL || !PyUnicode_Check(value))) {
#else
    if (unlikely(value == NULL || !PyString_Check(value))) {
#endif
        PyErr_SetString(PyExc_TypeError,
                        "__qualname__ must be set to a string object");
        return -1;
    }
    tmp = self->gi_qualname;
    Py_INCREF(value);
    self->gi_qualname = value;
    Py_XDECREF(tmp);
    return 0;
}
static __pyx_CoroutineObject *__Pyx__Coroutine_New(
            PyTypeObject* type, __pyx_coroutine_body_t body, PyObject *closure,
            PyObject *name, PyObject *qualname, PyObject *module_name) {
    __pyx_CoroutineObject *gen = PyObject_GC_New(__pyx_CoroutineObject, type);
    if (gen == NULL)
        return NULL;
    gen->body = body;
    gen->closure = closure;
    Py_XINCREF(closure);
    gen->is_running = 0;
    gen->resume_label = 0;
    gen->classobj = NULL;
    gen->yieldfrom = NULL;
    gen->exc_type = NULL;
    gen->exc_value = NULL;
    gen->exc_traceback = NULL;
    gen->gi_weakreflist = NULL;
    Py_XINCREF(qualname);
    gen->gi_qualname = qualname;
    Py_XINCREF(name);
    gen->gi_name = name;
    Py_XINCREF(module_name);
    gen->gi_modulename = module_name;
    PyObject_GC_Track(gen);
    return gen;
}

/* PatchModuleWithCoroutine */
              static PyObject* __Pyx_Coroutine_patch_module(PyObject* module, const char* py_code) {
#if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)
    int result;
    PyObject *globals, *result_obj;
    globals = PyDict_New();  if (unlikely(!globals)) goto ignore;
    result = PyDict_SetItemString(globals, "_cython_coroutine_type",
    #ifdef __Pyx_Coroutine_USED
        (PyObject*)__pyx_CoroutineType);
    #else
        Py_None);
    #endif
    if (unlikely(result < 0)) goto ignore;
    result = PyDict_SetItemString(globals, "_cython_generator_type",
    #ifdef __Pyx_Generator_USED
        (PyObject*)__pyx_GeneratorType);
    #else
        Py_None);
    #endif
    if (unlikely(result < 0)) goto ignore;
    if (unlikely(PyDict_SetItemString(globals, "_module", module) < 0)) goto ignore;
    if (unlikely(PyDict_SetItemString(globals, "__builtins__", __pyx_b) < 0)) goto ignore;
    result_obj = PyRun_String(py_code, Py_file_input, globals, globals);
    if (unlikely(!result_obj)) goto ignore;
    Py_DECREF(result_obj);
    Py_DECREF(globals);
    return module;
ignore:
    Py_XDECREF(globals);
    PyErr_WriteUnraisable(module);
    if (unlikely(PyErr_WarnEx(PyExc_RuntimeWarning, "Cython module failed to patch module with custom type", 1) < 0)) {
        Py_DECREF(module);
        module = NULL;
    }
#else
    py_code++;
#endif
    return module;
}

/* PatchGeneratorABC */
              #if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)
static PyObject* __Pyx_patch_abc_module(PyObject *module);
static PyObject* __Pyx_patch_abc_module(PyObject *module) {
    module = __Pyx_Coroutine_patch_module(
        module, ""
"if _cython_generator_type is not None:\n"
"    try: Generator = _module.Generator\n"
"    except AttributeError: pass\n"
"    else: Generator.register(_cython_generator_type)\n"
"if _cython_coroutine_type is not None:\n"
"    try: Coroutine = _module.Coroutine\n"
"    except AttributeError: pass\n"
"    else: Coroutine.register(_cython_coroutine_type)\n"
    );
    return module;
}
#endif
static int __Pyx_patch_abc(void) {
#if defined(__Pyx_Generator_USED) || defined(__Pyx_Coroutine_USED)
    static int abc_patched = 0;
    if (!abc_patched) {
        PyObject *module;
        module = PyImport_ImportModule((PY_VERSION_HEX >= 0x03030000) ? "collections.abc" : "collections");
        if (!module) {
            PyErr_WriteUnraisable(NULL);
            if (unlikely(PyErr_WarnEx(PyExc_RuntimeWarning,
                    ((PY_VERSION_HEX >= 0x03030000) ?
                        "Cython module failed to register with collections.abc module" :
                        "Cython module failed to register with collections module"), 1) < 0)) {
                return -1;
            }
        } else {
            module = __Pyx_patch_abc_module(module);
            abc_patched = 1;
            if (unlikely(!module))
                return -1;
            Py_DECREF(module);
        }
        module = PyImport_ImportModule("backports_abc");
        if (module) {
            module = __Pyx_patch_abc_module(module);
            Py_XDECREF(module);
        }
        if (!module) {
            PyErr_Clear();
        }
    }
#else
    if (0) __Pyx_Coroutine_patch_module(NULL, NULL);
#endif
    return 0;
}

/* Generator */
              static PyMethodDef __pyx_Generator_methods[] = {
    {"send", (PyCFunction) __Pyx_Coroutine_Send, METH_O,
     (char*) PyDoc_STR("send(arg) -> send 'arg' into generator,\nreturn next yielded value or raise StopIteration.")},
    {"throw", (PyCFunction) __Pyx_Coroutine_Throw, METH_VARARGS,
     (char*) PyDoc_STR("throw(typ[,val[,tb]]) -> raise exception in generator,\nreturn next yielded value or raise StopIteration.")},
    {"close", (PyCFunction) __Pyx_Coroutine_Close, METH_NOARGS,
     (char*) PyDoc_STR("close() -> raise GeneratorExit inside generator.")},
    {0, 0, 0, 0}
};
static PyMemberDef __pyx_Generator_memberlist[] = {
    {(char *) "gi_running", T_BOOL, offsetof(__pyx_CoroutineObject, is_running), READONLY, NULL},
    {(char*) "gi_yieldfrom", T_OBJECT, offsetof(__pyx_CoroutineObject, yieldfrom), READONLY,
     (char*) PyDoc_STR("object being iterated by 'yield from', or None")},
    {0, 0, 0, 0, 0}
};
static PyGetSetDef __pyx_Generator_getsets[] = {
    {(char *) "__name__", (getter)__Pyx_Coroutine_get_name, (setter)__Pyx_Coroutine_set_name,
     (char*) PyDoc_STR("name of the generator"), 0},
    {(char *) "__qualname__", (getter)__Pyx_Coroutine_get_qualname, (setter)__Pyx_Coroutine_set_qualname,
     (char*) PyDoc_STR("qualified name of the generator"), 0},
    {0, 0, 0, 0, 0}
};
static PyTypeObject __pyx_GeneratorType_type = {
    PyVarObject_HEAD_INIT(0, 0)
    "generator",
    sizeof(__pyx_CoroutineObject),
    0,
    (destructor) __Pyx_Coroutine_dealloc,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC | Py_TPFLAGS_HAVE_FINALIZE,
    0,
    (traverseproc) __Pyx_Coroutine_traverse,
    0,
    0,
    offsetof(__pyx_CoroutineObject, gi_weakreflist),
    0,
    (iternextfunc) __Pyx_Generator_Next,
    __pyx_Generator_methods,
    __pyx_Generator_memberlist,
    __pyx_Generator_getsets,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
#if PY_VERSION_HEX >= 0x030400a1
    0,
#else
    __Pyx_Coroutine_del,
#endif
    0,
#if PY_VERSION_HEX >= 0x030400a1
    __Pyx_Coroutine_del,
#endif
};
static int __pyx_Generator_init(void) {
    __pyx_GeneratorType_type.tp_getattro = PyObject_GenericGetAttr;
    __pyx_GeneratorType_type.tp_iter = PyObject_SelfIter;
    __pyx_GeneratorType = __Pyx_FetchCommonType(&__pyx_GeneratorType_type);
    if (unlikely(!__pyx_GeneratorType)) {
        return -1;
    }
    return 0;
}

/* CheckBinaryVersion */
              static int __Pyx_check_binary_version(void) {
    char ctversion[4], rtversion[4];
    PyOS_snprintf(ctversion, 4, "%d.%d", PY_MAJOR_VERSION, PY_MINOR_VERSION);
    PyOS_snprintf(rtversion, 4, "%s", Py_GetVersion());
    if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) {
        char message[200];
        PyOS_snprintf(message, sizeof(message),
                      "compiletime version %s of module '%.100s' "
                      "does not match runtime version %s",
                      ctversion, __Pyx_MODULE_NAME, rtversion);
        return PyErr_WarnEx(NULL, message, 1);
    }
    return 0;
}

/* InitStrings */
              static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) {
    while (t->p) {
        #if PY_MAJOR_VERSION < 3
        if (t->is_unicode) {
            *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL);
        } else if (t->intern) {
            *t->p = PyString_InternFromString(t->s);
        } else {
            *t->p = PyString_FromStringAndSize(t->s, t->n - 1);
        }
        #else
        if (t->is_unicode | t->is_str) {
            if (t->intern) {
                *t->p = PyUnicode_InternFromString(t->s);
            } else if (t->encoding) {
                *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL);
            } else {
                *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1);
            }
        } else {
            *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1);
        }
        #endif
        if (!*t->p)
            return -1;
        ++t;
    }
    return 0;
}

static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char* c_str) {
    return __Pyx_PyUnicode_FromStringAndSize(c_str, (Py_ssize_t)strlen(c_str));
}
static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject* o) {
    Py_ssize_t ignore;
    return __Pyx_PyObject_AsStringAndSize(o, &ignore);
}
static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) {
#if CYTHON_COMPILING_IN_CPYTHON && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT)
    if (
#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII
            __Pyx_sys_getdefaultencoding_not_ascii &&
#endif
            PyUnicode_Check(o)) {
#if PY_VERSION_HEX < 0x03030000
        char* defenc_c;
        PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL);
        if (!defenc) return NULL;
        defenc_c = PyBytes_AS_STRING(defenc);
#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII
        {
            char* end = defenc_c + PyBytes_GET_SIZE(defenc);
            char* c;
            for (c = defenc_c; c < end; c++) {
                if ((unsigned char) (*c) >= 128) {
                    PyUnicode_AsASCIIString(o);
                    return NULL;
                }
            }
        }
#endif
        *length = PyBytes_GET_SIZE(defenc);
        return defenc_c;
#else
        if (__Pyx_PyUnicode_READY(o) == -1) return NULL;
#if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII
        if (PyUnicode_IS_ASCII(o)) {
            *length = PyUnicode_GET_LENGTH(o);
            return PyUnicode_AsUTF8(o);
        } else {
            PyUnicode_AsASCIIString(o);
            return NULL;
        }
#else
        return PyUnicode_AsUTF8AndSize(o, length);
#endif
#endif
    } else
#endif
#if (!CYTHON_COMPILING_IN_PYPY) || (defined(PyByteArray_AS_STRING) && defined(PyByteArray_GET_SIZE))
    if (PyByteArray_Check(o)) {
        *length = PyByteArray_GET_SIZE(o);
        return PyByteArray_AS_STRING(o);
    } else
#endif
    {
        char* result;
        int r = PyBytes_AsStringAndSize(o, &result, length);
        if (unlikely(r < 0)) {
            return NULL;
        } else {
            return result;
        }
    }
}
static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) {
   int is_true = x == Py_True;
   if (is_true | (x == Py_False) | (x == Py_None)) return is_true;
   else return PyObject_IsTrue(x);
}
static CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x) {
#if CYTHON_USE_TYPE_SLOTS
  PyNumberMethods *m;
#endif
  const char *name = NULL;
  PyObject *res = NULL;
#if PY_MAJOR_VERSION < 3
  if (PyInt_Check(x) || PyLong_Check(x))
#else
  if (PyLong_Check(x))
#endif
    return __Pyx_NewRef(x);
#if CYTHON_USE_TYPE_SLOTS
  m = Py_TYPE(x)->tp_as_number;
  #if PY_MAJOR_VERSION < 3
  if (m && m->nb_int) {
    name = "int";
    res = PyNumber_Int(x);
  }
  else if (m && m->nb_long) {
    name = "long";
    res = PyNumber_Long(x);
  }
  #else
  if (m && m->nb_int) {
    name = "int";
    res = PyNumber_Long(x);
  }
  #endif
#else
  res = PyNumber_Int(x);
#endif
  if (res) {
#if PY_MAJOR_VERSION < 3
    if (!PyInt_Check(res) && !PyLong_Check(res)) {
#else
    if (!PyLong_Check(res)) {
#endif
      PyErr_Format(PyExc_TypeError,
                   "__%.4s__ returned non-%.4s (type %.200s)",
                   name, name, Py_TYPE(res)->tp_name);
      Py_DECREF(res);
      return NULL;
    }
  }
  else if (!PyErr_Occurred()) {
    PyErr_SetString(PyExc_TypeError,
                    "an integer is required");
  }
  return res;
}
static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) {
  Py_ssize_t ival;
  PyObject *x;
#if PY_MAJOR_VERSION < 3
  if (likely(PyInt_CheckExact(b))) {
    if (sizeof(Py_ssize_t) >= sizeof(long))
        return PyInt_AS_LONG(b);
    else
        return PyInt_AsSsize_t(x);
  }
#endif
  if (likely(PyLong_CheckExact(b))) {
    #if CYTHON_USE_PYLONG_INTERNALS
    const digit* digits = ((PyLongObject*)b)->ob_digit;
    const Py_ssize_t size = Py_SIZE(b);
    if (likely(__Pyx_sst_abs(size) <= 1)) {
        ival = likely(size) ? digits[0] : 0;
        if (size == -1) ival = -ival;
        return ival;
    } else {
      switch (size) {
         case 2:
           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {
             return (Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
         case -2:
           if (8 * sizeof(Py_ssize_t) > 2 * PyLong_SHIFT) {
             return -(Py_ssize_t) (((((size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
         case 3:
           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {
             return (Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
         case -3:
           if (8 * sizeof(Py_ssize_t) > 3 * PyLong_SHIFT) {
             return -(Py_ssize_t) (((((((size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
         case 4:
           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {
             return (Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
         case -4:
           if (8 * sizeof(Py_ssize_t) > 4 * PyLong_SHIFT) {
             return -(Py_ssize_t) (((((((((size_t)digits[3]) << PyLong_SHIFT) | (size_t)digits[2]) << PyLong_SHIFT) | (size_t)digits[1]) << PyLong_SHIFT) | (size_t)digits[0]));
           }
           break;
      }
    }
    #endif
    return PyLong_AsSsize_t(b);
  }
  x = PyNumber_Index(b);
  if (!x) return -1;
  ival = PyInt_AsSsize_t(x);
  Py_DECREF(x);
  return ival;
}
static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) {
    return PyInt_FromSize_t(ival);
}


#endif /* Py_PYTHON_H */
