-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
Copy pathprovider.py
955 lines (810 loc) · 36.8 KB
/
provider.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
from __future__ import annotations
import itertools
import logging
import re
import time
from collections import defaultdict
from contextlib import contextmanager
from typing import TYPE_CHECKING
from typing import ClassVar
from typing import cast
from cleo.ui.progress_indicator import ProgressIndicator
from poetry.core.constraints.version import EmptyConstraint
from poetry.core.constraints.version import Version
from poetry.core.constraints.version import VersionRange
from poetry.core.packages.utils.utils import get_python_constraint_from_marker
from poetry.core.version.markers import AnyMarker
from poetry.core.version.markers import union as marker_union
from poetry.mixology.incompatibility import Incompatibility
from poetry.mixology.incompatibility_cause import DependencyCauseError
from poetry.mixology.incompatibility_cause import PythonCauseError
from poetry.mixology.term import Term
from poetry.packages import DependencyPackage
from poetry.packages.direct_origin import DirectOrigin
from poetry.packages.package_collection import PackageCollection
from poetry.puzzle.exceptions import OverrideNeededError
from poetry.repositories.exceptions import PackageNotFoundError
from poetry.utils.helpers import get_file_hash
if TYPE_CHECKING:
from collections.abc import Callable
from collections.abc import Collection
from collections.abc import Iterable
from collections.abc import Iterator
from pathlib import Path
from cleo.io.io import IO
from packaging.utils import NormalizedName
from poetry.core.constraints.version import VersionConstraint
from poetry.core.packages.dependency import Dependency
from poetry.core.packages.directory_dependency import DirectoryDependency
from poetry.core.packages.file_dependency import FileDependency
from poetry.core.packages.package import Package
from poetry.core.packages.url_dependency import URLDependency
from poetry.core.packages.vcs_dependency import VCSDependency
from poetry.core.version.markers import BaseMarker
from poetry.repositories import RepositoryPool
from poetry.utils.env import Env
logger = logging.getLogger(__name__)
class IncompatibleConstraintsError(Exception):
"""
Exception when there are duplicate dependencies with incompatible constraints.
"""
def __init__(
self, package: Package, *dependencies: Dependency, with_sources: bool = False
) -> None:
constraints = []
for dep in dependencies:
constraint = dep.to_pep_508()
if dep.is_direct_origin():
# add version info because issue might be a version conflict
# with a version constraint
constraint += f" ({dep.constraint})"
if with_sources and dep.source_name:
constraint += f" ; source={dep.source_name}"
constraints.append(constraint)
super().__init__(
f"Incompatible constraints in requirements of {package}:\n"
+ "\n".join(constraints)
)
class Indicator(ProgressIndicator):
CONTEXT: str | None = None
@staticmethod
@contextmanager
def context() -> Iterator[Callable[[str | None], None]]:
def _set_context(context: str | None) -> None:
Indicator.CONTEXT = context
yield _set_context
_set_context(None)
def _formatter_context(self) -> str:
if Indicator.CONTEXT is None:
return " "
else:
return f" <c1>{Indicator.CONTEXT}</> "
def _formatter_elapsed(self) -> str:
assert self._start_time is not None
elapsed = time.time() - self._start_time
return f"{elapsed:.1f}s"
class Provider:
UNSAFE_PACKAGES: ClassVar[set[str]] = set()
def __init__(
self,
package: Package,
pool: RepositoryPool,
io: IO,
*,
installed: list[Package] | None = None,
locked: list[Package] | None = None,
) -> None:
self._package = package
self._pool = pool
self._direct_origin = DirectOrigin(self._pool.artifact_cache)
self._io = io
self._env: Env | None = None
self._python_constraint = package.python_constraint
self._is_debugging: bool = self._io.is_debug() or self._io.is_very_verbose()
self._overrides: dict[Package, dict[str, Dependency]] = {}
self._deferred_cache: dict[Dependency, Package] = {}
self._load_deferred = True
self._source_root: Path | None = None
self._installed_packages = installed if installed is not None else []
self._direct_origin_packages: dict[str, Package] = {}
self._locked: dict[NormalizedName, list[DependencyPackage]] = defaultdict(list)
self._use_latest: Collection[NormalizedName] = []
self._explicit_sources: dict[str, str] = {}
for package in locked or []:
self._locked[package.name].append(
DependencyPackage(package.to_dependency(), package)
)
for dependency_packages in self._locked.values():
dependency_packages.sort(
key=lambda p: p.package.version,
reverse=True,
)
@property
def pool(self) -> RepositoryPool:
return self._pool
@property
def use_latest(self) -> Collection[NormalizedName]:
return self._use_latest
def is_debugging(self) -> bool:
return self._is_debugging
def set_overrides(self, overrides: dict[Package, dict[str, Dependency]]) -> None:
self._overrides = overrides
def load_deferred(self, load_deferred: bool) -> None:
self._load_deferred = load_deferred
@contextmanager
def use_source_root(self, source_root: Path) -> Iterator[Provider]:
original_source_root = self._source_root
self._source_root = source_root
try:
yield self
finally:
self._source_root = original_source_root
@contextmanager
def use_environment(self, env: Env) -> Iterator[Provider]:
original_python_constraint = self._python_constraint
self._env = env
self._python_constraint = Version.parse(env.marker_env["python_full_version"])
try:
yield self
finally:
self._env = None
self._python_constraint = original_python_constraint
@contextmanager
def use_latest_for(self, names: Collection[NormalizedName]) -> Iterator[Provider]:
self._use_latest = names
try:
yield self
finally:
self._use_latest = []
@staticmethod
def validate_package_for_dependency(
dependency: Dependency, package: Package
) -> None:
if dependency.name != package.name:
# For now, the dependency's name must match the actual package's name
raise RuntimeError(
f"The dependency name for {dependency.name} does not match the actual"
f" package's name: {package.name}"
)
def search_for_installed_packages(
self,
dependency: Dependency,
) -> list[Package]:
"""
Search for installed packages, when available, that satisfy the given
dependency.
This is useful when dealing with packages that are under development, not
published on package sources and/or only available via system installations.
"""
if not self._installed_packages:
return []
logger.debug(
"Falling back to installed packages to discover metadata for <c2>%s</>",
dependency.complete_name,
)
packages = [
package
for package in self._installed_packages
if package.satisfies(dependency, ignore_source_type=True)
]
logger.debug(
"Found <c2>%d</> compatible packages for <c2>%s</>",
len(packages),
dependency.complete_name,
)
return packages
def search_for_direct_origin_dependency(self, dependency: Dependency) -> Package:
package = self._deferred_cache.get(dependency)
if package is not None:
pass
elif dependency.is_vcs():
dependency = cast("VCSDependency", dependency)
package = self._search_for_vcs(dependency)
elif dependency.is_file():
dependency = cast("FileDependency", dependency)
package = self._search_for_file(dependency)
elif dependency.is_directory():
dependency = cast("DirectoryDependency", dependency)
package = self._search_for_directory(dependency)
elif dependency.is_url():
dependency = cast("URLDependency", dependency)
package = self._search_for_url(dependency)
else:
raise RuntimeError(
f"{dependency}: unknown direct dependency type {dependency.source_type}"
)
if dependency.is_vcs():
dependency._source_reference = package.source_reference
dependency._source_resolved_reference = package.source_resolved_reference
dependency._source_subdirectory = package.source_subdirectory
dependency._constraint = package.version
dependency._pretty_constraint = package.version.text
self._deferred_cache[dependency] = package
return package
def search_for(self, dependency: Dependency) -> list[DependencyPackage]:
"""
Search for the specifications that match the given dependency.
The specifications in the returned list will be considered in reverse
order, so the latest version ought to be last.
"""
if dependency.is_root:
return PackageCollection(dependency, [self._package])
if dependency.is_direct_origin():
package = self.search_for_direct_origin_dependency(dependency)
self._direct_origin_packages[dependency.name] = package
return PackageCollection(dependency, [package])
# If we've previously found a direct-origin package that meets this dependency,
# use it.
#
# We rely on the VersionSolver resolving direct-origin dependencies first.
direct_origin_package = self._direct_origin_packages.get(dependency.name)
if direct_origin_package and direct_origin_package.satisfies(dependency):
packages = [direct_origin_package]
return PackageCollection(dependency, packages)
packages = self._pool.find_packages(dependency)
packages.sort(
key=lambda p: (
not p.yanked,
not p.is_prerelease() and not dependency.allows_prereleases(),
p.version,
),
reverse=True,
)
if not packages:
packages = self.search_for_installed_packages(dependency)
return PackageCollection(dependency, packages)
def _search_for_vcs(self, dependency: VCSDependency) -> Package:
"""
Search for the specifications that match the given VCS dependency.
Basically, we clone the repository in a temporary directory
and get the information we need by checking out the specified reference.
"""
package = self._direct_origin.get_package_from_vcs(
dependency.vcs,
dependency.source,
branch=dependency.branch,
tag=dependency.tag,
rev=dependency.rev,
subdirectory=dependency.source_subdirectory,
source_root=self._source_root
or (self._env.path.joinpath("src") if self._env else None),
)
self.validate_package_for_dependency(dependency=dependency, package=package)
package.develop = dependency.develop
return package
def _search_for_file(self, dependency: FileDependency) -> Package:
dependency.validate(raise_error=True)
package = self._direct_origin.get_package_from_file(dependency.full_path)
self.validate_package_for_dependency(dependency=dependency, package=package)
if dependency.base is not None:
package.root_dir = dependency.base
package.files = [
{
"file": dependency.path.name,
"hash": "sha256:" + get_file_hash(dependency.full_path),
}
]
return package
def _search_for_directory(self, dependency: DirectoryDependency) -> Package:
dependency.validate(raise_error=True)
package = self._direct_origin.get_package_from_directory(dependency.full_path)
self.validate_package_for_dependency(dependency=dependency, package=package)
package.develop = dependency.develop
if dependency.base is not None:
package.root_dir = dependency.base
return package
def _search_for_url(self, dependency: URLDependency) -> Package:
package = self._direct_origin.get_package_from_url(dependency.url)
self.validate_package_for_dependency(dependency=dependency, package=package)
for extra in dependency.extras:
if extra in package.extras:
for dep in package.extras[extra]:
dep.activate()
for extra_dep in package.extras[extra]:
package.add_dependency(extra_dep)
return package
def _get_dependencies_with_overrides(
self, dependencies: list[Dependency], package: Package
) -> list[Dependency]:
overrides = self._overrides.get(package, {})
_dependencies = []
overridden = []
for dep in dependencies:
if dep.name in overrides:
if dep.name in overridden:
continue
# empty constraint is used in overrides to mark that the package has
# already been handled and is not required for the attached markers
if not overrides[dep.name].constraint.is_empty():
_dependencies.append(overrides[dep.name])
overridden.append(dep.name)
continue
_dependencies.append(dep)
return _dependencies
def incompatibilities_for(
self, dependency_package: DependencyPackage
) -> list[Incompatibility]:
"""
Returns incompatibilities that encapsulate a given package's dependencies,
or that it can't be safely selected.
If multiple subsequent versions of this package have the same
dependencies, this will return incompatibilities that reflect that. It
won't return incompatibilities that have already been returned by a
previous call to _incompatibilities_for().
"""
package = dependency_package.package
if package.is_root():
dependencies = package.all_requires
else:
dependencies = package.requires
if not package.python_constraint.allows_all(self._python_constraint):
transitive_python_constraint = get_python_constraint_from_marker(
dependency_package.dependency.transitive_marker
)
intersection = package.python_constraint.intersect(
transitive_python_constraint
)
difference = transitive_python_constraint.difference(intersection)
# The difference is only relevant if it intersects
# the root package python constraint
difference = difference.intersect(self._python_constraint)
if (
transitive_python_constraint.is_any()
or self._python_constraint.intersect(
dependency_package.dependency.python_constraint
).is_empty()
or intersection.is_empty()
or not difference.is_empty()
):
return [
Incompatibility(
[Term(package.to_dependency(), True)],
PythonCauseError(
package.python_versions, str(self._python_constraint)
),
)
]
_dependencies = [
dep
for dep in dependencies
if dep.name not in self.UNSAFE_PACKAGES
and self._python_constraint.allows_any(dep.python_constraint)
and (not self._env or dep.marker.validate(self._env.marker_env))
]
dependencies = self._get_dependencies_with_overrides(_dependencies, package)
return [
Incompatibility(
[Term(package.to_dependency(), True), Term(dep, False)],
DependencyCauseError(),
)
for dep in dependencies
]
def complete_package(
self, dependency_package: DependencyPackage
) -> DependencyPackage:
package = dependency_package.package
dependency = dependency_package.dependency
if package.is_root():
dependency_package = dependency_package.clone()
package = dependency_package.package
dependency = dependency_package.dependency
requires = package.all_requires
elif package.is_direct_origin():
requires = package.requires
else:
try:
dependency_package = DependencyPackage(
dependency,
self._pool.package(
package.pretty_name,
package.version,
extras=list(dependency.extras),
repository_name=dependency.source_name,
),
)
except PackageNotFoundError as e:
try:
dependency_package = next(
DependencyPackage(dependency, pkg)
for pkg in self.search_for_installed_packages(dependency)
)
except StopIteration:
raise e from e
package = dependency_package.package
dependency = dependency_package.dependency
requires = package.requires
optional_dependencies = []
_dependencies = []
# If some extras/features were required, we need to
# add a special dependency representing the base package
# to the current package
if dependency.extras:
for extra in dependency.extras:
if extra not in package.extras:
continue
optional_dependencies += [d.name for d in package.extras[extra]]
dependency_package = dependency_package.with_features(
list(dependency.extras)
)
package = dependency_package.package
dependency = dependency_package.dependency
new_dependency = package.without_features().to_dependency()
# When adding dependency foo[extra] -> foo, preserve foo's source, if it's
# specified. This prevents us from trying to get foo from PyPI
# when user explicitly set repo for foo[extra].
if not new_dependency.source_name and dependency.source_name:
new_dependency.source_name = dependency.source_name
_dependencies.append(new_dependency)
for dep in requires:
if not self._python_constraint.allows_any(dep.python_constraint):
continue
if dep.name in self.UNSAFE_PACKAGES:
continue
if self._env and not dep.marker.validate(self._env.marker_env):
continue
if not package.is_root() and (
(dep.is_optional() and dep.name not in optional_dependencies)
or (
dep.in_extras
and not set(dep.in_extras).intersection(dependency.extras)
)
):
continue
_dependencies.append(dep)
if self._load_deferred:
# Retrieving constraints for deferred dependencies
for dep in _dependencies:
if dep.is_direct_origin():
locked = self.get_locked(dep)
# If lock file contains exactly the same URL and reference
# (commit hash) of dependency as is requested,
# do not analyze it again: nothing could have changed.
if locked is not None and locked.package.is_same_package_as(dep):
continue
self.search_for_direct_origin_dependency(dep)
dependencies = self._get_dependencies_with_overrides(_dependencies, package)
# Searching for duplicate dependencies
#
# If the duplicate dependencies have the same constraint,
# the requirements will be merged.
#
# For instance:
# • enum34; python_version=="2.7"
# • enum34; python_version=="3.3"
#
# will become:
# • enum34; python_version=="2.7" or python_version=="3.3"
#
# If the duplicate dependencies have different constraints
# we have to split the dependency graph.
#
# An example of this is:
# • pypiwin32 (220); sys_platform == "win32" and python_version >= "3.6"
# • pypiwin32 (219); sys_platform == "win32" and python_version < "3.6"
duplicates: dict[str, list[Dependency]] = defaultdict(list)
for dep in dependencies:
duplicates[dep.complete_name].append(dep)
dependencies = []
for dep_name, deps in duplicates.items():
if len(deps) == 1:
dependencies.append(deps[0])
continue
self.debug(f"<debug>Duplicate dependencies for {dep_name}</debug>")
# For dependency resolution, markers of duplicate dependencies must be
# mutually exclusive.
active_extras = None if package.is_root() else dependency.extras
deps = self._resolve_overlapping_markers(package, deps, active_extras)
if len(deps) == 1:
self.debug(f"<debug>Merging requirements for {dep_name}</debug>")
dependencies.append(deps[0])
continue
# At this point, we raise an exception that will
# tell the solver to make new resolutions with specific overrides.
#
# For instance, if the foo (1.2.3) package has the following dependencies:
# • bar (>=2.0) ; python_version >= "3.6"
# • bar (<2.0) ; python_version < "3.6"
#
# then the solver will need to make two new resolutions
# with the following overrides:
# • {<Package foo (1.2.3): {"bar": <Dependency bar (>=2.0)>}
# • {<Package foo (1.2.3): {"bar": <Dependency bar (<2.0)>}
def fmt_warning(d: Dependency) -> str:
dependency_marker = d.marker if not d.marker.is_any() else "*"
return (
f"<c1>{d.name}</c1> <fg=default>(<c2>{d.pretty_constraint}</c2>)</>"
f" with markers <b>{dependency_marker}</b>"
)
warnings = ", ".join(fmt_warning(d) for d in deps[:-1])
warnings += f" and {fmt_warning(deps[-1])}"
self.debug(
f"<warning>Different requirements found for {warnings}.</warning>"
)
overrides = []
overrides_marker_intersection: BaseMarker = AnyMarker()
for dep_overrides in self._overrides.values():
for dep in dep_overrides.values():
overrides_marker_intersection = (
overrides_marker_intersection.intersect(dep.marker)
)
for dep in deps:
if not overrides_marker_intersection.intersect(dep.marker).is_empty():
current_overrides = self._overrides.copy()
package_overrides = current_overrides.get(package, {}).copy()
package_overrides.update({dep.name: dep})
current_overrides.update({package: package_overrides})
overrides.append(current_overrides)
if overrides:
raise OverrideNeededError(*overrides)
# Modifying dependencies as needed
clean_dependencies = []
for dep in dependencies:
if not dependency.transitive_marker.without_extras().is_any():
transitive_marker_intersection = (
dependency.transitive_marker.without_extras().intersect(
dep.marker.without_extras()
)
)
if transitive_marker_intersection.is_empty():
# The dependency is not needed, since the markers specified
# for the current package selection are not compatible with
# the markers for the current dependency, so we skip it
continue
dep.transitive_marker = transitive_marker_intersection
if not dependency.python_constraint.is_any():
python_constraint_intersection = dep.python_constraint.intersect(
dependency.python_constraint
)
if python_constraint_intersection.is_empty():
# This dependency is not needed under current python constraint.
continue
clean_dependencies.append(dep)
package = package.with_dependency_groups([], only=True)
dependency_package = DependencyPackage(dependency, package)
for dep in clean_dependencies:
package.add_dependency(dep)
if self._locked and package.is_root():
# At this point all duplicates have been eliminated via overrides
# so that explicit sources are unambiguous.
# Clear _explicit_sources because it might be filled
# from a previous override.
self._explicit_sources.clear()
for dep in clean_dependencies:
if dep.source_name:
self._explicit_sources[dep.name] = dep.source_name
return dependency_package
def get_locked(self, dependency: Dependency) -> DependencyPackage | None:
if dependency.name in self._use_latest:
return None
locked = self._locked.get(dependency.name, [])
for dependency_package in locked:
package = dependency_package.package
if package.satisfies(dependency):
if explicit_source := self._explicit_sources.get(dependency.name):
dependency.source_name = explicit_source
return DependencyPackage(dependency, package)
return None
def debug(self, message: str, depth: int = 0) -> None:
if not (self._io.is_very_verbose() or self._io.is_debug()):
return
if message.startswith("fact:"):
if "depends on" in message:
m = re.match(r"fact: (.+?) depends on (.+?) \((.+?)\)", message)
if m is None:
raise ValueError(f"Unable to parse fact: {message}")
m2 = re.match(r"(.+?) \((.+?)\)", m.group(1))
if m2:
name = m2.group(1)
version = f" (<c2>{m2.group(2)}</c2>)"
else:
name = m.group(1)
version = ""
message = (
f"<fg=blue>fact</>: <c1>{name}</c1>{version} "
f"depends on <c1>{m.group(2)}</c1> (<c2>{m.group(3)}</c2>)"
)
elif " is " in message:
message = re.sub(
"fact: (.+) is (.+)",
"<fg=blue>fact</>: <c1>\\1</c1> is <c2>\\2</c2>",
message,
)
else:
message = re.sub(
r"(?<=: )(.+?) \((.+?)\)", "<c1>\\1</c1> (<c2>\\2</c2>)", message
)
message = f"<fg=blue>fact</>: {message.split('fact: ')[1]}"
elif message.startswith("selecting "):
message = re.sub(
r"selecting (.+?) \((.+?)\)",
"<fg=blue>selecting</> <c1>\\1</c1> (<c2>\\2</c2>)",
message,
)
elif message.startswith("derived:"):
m = re.match(r"derived: (.+?) \((.+?)\)$", message)
if m:
message = (
f"<fg=blue>derived</>: <c1>{m.group(1)}</c1>"
f" (<c2>{m.group(2)}</c2>)"
)
else:
message = (
f"<fg=blue>derived</>: <c1>{message.split('derived: ')[1]}</c1>"
)
elif message.startswith("conflict:"):
m = re.match(r"conflict: (.+?) depends on (.+?) \((.+?)\)", message)
if m:
m2 = re.match(r"(.+?) \((.+?)\)", m.group(1))
if m2:
name = m2.group(1)
version = f" (<c2>{m2.group(2)}</c2>)"
else:
name = m.group(1)
version = ""
message = (
f"<fg=red;options=bold>conflict</>: <c1>{name}</c1>{version} "
f"depends on <c1>{m.group(2)}</c1> (<c2>{m.group(3)}</c2>)"
)
else:
message = (
"<fg=red;options=bold>conflict</>:"
f" {message.split('conflict: ')[1]}"
)
message = message.replace("! ", "<error>!</error> ")
if self.is_debugging():
debug_info = str(message)
debug_info = (
"\n".join(
[
f"<debug>{str(depth).rjust(4)}:</debug> {s}"
for s in debug_info.split("\n")
]
)
+ "\n"
)
self._io.write(debug_info)
def _group_by_source(
self, dependencies: Iterable[Dependency]
) -> list[list[Dependency]]:
"""
Takes a list of dependencies and returns a list of groups of dependencies,
each group containing all dependencies from the same source.
"""
groups: list[list[Dependency]] = []
for dep in dependencies:
for group in groups:
if (
dep.is_same_source_as(group[0])
and dep.source_name == group[0].source_name
):
group.append(dep)
break
else:
groups.append([dep])
return groups
def _merge_dependencies_by_constraint(
self, dependencies: Iterable[Dependency]
) -> list[Dependency]:
"""
Merge dependencies with the same constraint
by building a union of their markers.
For instance, if we have:
- foo (>=2.0) ; python_version >= "3.6" and python_version < "3.7"
- foo (>=2.0) ; python_version >= "3.7"
we can avoid two overrides by merging them to:
- foo (>=2.0) ; python_version >= "3.6"
"""
dep_groups = self._group_by_source(dependencies)
merged_dependencies = []
for group in dep_groups:
by_constraint: dict[VersionConstraint, list[Dependency]] = defaultdict(list)
for dep in group:
by_constraint[dep.constraint].append(dep)
for deps in by_constraint.values():
dep = deps[0]
if len(deps) > 1:
new_markers = (dep.marker for dep in deps)
dep.marker = marker_union(*new_markers)
merged_dependencies.append(dep)
return merged_dependencies
def _is_relevant_marker(
self, marker: BaseMarker, active_extras: Collection[NormalizedName] | None
) -> bool:
"""
A marker is relevant if
- it is not empty
- allowed by the project's python constraint
- allowed by active extras of the dependency (not relevant for root package)
- allowed by the environment (only during installation)
"""
return (
not marker.is_empty()
and self._python_constraint.allows_any(
get_python_constraint_from_marker(marker)
)
and (active_extras is None or marker.validate({"extra": active_extras}))
and (not self._env or marker.validate(self._env.marker_env))
)
def _resolve_overlapping_markers(
self,
package: Package,
dependencies: list[Dependency],
active_extras: Collection[NormalizedName] | None,
) -> list[Dependency]:
"""
Convert duplicate dependencies with potentially overlapping markers
into duplicate dependencies with mutually exclusive markers.
Therefore, the intersections of all combinations of markers and inverted markers
have to be calculated. If such an intersection is relevant (not empty, etc.),
the intersection of all constraints, whose markers were not inverted is built
and a new dependency with the calculated version constraint and marker is added.
(The marker of such a dependency does not overlap with the marker
of any other new dependency.)
"""
# In order to reduce the number of intersections,
# we merge duplicate dependencies by constraint.
dependencies = self._merge_dependencies_by_constraint(dependencies)
new_dependencies = []
for uses in itertools.product([True, False], repeat=len(dependencies)):
# intersection of markers
# For performance optimization, we don't just intersect all markers at once,
# but intersect them one after the other to get empty markers early.
# Further, we intersect the inverted markers at last because
# they are more likely to overlap than the non-inverted ones.
markers = (
dep.marker if use else dep.marker.invert()
for use, dep in sorted(
zip(uses, dependencies), key=lambda ud: ud[0], reverse=True
)
)
used_marker_intersection: BaseMarker = AnyMarker()
for m in markers:
used_marker_intersection = used_marker_intersection.intersect(m)
if not self._is_relevant_marker(used_marker_intersection, active_extras):
continue
# intersection of constraints
constraint: VersionConstraint = VersionRange()
specific_source_dependency = None
used_dependencies = list(itertools.compress(dependencies, uses))
for dep in used_dependencies:
if dep.is_direct_origin() or dep.source_name:
# if direct origin or specific source:
# conflict if specific source already set and not the same
if specific_source_dependency and (
not dep.is_same_source_as(specific_source_dependency)
or dep.source_name != specific_source_dependency.source_name
):
raise IncompatibleConstraintsError(
package, dep, specific_source_dependency, with_sources=True
)
specific_source_dependency = dep
constraint = constraint.intersect(dep.constraint)
if constraint.is_empty():
# conflict in overlapping area
raise IncompatibleConstraintsError(package, *used_dependencies)
if not any(uses):
# This is an edge case where the dependency is not required
# for the resulting marker. However, we have to consider it anyway
# in order to not miss other dependencies later, for instance:
# • foo (1.0) ; python == 3.7
# • foo (2.0) ; python == 3.8
# • bar (2.0) ; python == 3.8
# • bar (3.0) ; python == 3.9
# the last dependency would be missed without this,
# because the intersection with both foo dependencies is empty.
# Set constraint to empty to mark dependency as "not required".
constraint = EmptyConstraint()
used_dependencies = dependencies
# build new dependency with intersected constraint and marker
# (and correct source)
new_dep = (
specific_source_dependency
if specific_source_dependency
else used_dependencies[0]
).with_constraint(constraint)
new_dep.marker = used_marker_intersection
new_dependencies.append(new_dep)
# In order to reduce the number of overrides we merge duplicate
# dependencies by constraint again. After overlapping markers were
# resolved, there might be new dependencies with the same constraint.
return self._merge_dependencies_by_constraint(new_dependencies)