File Manager

X7ROOT File Manager

Current Path: /opt/alt/python37/include/python3.7m

opt / alt / python37 / include / python3.7m /

ðŸ“ ..
ðŸ“„ Python-ast.h(21.29 KB)
ðŸ“„ Python.h(3.47 KB)
ðŸ“„ abstract.h(39.84 KB)
ðŸ“„ accu.h(1016 B)
ðŸ“„ asdl.h(1.18 KB)
ðŸ“„ ast.h(641 B)
ðŸ“„ bitset.h(810 B)
ðŸ“„ bltinmodule.h(264 B)
ðŸ“„ boolobject.h(886 B)
ðŸ“„ bytearrayobject.h(2.06 KB)
ðŸ“„ bytes_methods.h(3.22 KB)
ðŸ“„ bytesobject.h(8.29 KB)
ðŸ“„ cellobject.h(713 B)
ðŸ“„ ceval.h(8.51 KB)
ðŸ“„ classobject.h(1.64 KB)
ðŸ“„ code.h(5.92 KB)
ðŸ“„ codecs.h(6.63 KB)
ðŸ“„ compile.h(2.88 KB)
ðŸ“„ complexobject.h(1.76 KB)
ðŸ“„ context.h(1.97 KB)
ðŸ“„ datetime.h(9.62 KB)
ðŸ“„ descrobject.h(3.06 KB)
ðŸ“„ dictobject.h(7.15 KB)
ðŸ“„ dtoa.h(458 B)
ðŸ“„ dynamic_annotations.h(21.94 KB)
ðŸ“„ enumobject.h(253 B)
ðŸ“„ errcode.h(1.66 KB)
ðŸ“„ eval.h(1.18 KB)
ðŸ“„ fileobject.h(1.77 KB)
ðŸ“„ fileutils.h(4.43 KB)
ðŸ“„ floatobject.h(4.68 KB)
ðŸ“„ frameobject.h(3.24 KB)
ðŸ“„ funcobject.h(4.08 KB)
ðŸ“„ genobject.h(3.56 KB)
ðŸ“„ graminit.h(1.95 KB)
ðŸ“„ grammar.h(2.26 KB)
ðŸ“„ import.h(4.86 KB)
ðŸ“ internal
ðŸ“„ intrcheck.h(861 B)
ðŸ“„ iterobject.h(567 B)
ðŸ“„ listobject.h(2.86 KB)
ðŸ“„ longintrepr.h(3.71 KB)
ðŸ“„ longobject.h(8.39 KB)
ðŸ“„ marshal.h(803 B)
ðŸ“„ memoryobject.h(2.7 KB)
ðŸ“„ metagrammar.h(253 B)
ðŸ“„ methodobject.h(4.41 KB)
ðŸ“„ modsupport.h(8.36 KB)
ðŸ“„ moduleobject.h(2.25 KB)
ðŸ“„ namespaceobject.h(349 B)
ðŸ“„ node.h(1.09 KB)
ðŸ“„ object.h(40.86 KB)
ðŸ“„ objimpl.h(14.13 KB)
ðŸ“„ odictobject.h(1.25 KB)
ðŸ“„ opcode.h(4.99 KB)
ðŸ“„ osdefs.h(691 B)
ðŸ“„ osmodule.h(291 B)
ðŸ“„ parsetok.h(2.84 KB)
ðŸ“„ patchlevel.h(1.27 KB)
ðŸ“„ pgen.h(253 B)
ðŸ“„ pgenheaders.h(1.19 KB)
ðŸ“„ py_curses.h(3.97 KB)
ðŸ“„ pyarena.h(2.68 KB)
ðŸ“„ pyatomic.h(15.74 KB)
ðŸ“„ pycapsule.h(1.69 KB)
ðŸ“„ pyconfig-64.h(44.25 KB)
ðŸ“„ pyconfig.h(162 B)
ðŸ“„ pyctype.h(1.29 KB)
ðŸ“„ pydebug.h(1.19 KB)
ðŸ“„ pydtrace.h(2.23 KB)
ðŸ“„ pyerrors.h(16.96 KB)
ðŸ“„ pyexpat.h(2.39 KB)
ðŸ“„ pyfpe.h(341 B)
ðŸ“„ pyhash.h(4.04 KB)
ðŸ“„ pylifecycle.h(7.6 KB)
ðŸ“„ pymacconfig.h(2.92 KB)
ðŸ“„ pymacro.h(3.45 KB)
ðŸ“„ pymath.h(8.12 KB)
ðŸ“„ pymem.h(8.78 KB)
ðŸ“„ pyport.h(27.57 KB)
ðŸ“„ pystate.h(15.94 KB)
ðŸ“„ pystrcmp.h(436 B)
ðŸ“„ pystrhex.h(495 B)
ðŸ“„ pystrtod.h(1.45 KB)
ðŸ“„ pythonrun.h(6.06 KB)
ðŸ“„ pythread.h(5.21 KB)
ðŸ“„ pytime.h(8.72 KB)
ðŸ“„ rangeobject.h(629 B)
ðŸ“„ setobject.h(3.28 KB)
ðŸ“„ sliceobject.h(2.42 KB)
ðŸ“„ structmember.h(1.98 KB)
ðŸ“„ structseq.h(1.34 KB)
ðŸ“„ symtable.h(4.81 KB)
ðŸ“„ sysmodule.h(1.48 KB)
ðŸ“„ token.h(2.42 KB)
ðŸ“„ traceback.h(3.56 KB)
ðŸ“„ tupleobject.h(2.41 KB)
ðŸ“„ typeslots.h(2.2 KB)
ðŸ“„ ucnhash.h(1.03 KB)
ðŸ“„ unicodeobject.h(80.35 KB)
ðŸ“„ warnings.h(1.73 KB)
ðŸ“„ weakrefobject.h(2.8 KB)

