ruff format acts differently under tox ... not sure why

Author: grantjenks

src/sortedcontainers/sortedlist.py

@@ -1450,10 +1450,10 @@ def __imul__(self, num):
         return self
 
     def __make_cmp(seq_op, symbol, doc):
-        'Make comparator method.'
+        "Make comparator method."
 
         def comparer(self, other):
-            'Compare method for sorted list and sequence.'
+            "Compare method for sorted list and sequence."
             if not isinstance(other, Sequence):
                 return NotImplemented
 
@@ -1587,7 +1587,7 @@ def _check(self):
 
 
 def identity(value):
-    'Identity function.'
+    "Identity function."
     return value
 
 
@@ -1658,7 +1658,7 @@ def __new__(cls, iterable=None, key=identity):
 
     @property
     def key(self):
-        'Function used to extract comparison key from values.'
+        "Function used to extract comparison key from values."
         return self._key
 
     def clear(self):

src/sortedcontainers/sortedset.py

@@ -250,10 +250,10 @@ def __delitem__(self, index):
         del _list[index]
 
     def __make_cmp(set_op, symbol, doc):
-        'Make comparator method.'
+        "Make comparator method."
 
         def comparer(self, other):
-            'Compare method for sorted set and set.'
+            "Compare method for sorted set and set."
             if isinstance(other, SortedSet):
                 return set_op(self._set, other._set)
             elif isinstance(other, Set):

tests/benchmark_scale.py

@@ -76,7 +76,7 @@
 
 
 def iter_with_description(iterable, description=''):
-    'Placeholder iterator function with ignored description parameter.'
+    "Placeholder iterator function with ignored description parameter."
     return iter(iterable)
 
 
@@ -119,7 +119,7 @@ def init_sorted_list(sl, size, moment=5, fraction=0.1):
     total = 0
 
     class WhileIterator:
-        'Convert for-loop to while-loop with length estimate.'
+        "Convert for-loop to while-loop with length estimate."
 
         def __iter__(self):
             while total < size:
@@ -171,11 +171,11 @@ def __len__(self):
 
 
 def timeit(func):
-    'Decorator to time function calls.'
+    "Decorator to time function calls."
 
     @ft.wraps(func)
     def wrapper(*args, **kwargs):
-        'Return timed duration of function call. Ignores function result.'
+        "Return timed duration of function call. Ignores function result."
         start = time.perf_counter()
         result = func(*args, **kwargs)
         end = time.perf_counter()
@@ -186,26 +186,26 @@ def wrapper(*args, **kwargs):
 
 @timeit
 def add(obj, numbers):
-    'Repeatedly add number from numbers to sorted list.'
+    "Repeatedly add number from numbers to sorted list."
     for number in PROGRESS(numbers, 'add'):
         obj.add(number)
 
 
 @timeit
 def delitem(obj, indices):
-    'Repeatedly delete values from sorted list by index in indices.'
+    "Repeatedly delete values from sorted list by index in indices."
     for index in PROGRESS(indices, 'del'):
         del obj[index]
 
 
 def randvalues(limit, fraction=0.001):
-    'Return fraction of limit random values between 0 and limit.'
+    "Return fraction of limit random values between 0 and limit."
     iterable = PROGRESS(xrange(int(limit * fraction)), 'randvalues')
     return [random.randrange(limit) for each in iterable]
 
 
 def randindices(limit, fraction=0.002):
-    'Return fraction of limit random indices counting down from limit.'
+    "Return fraction of limit random indices counting down from limit."
     stop = limit - int(limit * fraction)
     iterable = PROGRESS(xrange(limit, stop, -1), 'randindices')
     return [random.randrange(length) for length in iterable]
@@ -278,7 +278,7 @@ def benchmark_del(start, limit, times):
 
 
 def display(name, times, size, last=['', 0]):
-    'Display performance summary with ratio of ops/sec.'
+    "Display performance summary with ratio of ops/sec."
 
     times.sort()
     median_time = times[len(times) / 2]

tests/benchmark_splits_fill.py

@@ -67,7 +67,7 @@
 
 
 class SortedListWithSplits(sc.SortedList):
-    'SortedList that counts splits that occur in _expand.'
+    "SortedList that counts splits that occur in _expand."
 
     def __init__(self, *args, **kwargs):
         self.splits = 0
@@ -80,7 +80,7 @@ def _expand(self, pos):
 
 
 def init_sorted_list(sl, size):
-    'Initialize a SortedList with normally distributed sublist lengths.'
+    "Initialize a SortedList with normally distributed sublist lengths."
     sl.clear()
 
     total = 0
@@ -105,7 +105,7 @@ def init_sorted_list(sl, size):
 
 
 def fill(obj, count, limit):
-    'Repeatedly add random values to the SortedList.'
+    "Repeatedly add random values to the SortedList."
     for each in range(count):
         obj.add(random.randrange(limit))
 

tests/plot_lengths_histogram_add.py

@@ -42,14 +42,14 @@
 
 
 def background():
-    'Plot the background of each animated frame.'
+    "Plot the background of each animated frame."
     hist_line.set_data([], [])
     norm_line.set_data([], [])
     return hist_line, norm_line
 
 
 def frame(num):
-    'Draw frame.'
+    "Draw frame."
     values.update(func() for func in it.repeat(random.random, LOAD))
     data = np.array([len(sublist) for sublist in values._lists])
     hist, bins = np.histogram(data, bins=BINS, normed=True)

