Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
pycore_abstract.h	611 B	-rw-r--r--	2024-12-03 17:20
pycore_accu.h	1.1 KB	-rw-r--r--	2024-12-03 17:20
pycore_asdl.h	2.96 KB	-rw-r--r--	2024-12-03 17:20
pycore_ast.h	28.63 KB	-rw-r--r--	2024-12-03 17:20
pycore_ast_state.h	6.4 KB	-rw-r--r--	2024-12-03 17:20
pycore_atomic.h	16.58 KB	-rw-r--r--	2024-12-03 17:20
pycore_atomic_funcs.h	2.38 KB	-rw-r--r--	2024-12-03 17:20
pycore_bitutils.h	5.92 KB	-rw-r--r--	2024-12-03 17:20
pycore_blocks_output_buffer.h	8.48 KB	-rw-r--r--	2024-12-03 17:20
pycore_bytes_methods.h	3.3 KB	-rw-r--r--	2024-12-03 17:20
pycore_bytesobject.h	1.39 KB	-rw-r--r--	2024-12-03 17:20
pycore_call.h	3.39 KB	-rw-r--r--	2024-12-03 17:20
pycore_ceval.h	4.31 KB	-rw-r--r--	2024-12-03 17:20
pycore_code.h	15.56 KB	-rw-r--r--	2024-12-03 17:20
pycore_compile.h	1.02 KB	-rw-r--r--	2024-12-03 17:20
pycore_condvar.h	2.77 KB	-rw-r--r--	2024-12-03 17:20
pycore_context.h	1.21 KB	-rw-r--r--	2024-12-03 17:20
pycore_dict.h	5.55 KB	-rw-r--r--	2024-12-03 17:20
pycore_dtoa.h	704 B	-rw-r--r--	2024-12-03 17:20
pycore_emscripten_signal.h	562 B	-rw-r--r--	2024-12-03 17:20
pycore_exceptions.h	842 B	-rw-r--r--	2024-12-03 17:20
pycore_fileutils.h	7.23 KB	-rw-r--r--	2024-12-03 17:20
pycore_floatobject.h	1.28 KB	-rw-r--r--	2024-12-03 17:20
pycore_format.h	480 B	-rw-r--r--	2024-12-03 17:20
pycore_frame.h	7.39 KB	-rw-r--r--	2024-12-03 17:20
pycore_function.h	413 B	-rw-r--r--	2024-12-03 17:20
pycore_gc.h	6.73 KB	-rw-r--r--	2024-12-03 17:20
pycore_genobject.h	1.14 KB	-rw-r--r--	2024-12-03 17:20
pycore_getopt.h	490 B	-rw-r--r--	2024-12-03 17:20
pycore_gil.h	1.53 KB	-rw-r--r--	2024-12-03 17:20
pycore_global_objects.h	1.4 KB	-rw-r--r--	2024-12-03 17:20
pycore_global_strings.h	12.68 KB	-rw-r--r--	2024-12-03 17:20
pycore_hamt.h	3.61 KB	-rw-r--r--	2024-12-03 17:20
pycore_hashtable.h	4.1 KB	-rw-r--r--	2024-12-03 17:20
pycore_import.h	743 B	-rw-r--r--	2024-12-03 17:20
pycore_initconfig.h	5.66 KB	-rw-r--r--	2024-12-03 17:20
pycore_interp.h	6.51 KB	-rw-r--r--	2024-12-03 17:20
pycore_interpreteridobject.h	562 B	-rw-r--r--	2024-12-03 17:20
pycore_list.h	1.32 KB	-rw-r--r--	2024-12-03 17:20
pycore_long.h	3.43 KB	-rw-r--r--	2024-12-03 17:20
pycore_moduleobject.h	1.02 KB	-rw-r--r--	2024-12-03 17:20
pycore_namespace.h	392 B	-rw-r--r--	2024-12-03 17:20
pycore_object.h	9.8 KB	-rw-r--r--	2024-12-03 17:20
pycore_opcode.h	18.54 KB	-rw-r--r--	2024-12-03 17:20
pycore_parser.h	626 B	-rw-r--r--	2024-12-03 17:20
pycore_pathconfig.h	606 B	-rw-r--r--	2024-12-03 17:20
pycore_pyarena.h	2.67 KB	-rw-r--r--	2024-12-03 17:20
pycore_pyerrors.h	2.44 KB	-rw-r--r--	2024-12-03 17:20
pycore_pyhash.h	206 B	-rw-r--r--	2024-12-03 17:20
pycore_pylifecycle.h	3.42 KB	-rw-r--r--	2024-12-03 17:20
pycore_pymath.h	9.21 KB	-rw-r--r--	2024-12-03 17:20
pycore_pymem.h	3.62 KB	-rw-r--r--	2024-12-03 17:20
pycore_pystate.h	4.15 KB	-rw-r--r--	2024-12-03 17:20
pycore_runtime.h	5.85 KB	-rw-r--r--	2024-12-03 17:20
pycore_runtime_init.h	47.94 KB	-rw-r--r--	2024-12-03 17:20
pycore_signal.h	937 B	-rw-r--r--	2024-12-03 17:20
pycore_sliceobject.h	336 B	-rw-r--r--	2024-12-03 17:20
pycore_strhex.h	937 B	-rw-r--r--	2024-12-03 17:20
pycore_structseq.h	580 B	-rw-r--r--	2024-12-03 17:20
pycore_symtable.h	5.51 KB	-rw-r--r--	2024-12-03 17:20
pycore_sysmodule.h	605 B	-rw-r--r--	2024-12-03 17:20
pycore_traceback.h	3.42 KB	-rw-r--r--	2024-12-03 17:20
pycore_tuple.h	2.04 KB	-rw-r--r--	2024-12-03 17:20
pycore_typeobject.h	1.13 KB	-rw-r--r--	2024-12-03 17:20
pycore_ucnhash.h	898 B	-rw-r--r--	2024-12-03 17:20
pycore_unicodeobject.h	1.68 KB	-rw-r--r--	2024-12-03 17:20
pycore_unionobject.h	678 B	-rw-r--r--	2024-12-03 17:20
pycore_warnings.h	740 B	-rw-r--r--	2024-12-03 17:20

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

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;

/* runtime lifecycle */

void _PyHamt_Fini(PyInterpreterState *);

/* 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;

/* 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 */