Editing: dictobject.h

#ifndef Py_DICTOBJECT_H
#define Py_DICTOBJECT_H
#ifdef __cplusplus
extern "C" {
#endif

/* Dictionary object type -- mapping from hashable object to object */

/* The distribution includes a separate file, Objects/dictnotes.txt,
   describing explorations into dictionary design and optimization.
   It covers typical dictionary use patterns, the parameters for
   tuning dictionaries, and several ideas for possible optimizations.
*/

#ifndef Py_LIMITED_API

typedef struct _dictkeysobject PyDictKeysObject;

/* The ma_values pointer is NULL for a combined table
 * or points to an array of PyObject* for a split table
 */
typedef struct {
    PyObject_HEAD

/* Number of items in the dictionary */
    Py_ssize_t ma_used;

/* Dictionary version: globally unique, value change each time
       the dictionary is modified */
    uint64_t ma_version_tag;

PyDictKeysObject *ma_keys;

/* If ma_values is NULL, the table is "combined": keys and values
       are stored in ma_keys.

If ma_values is not NULL, the table is splitted:
       keys are stored in ma_keys and values are stored in ma_values */
    PyObject **ma_values;
} PyDictObject;

typedef struct {
    PyObject_HEAD
    PyDictObject *dv_dict;
} _PyDictViewObject;

#endif /* Py_LIMITED_API */

PyAPI_DATA(PyTypeObject) PyDict_Type;
PyAPI_DATA(PyTypeObject) PyDictIterKey_Type;
PyAPI_DATA(PyTypeObject) PyDictIterValue_Type;
PyAPI_DATA(PyTypeObject) PyDictIterItem_Type;
PyAPI_DATA(PyTypeObject) PyDictKeys_Type;
PyAPI_DATA(PyTypeObject) PyDictItems_Type;
PyAPI_DATA(PyTypeObject) PyDictValues_Type;

#define PyDict_Check(op) \
                 PyType_FastSubclass(Py_TYPE(op), Py_TPFLAGS_DICT_SUBCLASS)
#define PyDict_CheckExact(op) (Py_TYPE(op) == &PyDict_Type)
#define PyDictKeys_Check(op) PyObject_TypeCheck(op, &PyDictKeys_Type)
#define PyDictItems_Check(op) PyObject_TypeCheck(op, &PyDictItems_Type)
#define PyDictValues_Check(op) PyObject_TypeCheck(op, &PyDictValues_Type)
/* This excludes Values, since they are not sets. */
# define PyDictViewSet_Check(op) \
    (PyDictKeys_Check(op) || PyDictItems_Check(op))

PyAPI_FUNC(PyObject *) PyDict_New(void);
PyAPI_FUNC(PyObject *) PyDict_GetItem(PyObject *mp, PyObject *key);
#ifndef Py_LIMITED_API
PyAPI_FUNC(PyObject *) _PyDict_GetItem_KnownHash(PyObject *mp, PyObject *key,
                                       Py_hash_t hash);
#endif
PyAPI_FUNC(PyObject *) PyDict_GetItemWithError(PyObject *mp, PyObject *key);
#ifndef Py_LIMITED_API
PyAPI_FUNC(PyObject *) _PyDict_GetItemIdWithError(PyObject *dp,
                                                  struct _Py_Identifier *key);
PyAPI_FUNC(PyObject *) PyDict_SetDefault(
    PyObject *mp, PyObject *key, PyObject *defaultobj);
#endif
PyAPI_FUNC(int) PyDict_SetItem(PyObject *mp, PyObject *key, PyObject *item);
#ifndef Py_LIMITED_API
PyAPI_FUNC(int) _PyDict_SetItem_KnownHash(PyObject *mp, PyObject *key,
                                          PyObject *item, Py_hash_t hash);
#endif
PyAPI_FUNC(int) PyDict_DelItem(PyObject *mp, PyObject *key);
#ifndef Py_LIMITED_API
PyAPI_FUNC(int) _PyDict_DelItem_KnownHash(PyObject *mp, PyObject *key,
                                          Py_hash_t hash);
PyAPI_FUNC(int) _PyDict_DelItemIf(PyObject *mp, PyObject *key,
                                  int (*predicate)(PyObject *value));
#endif
PyAPI_FUNC(void) PyDict_Clear(PyObject *mp);
PyAPI_FUNC(int) PyDict_Next(
    PyObject *mp, Py_ssize_t *pos, PyObject **key, PyObject **value);
#ifndef Py_LIMITED_API
PyDictKeysObject *_PyDict_NewKeysForClass(void);
PyAPI_FUNC(PyObject *) PyObject_GenericGetDict(PyObject *, void *);
PyAPI_FUNC(int) _PyDict_Next(
    PyObject *mp, Py_ssize_t *pos, PyObject **key, PyObject **value, Py_hash_t *hash);
PyObject *_PyDictView_New(PyObject *, PyTypeObject *);
#endif
PyAPI_FUNC(PyObject *) PyDict_Keys(PyObject *mp);
PyAPI_FUNC(PyObject *) PyDict_Values(PyObject *mp);
PyAPI_FUNC(PyObject *) PyDict_Items(PyObject *mp);
PyAPI_FUNC(Py_ssize_t) PyDict_Size(PyObject *mp);
PyAPI_FUNC(PyObject *) PyDict_Copy(PyObject *mp);
PyAPI_FUNC(int) PyDict_Contains(PyObject *mp, PyObject *key);
#ifndef Py_LIMITED_API
/* Get the number of items of a dictionary. */
#define PyDict_GET_SIZE(mp)  (assert(PyDict_Check(mp)),((PyDictObject *)mp)->ma_used)
PyAPI_FUNC(int) _PyDict_Contains(PyObject *mp, PyObject *key, Py_hash_t hash);
PyAPI_FUNC(PyObject *) _PyDict_NewPresized(Py_ssize_t minused);
PyAPI_FUNC(void) _PyDict_MaybeUntrack(PyObject *mp);
PyAPI_FUNC(int) _PyDict_HasOnlyStringKeys(PyObject *mp);
Py_ssize_t _PyDict_KeysSize(PyDictKeysObject *keys);
PyAPI_FUNC(Py_ssize_t) _PyDict_SizeOf(PyDictObject *);
PyAPI_FUNC(PyObject *) _PyDict_Pop(PyObject *, PyObject *, PyObject *);
PyObject *_PyDict_Pop_KnownHash(PyObject *, PyObject *, Py_hash_t, PyObject *);
PyObject *_PyDict_FromKeys(PyObject *, PyObject *, PyObject *);
#define _PyDict_HasSplitTable(d) ((d)->ma_values != NULL)

PyAPI_FUNC(int) PyDict_ClearFreeList(void);
#endif

/* PyDict_Update(mp, other) is equivalent to PyDict_Merge(mp, other, 1). */
PyAPI_FUNC(int) PyDict_Update(PyObject *mp, PyObject *other);

/* PyDict_Merge updates/merges from a mapping object (an object that
   supports PyMapping_Keys() and PyObject_GetItem()).  If override is true,
   the last occurrence of a key wins, else the first.  The Python
   dict.update(other) is equivalent to PyDict_Merge(dict, other, 1).
*/
PyAPI_FUNC(int) PyDict_Merge(PyObject *mp,
                                   PyObject *other,
                                   int override);

#ifndef Py_LIMITED_API
/* Like PyDict_Merge, but override can be 0, 1 or 2.  If override is 0,
   the first occurrence of a key wins, if override is 1, the last occurrence
   of a key wins, if override is 2, a KeyError with conflicting key as
   argument is raised.
*/
PyAPI_FUNC(int) _PyDict_MergeEx(PyObject *mp, PyObject *other, int override);
PyAPI_FUNC(PyObject *) _PyDictView_Intersect(PyObject* self, PyObject *other);
#endif

/* PyDict_MergeFromSeq2 updates/merges from an iterable object producing
   iterable objects of length 2.  If override is true, the last occurrence
   of a key wins, else the first.  The Python dict constructor dict(seq2)
   is equivalent to dict={}; PyDict_MergeFromSeq(dict, seq2, 1).
*/
PyAPI_FUNC(int) PyDict_MergeFromSeq2(PyObject *d,
                                           PyObject *seq2,
                                           int override);

PyAPI_FUNC(PyObject *) PyDict_GetItemString(PyObject *dp, const char *key);
#ifndef Py_LIMITED_API
PyAPI_FUNC(PyObject *) _PyDict_GetItemId(PyObject *dp, struct _Py_Identifier *key);
#endif /* !Py_LIMITED_API */
PyAPI_FUNC(int) PyDict_SetItemString(PyObject *dp, const char *key, PyObject *item);
#ifndef Py_LIMITED_API
PyAPI_FUNC(int) _PyDict_SetItemId(PyObject *dp, struct _Py_Identifier *key, PyObject *item);
#endif /* !Py_LIMITED_API */
PyAPI_FUNC(int) PyDict_DelItemString(PyObject *dp, const char *key);

#ifndef Py_LIMITED_API
PyAPI_FUNC(int) _PyDict_DelItemId(PyObject *mp, struct _Py_Identifier *key);
PyAPI_FUNC(void) _PyDict_DebugMallocStats(FILE *out);

int _PyObjectDict_SetItem(PyTypeObject *tp, PyObject **dictptr, PyObject *name, PyObject *value);
PyObject *_PyDict_LoadGlobal(PyDictObject *, PyDictObject *, PyObject *);
#endif

#ifdef __cplusplus
}
#endif
#endif /* !Py_DICTOBJECT_H */

X7ROOT File Manager

Editing: dictobject.h

Upload File

Create Folder