backrefs 6.1__tar.gz → 7.0__tar.gz

{backrefs-6.1 → backrefs-7.0}/LICENSE.md

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2015 - 2025 Isaac Muse
+Copyright (c) 2015 - 2026 Isaac Muse
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

{backrefs-6.1 → backrefs-7.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: backrefs
-Version: 6.1
+Version: 7.0
 Summary: A wrapper around re and regex that adds additional back references.
 Project-URL: Homepage, https://github.com/facelessuser/backrefs
 Author-email: Isaac Muse <Isaac.Muse@gmail.com>
@@ -13,7 +13,6 @@ Classifier: Intended Audience :: Developers
 Classifier: License :: OSI Approved :: MIT License
 Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
@@ -21,7 +20,7 @@ Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: 3.14
 Classifier: Topic :: Software Development :: Libraries :: Python Modules
 Classifier: Typing :: Typed
-Requires-Python: >=3.9
+Requires-Python: >=3.10
 Provides-Extra: extras
 Requires-Dist: regex; extra == 'extras'
 Description-Content-Type: text/markdown

{backrefs-6.1 → backrefs-7.0}/backrefs/__meta__.py

@@ -193,5 +193,5 @@ def parse_version(ver: str) -> Version:
     return Version(major, minor, micro, release, pre, post, dev)
 
 
-__version_info__ = Version(6, 1, 0, "final")
+__version_info__ = Version(7, 0, 0, "final")
 __version__ = __version_info__._get_canonical()

{backrefs-6.1 → backrefs-7.0}/backrefs/_bre_parse.py

@@ -81,7 +81,6 @@ class _SearchParser(Generic[AnyStr]):
     """Search Template."""
 
     _new_refs = ("c", "C", "e", "E", "h", "l", "L", "m", "M", "N", "p", "P", "Q", "R", "X")
-    _re_escape = r"\x1b"
     _re_start_wb = r"\b(?=\w)"
     _re_end_wb = r"\b(?<=\w)"
     _line_break = r'(?:\r\n|(?!\r\n)[\n\v\f\r\x85\u2028\u2029])'
@@ -307,14 +306,6 @@ class _SearchParser(Generic[AnyStr]):
             no_mark = self.unicode_props("^m", None, in_group=False)[0]
             mark = self.unicode_props("m", None, in_group=False)[0]
             current.extend(self._grapheme_cluster.format(no_mark, mark, mark))
-        elif t == "e":
-            _util.warn_deprecated(R"The \e reference has been deprecated, please use \x1b instead")
-            current.append(self._re_escape)
-        elif t == "h":
-            _util.warn_deprecated(R"The \h reference has been deprecated, please use \p{Horiz_Space} instead")
-            current.extend(self.unicode_props('blank', None, in_group=in_group))
-            if in_group:
-                self.found_property = True
         elif t == 'p':
             prop = self.get_unicode_property(i)
             current.extend(self.unicode_props(prop[0], prop[1], in_group=in_group))

{backrefs-6.1 → backrefs-7.0}/backrefs/_bregex_parse.py

@@ -71,7 +71,6 @@ class _SearchParser(Generic[AnyStr]):
     """Search Template."""
 
     _new_refs = ("e", "R", "Q", "E")
-    _re_escape = r"\x1b"
     _line_break = r'(?>\r\n|[\n\v\f\r\x85\u2028\u2029])'
     _bytes_line_break = r'(?>\r\n|[\n\v\f\r\x85])'
 
@@ -199,9 +198,6 @@ class _SearchParser(Generic[AnyStr]):
 
         if not in_group and t == "R":
             current.append(self._re_line_break)
-        elif t == 'e':
-            _util.warn_deprecated(R"The \e reference has been deprecated, please use \x1b instead")
-            current.extend(self._re_escape)
         else:
             current.extend(["\\", t])
         return current

{backrefs-6.1 → backrefs-7.0}/backrefs/bre.py

@@ -477,7 +477,7 @@ def search(
     return _re.search(_apply_search_backrefs(pattern, flags), string, flags, *args, **kwargs)
 
 
-def match(
+def prefixmatch(
     pattern: AnyStr | Pattern[AnyStr] | Bre[AnyStr],
     string: AnyStr,
     flags: int | _re.RegexFlag = 0,
@@ -488,6 +488,9 @@ def match(
     return _re.match(_apply_search_backrefs(pattern, flags), string, flags=flags, **kwargs)
 
 
+match = prefixmatch
+
+
 def fullmatch(
     pattern: AnyStr | Pattern[AnyStr] | Bre[AnyStr],
     string: AnyStr,

{backrefs-6.1 → backrefs-7.0}/backrefs/bregex.py

@@ -498,7 +498,7 @@ def expandf(m: Match[AnyStr] | None, repl: ReplaceTemplate[AnyStr] | AnyStr) ->
     return _apply_replace_backrefs(m, repl, flags=FORMAT)
 
 
-def match(
+def prefixmatch(
     pattern: AnyStr | Pattern[AnyStr] | Bregex[AnyStr],
     string: AnyStr,
     flags: int = 0,
@@ -513,6 +513,9 @@ def match(
     )
 
 
+match = prefixmatch
+
+
 def fullmatch(
     pattern: AnyStr | Pattern[AnyStr] | Bregex[AnyStr],
     string: AnyStr,