pyintervals 1.0.0__tar.gz → 1.0.2__tar.gz

{pyintervals-1.0.0 → pyintervals-1.0.2}/PKG-INFO

@@ -1,8 +1,7 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.3
 Name: pyintervals
-Version: 1.0.0
+Version: 1.0.2
 Summary: Efficient interval operations.
-Home-page: https://github.com/serkankalay/pyintervals
 License: MIT
 Keywords: interval,timespan
 Author: Serkan Kalay
@@ -14,7 +13,7 @@ Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
-Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.13
 Requires-Dist: importlib-metadata (>=1,<5) ; python_version < "3.8"
 Requires-Dist: sortedcontainers (>=2.4.0,<3.0.0)
 Requires-Dist: sortedcontainers-stubs (>=2.4.2,<3.0.0)
@@ -126,7 +125,7 @@ If you want to programatically check whether the shop is open at a given time **
 you need to iterate over `all (in the worst case)` the time intervals the patisserie is open
 for the time you are curious about, 12:30 in this case. This will take `O(n)` time.
 
-Linear time is nice but can we not improve it? Well, with **pyintervals**, you can! `(with an upcoming feature)`
+Linear time is nice but can we not improve it? Well, with **pyintervals**, you can!
 What we essentially are curious about is the status of that beautiful store at a given time.
 **pintervals** `will` allow you fetch this value in `O(log n)` time.
 

{pyintervals-1.0.0 → pyintervals-1.0.2}/README.rst

@@ -103,7 +103,7 @@ If you want to programatically check whether the shop is open at a given time **
 you need to iterate over `all (in the worst case)` the time intervals the patisserie is open
 for the time you are curious about, 12:30 in this case. This will take `O(n)` time.
 
-Linear time is nice but can we not improve it? Well, with **pyintervals**, you can! `(with an upcoming feature)`
+Linear time is nice but can we not improve it? Well, with **pyintervals**, you can!
 What we essentially are curious about is the status of that beautiful store at a given time.
 **pintervals** `will` allow you fetch this value in `O(log n)` time.
 

{pyintervals-1.0.0 → pyintervals-1.0.2}/pyproject.toml

@@ -1,15 +1,15 @@
 [tool.poetry]
 name = "pyintervals"
-version = "1.0.0"
+version = "1.0.2"
 description = "Efficient interval operations."
 authors = ["Serkan Kalay <serkanosmankalay@gmail.com>"]
 license = "MIT"
 classifiers = [
-    "Programming Language :: Python :: 3.8",
     "Programming Language :: Python :: 3.9",
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
 ]
 readme = "README.rst"
 packages = [

{pyintervals-1.0.0 → pyintervals-1.0.2}/src/pyintervals/interval.py

@@ -67,11 +67,9 @@ def overlaps(interval: Interval, other: Interval) -> bool:
 
 
 def contains(interval: Interval, other: Interval) -> bool:
-    # If at least one is degenerate, then we can check with overlaps.
-    if interval.is_degenerate() or other.is_degenerate():
+    # If the other interval is degenerate, then we can check with overlaps.
+    if other.is_degenerate():
         return overlaps(interval, other)
 
-    # We have 2 non-degenerate intervals. We take them in order
-    # and check whether first includes other.
-    first, second = _get_ordered(interval, other)
-    return first.start <= other.start and first.end >= second.end
+    # We have at least one non-degenerate interval.
+    return interval.start <= other.start and interval.end >= other.end