mirror/FairEmail
1
0
Fork 0
mirror of https://github.com/M66B/FairEmail.git synced 2024-12-26 09:47:13 +00:00
Code Issues Releases Wiki Activity

ARC improvements

Browse source
This commit is contained in:
M66B 2023-03-17 09:56:27 +01:00
parent 876ee65c90
commit 115a98b6fe
1 changed files with 5 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
app/src/main/java/eu/faircode/email/MessageHelper.java
View file

@ -2068,13 +2068,11 @@ public class MessageHelper {
break;
}
ok = (ok && as.size() > 0);
Log.i("ARC as=" + as.size() + " aar=" + aar.size() + " ams=" + ams.size() + " ok=" + ok);
if (ok)
ok = (as.size() > 0 && as.size() <= 50 &&
as.size() == aar.size() && as.size() == ams.size());
if (ok &&
as.size() <= 50 &&
as.size() == aar.size() &&
as.size() == ams.size()) {
if (ok)
for (int i = 1; i <= as.size(); i++) {
// 3.B. The instance values of the ARC Sets MUST form a continuous sequence from 1..N with no gaps or repetition
if (!as.containsKey(i) || !aar.containsKey(i) || !ams.containsKey(i)) {
@ -2094,8 +2092,7 @@ public class MessageHelper {
break;
}
}
}
Log.i("ARC sets=" + ok);
Log.i("ARC as=" + as.size() + " aar=" + aar.size() + " ams=" + ams.size() + " ok=" + ok);
// 4. Validate the AMS with the greatest instance value (most recent).
// If validation fails, then the Chain Validation Status is "fail", and the algorithm stops here.