Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 18.222.191.57
Domains :
Cant Read [ /etc/named.conf ]
User : cleahvkv
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
python310 /
include /
python3.10 /
internal /
Delete
Unzip
Name
Size
Permission
Date
Action
pycore_abstract.h
479
B
-rw-r--r--
2024-12-03 17:27
pycore_accu.h
1.1
KB
-rw-r--r--
2024-12-03 17:27
pycore_asdl.h
2.9
KB
-rw-r--r--
2024-12-03 17:27
pycore_ast.h
28.15
KB
-rw-r--r--
2024-12-03 17:27
pycore_ast_state.h
6.31
KB
-rw-r--r--
2024-12-03 17:27
pycore_atomic.h
16.58
KB
-rw-r--r--
2024-12-03 17:27
pycore_atomic_funcs.h
2.38
KB
-rw-r--r--
2024-12-03 17:27
pycore_bitutils.h
5.15
KB
-rw-r--r--
2024-12-03 17:27
pycore_blocks_output_buffer.h
8.48
KB
-rw-r--r--
2024-12-03 17:27
pycore_bytes_methods.h
3.3
KB
-rw-r--r--
2024-12-03 17:27
pycore_call.h
870
B
-rw-r--r--
2024-12-03 17:27
pycore_ceval.h
3.4
KB
-rw-r--r--
2024-12-03 17:27
pycore_code.h
696
B
-rw-r--r--
2024-12-03 17:27
pycore_compile.h
1.02
KB
-rw-r--r--
2024-12-03 17:27
pycore_condvar.h
2.74
KB
-rw-r--r--
2024-12-03 17:27
pycore_context.h
822
B
-rw-r--r--
2024-12-03 17:27
pycore_dtoa.h
646
B
-rw-r--r--
2024-12-03 17:27
pycore_fileutils.h
1.66
KB
-rw-r--r--
2024-12-03 17:27
pycore_format.h
480
B
-rw-r--r--
2024-12-03 17:27
pycore_gc.h
6.7
KB
-rw-r--r--
2024-12-03 17:27
pycore_getopt.h
490
B
-rw-r--r--
2024-12-03 17:27
pycore_gil.h
1.53
KB
-rw-r--r--
2024-12-03 17:27
pycore_hamt.h
3.61
KB
-rw-r--r--
2024-12-03 17:27
pycore_hashtable.h
4.1
KB
-rw-r--r--
2024-12-03 17:27
pycore_import.h
346
B
-rw-r--r--
2024-12-03 17:27
pycore_initconfig.h
5.49
KB
-rw-r--r--
2024-12-03 17:27
pycore_interp.h
9.07
KB
-rw-r--r--
2024-12-03 17:27
pycore_list.h
350
B
-rw-r--r--
2024-12-03 17:27
pycore_long.h
2.53
KB
-rw-r--r--
2024-12-03 17:27
pycore_moduleobject.h
1.02
KB
-rw-r--r--
2024-12-03 17:27
pycore_object.h
5.85
KB
-rw-r--r--
2024-12-03 17:27
pycore_parser.h
626
B
-rw-r--r--
2024-12-03 17:27
pycore_pathconfig.h
1.93
KB
-rw-r--r--
2024-12-03 17:27
pycore_pyarena.h
2.67
KB
-rw-r--r--
2024-12-03 17:27
pycore_pyerrors.h
2.26
KB
-rw-r--r--
2024-12-03 17:27
pycore_pyhash.h
206
B
-rw-r--r--
2024-12-03 17:27
pycore_pylifecycle.h
4.82
KB
-rw-r--r--
2024-12-03 17:27
pycore_pymem.h
3.14
KB
-rw-r--r--
2024-12-03 17:27
pycore_pystate.h
3.85
KB
-rw-r--r--
2024-12-03 17:27
pycore_runtime.h
4.79
KB
-rw-r--r--
2024-12-03 17:27
pycore_structseq.h
386
B
-rw-r--r--
2024-12-03 17:27
pycore_symtable.h
5.45
KB
-rw-r--r--
2024-12-03 17:27
pycore_sysmodule.h
548
B
-rw-r--r--
2024-12-03 17:27
pycore_traceback.h
2.9
KB
-rw-r--r--
2024-12-03 17:27
pycore_tuple.h
425
B
-rw-r--r--
2024-12-03 17:27
pycore_ucnhash.h
898
B
-rw-r--r--
2024-12-03 17:27
pycore_unionobject.h
629
B
-rw-r--r--
2024-12-03 17:27
pycore_warnings.h
633
B
-rw-r--r--
2024-12-03 17:27
Save
Rename
#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 #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; /* 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; PyAPI_DATA(PyTypeObject) _PyHamt_Type; PyAPI_DATA(PyTypeObject) _PyHamt_ArrayNode_Type; PyAPI_DATA(PyTypeObject) _PyHamt_BitmapNode_Type; PyAPI_DATA(PyTypeObject) _PyHamt_CollisionNode_Type; PyAPI_DATA(PyTypeObject) _PyHamtKeys_Type; PyAPI_DATA(PyTypeObject) _PyHamtValues_Type; PyAPI_DATA(PyTypeObject) _PyHamtItems_Type; /* 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); int _PyHamt_Init(void); void _PyHamt_Fini(void); #endif /* !Py_INTERNAL_HAMT_H */