summaryrefslogtreecommitdiff
path: root/match/match.h
diff options
context:
space:
mode:
authorHenrik Rydberg <rydberg@euromail.se>2008-11-06 23:01:41 +0100
committerHenrik Rydberg <rydberg@euromail.se>2008-11-06 23:01:41 +0100
commitd44b4794c679141a08fd802475bb542ecf5b7c51 (patch)
tree74251970cfbcc58d0252366be6e5e668149b8a48 /match/match.h
parent63de72d8d810e3692c96c7385b497bb4d68ef54a (diff)
ok, fast (but not fastest) matcher in place, no check output...
Signed-off-by: Henrik Rydberg <rydberg@euromail.se>
Diffstat (limited to 'match/match.h')
-rw-r--r--match/match.h25
1 files changed, 25 insertions, 0 deletions
diff --git a/match/match.h b/match/match.h
new file mode 100644
index 0000000..8936de4
--- /dev/null
+++ b/match/match.h
@@ -0,0 +1,25 @@
1#ifndef MATCHER_H
2#define MATCHER_H
3
4/**
5 * Special implementation of the hungarian algorithm.
6 * The maximum number of fingers matches a uint32.
7 * Bitmasks are used extensively.
8 */
9
10#define DIM_FINGER 16
11#define DIM2_FINGER (DIM_FINGER * DIM_FINGER)
12
13#define MIN(a, b) ((a) < (b) ? (a) : (b))
14#define MAX(a, b) ((a) < (b) ? (b) : (a))
15
16typedef int bool;
17
18////////////////////////////////////////////////////////
19
20void match_fingers(int index[DIM_FINGER], float A[DIM2_FINGER],
21 int nrow, int ncol);
22
23////////////////////////////////////////////////////////
24
25#endif