US 12,277,411 B2
Calculating lowest dependency version compatible with dependency specification
Leigh Griffin, Waterford (IE); and Anne Mulhern, Westford, MA (US)
Assigned to Red Hat, Inc., Raleigh, NC (US)
Filed by Red Hat, Inc., Raleigh, NC (US)
Filed on Apr. 3, 2023, as Appl. No. 18/130,337.
Prior Publication US 2024/0329951 A1, Oct. 3, 2024
Int. Cl. G06F 9/30 (2018.01); G06F 8/34 (2018.01); G06F 8/41 (2018.01); G06F 8/71 (2018.01); G06F 16/22 (2019.01); G06F 16/23 (2019.01); G06F 21/56 (2013.01); H04N 21/262 (2011.01)
CPC G06F 8/43 (2013.01) [G06F 8/34 (2013.01); G06F 8/423 (2013.01); G06F 8/433 (2013.01); G06F 8/71 (2013.01); G06F 16/221 (2019.01); G06F 16/2379 (2019.01); G06F 21/568 (2013.01); H04N 21/26258 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
for each of a set of packages required to execute an application:
analyzing, by a processing device, a dependency specification corresponding to the package to determine a set of relations, the set of relations defining version numbers of the package that are compatible with the application;
desugaring the set of relations to generate a basic format set of relations;
removing conflicting relations from the basic format set of relations;
removing duplicate relations from the basic format set of relations to generate a deduplicated set of relations; and
determining a lowest version of the package that is compatible with the dependency specification based on operators used among the deduplicated set of relations.