KiCad PCB EDA Suite
Loading...
Searching...
No Matches
KICAD_DIFF::RECONCILIATION Struct Reference

Maps every item in document A to either a peer in document B or to "only-in-A", and vice versa. More...

#include <identity_reconciler.h>

Public Attributes

std::map< KIID_PATH, KIID_PATHaToB
 
std::map< KIID_PATH, KIID_PATHbToA
 
std::set< KIID_PATHaOnly
 
std::set< KIID_PATHbOnly
 
std::vector< KIID_PATHduplicatesA
 
std::vector< KIID_PATHduplicatesB
 
std::size_t similarityMatches = 0
 

Detailed Description

Maps every item in document A to either a peer in document B or to "only-in-A", and vice versa.

Also flags duplicate KIID_PATHs within either side.

For the merge engine, the same reconciler is run on both (ancestor, ours) and (ancestor, theirs); the union of the two outputs is what the merge plan walks.

Definition at line 68 of file identity_reconciler.h.

Member Data Documentation

◆ aOnly

◆ aToB

◆ bOnly

◆ bToA

std::map<KIID_PATH, KIID_PATH> KICAD_DIFF::RECONCILIATION::bToA

Definition at line 71 of file identity_reconciler.h.

◆ duplicatesA

std::vector<KIID_PATH> KICAD_DIFF::RECONCILIATION::duplicatesA

◆ duplicatesB

std::vector<KIID_PATH> KICAD_DIFF::RECONCILIATION::duplicatesB

◆ similarityMatches

std::size_t KICAD_DIFF::RECONCILIATION::similarityMatches = 0

Definition at line 76 of file identity_reconciler.h.

Referenced by BOOST_AUTO_TEST_CASE().


The documentation for this struct was generated from the following file: