about check number heuristics
stimming at tuhh.de
Fri Jan 26 12:17:39 EST 2007
-----BEGIN PGP SIGNED MESSAGE-----
Ethy H. Brito schrieb:
> On Thu, 25 Jan 2007 10:00:54 -0500
> Derek Atkins <warlord at MIT.EDU> wrote:
>>>> Are you offering to code this and send in a patch? :-D
>>> yes I am. In fact I am working on the idea reading the code to catch your
>>> programing style and propose something that fits in.
>> Cool! I look forward to your patch. :)
> Here go my thoughts:
> I think the "problem" has to be dealed at check number increment/decrement.
> If this is done correctly, the import matching do not have to be smart
> (a simple str[n]cmp will do the job as it is today)
> Please correct me. I have no deep knowledge of GC innards.
As I already said: Are you talking about the matching rules of imported
and/or downloaded transactions? In case this concerns OFX or HBCI
(whereas QIF is different), do I understand correctly that you're
talking about the function split_find_match() in
src/import-export/import-backend.c, especially (svn-trunk) lines 659ff?
In particular, as you've mentioned OFX here,
I would strongly suggest to simply add a numerical comparison (in
additiona to the string comparison) in import-backend.c, as this
achieves your original goal of "good scores to imported transactions"
obviously much much easier.
Thanks for any proposals,
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v22.214.171.124 (MingW32)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
-----END PGP SIGNATURE-----
More information about the gnucash-devel