rdfa_merge: sort esets before alphabet calc

This commit is contained in:
Justin Viiret 2017-04-05 16:40:07 +10:00 committed by Matthew Barr
parent 2f9d063190
commit eec2b8233d

View File

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2015, Intel Corporation * Copyright (c) 2015-2017, Intel Corporation
* *
* Redistribution and use in source and binary forms, with or without * Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met: * modification, are permitted provided that the following conditions are met:
@ -40,6 +40,7 @@
#include "util/report_manager.h" #include "util/report_manager.h"
#include "util/ue2_containers.h" #include "util/ue2_containers.h"
#include <algorithm>
#include <queue> #include <queue>
using namespace std; using namespace std;
@ -135,6 +136,10 @@ public:
} }
} }
// Sort so that our alphabet mapping isn't dependent on the order of
// rdfas passed in.
sort(esets.begin(), esets.end());
alphasize = buildAlphabetFromEquivSets(esets, alpha, unalpha); alphasize = buildAlphabetFromEquivSets(esets, alpha, unalpha);
} }