sympy2jax 0.0.4__py3-none-any.whl → 0.0.6__py3-none-any.whl

sympy2jax/__init__.py

@@ -12,7 +12,11 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-from .sympy_module import SymbolicModule
+from .sympy_module import (
+    concatenate as concatenate,
+    stack as stack,
+    SymbolicModule as SymbolicModule,
+)
 
 
 __version__ = "0.0.4"

sympy2jax/sympy_module.py

@@ -15,7 +15,8 @@
 import abc
 import collections as co
 import functools as ft
-from typing import Any, Callable, Optional
+from collections.abc import Callable, Mapping
+from typing import Any, cast, Optional
 
 import equinox as eqx
 import jax
@@ -26,6 +27,9 @@ import sympy
 
 PyTree = Any
 
+concatenate: Callable = sympy.Function("concatenate")  # pyright: ignore
+stack: Callable = sympy.Function("stack")  # pyright: ignore
+
 
 def _reduce(fn):
     def fn_(*args):
@@ -34,7 +38,16 @@ def _reduce(fn):
     return fn_
 
 
+def _single_args(fn):
+    def fn_(*args):
+        return fn(args)
+
+    return fn_
+
+
 _lookup = {
+    concatenate: _single_args(jnp.concatenate),
+    stack: _single_args(jnp.stack),
     sympy.Mul: _reduce(jnp.multiply),
     sympy.Add: _reduce(jnp.add),
     sympy.div: jnp.divide,
@@ -80,13 +93,27 @@ _lookup = {
     sympy.Determinant: jnp.linalg.det,
 }
 
+_constant_lookup = {
+    sympy.E: jnp.e,
+    sympy.pi: jnp.pi,
+    sympy.EulerGamma: jnp.euler_gamma,
+    sympy.I: 1j,
+}
+
 _reverse_lookup = {v: k for k, v in _lookup.items()}
 assert len(_reverse_lookup) == len(_lookup)
 
 
+def _item(x):
+    if eqx.is_array(x):
+        return x.item()
+    else:
+        return x
+
+
 class _AbstractNode(eqx.Module):
     @abc.abstractmethod
-    def __call__(self, memodict: dict):
+    def __call__(self, memodict: dict) -> jax.typing.ArrayLike:
         ...
 
     @abc.abstractmethod
@@ -95,14 +122,14 @@ class _AbstractNode(eqx.Module):
 
     # Comparisons based on identity
     __hash__ = object.__hash__
-    __eq__ = object.__eq__
+    __eq__ = object.__eq__  # pyright: ignore
 
 
 class _Symbol(_AbstractNode):
     _name: str
 
     def __init__(self, expr: sympy.Expr):
-        self._name = expr.name
+        self._name = str(expr.name)  # pyright: ignore
 
     def __call__(self, memodict: dict):
         try:
@@ -123,7 +150,7 @@ def _maybe_array(val, make_array):
 
 
 class _Integer(_AbstractNode):
-    _value: jnp.ndarray
+    _value: jax.typing.ArrayLike
 
     def __init__(self, expr: sympy.Expr, make_array: bool):
         assert isinstance(expr, sympy.Integer)
@@ -134,11 +161,11 @@ class _Integer(_AbstractNode):
 
     def sympy(self, memodict: dict, func_lookup: dict) -> sympy.Expr:
         # memodict not needed as sympy deduplicates internally
-        return sympy.Integer(self._value.item())
+        return sympy.Integer(_item(self._value))
 
 
 class _Float(_AbstractNode):
-    _value: jnp.ndarray
+    _value: jax.typing.ArrayLike
 
     def __init__(self, expr: sympy.Expr, make_array: bool):
         assert isinstance(expr, sympy.Float)
@@ -149,24 +176,49 @@ class _Float(_AbstractNode):
 
     def sympy(self, memodict: dict, func_lookup: dict) -> sympy.Expr:
         # memodict not needed as sympy deduplicates internally
-        return sympy.Float(self._value.item())
+        return sympy.Float(_item(self._value))
 
 
 class _Rational(_AbstractNode):
-    _numerator: jnp.ndarray
-    _denominator: jnp.ndarray
+    _numerator: jax.typing.ArrayLike
+    _denominator: jax.typing.ArrayLike
 
     def __init__(self, expr: sympy.Expr, make_array: bool):
         assert isinstance(expr, sympy.Rational)
-        self._numerator = _maybe_array(int(expr.numerator), make_array)
-        self._denominator = _maybe_array(int(expr.denominator), make_array)
+        numerator = expr.numerator
+        denominator = expr.denominator
+        if callable(numerator):
+            # Support SymPy < 1.10
+            numerator = numerator()
+        if callable(denominator):
+            denominator = denominator()
+        self._numerator = _maybe_array(int(numerator), make_array)
+        self._denominator = _maybe_array(int(denominator), make_array)
 
     def __call__(self, memodict: dict):
         return self._numerator / self._denominator
 
     def sympy(self, memodict: dict, func_lookup: dict) -> sympy.Expr:
         # memodict not needed as sympy deduplicates internally
-        return sympy.Integer(self._numerator) / sympy.Integer(self._denominator)
+        return sympy.Integer(_item(self._numerator)) / sympy.Integer(
+            _item(self._denominator)
+        )
+
+
+class _Constant(_AbstractNode):
+    _value: jnp.ndarray
+    _expr: sympy.Expr
+
+    def __init__(self, expr: sympy.Expr, make_array: bool):
+        assert expr in _constant_lookup
+        self._value = _maybe_array(_constant_lookup[expr], make_array)
+        self._expr = expr
+
+    def __call__(self, memodict: dict):
+        return self._value
+
+    def sympy(self, memodict: dict, func_lookup: dict) -> sympy.Expr:
+        return self._expr
 
 
 class _Func(_AbstractNode):
@@ -174,14 +226,15 @@ class _Func(_AbstractNode):
     _args: list
 
     def __init__(
-        self, expr: sympy.Expr, memodict: dict, func_lookup: dict, make_array: bool
+        self, expr: sympy.Expr, memodict: dict, func_lookup: Mapping, make_array: bool
     ):
         try:
             self._func = func_lookup[expr.func]
         except KeyError as e:
             raise KeyError(f"Unsupported Sympy type {type(expr)}") from e
         self._args = [
-            _sympy_to_node(arg, memodict, func_lookup, make_array) for arg in expr.args
+            _sympy_to_node(cast(sympy.Expr, arg), memodict, func_lookup, make_array)
+            for arg in expr.args
         ]
 
     def __call__(self, memodict: dict):
@@ -207,7 +260,7 @@ class _Func(_AbstractNode):
 
 
 def _sympy_to_node(
-    expr: sympy.Expr, memodict: dict, func_lookup: dict, make_array: bool
+    expr: sympy.Expr, memodict: dict, func_lookup: Mapping, make_array: bool
 ) -> _AbstractNode:
     try:
         return memodict[expr]
@@ -220,6 +273,8 @@ def _sympy_to_node(
             out = _Float(expr, make_array)
         elif isinstance(expr, sympy.Rational):
             out = _Rational(expr, make_array)
+        elif expr in (sympy.E, sympy.pi, sympy.EulerGamma, sympy.I):
+            out = _Constant(expr, make_array)
         else:
             out = _Func(expr, memodict, func_lookup, make_array)
         memodict[expr] = out
@@ -239,9 +294,7 @@ class SymbolicModule(eqx.Module):
         expressions: PyTree,
         extra_funcs: Optional[dict] = None,
         make_array: bool = True,
-        **kwargs,
     ):
-        super().__init__(**kwargs)
         if extra_funcs is None:
             lookup = _lookup
             self.has_extra_funcs = False
@@ -259,7 +312,8 @@ class SymbolicModule(eqx.Module):
     def sympy(self) -> sympy.Expr:
         if self.has_extra_funcs:
             raise NotImplementedError(
-                "SymbolicModule cannot be converted back to SymPy if `extra_funcs` is passed"
+                "SymbolicModule cannot be converted back to SymPy if `extra_funcs` "
+                "is passed."
             )
         memodict = dict()
         return jax.tree_map(

sympy2jax-0.0.6.dist-info/METADATA

@@ -0,0 +1,296 @@
+Metadata-Version: 2.4
+Name: sympy2jax
+Version: 0.0.6
+Summary: Turn SymPy expressions into trainable JAX expressions.
+Project-URL: repository, https://github.com/google/sympy2jax
+Author-email: Patrick Kidger <contact@kidger.site>
+License: 
+                                         Apache License
+                                   Version 2.0, January 2004
+                                http://www.apache.org/licenses/
+        
+           TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+        
+           1. Definitions.
+        
+              "License" shall mean the terms and conditions for use, reproduction,
+              and distribution as defined by Sections 1 through 9 of this document.
+        
+              "Licensor" shall mean the copyright owner or entity authorized by
+              the copyright owner that is granting the License.
+        
+              "Legal Entity" shall mean the union of the acting entity and all
+              other entities that control, are controlled by, or are under common
+              control with that entity. For the purposes of this definition,
+              "control" means (i) the power, direct or indirect, to cause the
+              direction or management of such entity, whether by contract or
+              otherwise, or (ii) ownership of fifty percent (50%) or more of the
+              outstanding shares, or (iii) beneficial ownership of such entity.
+        
+              "You" (or "Your") shall mean an individual or Legal Entity
+              exercising permissions granted by this License.
+        
+              "Source" form shall mean the preferred form for making modifications,
+              including but not limited to software source code, documentation
+              source, and configuration files.
+        
+              "Object" form shall mean any form resulting from mechanical
+              transformation or translation of a Source form, including but
+              not limited to compiled object code, generated documentation,
+              and conversions to other media types.
+        
+              "Work" shall mean the work of authorship, whether in Source or
+              Object form, made available under the License, as indicated by a
+              copyright notice that is included in or attached to the work
+              (an example is provided in the Appendix below).
+        
+              "Derivative Works" shall mean any work, whether in Source or Object
+              form, that is based on (or derived from) the Work and for which the
+              editorial revisions, annotations, elaborations, or other modifications
+              represent, as a whole, an original work of authorship. For the purposes
+              of this License, Derivative Works shall not include works that remain
+              separable from, or merely link (or bind by name) to the interfaces of,
+              the Work and Derivative Works thereof.
+        
+              "Contribution" shall mean any work of authorship, including
+              the original version of the Work and any modifications or additions
+              to that Work or Derivative Works thereof, that is intentionally
+              submitted to Licensor for inclusion in the Work by the copyright owner
+              or by an individual or Legal Entity authorized to submit on behalf of
+              the copyright owner. For the purposes of this definition, "submitted"
+              means any form of electronic, verbal, or written communication sent
+              to the Licensor or its representatives, including but not limited to
+              communication on electronic mailing lists, source code control systems,
+              and issue tracking systems that are managed by, or on behalf of, the
+              Licensor for the purpose of discussing and improving the Work, but
+              excluding communication that is conspicuously marked or otherwise
+              designated in writing by the copyright owner as "Not a Contribution."
+        
+              "Contributor" shall mean Licensor and any individual or Legal Entity
+              on behalf of whom a Contribution has been received by Licensor and
+              subsequently incorporated within the Work.
+        
+           2. Grant of Copyright License. Subject to the terms and conditions of
+              this License, each Contributor hereby grants to You a perpetual,
+              worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+              copyright license to reproduce, prepare Derivative Works of,
+              publicly display, publicly perform, sublicense, and distribute the
+              Work and such Derivative Works in Source or Object form.
+        
+           3. Grant of Patent License. Subject to the terms and conditions of
+              this License, each Contributor hereby grants to You a perpetual,
+              worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+              (except as stated in this section) patent license to make, have made,
+              use, offer to sell, sell, import, and otherwise transfer the Work,
+              where such license applies only to those patent claims licensable
+              by such Contributor that are necessarily infringed by their
+              Contribution(s) alone or by combination of their Contribution(s)
+              with the Work to which such Contribution(s) was submitted. If You
+              institute patent litigation against any entity (including a
+              cross-claim or counterclaim in a lawsuit) alleging that the Work
+              or a Contribution incorporated within the Work constitutes direct
+              or contributory patent infringement, then any patent licenses
+              granted to You under this License for that Work shall terminate
+              as of the date such litigation is filed.
+        
+           4. Redistribution. You may reproduce and distribute copies of the
+              Work or Derivative Works thereof in any medium, with or without
+              modifications, and in Source or Object form, provided that You
+              meet the following conditions:
+        
+              (a) You must give any other recipients of the Work or
+                  Derivative Works a copy of this License; and
+        
+              (b) You must cause any modified files to carry prominent notices
+                  stating that You changed the files; and
+        
+              (c) You must retain, in the Source form of any Derivative Works
+                  that You distribute, all copyright, patent, trademark, and
+                  attribution notices from the Source form of the Work,
+                  excluding those notices that do not pertain to any part of
+                  the Derivative Works; and
+        
+              (d) If the Work includes a "NOTICE" text file as part of its
+                  distribution, then any Derivative Works that You distribute must
+                  include a readable copy of the attribution notices contained
+                  within such NOTICE file, excluding those notices that do not
+                  pertain to any part of the Derivative Works, in at least one
+                  of the following places: within a NOTICE text file distributed
+                  as part of the Derivative Works; within the Source form or
+                  documentation, if provided along with the Derivative Works; or,
+                  within a display generated by the Derivative Works, if and
+                  wherever such third-party notices normally appear. The contents
+                  of the NOTICE file are for informational purposes only and
+                  do not modify the License. You may add Your own attribution
+                  notices within Derivative Works that You distribute, alongside
+                  or as an addendum to the NOTICE text from the Work, provided
+                  that such additional attribution notices cannot be construed
+                  as modifying the License.
+        
+              You may add Your own copyright statement to Your modifications and
+              may provide additional or different license terms and conditions
+              for use, reproduction, or distribution of Your modifications, or
+              for any such Derivative Works as a whole, provided Your use,
+              reproduction, and distribution of the Work otherwise complies with
+              the conditions stated in this License.
+        
+           5. Submission of Contributions. Unless You explicitly state otherwise,
+              any Contribution intentionally submitted for inclusion in the Work
+              by You to the Licensor shall be under the terms and conditions of
+              this License, without any additional terms or conditions.
+              Notwithstanding the above, nothing herein shall supersede or modify
+              the terms of any separate license agreement you may have executed
+              with Licensor regarding such Contributions.
+        
+           6. Trademarks. This License does not grant permission to use the trade
+              names, trademarks, service marks, or product names of the Licensor,
+              except as required for reasonable and customary use in describing the
+              origin of the Work and reproducing the content of the NOTICE file.
+        
+           7. Disclaimer of Warranty. Unless required by applicable law or
+              agreed to in writing, Licensor provides the Work (and each
+              Contributor provides its Contributions) on an "AS IS" BASIS,
+              WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+              implied, including, without limitation, any warranties or conditions
+              of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+              PARTICULAR PURPOSE. You are solely responsible for determining the
+              appropriateness of using or redistributing the Work and assume any
+              risks associated with Your exercise of permissions under this License.
+        
+           8. Limitation of Liability. In no event and under no legal theory,
+              whether in tort (including negligence), contract, or otherwise,
+              unless required by applicable law (such as deliberate and grossly
+              negligent acts) or agreed to in writing, shall any Contributor be
+              liable to You for damages, including any direct, indirect, special,
+              incidental, or consequential damages of any character arising as a
+              result of this License or out of the use or inability to use the
+              Work (including but not limited to damages for loss of goodwill,
+              work stoppage, computer failure or malfunction, or any and all
+              other commercial damages or losses), even if such Contributor
+              has been advised of the possibility of such damages.
+        
+           9. Accepting Warranty or Additional Liability. While redistributing
+              the Work or Derivative Works thereof, You may choose to offer,
+              and charge a fee for, acceptance of support, warranty, indemnity,
+              or other liability obligations and/or rights consistent with this
+              License. However, in accepting such obligations, You may act only
+              on Your own behalf and on Your sole responsibility, not on behalf
+              of any other Contributor, and only if You agree to indemnify,
+              defend, and hold each Contributor harmless for any liability
+              incurred by, or claims asserted against, such Contributor by reason
+              of your accepting any such warranty or additional liability.
+        
+           END OF TERMS AND CONDITIONS
+        
+           APPENDIX: How to apply the Apache License to your work.
+        
+              To apply the Apache License to your work, attach the following
+              boilerplate notice, with the fields enclosed by brackets "[]"
+              replaced with your own identifying information. (Don't include
+              the brackets!)  The text should be enclosed in the appropriate
+              comment syntax for the file format. We also recommend that a
+              file or class name and description of purpose be included on the
+              same "printed page" as the copyright notice for easier
+              identification within third-party archives.
+        
+           Copyright [yyyy] [name of copyright owner]
+        
+           Licensed under the Apache License, Version 2.0 (the "License");
+           you may not use this file except in compliance with the License.
+           You may obtain a copy of the License at
+        
+               http://www.apache.org/licenses/LICENSE-2.0
+        
+           Unless required by applicable law or agreed to in writing, software
+           distributed under the License is distributed on an "AS IS" BASIS,
+           WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+           See the License for the specific language governing permissions and
+           limitations under the License.
+License-File: LICENSE
+Keywords: equinox,jax,sympy
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Natural Language :: English
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: ~=3.9
+Requires-Dist: equinox>=0.5.3
+Requires-Dist: jax>=0.3.4
+Requires-Dist: sympy>=1.7.1
+Description-Content-Type: text/markdown
+
+<h1 align="center">sympy2jax</h1>
+
+Turn SymPy expressions into trainable JAX expressions. The output will be an [Equinox](https://github.com/patrick-kidger/equinox) module with all SymPy floats (integers, rationals, ...) as leaves. SymPy symbols will be inputs.
+
+Optimise your symbolic expressions via gradient descent!
+
+## Installation
+
+```bash
+pip install sympy2jax
+```
+
+Requires:  
+Python 3.7+  
+JAX 0.3.4+  
+Equinox 0.5.3+  
+SymPy 1.7.1+.
+
+## Example
+
+```python
+import jax
+import sympy
+import sympy2jax
+
+x_sym = sympy.symbols("x_sym")
+cosx = 1.0 * sympy.cos(x_sym)
+sinx = 2.0 * sympy.sin(x_sym)
+mod = sympy2jax.SymbolicModule([cosx, sinx])  # PyTree of input expressions
+
+x = jax.numpy.zeros(3)
+out = mod(x_sym=x)  # PyTree of results.
+params = jax.tree_leaves(mod)  # 1.0 and 2.0 are parameters.
+                               # (Which may be trained in the usual way for Equinox.)
+```
+
+## Documentation
+
+```python
+sympytorch.SymbolicModule(expressions, extra_funcs=None, make_array=True)
+```
+
+Where:
+- `expressions` is a PyTree of SymPy expressions.
+- `extra_funcs` is an optional dictionary from SymPy functions to JAX operations, to extend the built-in translation rules.
+- `make_array` is whether integers/floats/rationals should be stored as Python integers/etc., or as JAX arrays.
+
+Instances can be called with key-value pairs of symbol-value, as in the above example.
+
+Instances have a `.sympy()` method that translates the module back into a PyTree of SymPy expressions.
+
+(That's literally the entire documentation, it's super easy.)
+
+## See also: other libraries in the JAX ecosystem
+
+**Always useful**  
+[Equinox](https://github.com/patrick-kidger/equinox): neural networks and everything not already in core JAX!  
+[jaxtyping](https://github.com/patrick-kidger/jaxtyping): type annotations for shape/dtype of arrays.  
+
+**Deep learning**  
+[Optax](https://github.com/deepmind/optax): first-order gradient (SGD, Adam, ...) optimisers.  
+[Orbax](https://github.com/google/orbax): checkpointing (async/multi-host/multi-device).  
+[Levanter](https://github.com/stanford-crfm/levanter): scalable+reliable training of foundation models (e.g. LLMs).  
+
+**Scientific computing**  
+[Diffrax](https://github.com/patrick-kidger/diffrax): numerical differential equation solvers.  
+[Optimistix](https://github.com/patrick-kidger/optimistix): root finding, minimisation, fixed points, and least squares.  
+[Lineax](https://github.com/patrick-kidger/lineax): linear solvers.  
+[BlackJAX](https://github.com/blackjax-devs/blackjax): probabilistic+Bayesian sampling.  
+[PySR](https://github.com/milesCranmer/PySR): symbolic regression. (Non-JAX honourable mention!)  
+
+**Awesome JAX**  
+[Awesome JAX](https://github.com/n2cholas/awesome-jax): a longer list of other JAX projects.  

sympy2jax-0.0.6.dist-info/RECORD

@@ -0,0 +1,6 @@
+sympy2jax/__init__.py,sha256=KqjLNlIiDATWsPhjPLpG-Hud4HMMuq_DP6sISDWVYQg,720
+sympy2jax/sympy_module.py,sha256=zQwxSeW2GbNWQbvqwYaDq_IFx3gVw0Jwe5d6h_YDJO4,9383
+sympy2jax-0.0.6.dist-info/METADATA,sha256=RG9im4iI-5vriRimeDW8wH3aAiy7V1Gcx2FLOpHfsYk,16559
+sympy2jax-0.0.6.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+sympy2jax-0.0.6.dist-info/licenses/LICENSE,sha256=z8d0m5b2O9McPEK1xHG_dWgUBT6EfBDz6wA0F7xSPTA,11358
+sympy2jax-0.0.6.dist-info/RECORD,,

{sympy2jax-0.0.4.dist-info → sympy2jax-0.0.6.dist-info}/WHEEL

@@ -1,5 +1,4 @@
 Wheel-Version: 1.0
-Generator: bdist_wheel (0.37.1)
+Generator: hatchling 1.27.0
 Root-Is-Purelib: true
 Tag: py3-none-any
-

sympy2jax-0.0.4.dist-info/METADATA

@@ -1,92 +0,0 @@
-Metadata-Version: 2.1
-Name: sympy2jax
-Version: 0.0.4
-Summary: Turn SymPy expressions into trainable JAX expressions.
-Home-page: https://github.com/google/sympy2jax
-Author: Patrick Kidger
-Author-email: contact@kidger.site
-Maintainer: Patrick Kidger
-Maintainer-email: contact@kidger.site
-License: Apache-2.0
-Platform: UNKNOWN
-Classifier: Development Status :: 3 - Alpha
-Classifier: Intended Audience :: Science/Research
-Classifier: License :: OSI Approved :: Apache Software License
-Classifier: Natural Language :: English
-Classifier: Programming Language :: Python :: 3
-Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
-Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: ~=3.7
-Description-Content-Type: text/markdown
-Requires-Dist: equinox (>=0.5.3)
-Requires-Dist: jax (>=0.3.4)
-Requires-Dist: sympy (>=1.7.1)
-
-<h1 align="center">sympy2jax</h1>
-
-Turn SymPy expressions into trainable JAX expressions. The output will be an [Equinox](https://github.com/patrick-kidger/equinox) module with all SymPy floats (integers, rationals, ...) as leaves. SymPy symbols will be inputs.
-
-Optimise your symbolic expressions via gradient descent!
-
-## Installation
-
-```bash
-pip install sympy2jax
-```
-
-Requires:  
-Python 3.7+  
-JAX 0.3.4+  
-Equinox 0.5.3+  
-SymPy 1.7.1+.
-
-## Example
-
-```python
-import jax
-import sympy
-import sympy2jax
-
-x_sym = sympy.symbols("x_sym")
-cosx = 1.0 * sympy.cos(x_sym)
-sinx = 2.0 * sympy.sin(x_sym)
-mod = sympy2jax.SymbolicModule([cosx, sinx])  # PyTree of input expressions
-
-x = jax.numpy.zeros(3)
-out = mod(x_sym=x)  # PyTree of results.
-params = jax.tree_leaves(mod)  # 1.0 and 2.0 are parameters.
-                               # (Which may be trained in the usual way for Equinox.)
-```
-
-## Documentation
-
-```python
-sympytorch.SymbolicModule(expressions, extra_funcs=None, make_array=True)
-```
-
-Where:
-- `expressions` is a PyTree of SymPy expressions.
-- `extra_funcs` is an optional dictionary from SymPy functions to JAX operations, to extend the built-in translation rules.
-- `make_array` is whether integers/floats/rationals should be stored as Python integers/etc., or as JAX arrays.
-
-Instances can be called with key-value pairs of symbol-value, as in the above example.
-
-Instances have a `.sympy()` method that translates the module back into a PyTree of SymPy expressions.
-
-(That's literally the entire documentation, it's super easy.)
-
-## Finally
-
-### See also: other tools in the JAX ecosystem
-
-Neural networks: [Equinox](https://github.com/patrick-kidger/equinox).
-
-Numerical differential equation solvers: [Diffrax](https://github.com/patrick-kidger/diffrax).
-
-Type annotations and runtime checking for PyTrees and shape/dtype of JAX arrays: [jaxtyping](https://github.com/google/jaxtyping). 
-
-### Disclaimer
-
-This is not an official Google product.
-
-

sympy2jax-0.0.4.dist-info/RECORD

@@ -1,7 +0,0 @@
-sympy2jax/__init__.py,sha256=s7exLvdhnQjBFcOz5Qs-K5DpaYjeunNwSK0fm-6dHew,641
-sympy2jax/sympy_module.py,sha256=9rJxrUmkVbj3Rhz4dacOzzhxmc4rQVScIvrtypu1Xok,7884
-sympy2jax-0.0.4.dist-info/LICENSE,sha256=z8d0m5b2O9McPEK1xHG_dWgUBT6EfBDz6wA0F7xSPTA,11358
-sympy2jax-0.0.4.dist-info/METADATA,sha256=mfHkzIfF9rVMuscQv4aaeQGA5RO76b36K-9tb4TqZnU,2823
-sympy2jax-0.0.4.dist-info/WHEEL,sha256=G16H4A3IeoQmnOrYV4ueZGKSjhipXx8zc8nu9FGlvMA,92
-sympy2jax-0.0.4.dist-info/top_level.txt,sha256=90sePp5fhiDuG5-Q1ocMRtZDImhpqSRr_KiV8Kp8TJA,10
-sympy2jax-0.0.4.dist-info/RECORD,,

sympy2jax-0.0.4.dist-info/top_level.txt

@@ -1 +0,0 @@
-sympy2jax