Merge pull request #140 from nschloe/args

args -> *args

Author: nschloe

justfile

@@ -1,9 +1,11 @@
+version := `python3 -c "from src.perfplot.__about__ import __version__; print(__version__)"`
+
 default:
 @echo "\"just publish\"?"
 
 publish:
 @if [ "$(git rev-parse --abbrev-ref HEAD)" != "main" ]; then exit 1; fi
-gh release create
+gh release create "v{{version}}"
 flit publish
 
 clean:

src/perfplot/__about__.py

@@ -0,0 +1 @@
+__version__ = "0.10.0"

src/perfplot/__init__.py

@@ -1,5 +1,4 @@
+from .__about__ import __version__
 from ._main import bench, live, plot, save, show
 
-__version__ = "0.9.15"
-
 __all__ = ["bench", "plot", "show", "save", "live", "__version__"]

src/perfplot/_main.py

@@ -218,6 +218,8 @@ def __next__(self):
  data = None
  if callable(self.setup):
  data = self.setup(n)
+ if not isinstance(data, tuple):
+ data = (data,)
 
  reference = None
  timings = []
@@ -230,6 +232,8 @@ def __next__(self):
 
  if isinstance(self.setup, list):
  data = self.setup[k](n)
+ if not isinstance(data, tuple):
+ data = (data,)
 
  # First let the function run once. The value is used for the equality_check
  # and the time for gauging how many more repetitions are to be done. If the
@@ -239,7 +243,7 @@ def __next__(self):
  # up first. The actual times are only reached after a few hundred
  # nanoseconds of computation. Most of the time it's okay though.
  t0_ns = time.perf_counter_ns()
- val = kernel(data)
+ val = kernel(*data)
  t1_ns = time.perf_counter_ns()
  t_ns = t1_ns - t0_ns
 
@@ -298,7 +302,7 @@ def _b(data, kernel: Callable, repeat: int):
  while min_timing_ns <= required_timing_ns:
  tm = np.array(
  timeit.repeat(
- stmt=lambda: kernel(data),
+ stmt=lambda: kernel(*data),
  repeat=repeat,
  number=number,
  timer=time.perf_counter_ns,