-
Notifications
You must be signed in to change notification settings - Fork 496
Expand file tree
/
Copy pathDeviceSpec.cxx
More file actions
73 lines (64 loc) · 2.07 KB
/
DeviceSpec.cxx
File metadata and controls
73 lines (64 loc) · 2.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
// Copyright 2019-2020 CERN and copyright holders of ALICE O2.
// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders.
// All rights not expressly granted are reserved.
//
// This software is distributed under the terms of the GNU General Public
// License v3 (GPL Version 3), copied verbatim in the file "COPYING".
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
#include "../src/WorkflowHelpers.h"
#include "Framework/DeviceSpec.h"
#include "Framework/WorkflowSpec.h"
#include "Framework/ChannelMatching.h"
#include "Framework/DeviceControl.h"
#include <vector>
#include <algorithm>
#include <unordered_set>
using namespace o2::framework;
namespace o2
{
namespace framework
{
using LogicalChannelsMap = std::map<LogicalChannelRange, size_t>;
// This calculates the distance between two strings. See:
//
// https://en.wikipedia.org/wiki/Levenshtein_distance
//
// For the full description
size_t levenshteinDistance(const char* s, int len_s, const char* t, int len_t)
{
size_t cost;
/* base case: empty strings */
if (len_s == 0) {
return len_t;
}
if (len_t == 0) {
return len_s;
}
/* test if last characters of the strings match */
if (s[len_s - 1] == t[len_t - 1]) {
cost = 0;
} else {
cost = 1;
}
return std::min(std::min(levenshteinDistance(s, len_s - 1, t, len_t) + 1,
levenshteinDistance(s, len_s, t, len_t - 1) + 1),
levenshteinDistance(s, len_s - 1, t, len_t - 1) + cost);
}
std::string findBestCandidate(const std::string& candidate, const LogicalChannelsMap& map)
{
std::string result;
size_t score = -1;
for (const auto& pair : map) {
auto newScore = levenshteinDistance(candidate.c_str(), candidate.size(),
pair.first.name.c_str(), pair.first.name.size());
if (newScore < score) {
result = pair.first.name;
}
}
return result;
}
} // namespace framework
} // namespace o2