File Manager

X7ROOT File Manager

Current Path: /opt/hc_python/lib/python3.12/site-packages/sqlalchemy/sql

opt / hc_python / lib / python3.12 / site-packages / sqlalchemy / sql /

📁 ..
📄 __init__.py(5.68 KB)
📁 __pycache__
📄 _dml_constructors.py(3.71 KB)
📄 _elements_constructors.py(61.16 KB)
📄 _orm_types.py(625 B)
📄 _py_util.py(2.12 KB)
📄 _selectable_constructors.py(19.9 KB)
📄 _typing.py(12.55 KB)
📄 annotation.py(17.82 KB)
📄 base.py(72.21 KB)
📄 cache_key.py(32.88 KB)
📄 coercions.py(39.7 KB)
📄 compiler.py(269.12 KB)
📄 crud.py(55.19 KB)
📄 ddl.py(46.32 KB)
📄 default_comparator.py(16.32 KB)
📄 dml.py(64.68 KB)
📄 elements.py(173.16 KB)
📄 events.py(17.88 KB)
📄 expression.py(7.41 KB)
📄 functions.py(62.36 KB)
📄 lambdas.py(48.04 KB)
📄 naming.py(6.7 KB)
📄 operators.py(74.99 KB)
📄 roles.py(7.48 KB)
📄 schema.py(224.63 KB)
📄 selectable.py(235.41 KB)
📄 sqltypes.py(125.93 KB)
📄 traversals.py(32.88 KB)
📄 type_api.py(82.85 KB)
📄 util.py(46.96 KB)
📄 visitors.py(35.47 KB)

Editing: _py_util.py

# sql/_py_util.py
# Copyright (C) 2005-2025 the SQLAlchemy authors and contributors
# <see AUTHORS file>
#
# This module is part of SQLAlchemy and is released under
# the MIT License: https://www.opensource.org/licenses/mit-license.php

from __future__ import annotations

import typing
from typing import Any
from typing import Dict
from typing import Tuple
from typing import Union

from ..util.typing import Literal

if typing.TYPE_CHECKING:
    from .cache_key import CacheConst

class prefix_anon_map(Dict[str, str]):
    """A map that creates new keys for missing key access.

Considers keys of the form "<ident> <name>" to produce
    new symbols "<name>_<index>", where "index" is an incrementing integer
    corresponding to <name>.

Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which
    is otherwise usually used for this type of operation.

"""

def __missing__(self, key: str) -> str:
        (ident, derived) = key.split(" ", 1)
        anonymous_counter = self.get(derived, 1)
        self[derived] = anonymous_counter + 1  # type: ignore
        value = f"{derived}_{anonymous_counter}"
        self[key] = value
        return value

class cache_anon_map(
    Dict[Union[int, "Literal[CacheConst.NO_CACHE]"], Union[Literal[True], str]]
):
    """A map that creates new keys for missing key access.

Produces an incrementing sequence given a series of unique keys.

This is similar to the compiler prefix_anon_map class although simpler.

Inlines the approach taken by :class:`sqlalchemy.util.PopulateDict` which
    is otherwise usually used for this type of operation.

"""

_index = 0

def get_anon(self, object_: Any) -> Tuple[str, bool]:
        idself = id(object_)
        if idself in self:
            s_val = self[idself]
            assert s_val is not True
            return s_val, True
        else:
            # inline of __missing__
            self[idself] = id_ = str(self._index)
            self._index += 1

return id_, False

def __missing__(self, key: int) -> str:
        self[key] = val = str(self._index)
        self._index += 1
        return val

X7ROOT File Manager

Editing: _py_util.py

Upload File

Create Folder