Affinity vs Consanguinity Legal & Kinship Explorer

The saved explorer classifies relationship presets using stored data and simple branches. This explains its program, not verified current marriage law or personalized genetic estimates. For step siblings, the prohibition branch requires both the co adoption toggle and a state record whose adoption bar is true. With one false the branch is false; with both true it is true. The bars show zero and one at three hundred pixels per true predicate. Half siblings always take the prohibited branch in this program. First cousins and double first cousins use the same state cousin field, despite different stored relationship coefficients. The parent marriage checkbox has no listener in the displayed engine and is not consulted by this classification function. These labels follow authored records rather than a new statute lookup. The table filters the already classified records by search and status. Search matches a lowercase state name, code or citation; status either accepts all or exactly matches the computed status. The national summary increments before filtering, and counts conditional records together with allowed records. For a hypothetical three record set containing one allowed, one conditional and one prohibited result, it reports two counted records even when the visible table is filtered to the single prohibited row. Bars at one hundred pixels per record show two and one. This illustration is about control flow, not a tally of actual state laws. The fixed summary suffix says fifty states, while the numerator comes from the stored array. Changing a table filter does not change the underlying relationship or state classification. Both export buttons use the same full matrix builder. It maps every stored state record, irrespective of the search box or status filter, and attaches relationship fields, the co adoption flag and a creation timestamp. Thus a hypothetical filtered view showing one of three records still exports three records: bars one hundred and three hundred pixels at one hundred pixels per record. The JSON and Markdown formats differ, but neither exports the current filtered subset. The tree draws from fixed preset node coordinates and link types; it does not infer genealogy from user supplied pedigrees. Offline D three is unavailable, so tree rendering throws. Earlier listeners and computed table fields can still operate before that drawing exception. Their actual preservation must be tested independently. The statutory descriptions and citations here remain unverified source data.