tests/plot_lengths_histogram_delitem.py

@@ -15,14 +15,14 @@
 
 
 def background():
-    'Plot the background of each animated frame.'
+    "Plot the background of each animated frame."
     hist_line.set_data([], [])
     norm_line.set_data([], [])
     return hist_line, norm_line
 
 
 def frame(num):
-    'Draw frame.'
+    "Draw frame."
     for value in xrange(LOAD):
         del values[random.randrange(len(values))]
     data = np.array([len(sublist) for sublist in values._lists])

tests/sortedcollection.py

@@ -132,69 +132,69 @@ def __contains__(self, item):
         return item in self._items[i:j]
 
     def index(self, item):
-        'Find the position of an item.  Raise ValueError if not found.'
+        "Find the position of an item.  Raise ValueError if not found."
         k = self._key(item)
         i = bisect_left(self._keys, k)
         j = bisect_right(self._keys, k)
         return self._items[i:j].index(item) + i
 
     def count(self, item):
-        'Return number of occurrences of item'
+        "Return number of occurrences of item"
         k = self._key(item)
         i = bisect_left(self._keys, k)
         j = bisect_right(self._keys, k)
         return self._items[i:j].count(item)
 
     def insert(self, item):
-        'Insert a new item.  If equal keys are found, add to the left'
+        "Insert a new item.  If equal keys are found, add to the left"
         k = self._key(item)
         i = bisect_left(self._keys, k)
         self._keys.insert(i, k)
         self._items.insert(i, item)
 
     def insert_right(self, item):
-        'Insert a new item.  If equal keys are found, add to the right'
+        "Insert a new item.  If equal keys are found, add to the right"
         k = self._key(item)
         i = bisect_right(self._keys, k)
         self._keys.insert(i, k)
         self._items.insert(i, item)
 
     def remove(self, item):
-        'Remove first occurrence of item.  Raise ValueError if not found'
+        "Remove first occurrence of item.  Raise ValueError if not found"
         i = self.index(item)
         del self._keys[i]
         del self._items[i]
 
     def find(self, k):
-        'Return first item with a key == k.  Raise ValueError if not found.'
+        "Return first item with a key == k.  Raise ValueError if not found."
         i = bisect_left(self._keys, k)
         if i != len(self) and self._keys[i] == k:
             return self._items[i]
         raise ValueError(f'No item found with key equal to: {k!r}')
 
     def find_le(self, k):
-        'Return last item with a key <= k.  Raise ValueError if not found.'
+        "Return last item with a key <= k.  Raise ValueError if not found."
         i = bisect_right(self._keys, k)
         if i:
             return self._items[i - 1]
         raise ValueError(f'No item found with key at or below: {k!r}')
 
     def find_lt(self, k):
-        'Return last item with a key < k.  Raise ValueError if not found.'
+        "Return last item with a key < k.  Raise ValueError if not found."
         i = bisect_left(self._keys, k)
         if i:
             return self._items[i - 1]
         raise ValueError(f'No item found with key below: {k!r}')
 
     def find_ge(self, k):
-        'Return first item with a key >= equal to k.  Raise ValueError if not found'
+        "Return first item with a key >= equal to k.  Raise ValueError if not found"
         i = bisect_left(self._keys, k)
         if i != len(self):
             return self._items[i]
         raise ValueError(f'No item found with key at or above: {k!r}')
 
     def find_gt(self, k):
-        'Return first item with a key > k.  Raise ValueError if not found'
+        "Return first item with a key > k.  Raise ValueError if not found"
         i = bisect_right(self._keys, k)
         if i != len(self):
             return self._items[i]
@@ -232,49 +232,49 @@ def __delitem__(self, index):
 if __name__ == '__main__':
 
     def ve2no(f, *args):
-        'Convert ValueError result to -1'
+        "Convert ValueError result to -1"
         try:
             return f(*args)
         except ValueError:
             return -1
 
     def slow_index(seq, k):
-        'Location of match or -1 if not found'
+        "Location of match or -1 if not found"
         for i, item in enumerate(seq):
             if item == k:
                 return i
         return -1
 
     def slow_find(seq, k):
-        'First item with a key equal to k. -1 if not found'
+        "First item with a key equal to k. -1 if not found"
         for item in seq:
             if item == k:
                 return item
         return -1
 
     def slow_find_le(seq, k):
-        'Last item with a key less-than or equal to k.'
+        "Last item with a key less-than or equal to k."
         for item in reversed(seq):
             if item <= k:
                 return item
         return -1
 
     def slow_find_lt(seq, k):
-        'Last item with a key less-than k.'
+        "Last item with a key less-than k."
         for item in reversed(seq):
             if item < k:
                 return item
         return -1
 
     def slow_find_ge(seq, k):
-        'First item with a key-value greater-than or equal to k.'
+        "First item with a key-value greater-than or equal to k."
         for item in seq:
             if item >= k:
                 return item
         return -1
 
     def slow_find_gt(seq, k):
-        'First item with a key-value greater-than or equal to k.'
+        "First item with a key-value greater-than or equal to k."
         for item in seq:
             if item > k:
                 return item

tox.ini

@@ -31,6 +31,7 @@ deps=ruff
 [testenv:ruffformatcheck]
 commands=ruff format --check {toxinidir}
 deps=ruff
+skip_install=True
 
 [testenv:doc8]
 commands=doc8 docs --ignore-path docs/_build