@@ -43,30 +43,30 @@ declare_lint_pass!(StableSortPrimitive => [STABLE_SORT_PRIMITIVE]);
43
43
/// The three "kinds" of sorts
44
44
enum SortingKind {
45
45
Vanilla ,
46
- // The other kinds of lint are currently commented out because they
47
- // can map distinct values to equal ones. If the key function is
48
- // provably one-to-one, or if the Cmp function conserves equality,
49
- // then they could be linted on, but I don't know if we can check
50
- // for that.
46
+ /* The other kinds of lint are currently commented out because they
47
+ * can map distinct values to equal ones. If the key function is
48
+ * provably one-to-one, or if the Cmp function conserves equality,
49
+ * then they could be linted on, but I don't know if we can check
50
+ * for that. */
51
51
52
- // ByKey,
53
- // ByCmp,
52
+ /* ByKey,
53
+ * ByCmp, */
54
54
}
55
55
impl SortingKind {
56
56
/// The name of the stable version of this kind of sort
57
57
fn stable_name ( & self ) -> & str {
58
58
match self {
59
59
SortingKind :: Vanilla => "sort" ,
60
- // SortingKind::ByKey => "sort_by_key",
61
- // SortingKind::ByCmp => "sort_by",
60
+ /* SortingKind::ByKey => "sort_by_key",
61
+ * SortingKind::ByCmp => "sort_by", */
62
62
}
63
63
}
64
64
/// The name of the unstable version of this kind of sort
65
65
fn unstable_name ( & self ) -> & str {
66
66
match self {
67
67
SortingKind :: Vanilla => "sort_unstable" ,
68
- // SortingKind::ByKey => "sort_unstable_by_key",
69
- // SortingKind::ByCmp => "sort_unstable_by",
68
+ /* SortingKind::ByKey => "sort_unstable_by_key",
69
+ * SortingKind::ByCmp => "sort_unstable_by", */
70
70
}
71
71
}
72
72
/// Takes the name of a function call and returns the kind of sort
0 commit comments