search

DDvO / Duplicate-Contacts-Manager

This Thunderbird add-on searches address book(s) for pairs of matching contact entries. It can automatically delete entries that have equivalent or less information than the other one. Any remaining matches are presented for manual treatment.
http://ddvo.net/DuplicateContactsManager/
21 stars 9 forks source link

support for CardBook #1

Open DJCrashdummy opened 6 years ago

DJCrashdummy commented 6 years ago

beforehand: your addon seems awesome and thanks for releasing your work as FOSS! :+1:

since the default address book of Thunderbird is pretty outdated and more and more people are switching to CardBook (support for current vcf-versions & CardDAV), is it possible to also support the storage-backends of CardBook? (...or at least any of it?)

i know it could be a workaround to transfer the contacts back (for comparison) and forth, but this is a bit cumbersome and really hard for causal users... not to mention the problems with switching around between the different vcf-versions.

DDvO commented 6 years ago

Thanks for your comment and feature request. I fully agree that the TB address book is to be strongly improved or replaced. Good suggestion to consider supporting alternatives. Will do when I have time, which unfortunately is not the case in the near future.

DJCrashdummy commented 6 years ago

thanks for considering my feature request!

btw: CardBook also has a duplicate detection on its own, but yours seem more advanced and mature. maybe it is possible to exchange code and collaborate with @CardBook (moved to https://gitlab.com/CardBook/CardBook) to "get the best of both worlds"? :wink:

possibly integrating your add-on into CardBook (at the latest if CardBook replaces the old TB-addressbook) may also be worth considering... or removing any duplicate detection from CardBook itself at all, and list the "enhanced" Duplicate Contacts Manager as "Compatible and complementary add-ons" can also be reasonable.

CardBook commented 6 years ago

Hi all

ready for all options :O) do not hesitate to contact me directly :)