-
Notifications
You must be signed in to change notification settings - Fork 4
/
main.cc
72 lines (64 loc) · 2.13 KB
/
main.cc
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
// Copyright 2007 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// ---
// A simple all-similar-pairs algorithm for binary vector input.
// ---
// Author: Roberto Bayardo
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iostream>
#include <memory>
#include "allpairs.h"
#include "data-source-iterator.h"
int main(int argc, char** argv) {
time_t start_time;
time(&start_time);
// Verify input arguments.
if (argc != 3) {
std::cerr << "ERROR: Usage is: ./ap <sim_threshold> <dataset_path>\n";
return 1;
}
const double threshold = strtod(argv[1], 0);
if (threshold <= 0.0 || threshold > 1.0) {
std::cerr << "ERROR: The first argument should be a similarity "
<< "threshhold with range (0.0-1.0]\n";
return 2;
}
std::cerr << "; User specified similarity threshold: "
<< threshold << std::endl;
{
std::auto_ptr<DataSourceIterator> data(DataSourceIterator::Get(argv[2]));
if (!data.get())
return 3;
AllPairs ap;
bool result =
ap.FindAllSimilarPairs(threshold, data.get(), 600000, 120000000);
if (!result) {
std::cerr << "ERROR: " << data->GetErrorMessage() << "\n";
return 4;
}
std::cerr << "; Found " << ap.SimilarPairsCount() << " similar pairs.\n"
<< "; Candidates considered: " << ap.CandidatesConsidered()
<< "\n"
<< "; Vector intersections performed: "
<< ap.IntersectionsPerformed() << '\n';
}
time_t end_time;
time(&end_time);
std::cerr << "; Total running time: " << (end_time - start_time)
<< " seconds" << std::endl;
return 0;
}