VoyForums Notice -- Quick Contributions:
Donate $10 to the Red Cross: Text the word REDCROSS to 90999
Donate $10 to the Salvation Army: Text the word STORM to 80888
* The charge will appear on your cellphone bill.
>Also- I tried changing owners with another gedcom
>program (PAF) with no effect.
I'm guessing here, but I suspect that you may have one or more circular references in your gedcom file.
In Gedcom files, individuals and families are linked together by a series of pointers which enable the tree to be traversed.
A simplified but logically correct example of relationships might be:
A is the child of B
B is the child of D
D is the child of E etc
If however the last relationship became corrupted to
D is the child of A
the program will enter an endless loop when trying to locate A's great grandparent.
This will eventually result in a program 'stack overflow' when the computer runs out of available memory, which is consistent with the error reported in the Java Console.
As the gedcom spec uses one set of pointers to move 'up' the tree (via ancestors) and another set of pointers to move 'down' the tree (via descendants), the choice of starting point (owner) can determine whether a particualr pointer is used when traversing the tree.
This leads to the possibility that certain 'owners' may hit a circular reference when initialising and other owners may manage to avoid it. Again, this is consistent with your findings.
I am currently quite busy on 'non DFT' matters, but if you are unable to find the error, I can put you in contact with a couple of users have volunteered to try and sort out other users gedcom problems - email me if you would like to proceed.