discrete-ndtree 0.2.3__tar.gz

discrete_ndtree-0.2.3/LICENSE

@@ -0,0 +1,191 @@
+
+                                 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
+
+   Copyright 2024 Kay Richter
+
+   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.

discrete_ndtree-0.2.3/MANIFEST.in

@@ -0,0 +1,2 @@
+graft discrete_ndtree
+global-exclude *.so *.pyd

discrete_ndtree-0.2.3/PKG-INFO

@@ -0,0 +1,105 @@
+Metadata-Version: 2.1
+Name: discrete_ndtree
+Version: 0.2.3
+Summary: N-Dimensional Dtree (e.g. Quadtree, Octree) with limited resolution.
+Author: Kay Richter
+License: Apache-2.0
+Project-URL: Repository, https://github.com/KayRichter/nim-dtree
+Project-URL: Issues, https://github.com/KayRichter/nim-dtree/issues
+Keywords: quadtree,octree,nim
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Intended Audience :: Developers
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# discrete_ndtree
+
+This package provides N-Dimensional trees (e.g. Quadtree, Octree) with a limited smallest node size.
+Opposed to normal ND-Trees, nearby coordinates may access the same cell.
+Example usecases:
+- occupancy maps for 2D and 3D
+- canvas for images without borders
+- timeline of daily temperatures
+
+
+## Usage
+
+```python
+from discrete_ndtree import DTree
+
+
+# create a quadtree with a smallest cell size of 0.5
+quad_tree = DTree(2, 0.5)
+
+# reading and writing cells can be done using the subscript operator
+# the default cell content is `None`
+assert quad_tree[0.0, 0.0] is None
+quad_tree[0.0, 0.0] = "value"
+assert quad_tree[0.0, 0.0] == "value"
+
+# since the cell size is limited, other nearby coordinates may access the same cell
+assert quad_tree[0.4, 0.4] == "value"
+
+# by default the corner of the root of the tree is at the coordinate origin
+# a different point can be set using the `anchor` parameter
+quad_tree = DTree(2, 0.5, anchor=[0.2, 0.2])
+quad_tree[0.0, 0.0] = "value"
+assert quad_tree[0.4, 0.4] is None  # coordinate is a different cell now
+
+# also the default value for all cells can be changed
+quad_tree = DTree(2, 0.5, default=0)
+assert quad_tree[0.0, 0.0] == 0
+
+# it is also possible to get ranges of cells from the tree
+# note that the results includes both ends of the slice
+assert quad_tree[0.1:0.9, 0.1:0.9] == [[0, 0], [0, 0]]
+```
+
+
+## Installation
+
+Precompiled wheels are available for Linux (glibc and musl), macOS, and Windows:
+
+```bash
+pip install discrete-ndtree
+```
+
+The wheels ship with dimensions 1-4 precompiled.
+Other dimensions are compiled on demand (see [More dimensions](#more-dimensions)).
+
+## More dimensions
+
+Dimensions 1-4 are precompiled; any other dimension is compiled on first use:
+
+```python
+from discrete_ndtree import DTree
+
+six_dim_tree = DTree(6, 1.0, anchor=[1.0, -2.0, 3.0, -4.0, 5.0, -6.0], default=False)
+assert six_dim_tree[0.0, 0.0, 0.0, 0.0, 0.0, 0.0] == False
+```
+
+The first construction of a tree with an uncompiled dimension compiles a
+`nim_dtree_dim_<dims>.so` (`.pyd` on Windows) into the `discrete_ndtree` package
+directory, so that directory must be writable.
+This requires a working [Nim compiler](https://nim-lang.org/) (>= 2.2.4) and
+the `nimpy` and `msgpack4nim` packages:
+
+```bash
+nimble install nimpy msgpack4nim
+```
+
+Nim and the nimble package manager can be installed using [choosenim](https://github.com/nim-lang/choosenim)
+To compile dimensions ahead of time, or to bundle several dimensions into one
+binary, use `compile_dimensions`:
+
+```python
+from discrete_ndtree import discrete_ndtree
+
+discrete_ndtree.compile_dimensions([6])  # or e.g. [5, 6, 7]
+```
+
+More low level access to the trees is not recommended, but available through
+```python
+from discrete_ndtree import discrete_ndtree
+```

discrete_ndtree-0.2.3/README.md

@@ -0,0 +1,90 @@
+# discrete_ndtree
+
+This package provides N-Dimensional trees (e.g. Quadtree, Octree) with a limited smallest node size.
+Opposed to normal ND-Trees, nearby coordinates may access the same cell.
+Example usecases:
+- occupancy maps for 2D and 3D
+- canvas for images without borders
+- timeline of daily temperatures
+
+
+## Usage
+
+```python
+from discrete_ndtree import DTree
+
+
+# create a quadtree with a smallest cell size of 0.5
+quad_tree = DTree(2, 0.5)
+
+# reading and writing cells can be done using the subscript operator
+# the default cell content is `None`
+assert quad_tree[0.0, 0.0] is None
+quad_tree[0.0, 0.0] = "value"
+assert quad_tree[0.0, 0.0] == "value"
+
+# since the cell size is limited, other nearby coordinates may access the same cell
+assert quad_tree[0.4, 0.4] == "value"
+
+# by default the corner of the root of the tree is at the coordinate origin
+# a different point can be set using the `anchor` parameter
+quad_tree = DTree(2, 0.5, anchor=[0.2, 0.2])
+quad_tree[0.0, 0.0] = "value"
+assert quad_tree[0.4, 0.4] is None  # coordinate is a different cell now
+
+# also the default value for all cells can be changed
+quad_tree = DTree(2, 0.5, default=0)
+assert quad_tree[0.0, 0.0] == 0
+
+# it is also possible to get ranges of cells from the tree
+# note that the results includes both ends of the slice
+assert quad_tree[0.1:0.9, 0.1:0.9] == [[0, 0], [0, 0]]
+```
+
+
+## Installation
+
+Precompiled wheels are available for Linux (glibc and musl), macOS, and Windows:
+
+```bash
+pip install discrete-ndtree
+```
+
+The wheels ship with dimensions 1-4 precompiled.
+Other dimensions are compiled on demand (see [More dimensions](#more-dimensions)).
+
+## More dimensions
+
+Dimensions 1-4 are precompiled; any other dimension is compiled on first use:
+
+```python
+from discrete_ndtree import DTree
+
+six_dim_tree = DTree(6, 1.0, anchor=[1.0, -2.0, 3.0, -4.0, 5.0, -6.0], default=False)
+assert six_dim_tree[0.0, 0.0, 0.0, 0.0, 0.0, 0.0] == False
+```
+
+The first construction of a tree with an uncompiled dimension compiles a
+`nim_dtree_dim_<dims>.so` (`.pyd` on Windows) into the `discrete_ndtree` package
+directory, so that directory must be writable.
+This requires a working [Nim compiler](https://nim-lang.org/) (>= 2.2.4) and
+the `nimpy` and `msgpack4nim` packages:
+
+```bash
+nimble install nimpy msgpack4nim
+```
+
+Nim and the nimble package manager can be installed using [choosenim](https://github.com/nim-lang/choosenim)
+To compile dimensions ahead of time, or to bundle several dimensions into one
+binary, use `compile_dimensions`:
+
+```python
+from discrete_ndtree import discrete_ndtree
+
+discrete_ndtree.compile_dimensions([6])  # or e.g. [5, 6, 7]
+```
+
+More low level access to the trees is not recommended, but available through
+```python
+from discrete_ndtree import discrete_ndtree
+```

discrete_ndtree-0.2.3/discrete_ndtree/__init__.py

@@ -0,0 +1 @@
+from .discrete_ndtree import DTree

discrete_ndtree-0.2.3/discrete_ndtree/discrete_ndtree.py

@@ -0,0 +1,229 @@
+from typing import Any, List, Optional, Union
+from pathlib import Path
+import importlib
+import subprocess
+from sys import platform
+import shutil
+
+
+def compile_dimensions(dimensions: List[int] = [1, 2, 3, 4], print_command: bool = False):
+    dims_str = ",".join([str(i) for i in dimensions])
+    dims_name = "_".join([str(i) for i in dimensions])
+
+    current_path = Path(__file__).absolute().parent
+    target_filename = f"nim_dtree_dim_{dims_name}"
+    source_path = current_path / "nim_dtree_python_bindings.nim"
+    new_source_path = current_path / f"{target_filename}.nim"
+    shutil.copy2(source_path, new_source_path)
+
+    params = ["nim", "c", "-d:release", "--app:lib", "--threads:on", f"-d:targetedDimensions={dims_str}"]
+    if platform in ["linux", "darwin"]:
+        params.append("--out:" + str(current_path / f"{target_filename}.so"))
+    else:
+        params = params + [
+            "--out:" + str(current_path / f"{target_filename}.pyd"),
+            "--tlsEmulation:off",
+            "--passL:-static"
+        ]
+    params.append(str(current_path / new_source_path))
+
+    if print_command:
+        print("Compiling bindings using this command: \"", " ".join(params), "\"", sep="")
+    result = subprocess.run(params, stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE, text=True)
+    if result.returncode != 0:
+        print(f"Failed to compile {target_filename} (exit code {result.returncode}):")
+        print(result.stdout)
+        print(result.stderr)
+        raise RuntimeError(f"Failed to compile {target_filename}: nim exited with code {result.returncode}")
+
+    new_source_path.unlink()
+
+    _update_dimensions_binary_mapping(str(target_filename))
+
+
+DTreeCoord = List[float]
+DTreeKey = List[int]
+
+# raw python bindings can be seen in nim_dtree_python_bindings.nim`
+
+class DTreeClimber:
+    """
+    Low level access to the underlying data structure.
+    Usually you get this using the `getNode` method of `DTree`.
+    """
+    def __init__(self, climber):
+        self._climber = climber
+
+    def level(self) -> int:
+        """How many levels until smallest leafs"""
+        return self._climber.getLevel()
+
+    def size(self) -> float:
+        """Size of currently covered per dimension by the node"""
+        return self._climber.size()
+
+    def hasData(self) -> bool:
+        """Check if the current node has stored any data"""
+        return self._climber.hasData()
+
+    def getData(self):
+        """Get the currently stored data.
+        Returns the default value if no data is stored and
+        a default value was given in the QuadTree constructor"""
+        return self._climber.getData()
+
+    def setData(self, value):
+        """Write data to the current node"""
+        return self._climber.setData(value)
+
+    def hasChildren(self) -> bool:
+        """Check if hte current node has children"""
+        return self._climber.hasChildren()
+
+    def climb(self, childIndex, creative: bool = True):
+        """Climber climbs from current node to the next as given in parameter.
+        If this node has no children and `creative` is true,
+        children are created beforehand."""
+        if creative:
+            self._climber.creativeClimb(childIndex)
+        else:
+            self._climber.climb(childIndex)
+
+    def climbClone(self, childIndex, creative: bool = True):
+        """Creates a new climber, which is located at the child node as given in parameter.
+        If this node has no children and `creative` is true,
+        children are created beforehand."""
+        if creative:
+            return DTreeClimber(self._climber.creativeClimbClone(childIndex))
+        else:
+            return DTreeClimber(self._climber.climbClone(childIndex))
+
+
+class DTree:
+    """
+    Wrapper for a more pythonic interface of the underlying datastructure.
+    """
+    def __init__(self, dimensions: int, min_cell_size: float, anchor: Optional[List[float]] = None, default: Optional[Any] = None):
+        """Construct a DTree."""
+        if dimensions not in _dimensions_binary_mapping:
+            compile_dimensions([dimensions])
+        module = _dimensions_binary_mapping[dimensions]
+        if anchor is None:
+            instance = module.__dict__[f"newDTree{dimensions}D"](min_cell_size, default)
+        else:
+            assert dimensions == len(anchor), f"Dimensions of parameters do not match. {dimensions} dimensions were requested, but anchor has only {len(anchor)} dimensions."
+            instance = module.__dict__[f"newDTree{dimensions}AD"](min_cell_size, anchor, default)
+
+        self._tree = instance
+        self.dimensions = dimensions
+
+    def anchor(self) -> DTreeCoord:
+        """This is the currently smallest coordinate covered"""
+        return self._tree.anchor()
+
+    def minNodeSize(self) -> float:
+        """Size of the smalles node (at level 0)"""
+        return self._tree.minNodeSize()
+
+    def depth(self) -> int:
+        """How many levels until smallest leafs"""
+        return self._tree.depth()
+
+    def size(self) -> float:
+        """Size of currently covered per dimension by the tree"""
+        return self._tree.size()
+
+    def __getitem__(self, key):
+        """
+        Get the data stored at the leaf node specified in parameters.
+        """
+
+        level = 0
+        if len(key) - self._tree.dimensions() == 1:
+            level = key[-1]
+            key = key[:-1]
+
+        if any([type(elem) is slice for elem in key]):
+            mins = []
+            maxs = []
+            for elem in key:
+                if type(elem) is slice:
+                    mins.append(elem.start)
+                    maxs.append(elem.stop)
+                else:
+                    mins.append(elem)
+                    maxs.append(elem)
+
+            return self._tree.getRange(mins, maxs)
+
+        else:
+            return self._tree.getNodeByCoord(key, level).getData()
+
+    def __setitem__(self, key, data):
+        """
+        Set the data stored at the leaf node specified in parameters.
+        """
+
+        level = 0
+        if len(key) - self._tree.dimensions() == 1:
+            level = key[-1]
+            key = key[:-1]
+
+        return self._tree.createNodeByCoord(key, level).setData(data)
+
+    def getNode(self, key: Union[DTreeKey, DTreeCoord], level: int = 0) -> DTreeClimber:
+        """
+        Get access to node at specified level.
+        Does not create nodes if they do not exist and instead returns the closest existing node
+        """
+
+        if key[0] is float:
+            return self._tree.getNodeByCoord(key, level)
+        else:
+            return self._tree.getNodeByKey(key, level)
+
+    def createNode(self, key: Union[DTreeKey, DTreeCoord], level: int = 0) -> DTreeClimber:
+        """
+        Get access to node at specified level.
+        Creates nodes if they do not exist.
+        """
+
+        if key[0] is float:
+            return self._tree.createNodeByCoord(key, level)
+        else:
+            return self._tree.createNodeByKey(key, level)
+
+    def serialize(self) -> bytes:
+        return self._tree.serialize()
+
+    def deserialize(self, bytes):
+        return self._tree.deserialize(bytes)
+
+    def __getstate__(self):
+        return (self.dimensions, self.serialize())
+
+    def __setstate__(self, state):
+        self.dimensions, tree_serialization = state
+        module = _dimensions_binary_mapping[self.dimensions]
+        self._tree = module.__dict__[f"newDTree{self.dimensions}"](1.0)
+        self.deserialize(tree_serialization)
+
+
+def _update_dimensions_binary_mapping(module_name: str):
+    global _dimensions_binary_mapping
+    discrete_ndtree_dim = importlib.import_module("." + module_name, __package__)
+    for dims in discrete_ndtree_dim.get_all_dimensions():
+        if dims in _dimensions_binary_mapping:
+            continue
+        else:
+            _dimensions_binary_mapping[dims] = discrete_ndtree_dim
+
+
+_dimensions_binary_mapping = {}
+
+if platform in ["linux", "darwin"]:
+    for module in Path(__file__).absolute().parent.glob("nim_dtree_*.so"):
+        _update_dimensions_binary_mapping(module.stem)
+else:
+    for module in Path(__file__).absolute().parent.glob("nim_dtree_*.pyd"):
+        _update_dimensions_binary_mapping(module.stem)

discrete_ndtree-0.2.3/discrete_ndtree/nim_dtree/dtree_math.nim

@@ -0,0 +1,56 @@
+import std/[math, sequtils]
+
+type Vector*[D: static[int], T] = array[D, T]
+
+converter toVector*[D: static[int], T](v: array[D, T]): Vector[D, T] =
+  Vector[D, T](v)
+
+func `+`*[D: static[int], T](left, right: Vector[D, T]): Vector[D, T] =
+  for i, (l, r) in zip(left, right):
+    result[i] = l + r
+
+func `+`*[D: static[int], T](left: Vector[D, T], right: T): Vector[D, T] =
+  for i in 0 ..< D:
+    result[i] = left[i] + right
+
+func `+`*[D: static[int], T](left: T, right: Vector[D, T]): Vector[D, T] =
+  right + left
+
+func `-`*[D: static[int], T](left, right: Vector[D, T]): Vector[D, T] =
+  for i, (l, r) in zip(left, right):
+    result[i] = l - r
+
+func `*`*[D: static[int], T](left, right: Vector[D, T]): Vector[D, T] =
+  for i, (l, r) in zip(left, right):
+    result[i] = l * r
+
+func `*`*[D: static[int], T](left: Vector[D, T], v: T): Vector[D, T] =
+  for i in 0 ..< D:
+    result[i] = left[i] * v
+
+func `*`*[D: static[int], T](left: T, right: Vector[D, T]): Vector[D, T] =
+  right * left
+
+## Calculates euclidean norm
+func norm*[D: static[int], T](vector: Vector[D, T]): T =
+  (vector * vector).sum().sqrt()
+
+func dot*[D: static[int], T](left, right: Vector[D, T]): T =
+  let mul = (left * right)
+  for v in mul:
+    result = result + v
+
+func angle*[D: static[int], T](left, right: Vector[D, T]): T =
+  arccos(dot(left, right) / (left.norm() * right.norm()))
+
+func anyLower*[D: static[int], T](isThis, lowerThanThis: openArray[T]): bool =
+  for i in 0 ..< D:
+    if isThis[i] < lowerThanThis[i]:
+      return true
+  return false
+
+func anyLowerEqual*[D: static[int], T](isThis, lowerThanThis: openArray[T]): bool =
+  for i in 0 ..< D:
+    if isThis[i] <= lowerThanThis[i]:
+      return true
+  return false