Fast multiple dispatch in Python, with many extra features.
With ovld, you can write a version of the same function for every type signature using annotations instead of writing an awkward sequence of isinstance
statements. Unlike Python's singledispatch
, it works for multiple arguments.
- ⚡️ Fast:
ovld
is the fastest multiple dispatch library around, by some margin. - 🚀 Variants and mixins of functions and methods.
- 🦄 Dependent types: Overloaded functions can depend on more than argument types: they can depend on actual values.
- 🔑 Extensive: Dispatch on functions, methods, positional arguments and even keyword arguments (with some restrictions).
Here's a function that recursively adds lists, tuples and dictionaries:
from ovld import ovld, recurse
@ovld
def add(x: list, y: list):
return [recurse(a, b) for a, b in zip(x, y)]
@ovld
def add(x: tuple, y: tuple):
return tuple(recurse(a, b) for a, b in zip(x, y))
@ovld
def add(x: dict, y: dict):
return {k: recurse(v, y[k]) for k, v in x.items()}
@ovld
def add(x: object, y: object):
return x + y
assert add([1, 2], [3, 4]) == [4, 6]
The recurse
function is special: it will recursively call the current ovld object. You may ask: how is it different from simply calling add
? The difference is that if you create a variant of add
, recurse
will automatically call the variant.
For example:
A variant of an ovld
is a copy of the ovld
, with some methods added or changed. For example, let's take the definition of add
above and make a variant that multiplies numbers instead:
@add.variant
def mul(self, x: object, y: object):
return x * y
assert mul([1, 2], [3, 4]) == [3, 8]
Simple! This means you can define one ovld
that recursively walks generic data structures, and then specialize it in various ways.
You can define a numeric priority for each method (the default priority is 0):
from ovld import call_next
@ovld(priority=1000)
def f(x: int):
return call_next(x + 1)
@ovld
def f(x: int):
return x * x
assert f(10) == 121
Both definitions above have the same type signature, but since the first has higher priority, that is the one that will be called.
However, that does not mean there is no way to call the second one. Indeed, when the first function calls the special function call_next(x + 1)
, it will call the next function in the list below itself.
The pattern you see above is how you may wrap each call with some generic behavior. For instance, if you did something like that:
@f.variant(priority=1000)
def f2(x: object)
print(f"f({x!r})")
return call_next(x)
You would effectively be creating a clone of f
that traces every call.
A dependent type is a type that depends on a value. ovld
supports this, either through Literal[value]
or Dependent[bound, check]
. For example, this definition of factorial:
from typing import Literal
from ovld import ovld, recurse, Dependent
@ovld
def fact(n: Literal[0]):
return 1
@ovld
def fact(n: Dependent[int, lambda n: n > 0]):
return n * recurse(n - 1)
assert fact(5) == 120
fact(-1) # Error!
The first argument to Dependent
must be a type bound. The bound must match before the logic is called, which also ensures we don't get a performance hit for unrelated types. For type checking purposes, Dependent[T, A]
is equivalent to Annotated[T, A]
.
Define your own types with the @dependent_check
decorator:
import torch
from ovld import ovld, dependent_check
@dependent_check
def Shape(tensor: torch.Tensor, *shape):
return (
len(tensor.shape) == len(shape)
and all(s2 is Any or s1 == s2 for s1, s2 in zip(tensor.shape, shape))
)
@dependent_check
def Dtype(tensor: torch.Tensor, dtype):
return tensor.dtype == dtype
@ovld
def f(tensor: Shape[3, Any]):
# Matches 3xN tensors
...
@ovld
def f(tensor: Shape[2, 2] & Dtype[torch.float32]):
# Only matches 2x2 tensors that also have the float32 dtype
...
The first parameter is the value to check. The type annotation (e.g. value: torch.Tensor
above) is interpreted by ovld
to be the bound for this type, so Shape
will only be called on parameters of type torch.Tensor
.
Either inherit from OvldBase
or use the OvldMC
metaclass to use multiple dispatch on methods.
from ovld import OvldBase, OvldMC
# class Cat(OvldBase): <= Also an option
class Cat(metaclass=OvldMC):
def interact(self, x: Mouse):
return "catch"
def interact(self, x: Food):
return "devour"
def interact(self, x: PricelessVase):
return "destroy"
Subclasses inherit overloaded methods. They may define additional overloads for these methods which will only be valid for the subclass, but they need to use the @extend_super
decorator (this is required for clarity):
from ovld import OvldMC, extend_super
class One(metaclass=OvldMC):
def f(self, x: int):
return "an integer"
class Two(One):
@extend_super
def f(self, x: str):
return "a string"
assert Two().f(1) == "an integer"
assert Two().f("s") == "a string"
ovld
is pretty fast: the overhead is comparable to isinstance
or match
, and only 2-3x slower when dispatching on Literal
types. Compared to other multiple dispatch libraries, it is 1.5x to 100x faster.
Time relative to the fastest implementation (1.00) (lower is better).
Bench | custom | ovld | plum | multim | multid | runtype | fastcore | singled |
---|---|---|---|---|---|---|---|---|
trivial | 1.14 | 1.00 | 2.53 | 3.64 | 1.61 | 1.86 | 41.31 | 1.54 |
add | 1.01 | 1.00 | 3.46 | 4.83 | 2.21 | 2.66 | 56.08 | x |
multer | 1.00 | 1.06 | 9.79 | 4.11 | 7.19 | 1.89 | 40.37 | 6.34 |
ast | 1.00 | 1.06 | 23.07 | 3.04 | 1.68 | 1.87 | 29.11 | 1.63 |
calc | 1.00 | 1.96 | 80.00 | 43.21 | x | x | x | x |
fib | 1.00 | 3.58 | 438.97 | 123.58 | x | x | x | x |
tweak | 1.00 | 2.59 | x | x | x | x | x | x |