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
|
/**
* @copyright Copyright (c) 2018 John Molakvoæ <skjnldsv@protonmail.com>
*
* @author John Molakvoæ <skjnldsv@protonmail.com>
*
* @license GNU AGPL version 3 or any later version
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
import Vue from 'vue'
import ICAL from 'ical.js'
import Contact from '../models/contact'
import validate from '../services/validate'
const sortData = (a, b) => {
const nameA = typeof a.value === 'string'
? a.value.toUpperCase() // ignore upper and lowercase
: a.value.toUnixTime() // only other sorting we support is a vCardTime
const nameB = typeof b.value === 'string'
? b.value.toUpperCase() // ignore upper and lowercase
: b.value.toUnixTime() // only other sorting we support is a vCardTime
const score = nameA.localeCompare
? nameA.localeCompare(nameB)
: nameB - nameA
// if equal, fallback to the key
return score !== 0
? score
: a.key.localeCompare(b.key)
}
const state = {
// Using objects for performance
// https://codepen.io/skjnldsv/pen/ZmKvQo
contacts: {},
sortedContacts: [],
orderKey: 'displayName',
}
const mutations = {
/**
* Store raw contacts into state
* Used by the first contact fetch
*
* @param {Object} state Default state
* @param {Array<Contact>} contacts Contacts
*/
appendContacts(state, contacts = []) {
state.contacts = contacts.reduce(function(list, contact) {
if (contact instanceof Contact) {
Vue.set(list, contact.key, contact)
} else {
console.error('Invalid contact object', contact)
}
return list
}, state.contacts)
},
/**
* Delete a contact from the global contacts list
*
* @param {Object} state the store data
* @param {Contact} contact the contact to delete
*/
deleteContact(state, contact) {
if (state.contacts[contact.key] && contact instanceof Contact) {
const index = state.sortedContacts.findIndex(search => search.key === contact.key)
state.sortedContacts.splice(index, 1)
Vue.delete(state.contacts, contact.key)
} else {
console.error('Error while deleting the following contact', contact)
}
},
/**
* Insert new contact into sorted array
*
* @param {Object} state the store data
* @param {Contact} contact the contact to add
*/
addContact(state, contact) {
if (contact instanceof Contact) {
// Checking contact validity 🔍🙈
validate(contact)
const sortedContact = {
key: contact.key,
value: contact[state.orderKey],
}
// Not using sort, splice has far better performances
// https://jsperf.com/sort-vs-splice-in-array
for (let i = 0, len = state.sortedContacts.length; i < len; i++) {
if (sortData(state.sortedContacts[i], sortedContact) >= 0) {
state.sortedContacts.splice(i, 0, sortedContact)
break
} else if (i + 1 === len) {
// we reached the end insert it now
state.sortedContacts.push(sortedContact)
}
}
// sortedContact is empty, just push it
if (state.sortedContacts.length === 0) {
state.sortedContacts.push(sortedContact)
}
// default contacts list
Vue.set(state.contacts, contact.key, contact)
} else {
console.error('Error while adding the following contact', contact)
}
},
/**
* Update a contact
*
* @param {Object} state the store data
* @param {Contact} contact the contact to update
*/
updateContact(state, contact) {
if (state.contacts[contact.key] && contact instanceof Contact) {
// replace contact object data
state.contacts[contact.key].updateContact(contact.jCal)
const sortedContact = state.sortedContacts.find(search => search.key === contact.key)
// has the sort key changed for this contact ?
const hasChanged = sortedContact.value !== contact[state.orderKey]
if (hasChanged) {
// then update the new data
sortedContact.value = contact[state.orderKey]
// and then we sort again
state.sortedContacts.sort(sortData)
}
} else {
console.error('Error while replacing the following contact', contact)
}
},
/**
* Update a contact addressbook
*
* @param {Object} state the store data
* @param {Object} data destructuring object
* @param {Contact} contact the contact to update
* @param {Object} addressbook the addressbook to set
*/
updateContactAddressbook(state, { contact, addressbook }) {
if (state.contacts[contact.key] && contact instanceof Contact) {
// replace contact object data by creating a new contact
const oldKey = contact.key
// hijack reference
const newContact = contact
// delete old key, cut reference
Vue.delete(state.contacts, oldKey)
// replace addressbook
Vue.set(newContact, 'addressbook', addressbook)
// set new key, re-assign reference
Vue.set(state.contacts, newContact.key, newContact)
// Update sorted contacts list, replace at exact same position
const index = state.sortedContacts.findIndex(search => search.key === oldKey)
state.sortedContacts[index] = {
key: newContact.key,
value: newContact[state.orderKey],
}
} else {
console.error('Error while replacing the addressbook of following contact', contact)
}
},
/**
* Update a contact etag
*
* @param {Object} state the store data
* @param {Object} data destructuring object
* @param {Contact} contact the contact to update
* @param {string} etag the contact etag
*/
updateContactEtag(state, { contact, etag }) {
if (state.contacts[contact.key] && contact instanceof Contact) {
// replace contact object data
state.contacts[contact.key].dav.etag = etag
} else {
console.error('Error while replacing the etag of following contact', contact)
}
},
/**
* Order the contacts list. Filters have terrible performances.
* We do not want to run the sorting function every time.
* Let's only run it on additions and create an index
*
* @param {Object} state the store data
*/
sortContacts(state) {
state.sortedContacts = Object.values(state.contacts)
// exclude groups
.filter(contact => contact.kind !== 'group')
.map(contact => { return { key: contact.key, value: contact[state.orderKey] } })
.sort(sortData)
},
/**
* Set the
|