AppPkg/Applications/Python/Python-2.7.10: Initial Checkin part 1/5.

[mirror_edk2.git] / AppPkg / Applications / Python / Python-2.7.10 / Include / setobject.h

/* Set object interface */\r
\r
#ifndef Py_SETOBJECT_H\r
#define Py_SETOBJECT_H\r
#ifdef __cplusplus\r
extern "C" {\r
#endif\r
\r
\r
/*\r
There are three kinds of slots in the table:\r
\r
1. Unused:  key == NULL\r
2. Active:  key != NULL and key != dummy\r
3. Dummy:   key == dummy\r
\r
Note: .pop() abuses the hash field of an Unused or Dummy slot to\r
hold a search finger.  The hash field of Unused or Dummy slots has\r
no meaning otherwise.\r
*/\r
\r
#define PySet_MINSIZE 8\r
\r
typedef struct {\r
    long hash;      /* cached hash code for the entry key */\r
    PyObject *key;\r
} setentry;\r
\r
\r
/*\r
This data structure is shared by set and frozenset objects.\r
*/\r
\r
typedef struct _setobject PySetObject;\r
struct _setobject {\r
    PyObject_HEAD\r
\r
    Py_ssize_t fill;  /* # Active + # Dummy */\r
    Py_ssize_t used;  /* # Active */\r
\r
    /* The table contains mask + 1 slots, and that's a power of 2.\r
     * We store the mask instead of the size because the mask is more\r
     * frequently needed.\r
     */\r
    Py_ssize_t mask;\r
\r
    /* table points to smalltable for small tables, else to\r
     * additional malloc'ed memory.  table is never NULL!  This rule\r
     * saves repeated runtime null-tests.\r
     */\r
    setentry *table;\r
    setentry *(*lookup)(PySetObject *so, PyObject *key, long hash);\r
    setentry smalltable[PySet_MINSIZE];\r
\r
    long hash;                  /* only used by frozenset objects */\r
    PyObject *weakreflist;      /* List of weak references */\r
};\r
\r
PyAPI_DATA(PyTypeObject) PySet_Type;\r
PyAPI_DATA(PyTypeObject) PyFrozenSet_Type;\r
\r
/* Invariants for frozensets:\r
 *     data is immutable.\r
 *     hash is the hash of the frozenset or -1 if not computed yet.\r
 * Invariants for sets:\r
 *     hash is -1\r
 */\r
\r
#define PyFrozenSet_CheckExact(ob) (Py_TYPE(ob) == &PyFrozenSet_Type)\r
#define PyAnySet_CheckExact(ob) \\r
    (Py_TYPE(ob) == &PySet_Type || Py_TYPE(ob) == &PyFrozenSet_Type)\r
#define PyAnySet_Check(ob) \\r
    (Py_TYPE(ob) == &PySet_Type || Py_TYPE(ob) == &PyFrozenSet_Type || \\r
      PyType_IsSubtype(Py_TYPE(ob), &PySet_Type) || \\r
      PyType_IsSubtype(Py_TYPE(ob), &PyFrozenSet_Type))\r
#define PySet_Check(ob) \\r
    (Py_TYPE(ob) == &PySet_Type || \\r
    PyType_IsSubtype(Py_TYPE(ob), &PySet_Type))\r
#define   PyFrozenSet_Check(ob) \\r
    (Py_TYPE(ob) == &PyFrozenSet_Type || \\r
      PyType_IsSubtype(Py_TYPE(ob), &PyFrozenSet_Type))\r
\r
PyAPI_FUNC(PyObject *) PySet_New(PyObject *);\r
PyAPI_FUNC(PyObject *) PyFrozenSet_New(PyObject *);\r
PyAPI_FUNC(Py_ssize_t) PySet_Size(PyObject *anyset);\r
#define PySet_GET_SIZE(so) (((PySetObject *)(so))->used)\r
PyAPI_FUNC(int) PySet_Clear(PyObject *set);\r
PyAPI_FUNC(int) PySet_Contains(PyObject *anyset, PyObject *key);\r
PyAPI_FUNC(int) PySet_Discard(PyObject *set, PyObject *key);\r
PyAPI_FUNC(int) PySet_Add(PyObject *set, PyObject *key);\r
PyAPI_FUNC(int) _PySet_Next(PyObject *set, Py_ssize_t *pos, PyObject **key);\r
PyAPI_FUNC(int) _PySet_NextEntry(PyObject *set, Py_ssize_t *pos, PyObject **key, long *hash);\r
PyAPI_FUNC(PyObject *) PySet_Pop(PyObject *set);\r
PyAPI_FUNC(int) _PySet_Update(PyObject *set, PyObject *iterable);\r
\r
#ifdef __cplusplus\r
}\r
#endif\r
#endif /* !Py_SETOBJECT_H */\r