So you are suggesting reducing the size of our QIF files to a small debuggable size.
My QIF file is 653,808 lines long. About 2^20. So just using a binary search would take at least 20 trials to find the first line that it fails on. Not exactly something that seems practical. And that's just for my input file. And of course, just feeding a partial file might produce a failure, but a failure of a different kind, so this won't necessarily get us anywhere. -- Sent from: http://gnucash.1415818.n4.nabble.com/GnuCash-User-f1415819.html _______________________________________________ gnucash-user mailing list gnucash-user@gnucash.org To update your subscription preferences or to unsubscribe: https://lists.gnucash.org/mailman/listinfo/gnucash-user If you are using Nabble or Gmane, please see https://wiki.gnucash.org/wiki/Mailing_Lists for more information. ----- Please remember to CC this list on all your replies. You can do this by using Reply-To-List or Reply-All.
