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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
|
/**
* Author: Sven Gothel <sgothel@jausoft.com>
* Copyright (c) 2020 Gothel Software e.K.
* Copyright (c) 2020 ZAFENA AB
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
package org.direct_bt;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import org.jau.net.EUI48;
import org.jau.net.EUI48Sub;
/**
* Application toolkit providing BT device registration of processed and awaited devices.
* The latter on a pattern matching basis, i.e. EUI48Sub or name-sub.
*/
public class BTDeviceRegistry {
/**
* Specifies devices queries to act upon.
*/
public static class DeviceQuery {
/**
* {@link DeviceQuery} type, i.e. {@link EUI48Sub} or a {@link String} name.
*/
public static enum Type {
/** {@link DeviceQuery} type, using a sensor device {@link EUI48Sub}. */
EUI48SUB,
/** {@link DeviceQuery} type, using a sensor device {@link String} name. */
NAME
}
public final Type type;
public final EUI48Sub addressSub;
public final String nameSub;
public DeviceQuery(final EUI48Sub as) {
type = Type.EUI48SUB;
addressSub = as;
nameSub = new String();
}
public DeviceQuery(final String ns) {
type = Type.NAME;
addressSub = EUI48Sub.ANY_DEVICE;
nameSub = ns;
}
public final boolean isEUI48Sub() { return Type.EUI48SUB == type; }
@Override
public String toString() {
if( Type.EUI48SUB == type ) {
return "[a: "+addressSub.toString()+"]";
} else {
return "[n: '"+nameSub+"']";
}
}
};
private static List<DeviceQuery> waitForDevices = new ArrayList<DeviceQuery>();
/**
* Specifies unique device identities,
* using {@link BDAddressAndType} as key.
*/
public static class DeviceID {
public final BDAddressAndType addressAndType;
public final String name;
public DeviceID(final BDAddressAndType a, final String n) {
addressAndType = a;
name = n;
}
/**
* {@inheritDoc}
* <p>
* Implementation simply tests the {@link BDAddressAndType} fields for equality,
* `name` is ignored.
* </p>
*/
@Override
public final boolean equals(final Object obj) {
if(this == obj) {
return true;
}
if (obj == null || !(obj instanceof DeviceID)) {
return false;
}
return addressAndType.equals(((DeviceID)obj).addressAndType);
}
/**
* {@inheritDoc}
* <p>
* Implementation simply returns the {@link BDAddressAndType} hash code,
* `name` is ignored.
* </p>
*/
@Override
public final int hashCode() {
return addressAndType.hashCode();
}
@Override
public String toString() {
return "["+addressAndType+", "+name+"]";
}
};
private static Collection<DeviceID> devicesProcessed = Collections.synchronizedCollection(new HashSet<DeviceID>());
public static void addToWaitForDevices(final String addrOrNameSub) {
final EUI48Sub addr1 = new EUI48Sub();
final StringBuilder errmsg = new StringBuilder();
if( EUI48Sub.scanEUI48Sub(addrOrNameSub, addr1, errmsg) ) {
waitForDevices.add( new DeviceQuery( addr1 ) );
} else {
addr1.clear();
waitForDevices.add( new DeviceQuery( addrOrNameSub ) );
}
}
public static boolean isWaitingForAnyDevice() {
return waitForDevices.size()==0;
}
public static int getWaitForDevicesCount() {
return waitForDevices.size();
}
public static String getWaitForDevicesString() {
return Arrays.toString(waitForDevices.toArray());
}
/**
* Returns the reference of the current list of {@link DeviceQuery}, not a copy.
*/
public static List<DeviceQuery> getWaitForDevices() {
return waitForDevices;
}
/**
* Clears internal list
*/
public static void clearWaitForDevices() {
waitForDevices.clear();
}
public static void addToProcessedDevices(final BDAddressAndType a, final String n) {
devicesProcessed.add( new DeviceID(a, n) );
}
public static boolean isDeviceProcessed(final BDAddressAndType a) {
return devicesProcessed.contains( new DeviceID(a, null) );
}
public static int getProcessedDeviceCount() {
return devicesProcessed.size();
}
public static String getProcessedDevicesString() {
return Arrays.toString(devicesProcessed.toArray());
}
/**
* Returns a copy of the current collection of processed {@link DeviceID}.
*/
public static List<DeviceID> getProcessedDevices() {
return new ArrayList<DeviceID>(devicesProcessed);
}
/**
* Clears internal list
*/
public static void clearProcessedDevices() {
devicesProcessed.clear();
}
/**
* Interface for user defined {@link DeviceQuery} matching criteria and algorithm.
*/
public static interface DeviceQueryMatch {
/**
* Return {@code true} if the given {@code address} and/or {@code name} matches
* with the {@link DeviceQuery}'s {@link DeviceQuery#addressSub addressSub} and/or
* {@link DeviceQuery#nameSub nameSub}.
* <p>
* Example (lambda):
* <pre>
* (final EUI48 a, final String n, final DeviceQuery q) -> {
* return q.isEUI48Sub() ? a.contains(q.addressSub) : n.indexOf(q.nameSub) >= 0;
* }
* </pre>
* </p>
*/
public boolean match(final EUI48 address, final String name, final DeviceQuery q);
}
/**
* Returns {@code true} if the given {@code address} and/or {@code name}
* {@link DeviceQueryMatch#match(EUI48, String, DeviceQuery) matches}
* any of the {@link #addToWaitForDevices(String) awaited devices}.
* <p>
* Matching criteria and algorithm is defined by the given {@link DeviceQueryMatch}.
* </p>
* @see #isWaitingForDevice(EUI48, String)
*/
public static boolean isWaitingForDevice(final EUI48 address, final String name,
final DeviceQueryMatch m) {
for(final Iterator<DeviceQuery> it=waitForDevices.iterator(); it.hasNext(); ) {
final DeviceQuery q = it.next();
if( m.match(address, name, q) ) {
return true;
}
}
return false;
}
/**
* Returns {@code true} if the given {@code address} and/or {@code name}
* {@link DeviceQueryMatch#match(EUI48, String, DeviceQuery) matches}
* any of the {@link #addToWaitForDevices(String) awaited devices}.
* <p>
* Matching criteria is either the awaited device's {@link DeviceQuery#addressSub}
* or {@link DeviceQuery#nameSub}, whichever is set.
* </p>
* <p>
* Matching algorithm is a simple {@code contains} pattern match,
* i.e. the given {@code address} or {@code name} contains the corresponding {@link DeviceQuery} element.
* </p>
* @see #isWaitingForDevice(EUI48, String, DeviceQueryMatch)
*/
public static boolean isWaitingForDevice(final EUI48 address, final String name) {
return isWaitingForDevice( address, name,
(final EUI48 a, final String n, final DeviceQuery q) -> {
return q.isEUI48Sub() ? a.contains(q.addressSub) : n.indexOf(q.nameSub) >= 0;
});
}
/**
* Returns {@code true} if all {@link #addToWaitForDevices(String) awaited devices}
* have been {@link #addToProcessedDevices(BDAddressAndType, String) processed}.
* <p>
* Matching criteria and algorithm is defined by the given {@link DeviceQueryMatch}.
* </p>
* @see #areAllDevicesProcessed()
*/
public static boolean areAllDevicesProcessed(final DeviceQueryMatch m) {
for(final Iterator<DeviceQuery> it1=waitForDevices.iterator(); it1.hasNext(); ) {
final DeviceQuery q = it1.next();
final Iterator<DeviceID> it2=devicesProcessed.iterator();
while( it2.hasNext() ) {
final DeviceID id = it2.next();
if( m.match(id.addressAndType.address, id.name, q) ) {
break;
}
}
if( !it2.hasNext() ) {
return false;
}
}
return true;
}
/**
* Returns {@code true} if all {@link #addToWaitForDevices(String) awaited devices}
* have been {@link #addToProcessedDevices(BDAddressAndType, String) processed}.
* <p>
* Matching criteria is either the awaited device's {@link DeviceQuery#addressSub}
* or {@link DeviceQuery#nameSub}, whichever is set.
* </p>
* <p>
* Matching algorithm is a simple {@code contains} pattern match,
* i.e. the processed {@link DeviceID} contains one element of {@link DeviceQuery}.
* </p>
* @see #areAllDevicesProcessed(DeviceQueryMatch)
*/
public static boolean areAllDevicesProcessed() {
return areAllDevicesProcessed( (final EUI48 a, final String n, final DeviceQuery q) -> {
return q.isEUI48Sub() ? a.contains(q.addressSub) : n.indexOf(q.nameSub) >= 0;
});
}
}
|