/
GraphComparer.h
61 lines (45 loc) · 1.57 KB
/
GraphComparer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
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
55
56
57
58
59
60
61
#pragma once
#include <string>
#include <list>
#include <map>
#include <memory>
#include "inode.h"
#include "imap.h"
#include "itextstream.h"
#include "ComparisonResult.h"
namespace scene
{
namespace merge
{
/**
* Static utility class to compare two scenes given by their root nodes.
*/
class GraphComparer
{
private:
using Fingerprints = std::map<std::string, scene::INodePtr>;
public:
struct EntityMismatch
{
std::string fingerPrint;
scene::INodePtr node;
std::string entityName;
};
using EntityMismatchByName = std::map<std::string, EntityMismatch>;
public:
// Compares the two graphs and returns the result
static ComparisonResult::Ptr Compare(const scene::IMapRootNodePtr& source, const scene::IMapRootNodePtr& base);
private:
static void processDifferingEntities(ComparisonResult& result, const EntityMismatchByName& sourceMismatches,
const EntityMismatchByName& baseMismatches);
static Fingerprints collectEntityFingerprints(const scene::INodePtr& root);
static Fingerprints collectPrimitiveFingerprints(const scene::INodePtr& parent);
static Fingerprints collectNodeFingerprints(const scene::INodePtr& parent,
const std::function<bool(const scene::INodePtr& node)>& nodePredicate);
static std::list<ComparisonResult::KeyValueDifference> compareKeyValues(
const scene::INodePtr& sourceNode, const scene::INodePtr& baseNode);
static std::list<ComparisonResult::PrimitiveDifference> compareChildNodes(
const scene::INodePtr& sourceNode, const scene::INodePtr& baseNode);
};
}
}