-
-
Notifications
You must be signed in to change notification settings - Fork 293
/
filters.c
115 lines (104 loc) · 2.88 KB
/
filters.c
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
/*
* lidar-related filtering functions
*
* Authors:
* Markus Metz (r.in.lidar)
* Vaclav Petras (refactoring and various additions)
*
* Copyright 2011-2016 by Markus Metz, and The GRASS Development Team
*
* This program is free software licensed under the GPL (>=v2).
* Read the COPYING file that comes with GRASS for details.
*
*/
#include "filters.h"
#include <stdlib.h>
#include <string.h>
#include <grass/gis.h>
#include <grass/glocale.h>
int range_filter_from_option(struct Option *option, double *min, double *max)
{
if (option->answer != NULL) {
if (option->answers[0] == NULL || option->answers[1] == NULL)
G_fatal_error(_("Invalid range <%s> for option %s"), option->answer, option->key);
sscanf(option->answers[0], "%lf", min);
sscanf(option->answers[1], "%lf", max);
/* for convenience, switch order to make valid input */
if (*min > *max) {
double tmp = *max;
*max = *min;
*min = tmp;
}
return TRUE;
}
return FALSE;
}
int return_filter_create_from_string(struct ReturnFilter *return_filter,
const char *name)
{
return_filter->filter = LAS_ALL;
if (name) {
if (strcmp(name, "first") == 0)
return_filter->filter = LAS_FIRST;
else if (strcmp(name, "last") == 0)
return_filter->filter = LAS_LAST;
else if (strcmp(name, "mid") == 0)
return_filter->filter = LAS_MID;
else
G_fatal_error(_("Unknown return filter value <%s>"), name);
}
if (return_filter->filter == LAS_ALL)
return FALSE;
else
return TRUE;
}
int return_filter_is_out(struct ReturnFilter *return_filter, int return_n,
int n_returns)
{
if (return_filter->filter == LAS_ALL)
return FALSE;
int skipme = 1;
switch (return_filter->filter) {
case LAS_FIRST:
if (return_n == 1)
skipme = 0;
break;
case LAS_MID:
if (return_n > 1 && return_n < n_returns)
skipme = 0;
break;
case LAS_LAST:
if (n_returns > 1 && return_n == n_returns)
skipme = 0;
break;
}
if (skipme)
return TRUE;
return FALSE;
}
int class_filter_create_from_strings(struct ClassFilter *class_filter,
char **classes)
{
class_filter->str_classes = classes;
if (classes)
return TRUE;
else
return FALSE;
}
int class_filter_is_out(struct ClassFilter *class_filter, int class_n)
{
if (!class_filter->str_classes)
return FALSE;
int i = 0;
int skipme = TRUE;
while (class_filter->str_classes[i]) {
if (class_n == atoi(class_filter->str_classes[i])) {
skipme = FALSE;
break;
}
i++;
}
if (skipme)
return TRUE;
return FALSE;
}