gedcomkit 0.1.16__tar.gz → 0.1.18__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/CHANGELOG.md +134 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/Cargo.lock +1 -1
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/Cargo.toml +4 -3
- {gedcomkit-0.1.16/bindings/gedcomkit-py → gedcomkit-0.1.18}/LICENSE +80 -67
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/PKG-INFO +3 -3
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/README.md +9 -5
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/bindings/gedcomkit-py/Cargo.lock +2 -2
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/bindings/gedcomkit-py/Cargo.toml +2 -2
- {gedcomkit-0.1.16 → gedcomkit-0.1.18/bindings/gedcomkit-py}/LICENSE +80 -67
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/bindings/gedcomkit-py/README.md +1 -1
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/bindings/gedcomkit-py/gedcomkit.pyi +5 -1
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/bindings/gedcomkit-py/src/lib.rs +4 -1
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/pyproject.toml +1 -1
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/dates.rs +134 -7
- gedcomkit-0.1.18/src/validate.rs +3470 -0
- gedcomkit-0.1.16/src/validate.rs +0 -855
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/LICENSE +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/README.md +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/cardinalities.tsv +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/enumerations.tsv +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/enumerationsets.tsv +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/grammar.abnf +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/grammar.gedstruct +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/payloads.tsv +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom-spec/substructures.tsv +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/age-invalid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/age-valid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/atsign.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_ascii_1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_ascii_2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf16be-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf16be-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf16le-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf16le-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf8-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf8-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/char_utf8-3.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/date-all.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/date-dual-invalid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/date-dual-valid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/enum-ext.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/filename-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/lang-all.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/notes-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/obje-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/obsolete-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/pedi-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/rela_1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/sour-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/tiny-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/5/xref-case.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/age-invalid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/age-valid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/atsign.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_ascii_1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_ascii_2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf16be-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf16be-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf16le-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf16le-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf8-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf8-2.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/char_utf8-3.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/date-all.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/date-dual-invalid.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/enum-ext.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/filename-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/lang-all.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/notes-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/obje-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/obsolete-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/pedi-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/rela_1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/sour-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/tiny-1.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/7/xref-case.ged +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/LICENSE +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/gedcom7code/UPSTREAM-README.md +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/zip-interop/README.md +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/zip-interop/python-zip64.gdz +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/fixtures/vendored/zip-interop/python-zipfile.gdz +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/build.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/convert.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/decode.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/family.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/gedzip.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/lib.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/names.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/schema.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/synthetic.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/tags.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/src/view.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/endurance.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/external_charset.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/properties.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/requirement_corpus.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/spec_conformance.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/typescript.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/vendored_corpus.rs +0 -0
- {gedcomkit-0.1.16 → gedcomkit-0.1.18}/tests/version_conversion.rs +0 -0
|
@@ -5,6 +5,140 @@ format follows [Keep a Changelog](https://keepachangelog.com/en/1.1.0/), and
|
|
|
5
5
|
the project uses semantic versioning within the usual pre-1.0 compatibility
|
|
6
6
|
rules.
|
|
7
7
|
|
|
8
|
+
## [Unreleased]
|
|
9
|
+
|
|
10
|
+
## [0.1.18] - 2026-10-16
|
|
11
|
+
|
|
12
|
+
### Added
|
|
13
|
+
|
|
14
|
+
- `validate::inspect` runs nine more checks. Each has a stable name, and
|
|
15
|
+
the module documentation now lists every check with its severity:
|
|
16
|
+
- `married-after-died` (contradiction): a family's first `MARR` wholly
|
|
17
|
+
after a partner's death, or, failing a dated death, their burial. A
|
|
18
|
+
burial before the wedding beside a death after it is no finding here:
|
|
19
|
+
the death says when the life ended, and the burial is
|
|
20
|
+
`buried-before-died`'s.
|
|
21
|
+
- `child-born-long-after-father-died`: a child born more than 300 days
|
|
22
|
+
after the death of the family's `HUSB`. A contradiction when both dates
|
|
23
|
+
name a day; a question otherwise, since a bare year is often a guess.
|
|
24
|
+
- `christened-before-born` (contradiction): a `CHR`, `CHRA` or `BAPM`
|
|
25
|
+
wholly before the birth.
|
|
26
|
+
- `event-before-birth`: the mirror of `event-after-death`, for any other
|
|
27
|
+
event or attribute wholly before the birth year. A burial or cremation
|
|
28
|
+
is left to `died-before-born` and `buried-before-died` when the person
|
|
29
|
+
has a dated death.
|
|
30
|
+
- `buried-long-after-died` (question): a burial more than 365 days after
|
|
31
|
+
the death, counted from the latest day the death allows to the earliest
|
|
32
|
+
the burial does.
|
|
33
|
+
- `children-too-close`: two children of one mother born 2 to 270 days
|
|
34
|
+
apart. A contradiction when both dates name a day and are under 150
|
|
35
|
+
days apart; a question otherwise, since a very early birth makes the
|
|
36
|
+
longer gaps possible. A mother's children are taken from every family
|
|
37
|
+
she is the `WIFE` in; a family with no `WIFE` is compared alone.
|
|
38
|
+
- `possible-duplicate-child` (question): two children of one mother with
|
|
39
|
+
one given name (one name may be the start of the other: `Mira` and
|
|
40
|
+
`Mira Elowen`, but not `Mira Elowen` and `Mira Rose`), born on one
|
|
41
|
+
date, or on one day and month of different years.
|
|
42
|
+
- `conflicting-vitals` (question): two `BIRT`, or two `DEAT`, events of
|
|
43
|
+
one person that cannot both be true, even with an approximate date
|
|
44
|
+
allowed a year either way (`BIRT 1851` and `BIRT ABT 1850` are not in
|
|
45
|
+
conflict). GEDCOM lets a file record alternatives with the preferred
|
|
46
|
+
first, which is the one the other checks read, so this asks rather
|
|
47
|
+
than accuses.
|
|
48
|
+
- `own-ancestor` (contradiction): a loop in the parent links, read from
|
|
49
|
+
both directions of the family link as `FamilyGraph` reads them. One
|
|
50
|
+
finding per loop, on the person in it the file lists first, naming the
|
|
51
|
+
shortest way round: in full up to six steps, and past that its first
|
|
52
|
+
five and how many more, so a loop through 20,000 people is one short
|
|
53
|
+
message.
|
|
54
|
+
|
|
55
|
+
The three checks that compare pairs are bounded, so a hostile file cannot
|
|
56
|
+
make the report as large as the square of its people. `children-too-close`
|
|
57
|
+
and `possible-duplicate-child` report at most ten pairs for one mother,
|
|
58
|
+
and `conflicting-vitals` ten for one person's births and ten for their
|
|
59
|
+
deaths, the first in the order the file lists them; one more finding under
|
|
60
|
+
the same check, as serious as the most serious pair it stands for, then
|
|
61
|
+
says how many more pairs there are and how many in all (`4059990 more
|
|
62
|
+
pairs of children born 2 to 270 days apart, 4060000 in all`). The work is
|
|
63
|
+
bounded too: births and deaths are counted by sorting rather than compared
|
|
64
|
+
pair by pair; children who share a span of birth days, or a given name,
|
|
65
|
+
are compared as one group; and one mother's children are compared at most
|
|
66
|
+
100,000 times for each check, past which the summary gives its counts as
|
|
67
|
+
lower bounds. A family of 3,000 children of one name born in one month,
|
|
68
|
+
which made 4.5 million sibling findings, makes 22; a person with 5,000
|
|
69
|
+
births, which made 12.5 million `conflicting-vitals` findings, makes 11.
|
|
70
|
+
|
|
71
|
+
### Changed
|
|
72
|
+
|
|
73
|
+
- PyPI gets one wheel, Linux x86_64, beside the source distribution. The
|
|
74
|
+
macOS and Windows wheels are no longer cross-built; on those platforms pip
|
|
75
|
+
builds from the sdist, which needs a Rust toolchain.
|
|
76
|
+
- `died-before-born`, `buried-before-died`, `christened-before-born`,
|
|
77
|
+
`married-after-died` and `conflicting-vitals` compare as finely as both
|
|
78
|
+
dates allow: a burial on 12 September before a death on 14 September of
|
|
79
|
+
one year is now found. Julian and Gregorian dates are put on one count of days first.
|
|
80
|
+
An approximate date (`ABT`, `CAL`, `EST`) still vouches for its year and
|
|
81
|
+
nothing finer, and a bound (`BEF`, `AFT`, `BET`) admits its own day. A
|
|
82
|
+
finding the years alone decide keeps its wording (`born 1900 and died
|
|
83
|
+
1880`); one only a finer comparison finds names the dates in full
|
|
84
|
+
(`died 14 September 1862 and buried 12 September 1862`).
|
|
85
|
+
- An approximate date (`ABT`, `CAL`, `EST`) may be a year out. A finding
|
|
86
|
+
that two events are out of order is a question, not a contradiction, when
|
|
87
|
+
moving each approximate date a year either way could put them in order:
|
|
88
|
+
`BIRT ABT 1850` with `CHR 1849` or `CENS 1849`, or `DEAT ABT 1850` with a
|
|
89
|
+
burial in 1849. Two years out it is still a contradiction. This holds for
|
|
90
|
+
`died-before-born`, `buried-before-died`, `event-after-death`,
|
|
91
|
+
`married-before-born` and `child-born-after-mother-died`, and for the new
|
|
92
|
+
`christened-before-born`, `event-before-birth` and `married-after-died`;
|
|
93
|
+
the checks about an age or an interval take an approximate year as
|
|
94
|
+
written. Their messages say an approximate date is one: `born about 1850,
|
|
95
|
+
and Christening is dated 1849`.
|
|
96
|
+
- `event-after-death` is a question, not a contradiction, for an `EVEN` or
|
|
97
|
+
`FACT`. Such an event is whatever its free-text `TYPE` says — a land
|
|
98
|
+
entry completed, a patent issued, an estate settled — and many of those
|
|
99
|
+
are done in a dead person's name. The other events keep their severity.
|
|
100
|
+
- `by` is read as a `BEF` qualifier: `by 5 October 1752` is
|
|
101
|
+
`BEF 5 OCT 1752`, where it was read as 5 May 1752. The qualifiers the
|
|
102
|
+
reader already knew (`abt`, `about`, `c.`, `ca.`, `bef`, `before`, `aft`,
|
|
103
|
+
`after`, and the others) are unchanged.
|
|
104
|
+
|
|
105
|
+
### Fixed
|
|
106
|
+
|
|
107
|
+
- The date reader no longer shifts the pieces of a four-word date around a
|
|
108
|
+
word it does not know. `chr 10 Nov 1788` read as 10 October 1788,
|
|
109
|
+
`b 9 Jun 1750` as 9 September, `bapt. 3 May 1801` as 3 March: the leading
|
|
110
|
+
word was tried as a month, failed, and the day number was taken as the
|
|
111
|
+
month instead. Four pieces are now read only as a day, its ordinal ending
|
|
112
|
+
and a month written as a word, in either order (`Feb 11 th 1809`,
|
|
113
|
+
`11 th Feb 1809`, `1er janvier 1800`, `5te Januar 1800`); anything else is
|
|
114
|
+
`DateKind::Unparsed`, keeps its text as the phrase, and still offers its
|
|
115
|
+
year to sort by, so `to_gedcom_5_5_1` and `to_gedcom_7` return `None` and
|
|
116
|
+
the caller writes it as a date phrase. A month given only as a number never
|
|
117
|
+
decides the order of four pieces.
|
|
118
|
+
- A dual year (`10 JAN 1731/32`) admits both its years in every check, not
|
|
119
|
+
only where days are compared. The checks that compare years read it as
|
|
120
|
+
its first year alone, so `BIRT 1732` with `DEAT 10 JAN 1731/32` was
|
|
121
|
+
`died-before-born` ("born 1732 and died 1731"); it is now no finding, and
|
|
122
|
+
a death past both years says `died between 1731 and 1732`. Where the days
|
|
123
|
+
of two dates are compared, they alone decide the order, so a burial in the
|
|
124
|
+
Julian year 1700, which runs eleven days into the Gregorian 1701, is no
|
|
125
|
+
longer wholly before a death in the Gregorian 1701.
|
|
126
|
+
- `child-listed-twice` keeps the children it has seen in a set rather than
|
|
127
|
+
a list, so a family listing tens of thousands of children is checked in
|
|
128
|
+
time proportional to their number, not its square.
|
|
129
|
+
- The checks on an individual's own record read that record's dates when it
|
|
130
|
+
has no identifier, or shares one with another record. Before, such a
|
|
131
|
+
record was checked against no dates, or against those of the last record
|
|
132
|
+
with its identifier.
|
|
133
|
+
|
|
134
|
+
## [0.1.17] - 2026-10-16
|
|
135
|
+
|
|
136
|
+
### Changed
|
|
137
|
+
|
|
138
|
+
- Relicensed from AGPL-3.0-or-later to GPL-3.0-or-later: the crate, the
|
|
139
|
+
Python wheel and the npm package. The code is unchanged. Versions up to and
|
|
140
|
+
including 0.1.16 remain available under AGPL-3.0-or-later as published.
|
|
141
|
+
|
|
8
142
|
## [0.1.16] - 2026-10-14
|
|
9
143
|
|
|
10
144
|
### Added
|
|
@@ -3,7 +3,7 @@
|
|
|
3
3
|
# was checked on crates.io, npm, and PyPI before the initial release.
|
|
4
4
|
[package]
|
|
5
5
|
name = "gedcomkit"
|
|
6
|
-
version = "0.1.
|
|
6
|
+
version = "0.1.18"
|
|
7
7
|
description = "A byte-preserving GEDCOM document model: decoding, parsing, readings, version conversion, plausibility checks, and the GEDZIP container, for GEDCOM 5.5 through 7.x."
|
|
8
8
|
edition = "2024"
|
|
9
9
|
# The true minimum, not the workspace's toolchain: a parser library is a leaf
|
|
@@ -11,10 +11,11 @@ edition = "2024"
|
|
|
11
11
|
# actually needs a newer feature (currently: edition 2024, `slice::as_chunks`).
|
|
12
12
|
rust-version = "1.88"
|
|
13
13
|
# The crate carries its own license so it can leave the (unlicensed)
|
|
14
|
-
# application workspace.
|
|
14
|
+
# application workspace. GPL-3.0-or-later, the user's call (2026-10-16; AGPL
|
|
15
|
+
# through 0.1.16):
|
|
15
16
|
# the LICENSE text sits beside this file, and the sole copyright holder can
|
|
16
17
|
# always grant other terms separately.
|
|
17
|
-
license = "
|
|
18
|
+
license = "GPL-3.0-or-later"
|
|
18
19
|
repository = "https://gitlab.com/timrs2998/gedcomkit"
|
|
19
20
|
keywords = ["gedcom", "genealogy", "parser", "family-tree", "gedzip"]
|
|
20
21
|
categories = ["parser-implementations", "encoding"]
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
GNU
|
|
2
|
-
Version 3,
|
|
1
|
+
GNU GENERAL PUBLIC LICENSE
|
|
2
|
+
Version 3, 29 June 2007
|
|
3
3
|
|
|
4
4
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
|
5
5
|
Everyone is permitted to copy and distribute verbatim copies
|
|
@@ -7,15 +7,17 @@
|
|
|
7
7
|
|
|
8
8
|
Preamble
|
|
9
9
|
|
|
10
|
-
The GNU
|
|
11
|
-
software and other kinds of works
|
|
12
|
-
cooperation with the community in the case of network server software.
|
|
10
|
+
The GNU General Public License is a free, copyleft license for
|
|
11
|
+
software and other kinds of works.
|
|
13
12
|
|
|
14
13
|
The licenses for most software and other practical works are designed
|
|
15
14
|
to take away your freedom to share and change the works. By contrast,
|
|
16
|
-
|
|
15
|
+
the GNU General Public License is intended to guarantee your freedom to
|
|
17
16
|
share and change all versions of a program--to make sure it remains free
|
|
18
|
-
software for all its users.
|
|
17
|
+
software for all its users. We, the Free Software Foundation, use the
|
|
18
|
+
GNU General Public License for most of our software; it applies also to
|
|
19
|
+
any other work released this way by its authors. You can apply it to
|
|
20
|
+
your programs, too.
|
|
19
21
|
|
|
20
22
|
When we speak of free software, we are referring to freedom, not
|
|
21
23
|
price. Our General Public Licenses are designed to make sure that you
|
|
@@ -24,34 +26,44 @@ them if you wish), that you receive source code or can get it if you
|
|
|
24
26
|
want it, that you can change the software or use pieces of it in new
|
|
25
27
|
free programs, and that you know you can do these things.
|
|
26
28
|
|
|
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
|
-
this
|
|
29
|
+
To protect your rights, we need to prevent others from denying you
|
|
30
|
+
these rights or asking you to surrender the rights. Therefore, you have
|
|
31
|
+
certain responsibilities if you distribute copies of the software, or if
|
|
32
|
+
you modify it: responsibilities to respect the freedom of others.
|
|
33
|
+
|
|
34
|
+
For example, if you distribute copies of such a program, whether
|
|
35
|
+
gratis or for a fee, you must pass on to the recipients the same
|
|
36
|
+
freedoms that you received. You must make sure that they, too, receive
|
|
37
|
+
or can get the source code. And you must show them these terms so they
|
|
38
|
+
know their rights.
|
|
39
|
+
|
|
40
|
+
Developers that use the GNU GPL protect your rights with two steps:
|
|
41
|
+
(1) assert copyright on the software, and (2) offer you this License
|
|
42
|
+
giving you legal permission to copy, distribute and/or modify it.
|
|
43
|
+
|
|
44
|
+
For the developers' and authors' protection, the GPL clearly explains
|
|
45
|
+
that there is no warranty for this free software. For both users' and
|
|
46
|
+
authors' sake, the GPL requires that modified versions be marked as
|
|
47
|
+
changed, so that their problems will not be attributed erroneously to
|
|
48
|
+
authors of previous versions.
|
|
49
|
+
|
|
50
|
+
Some devices are designed to deny users access to install or run
|
|
51
|
+
modified versions of the software inside them, although the manufacturer
|
|
52
|
+
can do so. This is fundamentally incompatible with the aim of
|
|
53
|
+
protecting users' freedom to change the software. The systematic
|
|
54
|
+
pattern of such abuse occurs in the area of products for individuals to
|
|
55
|
+
use, which is precisely where it is most unacceptable. Therefore, we
|
|
56
|
+
have designed this version of the GPL to prohibit the practice for those
|
|
57
|
+
products. If such problems arise substantially in other domains, we
|
|
58
|
+
stand ready to extend this provision to those domains in future versions
|
|
59
|
+
of the GPL, as needed to protect the freedom of users.
|
|
60
|
+
|
|
61
|
+
Finally, every program is threatened constantly by software patents.
|
|
62
|
+
States should not allow patents to restrict development and use of
|
|
63
|
+
software on general-purpose computers, but in those that do, we wish to
|
|
64
|
+
avoid the special danger that patents applied to a free program could
|
|
65
|
+
make it effectively proprietary. To prevent this, the GPL assures that
|
|
66
|
+
patents cannot be used to render the program non-free.
|
|
55
67
|
|
|
56
68
|
The precise terms and conditions for copying, distribution and
|
|
57
69
|
modification follow.
|
|
@@ -60,7 +72,7 @@ modification follow.
|
|
|
60
72
|
|
|
61
73
|
0. Definitions.
|
|
62
74
|
|
|
63
|
-
"This License" refers to version 3 of the GNU
|
|
75
|
+
"This License" refers to version 3 of the GNU General Public License.
|
|
64
76
|
|
|
65
77
|
"Copyright" also means copyright-like laws that apply to other kinds of
|
|
66
78
|
works, such as semiconductor masks.
|
|
@@ -537,45 +549,35 @@ to collect a royalty for further conveying from those to whom you convey
|
|
|
537
549
|
the Program, the only way you could satisfy both those terms and this
|
|
538
550
|
License would be to refrain entirely from conveying the Program.
|
|
539
551
|
|
|
540
|
-
13.
|
|
541
|
-
|
|
542
|
-
Notwithstanding any other provision of this License, if you modify the
|
|
543
|
-
Program, your modified version must prominently offer all users
|
|
544
|
-
interacting with it remotely through a computer network (if your version
|
|
545
|
-
supports such interaction) an opportunity to receive the Corresponding
|
|
546
|
-
Source of your version by providing access to the Corresponding Source
|
|
547
|
-
from a network server at no charge, through some standard or customary
|
|
548
|
-
means of facilitating copying of software. This Corresponding Source
|
|
549
|
-
shall include the Corresponding Source for any work covered by version 3
|
|
550
|
-
of the GNU General Public License that is incorporated pursuant to the
|
|
551
|
-
following paragraph.
|
|
552
|
+
13. Use with the GNU Affero General Public License.
|
|
552
553
|
|
|
553
554
|
Notwithstanding any other provision of this License, you have
|
|
554
555
|
permission to link or combine any covered work with a work licensed
|
|
555
|
-
under version 3 of the GNU General Public License into a single
|
|
556
|
+
under version 3 of the GNU Affero General Public License into a single
|
|
556
557
|
combined work, and to convey the resulting work. The terms of this
|
|
557
558
|
License will continue to apply to the part which is the covered work,
|
|
558
|
-
but the
|
|
559
|
-
|
|
559
|
+
but the special requirements of the GNU Affero General Public License,
|
|
560
|
+
section 13, concerning interaction through a network will apply to the
|
|
561
|
+
combination as such.
|
|
560
562
|
|
|
561
563
|
14. Revised Versions of this License.
|
|
562
564
|
|
|
563
565
|
The Free Software Foundation may publish revised and/or new versions of
|
|
564
|
-
the GNU
|
|
565
|
-
|
|
566
|
+
the GNU General Public License from time to time. Such new versions will
|
|
567
|
+
be similar in spirit to the present version, but may differ in detail to
|
|
566
568
|
address new problems or concerns.
|
|
567
569
|
|
|
568
570
|
Each version is given a distinguishing version number. If the
|
|
569
|
-
Program specifies that a certain numbered version of the GNU
|
|
571
|
+
Program specifies that a certain numbered version of the GNU General
|
|
570
572
|
Public License "or any later version" applies to it, you have the
|
|
571
573
|
option of following the terms and conditions either of that numbered
|
|
572
574
|
version or of any later version published by the Free Software
|
|
573
575
|
Foundation. If the Program does not specify a version number of the
|
|
574
|
-
GNU
|
|
576
|
+
GNU General Public License, you may choose any version ever published
|
|
575
577
|
by the Free Software Foundation.
|
|
576
578
|
|
|
577
579
|
If the Program specifies that a proxy can decide which future
|
|
578
|
-
versions of the GNU
|
|
580
|
+
versions of the GNU General Public License can be used, that proxy's
|
|
579
581
|
public statement of acceptance of a version permanently authorizes you
|
|
580
582
|
to choose that version for the Program.
|
|
581
583
|
|
|
@@ -633,29 +635,40 @@ the "copyright" line and a pointer to where the full notice is found.
|
|
|
633
635
|
Copyright (C) <year> <name of author>
|
|
634
636
|
|
|
635
637
|
This program is free software: you can redistribute it and/or modify
|
|
636
|
-
it under the terms of the GNU
|
|
638
|
+
it under the terms of the GNU General Public License as published by
|
|
637
639
|
the Free Software Foundation, either version 3 of the License, or
|
|
638
640
|
(at your option) any later version.
|
|
639
641
|
|
|
640
642
|
This program is distributed in the hope that it will be useful,
|
|
641
643
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
642
644
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
643
|
-
GNU
|
|
645
|
+
GNU General Public License for more details.
|
|
644
646
|
|
|
645
|
-
You should have received a copy of the GNU
|
|
647
|
+
You should have received a copy of the GNU General Public License
|
|
646
648
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
647
649
|
|
|
648
650
|
Also add information on how to contact you by electronic and paper mail.
|
|
649
651
|
|
|
650
|
-
If
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
|
|
655
|
-
|
|
656
|
-
|
|
652
|
+
If the program does terminal interaction, make it output a short
|
|
653
|
+
notice like this when it starts in an interactive mode:
|
|
654
|
+
|
|
655
|
+
<program> Copyright (C) <year> <name of author>
|
|
656
|
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
657
|
+
This is free software, and you are welcome to redistribute it
|
|
658
|
+
under certain conditions; type `show c' for details.
|
|
659
|
+
|
|
660
|
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
661
|
+
parts of the General Public License. Of course, your program's commands
|
|
662
|
+
might be different; for a GUI interface, you would use an "about box".
|
|
657
663
|
|
|
658
664
|
You should also get your employer (if you work as a programmer) or school,
|
|
659
665
|
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
|
660
|
-
For more information on this, and how to apply and follow the GNU
|
|
666
|
+
For more information on this, and how to apply and follow the GNU GPL, see
|
|
661
667
|
<https://www.gnu.org/licenses/>.
|
|
668
|
+
|
|
669
|
+
The GNU General Public License does not permit incorporating your program
|
|
670
|
+
into proprietary programs. If your program is a subroutine library, you
|
|
671
|
+
may consider it more useful to permit linking proprietary applications with
|
|
672
|
+
the library. If this is what you want to do, use the GNU Lesser General
|
|
673
|
+
Public License instead of this License. But first, please read
|
|
674
|
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: gedcomkit
|
|
3
|
-
Version: 0.1.
|
|
3
|
+
Version: 0.1.18
|
|
4
4
|
Classifier: Development Status :: 3 - Alpha
|
|
5
5
|
Classifier: Programming Language :: Rust
|
|
6
6
|
Classifier: Programming Language :: Python :: Implementation :: CPython
|
|
@@ -8,7 +8,7 @@ Classifier: Topic :: Sociology :: Genealogy
|
|
|
8
8
|
License-File: LICENSE
|
|
9
9
|
Summary: An archival-grade GEDCOM library: byte-preserving round-trip, encoding detection and reporting, GEDCOM 5.5 through 7.x, GEDZIP. Rust core, Python bindings.
|
|
10
10
|
Keywords: gedcom,genealogy,parser,family-tree,gedzip
|
|
11
|
-
License-Expression:
|
|
11
|
+
License-Expression: GPL-3.0-or-later
|
|
12
12
|
Requires-Python: >=3.9
|
|
13
13
|
Description-Content-Type: text/markdown; charset=UTF-8; variant=GFM
|
|
14
14
|
|
|
@@ -52,5 +52,5 @@ maturin build --release # a wheel
|
|
|
52
52
|
The Rust core lives at the root of the same repository; this crate
|
|
53
53
|
is a thin PyO3 layer over its public API.
|
|
54
54
|
|
|
55
|
-
License:
|
|
55
|
+
License: GPL-3.0-or-later, the same as the core (see LICENSE).
|
|
56
56
|
|
|
@@ -23,6 +23,9 @@ Python:
|
|
|
23
23
|
python -m pip install gedcomkit
|
|
24
24
|
```
|
|
25
25
|
|
|
26
|
+
Wheels are published for Linux x86_64 only. Elsewhere pip builds the package from
|
|
27
|
+
source, which needs a Rust toolchain ([rustup](https://rustup.rs)).
|
|
28
|
+
|
|
26
29
|
Node.js / WASM:
|
|
27
30
|
|
|
28
31
|
```bash
|
|
@@ -161,7 +164,7 @@ and don't need the original bytes to survive.
|
|
|
161
164
|
| Hostile-input bounds | size, depth, counts | file size | — | — |
|
|
162
165
|
| Version conversion | reported per construct | — | — | — |
|
|
163
166
|
| Python + browser bindings | yes | — | JS only | — |
|
|
164
|
-
| License |
|
|
167
|
+
| License | GPL-3.0-or-later | MIT | MIT | MIT |
|
|
165
168
|
|
|
166
169
|
## How it is tested
|
|
167
170
|
|
|
@@ -214,10 +217,11 @@ contributors are expected to follow.
|
|
|
214
217
|
|
|
215
218
|
## License
|
|
216
219
|
|
|
217
|
-
**
|
|
218
|
-
change it freely; if you distribute it
|
|
219
|
-
|
|
220
|
-
can grant separate terms; open
|
|
220
|
+
**GPL-3.0-or-later** (see [LICENSE](LICENSE)). In short: use, study, and
|
|
221
|
+
change it freely; if you distribute it, or anything built on it, pass the
|
|
222
|
+
same freedoms on, source included. Versions up to 0.1.16 were published
|
|
223
|
+
under AGPL-3.0-or-later. The copyright holder can grant separate terms; open
|
|
224
|
+
an issue to ask.
|
|
221
225
|
|
|
222
226
|
The library's code is original to this project. What it learned from
|
|
223
227
|
elsewhere, it learned as published fact — the GEDCOM specifications' tag and
|
|
@@ -35,7 +35,7 @@ dependencies = [
|
|
|
35
35
|
|
|
36
36
|
[[package]]
|
|
37
37
|
name = "gedcomkit"
|
|
38
|
-
version = "0.1.
|
|
38
|
+
version = "0.1.18"
|
|
39
39
|
dependencies = [
|
|
40
40
|
"flate2",
|
|
41
41
|
"serde",
|
|
@@ -43,7 +43,7 @@ dependencies = [
|
|
|
43
43
|
|
|
44
44
|
[[package]]
|
|
45
45
|
name = "gedcomkit-py"
|
|
46
|
-
version = "0.1.
|
|
46
|
+
version = "0.1.18"
|
|
47
47
|
dependencies = [
|
|
48
48
|
"gedcomkit",
|
|
49
49
|
"pyo3",
|
|
@@ -2,11 +2,11 @@
|
|
|
2
2
|
# abi3 keeps it to one wheel per platform across Python versions.
|
|
3
3
|
[package]
|
|
4
4
|
name = "gedcomkit-py"
|
|
5
|
-
version = "0.1.
|
|
5
|
+
version = "0.1.18"
|
|
6
6
|
description = "Python bindings for gedcomkit: an archival-grade GEDCOM library — byte-preserving round-trip, encoding detection, GEDCOM 5.5 through 7.x, GEDZIP."
|
|
7
7
|
edition = "2024"
|
|
8
8
|
rust-version = "1.88"
|
|
9
|
-
license = "
|
|
9
|
+
license = "GPL-3.0-or-later"
|
|
10
10
|
repository = "https://gitlab.com/timrs2998/gedcomkit"
|
|
11
11
|
readme = "README.md"
|
|
12
12
|
publish = false
|