X7ROOT File Manager
Current Path:
/opt/alt/python313/include/python3.13/internal
opt
/
alt
/
python313
/
include
/
python3.13
/
internal
/
ðŸ“
..
ðŸ“
mimalloc
📄
pycore_abstract.h
(1.87 KB)
📄
pycore_asdl.h
(2.96 KB)
📄
pycore_ast.h
(30.78 KB)
📄
pycore_ast_state.h
(6.62 KB)
📄
pycore_atexit.h
(1.4 KB)
📄
pycore_backoff.h
(3.81 KB)
📄
pycore_bitutils.h
(5.88 KB)
📄
pycore_blocks_output_buffer.h
(8.57 KB)
📄
pycore_brc.h
(2.05 KB)
📄
pycore_bytes_methods.h
(3.84 KB)
📄
pycore_bytesobject.h
(4.75 KB)
📄
pycore_call.h
(5.99 KB)
📄
pycore_capsule.h
(397 B)
📄
pycore_cell.h
(1.03 KB)
📄
pycore_ceval.h
(10.9 KB)
📄
pycore_ceval_state.h
(3.83 KB)
📄
pycore_code.h
(19.4 KB)
📄
pycore_codecs.h
(2.41 KB)
📄
pycore_compile.h
(3.66 KB)
📄
pycore_complexobject.h
(588 B)
📄
pycore_condvar.h
(2.64 KB)
📄
pycore_context.h
(1.15 KB)
📄
pycore_critical_section.h
(7.78 KB)
📄
pycore_crossinterp.h
(11.84 KB)
📄
pycore_descrobject.h
(543 B)
📄
pycore_dict.h
(11.98 KB)
📄
pycore_dict_state.h
(732 B)
📄
pycore_dtoa.h
(1.69 KB)
📄
pycore_emscripten_signal.h
(685 B)
📄
pycore_emscripten_trampoline.h
(3.11 KB)
📄
pycore_exceptions.h
(900 B)
📄
pycore_faulthandler.h
(2.19 KB)
📄
pycore_fileutils.h
(9.25 KB)
📄
pycore_fileutils_windows.h
(2.65 KB)
📄
pycore_floatobject.h
(1.46 KB)
📄
pycore_flowgraph.h
(1.45 KB)
📄
pycore_format.h
(480 B)
📄
pycore_frame.h
(10.62 KB)
📄
pycore_freelist.h
(4.7 KB)
📄
pycore_function.h
(1.5 KB)
📄
pycore_gc.h
(12.66 KB)
📄
pycore_genobject.h
(859 B)
📄
pycore_getopt.h
(490 B)
📄
pycore_gil.h
(2.14 KB)
📄
pycore_global_objects.h
(3.02 KB)
📄
pycore_global_objects_fini_generated.h
(115.04 KB)
📄
pycore_global_strings.h
(26.08 KB)
📄
pycore_hamt.h
(3.65 KB)
📄
pycore_hashtable.h
(4.26 KB)
📄
pycore_identifier.h
(515 B)
📄
pycore_import.h
(7.55 KB)
📄
pycore_importdl.h
(3.96 KB)
📄
pycore_initconfig.h
(6.23 KB)
📄
pycore_instruction_sequence.h
(2.11 KB)
📄
pycore_instruments.h
(2.28 KB)
📄
pycore_interp.h
(14.71 KB)
📄
pycore_intrinsics.h
(1.71 KB)
📄
pycore_jit.h
(527 B)
📄
pycore_list.h
(1.82 KB)
📄
pycore_llist.h
(2.36 KB)
📄
pycore_lock.h
(8.34 KB)
📄
pycore_long.h
(9.73 KB)
📄
pycore_memoryobject.h
(427 B)
📄
pycore_mimalloc.h
(1.6 KB)
📄
pycore_modsupport.h
(3.27 KB)
📄
pycore_moduleobject.h
(1.54 KB)
📄
pycore_namespace.h
(435 B)
📄
pycore_object.h
(26.64 KB)
📄
pycore_object_alloc.h
(2.13 KB)
📄
pycore_object_stack.h
(2.33 KB)
📄
pycore_object_state.h
(942 B)
📄
pycore_obmalloc.h
(26.78 KB)
📄
pycore_obmalloc_init.h
(1.89 KB)
📄
pycore_opcode_metadata.h
(82.74 KB)
📄
pycore_opcode_utils.h
(2.07 KB)
📄
pycore_optimizer.h
(8.11 KB)
📄
pycore_parking_lot.h
(3.27 KB)
📄
pycore_parser.h
(2.04 KB)
📄
pycore_pathconfig.h
(658 B)
📄
pycore_pyarena.h
(2.79 KB)
📄
pycore_pyatomic_ft_wrappers.h
(7.87 KB)
📄
pycore_pybuffer.h
(510 B)
📄
pycore_pyerrors.h
(4.84 KB)
📄
pycore_pyhash.h
(2.75 KB)
📄
pycore_pylifecycle.h
(4.36 KB)
📄
pycore_pymath.h
(8.4 KB)
📄
pycore_pymem.h
(4.37 KB)
📄
pycore_pymem_init.h
(3.44 KB)
📄
pycore_pystate.h
(9.73 KB)
📄
pycore_pystats.h
(420 B)
📄
pycore_pythonrun.h
(758 B)
📄
pycore_pythread.h
(5.3 KB)
📄
pycore_qsbr.h
(4.81 KB)
📄
pycore_range.h
(346 B)
📄
pycore_runtime.h
(12.84 KB)
📄
pycore_runtime_init.h
(12.74 KB)
📄
pycore_runtime_init_generated.h
(45.72 KB)
📄
pycore_semaphore.h
(1.69 KB)
📄
pycore_setobject.h
(951 B)
📄
pycore_signal.h
(2.86 KB)
📄
pycore_sliceobject.h
(369 B)
📄
pycore_stackref.h
(5.06 KB)
📄
pycore_strhex.h
(1013 B)
📄
pycore_structseq.h
(963 B)
📄
pycore_symtable.h
(8.47 KB)
📄
pycore_sysmodule.h
(1.15 KB)
📄
pycore_time.h
(11.52 KB)
📄
pycore_token.h
(2.93 KB)
📄
pycore_traceback.h
(3.54 KB)
📄
pycore_tracemalloc.h
(4.43 KB)
📄
pycore_tstate.h
(1.32 KB)
📄
pycore_tuple.h
(820 B)
📄
pycore_typeobject.h
(8.67 KB)
📄
pycore_typevarobject.h
(924 B)
📄
pycore_ucnhash.h
(958 B)
📄
pycore_unicodeobject.h
(12.15 KB)
📄
pycore_unicodeobject_generated.h
(129.04 KB)
📄
pycore_unionobject.h
(742 B)
📄
pycore_uop_ids.h
(10.03 KB)
📄
pycore_uop_metadata.h
(38.54 KB)
📄
pycore_warnings.h
(840 B)
📄
pycore_weakref.h
(3.25 KB)
Editing: pycore_hamt.h
#ifndef Py_INTERNAL_HAMT_H #define Py_INTERNAL_HAMT_H #ifndef Py_BUILD_CORE # error "this header requires Py_BUILD_CORE define" #endif /* HAMT tree is shaped by hashes of keys. Every group of 5 bits of a hash denotes the exact position of the key in one level of the tree. Since we're using 32 bit hashes, we can have at most 7 such levels. Although if there are two distinct keys with equal hashes, they will have to occupy the same cell in the 7th level of the tree -- so we'd put them in a "collision" node. Which brings the total possible tree depth to 8. Read more about the actual layout of the HAMT tree in `hamt.c`. This constant is used to define a datastucture for storing iteration state. */ #define _Py_HAMT_MAX_TREE_DEPTH 8 extern PyTypeObject _PyHamt_Type; extern PyTypeObject _PyHamt_ArrayNode_Type; extern PyTypeObject _PyHamt_BitmapNode_Type; extern PyTypeObject _PyHamt_CollisionNode_Type; extern PyTypeObject _PyHamtKeys_Type; extern PyTypeObject _PyHamtValues_Type; extern PyTypeObject _PyHamtItems_Type; /* other API */ #define PyHamt_Check(o) Py_IS_TYPE((o), &_PyHamt_Type) /* Abstract tree node. */ typedef struct { PyObject_HEAD } PyHamtNode; /* An HAMT immutable mapping collection. */ typedef struct { PyObject_HEAD PyHamtNode *h_root; PyObject *h_weakreflist; Py_ssize_t h_count; } PyHamtObject; typedef struct { PyObject_VAR_HEAD uint32_t b_bitmap; PyObject *b_array[1]; } PyHamtNode_Bitmap; /* A struct to hold the state of depth-first traverse of the tree. HAMT is an immutable collection. Iterators will hold a strong reference to it, and every node in the HAMT has strong references to its children. So for iterators, we can implement zero allocations and zero reference inc/dec depth-first iteration. - i_nodes: an array of seven pointers to tree nodes - i_level: the current node in i_nodes - i_pos: an array of positions within nodes in i_nodes. */ typedef struct { PyHamtNode *i_nodes[_Py_HAMT_MAX_TREE_DEPTH]; Py_ssize_t i_pos[_Py_HAMT_MAX_TREE_DEPTH]; int8_t i_level; } PyHamtIteratorState; /* Base iterator object. Contains the iteration state, a pointer to the HAMT tree, and a pointer to the 'yield function'. The latter is a simple function that returns a key/value tuple for the 'Items' iterator, just a key for the 'Keys' iterator, and a value for the 'Values' iterator. */ typedef struct { PyObject_HEAD PyHamtObject *hi_obj; PyHamtIteratorState hi_iter; binaryfunc hi_yield; } PyHamtIterator; /* Create a new HAMT immutable mapping. */ PyHamtObject * _PyHamt_New(void); /* Return a new collection based on "o", but with an additional key/val pair. */ PyHamtObject * _PyHamt_Assoc(PyHamtObject *o, PyObject *key, PyObject *val); /* Return a new collection based on "o", but without "key". */ PyHamtObject * _PyHamt_Without(PyHamtObject *o, PyObject *key); /* Find "key" in the "o" collection. Return: - -1: An error occurred. - 0: "key" wasn't found in "o". - 1: "key" is in "o"; "*val" is set to its value (a borrowed ref). */ int _PyHamt_Find(PyHamtObject *o, PyObject *key, PyObject **val); /* Check if "v" is equal to "w". Return: - 0: v != w - 1: v == w - -1: An error occurred. */ int _PyHamt_Eq(PyHamtObject *v, PyHamtObject *w); /* Return the size of "o"; equivalent of "len(o)". */ Py_ssize_t _PyHamt_Len(PyHamtObject *o); /* Return a Keys iterator over "o". */ PyObject * _PyHamt_NewIterKeys(PyHamtObject *o); /* Return a Values iterator over "o". */ PyObject * _PyHamt_NewIterValues(PyHamtObject *o); /* Return a Items iterator over "o". */ PyObject * _PyHamt_NewIterItems(PyHamtObject *o); #endif /* !Py_INTERNAL_HAMT_H */
Upload File
Create Folder