reorder ActivationKey so that the source is last

The source is the field the most expensive to do Eq on and the one least likely to be different. By moving it to the end calles to comparing keys that are different returns faster.

Author: Eh2406

src/cargo/core/resolver/context.rs

@@ -107,7 +107,7 @@ impl ResolverContext {
                 if let Some((_, dep)) = parent {
                     if dep.source_id() != id.source_id() {
                         let key =
-                            ActivationsKey::new(id.name(), dep.source_id(), id.version().into());
+                            ActivationsKey::new(id.name(), id.version().into(), dep.source_id());
                         let prev = self.activations.insert(key, (summary.clone(), age));
                         if let Some((previous_summary, _)) = prev {
                             return Err(

src/cargo/core/resolver/types.rs

@@ -168,11 +168,11 @@ impl ResolveOpts {
 /// semver compatible version of each crate.
 /// Find the activated version of a crate based on the name, source, and semver compatibility.
 #[derive(Clone, PartialEq, Eq, Debug, Ord, PartialOrd, Hash)]
-pub struct ActivationsKey(InternedString, SourceId, SemverCompatibility);
+pub struct ActivationsKey(InternedString, SemverCompatibility, SourceId);
 
 impl ActivationsKey {
-    pub fn new(name: InternedString, source_id: SourceId, ver: SemverCompatibility) -> ActivationsKey {
-        ActivationsKey(name, source_id, ver)
+    pub fn new(name: InternedString, ver: SemverCompatibility, source_id: SourceId) -> ActivationsKey {
+        ActivationsKey(name, ver, source_id)
     }
 }
 
@@ -200,7 +200,7 @@ impl From<&semver::Version> for SemverCompatibility {
 
 impl PackageId {
     pub fn as_activations_key(self) -> ActivationsKey {
-        ActivationsKey(self.name(), self.source_id(), self.version().into())
+        ActivationsKey(self.name(), self.version().into(), self.source_id())
     }
 }