diff options
author | Daniel <kingdread@gmx.de> | 2020-05-12 16:12:33 +0200 |
---|---|---|
committer | Daniel <kingdread@gmx.de> | 2020-05-12 16:12:33 +0200 |
commit | 279fed9f175a84799f37ffb3fbb22b64313f8c47 (patch) | |
tree | e45e7050171ada617ba93a6ee818b6fe93cf326f /src/csl.rs | |
parent | 013776cbc4ebf6242e64df25d3bebf4851de116b (diff) | |
download | raidgrep-279fed9f175a84799f37ffb3fbb22b64313f8c47.tar.gz raidgrep-279fed9f175a84799f37ffb3fbb22b64313f8c47.tar.bz2 raidgrep-279fed9f175a84799f37ffb3fbb22b64313f8c47.zip |
sort players based on their names
The easiest way to get this consistent is to implement PartialOrd & Ord
for Player. However, the implementation might not be 100% sound, as it
should be using the same fields as (Partial)Eq, but that would mean
either
1. Deriving PartialOrd/Ord, which is not possible because PlayerClass
does not implement it (which in turn would not make sense to order)
or
2. Implementing (Partial)Eq by hand instead of deriving it, which is not
the best either
I don't think it's an issue though, as we never put Players in any
position where it might get relevant (such as a HashMap/BTreeMap), and
we're only using it to sort them for the output.
Diffstat (limited to 'src/csl.rs')
0 files changed, 0 insertions, 0 deletions