gridpoints 1.0.5__tar.gz → 1.0.6__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {gridpoints-1.0.5 → gridpoints-1.0.6}/PKG-INFO +2 -2
- {gridpoints-1.0.5 → gridpoints-1.0.6}/README.md +1 -1
- {gridpoints-1.0.5 → gridpoints-1.0.6}/pyproject.toml +1 -1
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/griddemo/__init__.py +1 -1
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints/__init__.py +1 -1
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints/mlg_sort.py +1 -1
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints.egg-info/PKG-INFO +2 -2
- {gridpoints-1.0.5 → gridpoints-1.0.6}/LICENSE +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/setup.cfg +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/griddemo/quick_demo.py +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints/array_libs.py +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints/diagonal_tricks.py +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints/kdtree.py +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints.egg-info/SOURCES.txt +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints.egg-info/dependency_links.txt +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints.egg-info/requires.txt +0 -0
- {gridpoints-1.0.5 → gridpoints-1.0.6}/src/gridpoints.egg-info/top_level.txt +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: gridpoints
|
|
3
|
-
Version: 1.0.
|
|
3
|
+
Version: 1.0.6
|
|
4
4
|
Summary: fast multidimensional sorting tool for point clouds using the monotonic lagrangian grid
|
|
5
5
|
Author: Armand de Cacqueray
|
|
6
6
|
License: MIT
|
|
@@ -42,7 +42,7 @@ NaNs and Infs are supported in a consistent manner:
|
|
|
42
42
|
|
|
43
43
|
This allow to gridsort prime or variable number of points N, as long as one is ready to deal with void/special grid cells.
|
|
44
44
|
|
|
45
|
-
Expected runtime for sorting 1 million points: CPU → < 10s, GPU → < 500 ms
|
|
45
|
+
Expected runtime for sorting 1 million points: CPU → < 10s (numpy), GPU → < 500 ms (torch cuda)
|
|
46
46
|
|
|
47
47
|
---
|
|
48
48
|
|
|
@@ -26,7 +26,7 @@ NaNs and Infs are supported in a consistent manner:
|
|
|
26
26
|
|
|
27
27
|
This allow to gridsort prime or variable number of points N, as long as one is ready to deal with void/special grid cells.
|
|
28
28
|
|
|
29
|
-
Expected runtime for sorting 1 million points: CPU → < 10s, GPU → < 500 ms
|
|
29
|
+
Expected runtime for sorting 1 million points: CPU → < 10s (numpy), GPU → < 500 ms (torch cuda)
|
|
30
30
|
|
|
31
31
|
---
|
|
32
32
|
|
|
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
|
|
|
4
4
|
|
|
5
5
|
[project]
|
|
6
6
|
name = "gridpoints"
|
|
7
|
-
version = "1.0.
|
|
7
|
+
version = "1.0.6"
|
|
8
8
|
description = "fast multidimensional sorting tool for point clouds using the monotonic lagrangian grid "
|
|
9
9
|
readme = "README.md"
|
|
10
10
|
requires-python = ">=3.9"
|
|
@@ -84,7 +84,7 @@ def argsort(X, gridshape, verbose = 2, level=2, init="kdtree", n_iter=40):
|
|
|
84
84
|
f"Algorithm failed to converge after {n_iter} iterations.\n " \
|
|
85
85
|
"Consider checking if the grid structure is already suitable \n" \
|
|
86
86
|
"for the given task, which is higly probable, or increase the \n" \
|
|
87
|
-
"`n_iter` parameter if strict convergence is required.\n"
|
|
87
|
+
"`n_iter` parameter if strict convergence is required.\n" \
|
|
88
88
|
"(to shutup this warning, run the sort with verbose <= 1)",
|
|
89
89
|
category=ConvergenceWarning,
|
|
90
90
|
stacklevel=2
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: gridpoints
|
|
3
|
-
Version: 1.0.
|
|
3
|
+
Version: 1.0.6
|
|
4
4
|
Summary: fast multidimensional sorting tool for point clouds using the monotonic lagrangian grid
|
|
5
5
|
Author: Armand de Cacqueray
|
|
6
6
|
License: MIT
|
|
@@ -42,7 +42,7 @@ NaNs and Infs are supported in a consistent manner:
|
|
|
42
42
|
|
|
43
43
|
This allow to gridsort prime or variable number of points N, as long as one is ready to deal with void/special grid cells.
|
|
44
44
|
|
|
45
|
-
Expected runtime for sorting 1 million points: CPU → < 10s, GPU → < 500 ms
|
|
45
|
+
Expected runtime for sorting 1 million points: CPU → < 10s (numpy), GPU → < 500 ms (torch cuda)
|
|
46
46
|
|
|
47
47
|
---
|
|
48
48
|
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|