# Python: 3.9.2 (tags/v3.9.2:1a79785, Feb 19 2021, 13:44:55) [MSC v.1928 64 bit (AMD64)]
# Library: pandas, version: 1.2.4
# Module: pandas._libs.join, version: unspecified
import typing
import builtins as _mod_builtins

__doc__: typing.Any
__file__: str
__name__: str
__package__: str
def __pyx_unpickle_Enum() -> typing.Any:
    ...

__test__: dict
def asof_join_backward() -> typing.Any:
    ...

def asof_join_backward_on_X_by_Y() -> typing.Any:
    ...

def asof_join_forward() -> typing.Any:
    ...

def asof_join_forward_on_X_by_Y() -> typing.Any:
    ...

def asof_join_nearest() -> typing.Any:
    ...

def asof_join_nearest_on_X_by_Y() -> typing.Any:
    ...

def ensure_platform_int() -> typing.Any:
    ...

def ffill_indexer() -> typing.Any:
    ...

def full_outer_join() -> typing.Any:
    ...

def groupsort_indexer() -> typing.Any:
    '\n    Compute a 1-d indexer.\n\n    The indexer is an ordering of the passed index,\n    ordered by the groups.\n\n    Parameters\n    ----------\n    index: int64 ndarray\n        Mappings from group -> position.\n    ngroups: int64\n        Number of groups.\n\n    Returns\n    -------\n    tuple\n        1-d indexer ordered by groups, group counts.\n\n    Notes\n    -----\n    This is a reverse of the label factorization process.\n    '
    ...

def inner_join() -> typing.Any:
    ...

def inner_join_indexer(left, right) -> typing.Any:
    '\n    Two-pass algorithm for monotonic indexes. Handles many-to-one merges.\n    '
    ...

def left_join_indexer(left, right) -> typing.Any:
    '\n    Two-pass algorithm for monotonic indexes. Handles many-to-one merges.\n    '
    ...

def left_join_indexer_unique(left, right) -> typing.Any:
    ...

def left_outer_join() -> typing.Any:
    ...

def outer_join_indexer(left, right) -> typing.Any:
    ...

def take_1d_int64_int64() -> typing.Any:
    ...

def __getattr__(name) -> typing.Any:
    ...