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
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
|
/*
* ContactsCache.java
*
* Copyright (C) 2011 to 2013 Tim Marston <tim@ed.am>
*
* This file is part of the Import Contacts program (hereafter referred
* to as "this program"). For more information, see
* http://ed.am/dev/android/import-contacts
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package am.ed.importcontacts;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Locale;
public class ContactsCache
{
/**
* A thing that can be used to identify (or lookup) a contact within the
* contacts cache. It is not a reference to a cache entry and may not
* identify an existing contact in the cache.
*/
public static class CacheIdentifier
{
public enum Type { NAME, ORGANISATION, PRIMARY_NUMBER, PRIMARY_EMAIL }
private Type _type;
private String _detail;
/**
* Obtain a cache identifier. This routine is designed to be as robust
* as possible (in terms of bad or null detail values), and to return
* null when a cache identifier can not be created.
*
* @param type the detail type
* @param detail the detail
* @return the cache identifier, or null
*/
public static CacheIdentifier factory( Type type, String detail )
{
switch( type )
{
case NAME: detail = normaliseName( detail ); break;
case ORGANISATION: detail = normaliseOrganisation( detail ); break;
case PRIMARY_NUMBER: detail = normalisePhoneNumber( detail ); break;
case PRIMARY_EMAIL: detail = normaliseEmailAddress( detail ); break;
default: return null;
}
if( detail == null ) return null;
return new CacheIdentifier( type, detail );
}
/**
* Obtain a cache identifier from contact data. This routine is
* designed to be as robust as possible and may return null when a cache
* identifier can not be created.
*
* @param contact the contact data
* @return the cache identifier, or null
*/
public static CacheIdentifier factory( Importer.ContactData contact )
{
CacheIdentifier identifier = null;
if( contact.hasName() )
identifier = factory( CacheIdentifier.Type.NAME,
contact.getName() );
if( identifier != null ) return identifier;
if( contact.hasPrimaryOrganisation() )
identifier = factory( CacheIdentifier.Type.ORGANISATION,
contact.getPrimaryOrganisation() );
if( identifier != null ) return identifier;
if( contact.hasPrimaryNumber() )
identifier = factory( CacheIdentifier.Type.PRIMARY_NUMBER,
contact.getPrimaryNumber() );
if( identifier != null ) return identifier;
if( contact.hasPrimaryEmail() )
identifier = factory( CacheIdentifier.Type.PRIMARY_EMAIL,
contact.getPrimaryEmail() );
if( identifier != null ) return identifier;
return null;
}
protected CacheIdentifier( Type type, String detail )
{
_type = type;
_detail = detail;
}
public Type getType()
{
return _type;
}
public String getDetail()
{
return _detail;
}
}
// mappings of contact names, organisations and primary numbers to ids
private HashMap< String, Long > _contactsByName
= new HashMap< String, Long >();
private HashMap< String, Long > _contactsByOrg
= new HashMap< String, Long >();
private HashMap< String, Long > _contactsByNumber
= new HashMap< String, Long >();
private HashMap< String, Long > _contactsByEmail
= new HashMap< String, Long >();
// mapping of contact ids to sets of associated data
private HashMap< Long, HashSet< String > > _contactNumbers
= new HashMap< Long, HashSet< String > >();
private HashMap< Long, HashSet< String > > _contactEmails
= new HashMap< Long, HashSet< String > >();
private HashMap< Long, HashSet< String > > _contactAddresses
= new HashMap< Long, HashSet< String > >();
private HashMap< Long, HashSet< String > > _contactOrganisations
= new HashMap< Long, HashSet< String > >();
private HashMap< Long, HashSet< String > > _contactNotes
= new HashMap< Long, HashSet< String > >();
private HashMap< Long, String > _contactBirthdays
= new HashMap< Long, String >();
public boolean canLookup( CacheIdentifier identifier )
{
return lookup( identifier ) != null;
}
/**
* Retrieve the contact id of a contact identified by the specified cache
* identifier, if it exists.
*
* @param identifier the cache identifier
* @return a contact id, or null
*/
public Long lookup( CacheIdentifier identifier )
{
switch( identifier.getType() )
{
case NAME:
return _contactsByName.get( identifier.getDetail() );
case ORGANISATION:
return _contactsByOrg.get( identifier.getDetail() );
case PRIMARY_NUMBER:
return _contactsByNumber.get( identifier.getDetail() );
case PRIMARY_EMAIL:
return _contactsByEmail.get( identifier.getDetail() );
}
return null;
}
/**
* Remove any cache entry that is identified by the cache identifier.
*
* @param identifier the cache identifier
* @return the contact id of the contact that was removed, or null
*/
public Long removeLookup( CacheIdentifier identifier )
{
switch( identifier.getType() )
{
case NAME:
return _contactsByName.remove( identifier.getDetail() );
case ORGANISATION:
return _contactsByOrg.remove( identifier.getDetail() );
case PRIMARY_NUMBER:
return _contactsByNumber.remove( identifier.getDetail() );
case PRIMARY_EMAIL:
return _contactsByEmail.remove( identifier.getDetail() );
}
return null;
}
/**
* Add a lookup from a contact identifier to a contact id to the cache.
*
* @param identifier the cache identifier
* @param id teh contact id
*/
public void addLookup( CacheIdentifier identifier, Long id )
{
switch( identifier.getType() )
{
case NAME:
_contactsByName.put( identifier.getDetail(), id );
break;
case ORGANISATION:
_contactsByOrg.put( identifier.getDetail(), id );
break;
case PRIMARY_NUMBER:
_contactsByNumber.put( identifier.getDetail(), id );
break;
case PRIMARY_EMAIL:
_contactsByEmail.put( identifier.getDetail(), id );
break;
}
}
/**
* Remove any data that is associated with an contact id.
*
* @param id
*/
public void removeAssociatedData( Long id )
{
_contactNumbers.remove( id );
_contactEmails.remove( id );
_contactAddresses.remove( id );
_contactOrganisations.remove( id );
_contactNotes.remove( id );
}
public boolean hasAssociatedNumber( Long id, String number )
{
number = normalisePhoneNumber( number );
if( number == null ) return false;
HashSet< String > set = _contactNumbers.get( id );
return set != null && set.contains( number );
}
public void addAssociatedNumber( Long id, String number )
{
number = normalisePhoneNumber( number );
if( number == null ) return;
HashSet< String > set = _contactNumbers.get( id );
if( set == null ) {
set = new HashSet< String >();
_contactNumbers.put( id, set );
}
set.add( number );
}
public boolean hasAssociatedEmail( Long id, String email )
{
email = normaliseEmailAddress( email );
if( email == null ) return false;
HashSet< String > set = _contactEmails.get( id );
return set != null && set.contains( email );
}
public void addAssociatedEmail( Long id, String email )
{
email = normaliseEmailAddress( email );
if( email == null ) return;
HashSet< String > set = _contactEmails.get( id );
if( set == null ) {
set = new HashSet< String >();
_contactEmails.put( id, set );
}
set.add( email );
}
public boolean hasAssociatedAddress( Long id, String address )
{
address = normaliseAddress( address );
if( address == null ) return false;
HashSet< String > set = _contactAddresses.get( id );
return set != null && set.contains( address );
}
public void addAssociatedAddress( Long id, String address )
{
address = normaliseAddress( address );
if( address == null ) return;
HashSet< String > set = _contactAddresses.get( id );
if( set == null ) {
set = new HashSet< String >();
_contactAddresses.put( id, set );
}
set.add( address );
}
public boolean hasAssociatedOrganisation( Long id, String organisation )
{
organisation = normaliseOrganisation( organisation );
if( organisation == null ) return false;
HashSet< String > set = _contactOrganisations.get( id );
return set != null && set.contains( organisation );
}
public void addAssociatedOrganisation( Long id, String organisation )
{
organisation = normaliseOrganisation( organisation );
if( organisation == null ) return;
HashSet< String > set = _contactOrganisations.get( id );
if( set == null ) {
set = new HashSet< String >();
_contactOrganisations.put( id, set );
}
set.add( organisation );
}
public boolean hasAssociatedNote( Long id, String note )
{
note = normaliseNote( note );
if( note == null ) return false;
HashSet< String > set = _contactNotes.get( id );
return set != null && set.contains( note );
}
public void addAssociatedNote( Long id, String note )
{
note = normaliseNote( note );
if( note == null ) return;
HashSet< String > set = _contactNotes.get( id );
if( set == null ) {
set = new HashSet< String >();
_contactNotes.put( id, set );
}
set.add( note );
}
public boolean hasAssociatedBirthday( Long id, String birthday )
{
birthday = normaliseBirthday( birthday );
if( birthday == null ) return false;
String found = _contactBirthdays.get( id );
return found != null && found.equalsIgnoreCase( birthday );
}
public void addAssociatedBirthday( Long id, String birthday )
{
birthday = normaliseBirthday( birthday );
if( birthday == null ) return;
_contactBirthdays.put( id, birthday );
}
static public String normaliseName( String name )
{
if( name == null ) return null;
name = name.trim();
return name.length() > 0? name : null;
}
static public String normalisePhoneNumber( String number )
{
if( number == null ) return null;
number = number.trim().replaceAll( "[-\\(\\) ]", "" );
return number.length() > 0? number : null;
}
static public String normaliseEmailAddress( String email )
{
if( email == null ) return null;
email = email.trim().toLowerCase( Locale.US );
return email.length() > 0? email : null;
}
static public String normaliseOrganisation( String organisation )
{
if( organisation == null ) return null;
organisation = organisation.trim();
return organisation.length() > 0? organisation : null;
}
static public String normaliseAddress( String address )
{
if( address == null ) return null;
address = address.trim();
return address.length() > 0? address : null;
}
static public String normaliseNote( String note )
{
if( note == null ) return null;
note = note.trim();
return note.length() > 0? note : null;
}
static public String normaliseBirthday( String birthday )
{
if( birthday == null ) return null;
birthday = birthday.trim();
return birthday.length() > 0? birthday : null;
}
}
|