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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* Copyright 2009 Evangelos Katsikaros <vkatsikaros at yahoo dot gr>
*
* This library is free software; you can redistribute it and/or
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.1 (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.mozilla.org/MPL/
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*/
/*
initial toy for redblack trees
*/
#include <2geom/rtree.h>
#include <time.h>
#include <vector>
#include <sstream>
#include <getopt.h>
//using std::vector;
using namespace Geom;
using namespace std;
sadfsdfasdfasdfa
int main(int argc, char **argv) {
long test_seed = 1243716824;
char* min_arg = NULL;
char* max_arg = NULL;
char* filename_arg = NULL;
int set_min_max = 0;
int c;
while (1)
{
static struct option long_options[] =
{
/* These options set a flag. */
/* These options don't set a flag.
We distinguish them by their indices. */
{"min-nodes", required_argument, 0, 'n'},
{"max-nodes", required_argument, 0, 'm'},
{"input-file", required_argument, 0, 'f'},
{"help", no_argument, 0, 'h'},
{0, 0, 0, 0}
};
/* getopt_long stores the option index here. */
int option_index = 0;
c = getopt_long (argc, argv, "n:m:f:h",
long_options, &option_index);
/* Detect the end of the options. */
if (c == -1){
break;
}
switch (c)
{
case 'n':
min_arg = optarg;
set_min_max += 1;
break;
case 'm':
max_arg = optarg;
set_min_max += 2;
break;
case 'f':
filename_arg = optarg;
set_min_max += 3;
break;
case 'h':
std::cerr << "Usage: " << argv[0] << " options\n" << std::endl ;
std::cerr <<
" -n --min-nodes=NUMBER minimum number in node.\n" <<
" -m --max-nodes=NUMBER maximum number in node.\n" <<
" -f --max-nodes=NUMBER maximum number in node.\n" <<
" -h --help Print this help.\n" << std::endl;
exit(1);
break;
case '?':
/* getopt_long already printed an error message. */
break;
default:
abort ();
}
}
unsigned rmin = 0;
unsigned rmax = 0;
if( set_min_max == 6 ){
stringstream s1( min_arg );
s1 >> rmin;
stringstream s2( max_arg );
s2 >> rmax;
if( rmax <= rmin || rmax < 2 || rmin < 1 ){
std::cerr << "Rtree set to 2, 3" << std::endl ;
rmin = 2;
rmax = 3;
}
}
else{
std::cerr << "Rtree set to 2, 3 ." << std::endl ;
rmin = 2;
rmax = 3;
}
std::cout << "rmin: " << rmin << " rmax:" << rmax << " filename_arg:" << filename_arg << std::endl;
RTree rtree( rmin, rmax, QUADRATIC_SPIT );
srand(1243716824);
rand() % 10;
return 0;
}
|
