Skip to main content
summaryrefslogtreecommitdiffstats
blob: b4292a6eed038b87c4b98b3ae5ae72f045eebe78 (plain) (blame)
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
/*******************************************************************************
 * Copyright (c) 2012, 2016 Obeo and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 * 
 * Contributors:
 *     Obeo - initial API and implementation
 *     Stefan Dirix - bugs 441172, 452147, 460902 and 460923
 *******************************************************************************/
package org.eclipse.emf.compare.tests.merge;

import static com.google.common.base.Predicates.and;
import static com.google.common.base.Predicates.instanceOf;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.added;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.addedToReference;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.changedReference;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.fromSide;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.moved;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.removed;
import static org.eclipse.emf.compare.utils.EMFComparePredicates.removedFromReference;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.assertNull;
import static org.junit.Assert.assertSame;
import static org.junit.Assert.assertTrue;

import com.google.common.collect.ImmutableList;
import com.google.common.collect.Iterators;
import com.google.common.collect.Lists;

import java.io.IOException;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;

import org.eclipse.emf.common.util.BasicMonitor;
import org.eclipse.emf.compare.Comparison;
import org.eclipse.emf.compare.Diff;
import org.eclipse.emf.compare.DifferenceSource;
import org.eclipse.emf.compare.DifferenceState;
import org.eclipse.emf.compare.EMFCompare;
import org.eclipse.emf.compare.FeatureMapChange;
import org.eclipse.emf.compare.Match;
import org.eclipse.emf.compare.ReferenceChange;
import org.eclipse.emf.compare.internal.utils.ComparisonUtil;
import org.eclipse.emf.compare.merge.IMerger;
import org.eclipse.emf.compare.scope.DefaultComparisonScope;
import org.eclipse.emf.compare.scope.IComparisonScope;
import org.eclipse.emf.compare.tests.conflict.data.ConflictInputData;
import org.eclipse.emf.compare.tests.equi.data.EquiInputData;
import org.eclipse.emf.compare.tests.fullcomparison.data.identifier.IdentifierMatchInputData;
import org.eclipse.emf.compare.tests.merge.data.TwoWayMergeInputData;
import org.eclipse.emf.ecore.EObject;
import org.eclipse.emf.ecore.EReference;
import org.eclipse.emf.ecore.resource.Resource;
import org.eclipse.emf.ecore.resource.impl.ResourceSetImpl;
import org.junit.Test;

@SuppressWarnings("nls")
public class MultipleMergeTest {
	// We'll use input from various other tests
	private ConflictInputData conflictInput = new ConflictInputData();

	private EquiInputData equivalenceInput = new EquiInputData();

	private TwoWayMergeInputData twoWayInput = new TwoWayMergeInputData();

	private IMerger.Registry mergerRegistry = IMerger.RegistryImpl.createStandaloneInstance();

	/**
	 * @see ComplexMergeTest for a parametric test of all combinations of merge order. This test is here to
	 *      detail step by step how the merge is supposed to take place and facilitate debugging in case of a
	 *      problem.
	 * @throws IOException
	 */
	@Test
	public void testComplexUseCaseLtoR1() throws IOException {
		final Resource left = conflictInput.getComplexLeft();
		final Resource origin = conflictInput.getComplexOrigin();
		final Resource right = conflictInput.getComplexRight();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, origin);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();
		/*
		 * This use case features 12 distinct differences of all types, adding up to 4 real conflicts and 1
		 * pseudo conflict.
		 */
		// 1 - Left : Node8 added
		// 2 - Left : Node9 added
		// 3 - Left : Node1 moved
		// 4 - Left : Node0 added
		// 5 - Left : Node5 removed
		// 6 - Left : Node6 removed
		// 7 - Left : Node7 removed

		// 8 - Right : Node6 moved
		// 9 - Right : Node9 added
		// 10 - Right : Node0 added
		// 11 - Right : Node1 moved
		// 12 - Right : Node5 removed

		// Real conflict : 6 and 8 (Moving and deleting the same value)
		// Real conflict : 2 and 9 (Adding the same value at different indices)
		// Real conflict : 4 and 10 (Adding the same value at different indices)

		// Pseudo conflict : 3 and 11 (Moving the same value to the same index on both sides)
		// Pseudo conflict : 5 and 12 (Removing the same value on both sides)

		// For reference
		// "original" is : {Node1, Node2, Node3, Node4, Node5, Node6, Node7}
		// "left" is : {Node8, Node9, Node2, Node3, Node4, Node1, Node0}
		// "right" is : {Node6, Node2, Node9, Node3, Node0, Node1, Node4, Node7}

		// Merge all, left to right, in order. Resolve conflicts by taking left side.

		// First, reject all conflicts on the right
		// left: 8923410, right: 62930147
		final ReferenceChange rightAdOfNode9 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), added("Root.Node9")));
		mergerRegistry.getHighestRankingMerger(rightAdOfNode9).copyLeftToRight(rightAdOfNode9,
				new BasicMonitor());

		// left: 8923410, right: 6230147

		final ReferenceChange rightMoveOfNode1 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), moved("Root.Node1", "containmentRef1")));
		// revert move of Node 1 in right. It should be re-positioned right before 2
		mergerRegistry.getHighestRankingMerger(rightMoveOfNode1).copyLeftToRight(rightMoveOfNode1,
				new BasicMonitor());
		assertValueIndexIs(rightMoveOfNode1, false, 1);

		// left: 8923410, right: 6123047

		final ReferenceChange rightAddOfNode0 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), added("Root.Node0")));
		// revert addition of 0 in right
		mergerRegistry.getHighestRankingMerger(rightAddOfNode0).copyLeftToRight(rightAddOfNode0,
				new BasicMonitor());

		// left: 8923410, right: 612347

		final ReferenceChange rightMoveOfNode6 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), moved("Root.Node6", "containmentRef1")));
		// Revert move of 6 in right.
		mergerRegistry.getHighestRankingMerger(rightMoveOfNode6).copyLeftToRight(rightMoveOfNode6,
				new BasicMonitor());
		assertValueIndexIs(rightMoveOfNode6, false, 4);

		// left: 8923410, right: 123467

		final ReferenceChange rightDeleteOfNode5 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.RIGHT), removed("Root.Node5")));
		// delete of Node 5 (pseudo-conflict) => no change
		mergerRegistry.getHighestRankingMerger(rightDeleteOfNode5).copyLeftToRight(rightDeleteOfNode5,
				new BasicMonitor());
		assertValueIndexIs(rightDeleteOfNode5, false, -1);

		// left: 8923410, right: 123467

		// And now, accept all other changes

		// add Node8
		final ReferenceChange leftAddOfNode8 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node8")));
		// LCS is currently {2, 3, 4}. Insertion index is right before 2.
		mergerRegistry.getHighestRankingMerger(leftAddOfNode8).copyLeftToRight(leftAddOfNode8,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode8, false, 1);

		// left: 8923410, right: 1823467

		// add Node9
		final ReferenceChange leftAddOfNode9 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node9")));
		// LCS is now {8, 2, 3, 4}. Insertion should be right after 8
		mergerRegistry.getHighestRankingMerger(leftAddOfNode9).copyLeftToRight(leftAddOfNode9,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode9, false, 2);

		// left: 8923410, right: 18923467

		// move Node1
		final ReferenceChange leftMoveOfNode1 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), moved("Root.Node1", "containmentRef1")));
		// LCS is {8, 9, 2, 3, 4}. 1 should be moved right after 4.
		mergerRegistry.getHighestRankingMerger(leftMoveOfNode1).copyLeftToRight(leftMoveOfNode1,
				new BasicMonitor());
		assertValueIndexIs(leftMoveOfNode1, false, 5);

		// left: 8923410, right: 89234167

		// add Node0
		final ReferenceChange leftAddOfNode0 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node0")));
		// LCS is now {8, 9, 2, 3, 4, 1}. 0 should be added right after 1
		mergerRegistry.getHighestRankingMerger(leftAddOfNode0).copyLeftToRight(leftAddOfNode0,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode0, false, 6);

		// left: 8923410, right: 892341067

		// remove Node5 (again since pseudo-conflict) should have no effect
		// These diff won't even be presented to the user, but let's merge it anyway.
		final ReferenceChange leftDeleteOfNode5 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.LEFT), removed("Root.Node5")));
		mergerRegistry.getHighestRankingMerger(leftDeleteOfNode5).copyLeftToRight(leftDeleteOfNode5,
				new BasicMonitor());
		assertValueIndexIs(leftDeleteOfNode5, false, -1);

		// left: 8923410, right: 892341067

		// remove Node6
		final ReferenceChange leftDeleteOfNode6 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.LEFT), removed("Root.Node6")));
		mergerRegistry.getHighestRankingMerger(leftDeleteOfNode6).copyLeftToRight(leftDeleteOfNode6,
				new BasicMonitor());
		assertValueIndexIs(leftDeleteOfNode6, false, -1);

		// left: 8923410, right: 89234107

		// merge 7 (remove Node7)
		final ReferenceChange diff7 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), removed("Root.Node7")));
		mergerRegistry.getHighestRankingMerger(diff7).copyLeftToRight(diff7, new BasicMonitor());
		assertValueIndexIs(diff7, false, -1);

		// left: 8923410, right: 8923410

		// Left and Right should now be equal
		final EObject leftContainer = diff7.getMatch().getLeft();
		final EObject rightContainer = diff7.getMatch().getRight();
		final List<EObject> leftContents = getAsList(leftContainer, diff7.getReference());
		final List<EObject> rightContents = getAsList(rightContainer, diff7.getReference());
		assertEqualContents(comparison, leftContents, rightContents);
	}

	/**
	 * Same as previous but right to left.
	 * 
	 * @throws IOException
	 */
	@Test
	public void testComplexUseCaseRtoL1() throws IOException {
		final Resource left = conflictInput.getComplexLeft();
		final Resource origin = conflictInput.getComplexOrigin();
		final Resource right = conflictInput.getComplexRight();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, origin);
		final Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// See description of the changes in #testComplexUseCaseLtoR1
		// Merge all, right to left, in order. Resolve conflicts by taking right side.

		// left: 8923410, right: 62930147

		// Revert delete of 6 on the left side
		final ReferenceChange leftDeleteOfNode6 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.LEFT), removed("Root.Node6")));
		mergerRegistry.getHighestRankingMerger(leftDeleteOfNode6).copyRightToLeft(leftDeleteOfNode6,
				new BasicMonitor());
		assertValueIndexIs(leftDeleteOfNode6, true, 5);

		// left: 89234610, right: 62930147

		// Revert add of 9 on the left side
		final ReferenceChange leftAddOfNode9 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node9")));
		mergerRegistry.getHighestRankingMerger(leftAddOfNode9).copyRightToLeft(leftAddOfNode9,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode9, true, -1);

		// left: 8234610, right: 62930147

		// Revert delete of node 5, pseudo conflict -> does nothing
		final ReferenceChange leftDeleteOfNode5 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.LEFT), removed("Root.Node5")));
		mergerRegistry.getHighestRankingMerger(leftDeleteOfNode5).copyRightToLeft(leftDeleteOfNode5,
				new BasicMonitor());
		assertValueIndexIs(leftDeleteOfNode5, true, -1);

		// left: 8234610, right: 62930147

		// Revert add of 0 on the left side
		final ReferenceChange leftAddOfNode0 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node0")));
		mergerRegistry.getHighestRankingMerger(leftAddOfNode0).copyRightToLeft(leftAddOfNode0,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode0, true, -1);

		// left: 823461, right: 62930147

		// Revert move of 1 in left
		final ReferenceChange leftMoveOfNode1 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), moved("Root.Node1", "containmentRef1")));
		mergerRegistry.getHighestRankingMerger(leftMoveOfNode1).copyRightToLeft(leftMoveOfNode1,
				new BasicMonitor());
		assertValueIndexIs(leftMoveOfNode1, true, 1);

		// left: 812346, right: 62930147

		// And now, let's merge all the others right to left

		// move 6
		final ReferenceChange rightMoveOfNode6 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), moved("Root.Node6", "containmentRef1")));
		mergerRegistry.getHighestRankingMerger(rightMoveOfNode6).copyRightToLeft(rightMoveOfNode6,
				new BasicMonitor());
		assertValueIndexIs(rightMoveOfNode6, true, 2);

		// left: 816234, right: 62930147

		// add 9
		final ReferenceChange rightAddOfNode9 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), added("Root.Node9")));
		mergerRegistry.getHighestRankingMerger(rightAddOfNode9).copyRightToLeft(rightAddOfNode9,
				new BasicMonitor());
		assertValueIndexIs(rightAddOfNode9, true, 4);

		// left: 8162934, right: 62930147

		// add 0
		final ReferenceChange rightAddOfNode0 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), added("Root.Node0")));
		mergerRegistry.getHighestRankingMerger(rightAddOfNode0).copyRightToLeft(rightAddOfNode0,
				new BasicMonitor());
		assertValueIndexIs(rightAddOfNode0, true, 6);

		// left: 81629304, right: 62930147

		// move 1
		final ReferenceChange rightMoveOfNode1 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.RIGHT), moved("Root.Node1", "containmentRef1")));
		mergerRegistry.getHighestRankingMerger(rightMoveOfNode1).copyRightToLeft(rightMoveOfNode1,
				new BasicMonitor());
		assertValueIndexIs(rightMoveOfNode1, true, 6);

		// left: 86293014, right: 62930147

		// remove 5 (again, pseudo-conflict) -> no effect
		final ReferenceChange rightDeleteOfNode5 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.RIGHT), removed("Root.Node5")));
		mergerRegistry.getHighestRankingMerger(rightDeleteOfNode5).copyRightToLeft(rightDeleteOfNode5,
				new BasicMonitor());
		assertValueIndexIs(rightDeleteOfNode5, true, -1);

		// left: 86293014, right: 62930147

		// revert add 8
		final ReferenceChange leftAddOfNode8 = (ReferenceChange)Iterators.find(differences.iterator(), and(
				fromSide(DifferenceSource.LEFT), added("Root.Node8")));
		mergerRegistry.getHighestRankingMerger(leftAddOfNode8).copyRightToLeft(leftAddOfNode8,
				new BasicMonitor());
		assertValueIndexIs(leftAddOfNode8, false, -1);

		// left: 6293014, right: 62930147

		// revert delete 7
		final ReferenceChange leftDeleteOfNode7 = (ReferenceChange)Iterators.find(differences.iterator(),
				and(fromSide(DifferenceSource.LEFT), removed("Root.Node7")));
		mergerRegistry.getHighestRankingMerger(leftDeleteOfNode7).copyRightToLeft(leftDeleteOfNode7,
				new BasicMonitor());
		assertValueIndexIs(leftDeleteOfNode7, false, 7);

		// left: 62930147, right: 62930147

		// Left and Right should now be equal
		final EObject leftContainer = leftDeleteOfNode7.getMatch().getLeft();
		final EObject rightContainer = leftDeleteOfNode7.getMatch().getRight();
		final List<EObject> leftContents = getAsList(leftContainer, leftDeleteOfNode7.getReference());
		final List<EObject> rightContents = getAsList(rightContainer, leftDeleteOfNode7.getReference());
		assertEqualContents(comparison, leftContents, rightContents);
	}

	@Test
	public void testEquivalenceA1LtoR() throws IOException {
		final Resource left = equivalenceInput.getA1Left();
		final Resource right = equivalenceInput.getA1Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 6 differences, equivalent by pairs
		assertEquals(6, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4
		// diff5 is equivalent to diff6

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", null, "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", null, "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.C", "destination", "Requirements.D"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.D", "source", null, "Requirements.C"));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.E", "destination", "Requirements.F"));
		final ReferenceChange diff6 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.F", "source", "Requirements.E"));

		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		// Check that diff1 got properly merged
		assertMerged(comparison, diff1, false, false);
		// And validate that diff2 got merged as an equivalent diff
		assertMerged(comparison, diff2, false, false);

		mergerRegistry.getHighestRankingMerger(diff3).copyLeftToRight(diff3, new BasicMonitor());
		// Check that diff3 got properly merged
		assertMerged(comparison, diff3, false, false);
		// And validate that diff4 got merged as an equivalent diff
		assertMerged(comparison, diff4, false, false);

		mergerRegistry.getHighestRankingMerger(diff5).copyLeftToRight(diff5, new BasicMonitor());
		// Check that diff5 got properly merged
		assertMerged(comparison, diff5, false, false);
		// And validate that diff6 got merged as an equivalent diff
		assertMerged(comparison, diff6, false, false);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceA1RtoL() throws IOException {
		final Resource left = equivalenceInput.getA1Left();
		final Resource right = equivalenceInput.getA1Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 6 differences, equivalent by pairs
		assertEquals(6, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4
		// diff5 is equivalent to diff6

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", null, "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", null, "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.C", "destination", "Requirements.D"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.D", "source", null, "Requirements.C"));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.E", "destination", "Requirements.F"));
		final ReferenceChange diff6 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.F", "source", "Requirements.E"));

		mergerRegistry.getHighestRankingMerger(diff1).copyRightToLeft(diff1, new BasicMonitor());
		// Check that diff1 got properly merged (we're unsetting values)
		assertMerged(comparison, diff1, true, true);
		// And validate that diff2 got merged as an equivalent diff
		assertMerged(comparison, diff2, true, true);

		mergerRegistry.getHighestRankingMerger(diff3).copyRightToLeft(diff3, new BasicMonitor());
		assertMerged(comparison, diff3, true, true);
		assertMerged(comparison, diff4, true, true);

		mergerRegistry.getHighestRankingMerger(diff5).copyRightToLeft(diff5, new BasicMonitor());
		assertMerged(comparison, diff5, true, true);
		assertMerged(comparison, diff6, true, true);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceA4LtoR() throws IOException {
		final Resource left = equivalenceInput.getA4Left();
		final Resource right = equivalenceInput.getA4Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 4 differences, equivalent by pairs
		assertEquals(4, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.A", "destination", "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.B", "source", "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.B", "destination", "Requirements.A"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.A", "source", "Requirements.B"));

		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, false, false);
		assertMerged(comparison, diff2, false, false);

		mergerRegistry.getHighestRankingMerger(diff3).copyLeftToRight(diff3, new BasicMonitor());
		assertMerged(comparison, diff3, false, false);
		assertMerged(comparison, diff4, false, false);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceA4RtoL() throws IOException {
		final Resource left = equivalenceInput.getA4Left();
		final Resource right = equivalenceInput.getA4Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 4 differences, equivalent by pairs
		assertEquals(4, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.A", "destination", "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.B", "source", "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.B", "destination", "Requirements.A"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.A", "source", "Requirements.B"));

		mergerRegistry.getHighestRankingMerger(diff1).copyRightToLeft(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, true, true);
		assertMerged(comparison, diff2, true, true);

		mergerRegistry.getHighestRankingMerger(diff3).copyRightToLeft(diff3, new BasicMonitor());
		assertMerged(comparison, diff3, true, true);
		assertMerged(comparison, diff4, true, true);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceA5LtoR() throws IOException {
		final Resource left = equivalenceInput.getA5Left();
		final Resource right = equivalenceInput.getA5Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 12 differences, 3 equivalent pairs, some dependencies
		assertEquals(12, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4
		// diff5 is equivalent to diff6

		// diff1 depends on diff7 and diff 8
		// diff2 also depends on 7 and 8 (equivalent diffs have the same requires)
		// 3 and 4 both depend on 9 and 10
		// 5 and 6 both depend on 11 and 12
		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", null, "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", null, "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.C", "destination", "Requirements.D"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.D", "source", null, "Requirements.C"));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.E", "destination", "Requirements.F"));
		final ReferenceChange diff6 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.F", "source", "Requirements.E"));

		final ReferenceChange diff7 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.A"));
		final ReferenceChange diff8 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.B"));
		final ReferenceChange diff9 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff10 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.D"));
		final ReferenceChange diff11 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.E"));
		final ReferenceChange diff12 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.F"));

		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, false, false);
		assertMerged(comparison, diff2, false, false);
		assertSame(DifferenceState.MERGED, diff7.getState());
		assertSame(DifferenceState.MERGED, diff8.getState());

		mergerRegistry.getHighestRankingMerger(diff3).copyLeftToRight(diff3, new BasicMonitor());
		assertMerged(comparison, diff3, false, false);
		assertMerged(comparison, diff4, false, false);
		assertSame(DifferenceState.MERGED, diff9.getState());
		assertSame(DifferenceState.MERGED, diff10.getState());

		mergerRegistry.getHighestRankingMerger(diff5).copyLeftToRight(diff5, new BasicMonitor());
		assertMerged(comparison, diff5, false, false);
		assertMerged(comparison, diff6, false, false);
		assertSame(DifferenceState.MERGED, diff11.getState());
		assertSame(DifferenceState.MERGED, diff12.getState());

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceA5RtoL() throws IOException {
		final Resource left = equivalenceInput.getA5Left();
		final Resource right = equivalenceInput.getA5Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 12 differences, 3 equivalent pairs, some dependencies
		assertEquals(12, differences.size());

		// diff1 is equivalent to diff2
		// diff3 is equivalent to diff4
		// diff5 is equivalent to diff6

		// diff1 depends on diff7 and diff 8
		// diff2 also depends on 7 and 8 (equivalent diffs have the same requires)
		// 3 and 4 both depend on 9 and 10
		// 5 and 6 both depend on 11 and 12
		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", null, "Requirements.B"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", null, "Requirements.A"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.C", "destination", "Requirements.D"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.D", "source", null, "Requirements.C"));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.E", "destination", "Requirements.F"));
		final ReferenceChange diff6 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements.F", "source", "Requirements.E"));

		final ReferenceChange diff7 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.A"));
		final ReferenceChange diff8 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.B"));
		final ReferenceChange diff9 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff10 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.D"));
		final ReferenceChange diff11 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.E"));
		final ReferenceChange diff12 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.F"));

		// Removing the link between A and B does not necessarily means removing A and B
		// The "required" diffs will ne be merged
		mergerRegistry.getHighestRankingMerger(diff1).copyRightToLeft(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, true, true);
		assertMerged(comparison, diff2, true, true);
		assertSame(DifferenceState.UNRESOLVED, diff7.getState());
		assertSame(DifferenceState.UNRESOLVED, diff8.getState());

		mergerRegistry.getHighestRankingMerger(diff3).copyRightToLeft(diff3, new BasicMonitor());
		assertMerged(comparison, diff3, true, true);
		assertMerged(comparison, diff4, true, true);
		assertSame(DifferenceState.UNRESOLVED, diff9.getState());
		assertSame(DifferenceState.UNRESOLVED, diff10.getState());

		mergerRegistry.getHighestRankingMerger(diff5).copyRightToLeft(diff5, new BasicMonitor());
		assertMerged(comparison, diff5, true, true);
		assertMerged(comparison, diff6, true, true);
		assertSame(DifferenceState.UNRESOLVED, diff11.getState());
		assertSame(DifferenceState.UNRESOLVED, diff12.getState());

		// Merge the 6 remaining diffs
		mergerRegistry.getHighestRankingMerger(diff7).copyRightToLeft(diff7, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff8).copyRightToLeft(diff8, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff9).copyRightToLeft(diff9, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff10).copyRightToLeft(diff10, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff11).copyRightToLeft(diff11, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff12).copyRightToLeft(diff12, new BasicMonitor());

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC2LtoR1() throws IOException {
		final Resource left = equivalenceInput.getC2Left();
		final Resource right = equivalenceInput.getC2Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 4 differences
		// 1 : added C
		// 2 : changed reference "destination" of A to C
		// 3 : unset reference "source" of B
		// 4 : changed reference "source" of C to A
		// 2, 3 and 4 are equivalent
		// 2 and 4 require 1
		assertEquals(4, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", "Requirements.B", "Requirements.C"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", "Requirements.A", null));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.C", "source", null, "Requirements.A"));

		mergerRegistry.getHighestRankingMerger(diff2).copyLeftToRight(diff2, new BasicMonitor());
		assertSame(DifferenceState.MERGED, diff1.getState());
		assertMerged(comparison, diff2, false, false);
		assertMerged(comparison, diff3, true, false);
		assertMerged(comparison, diff4, false, false);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC2LtoR2() throws IOException {
		final Resource left = equivalenceInput.getC2Left();
		final Resource right = equivalenceInput.getC2Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 4 differences
		// 1 : added C
		// 2 : changed reference "destination" of A to C
		// 3 : unset reference "source" of B
		// 4 : changed reference "source" of C to A
		// 2, 3 and 4 are equivalent
		// 2 and 4 require 1
		assertEquals(4, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", "Requirements.B", "Requirements.C"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", "Requirements.A", null));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.C", "source", null, "Requirements.A"));

		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		assertSame(DifferenceState.MERGED, diff1.getState());
		assertSame(DifferenceState.UNRESOLVED, diff2.getState());
		assertSame(DifferenceState.UNRESOLVED, diff3.getState());
		assertSame(DifferenceState.UNRESOLVED, diff4.getState());

		mergerRegistry.getHighestRankingMerger(diff2).copyLeftToRight(diff2, new BasicMonitor());
		assertMerged(comparison, diff2, false, false);
		assertMerged(comparison, diff3, true, false);
		assertMerged(comparison, diff4, false, false);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC2RtoL() throws IOException {
		final Resource left = equivalenceInput.getC2Left();
		final Resource right = equivalenceInput.getC2Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 4 differences
		// 1 : added C
		// 2 : changed reference "destination" of A to C
		// 3 : unset reference "source" of B
		// 4 : changed reference "source" of C to A
		// 2, 3 and 4 are equivalent
		// 2 and 4 require 1
		assertEquals(4, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", "Requirements.B", "Requirements.C"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", "Requirements.A", null));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.C", "source", null, "Requirements.A"));

		mergerRegistry.getHighestRankingMerger(diff2).copyRightToLeft(diff2, new BasicMonitor());
		assertSame(DifferenceState.UNRESOLVED, diff1.getState());
		assertMerged(comparison, diff3, false, true);
		assertMerged(comparison, diff4, true, true);
		/*
		 * Diff 2 is a little more complicated than the usual. We are on a mono-valued refrence, and the merge
		 * operation is actually resetting the value to its original state. We will need to check that.
		 */
		final EObject nodeA = diff2.getMatch().getLeft();
		final EObject nodeB = diff3.getMatch().getLeft();
		assertEquals("A", nodeA.eGet(nodeA.eClass().getEStructuralFeature("name")));
		assertEquals("B", nodeB.eGet(nodeB.eClass().getEStructuralFeature("name")));
		assertSame(nodeB, nodeA.eGet(diff2.getReference()));

		mergerRegistry.getHighestRankingMerger(diff1).copyRightToLeft(diff1, new BasicMonitor());

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC4LtoR() throws IOException {
		final Resource left = equivalenceInput.getC4Left();
		final Resource right = equivalenceInput.getC4Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 5 differences
		// 1 : added C
		// 2 : removed B
		// 3 : changed reference "destination" of A to C
		// 4 : unset reference "source" of B
		// 5 : changed reference "source" of C to A
		// 3, 4 and 5 are equivalent
		// 2 requires 3 and 4
		// 3 and 5 require 1
		assertEquals(5, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				removedFromReference("Requirements", "containmentRef1", "Requirements.B"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", "Requirements.B", "Requirements.C"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", "Requirements.A", null));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.C", "source", null, "Requirements.A"));

		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, false, false);
		assertSame(DifferenceState.UNRESOLVED, diff2.getState());
		assertSame(DifferenceState.UNRESOLVED, diff3.getState());
		assertSame(DifferenceState.UNRESOLVED, diff4.getState());
		assertSame(DifferenceState.UNRESOLVED, diff5.getState());

		mergerRegistry.getHighestRankingMerger(diff2).copyLeftToRight(diff2, new BasicMonitor());
		// B has been deleted : unset element in right
		assertMerged(comparison, diff2, true, false);
		// Change A.destination from "B" to "C"
		assertMerged(comparison, diff3, false, false);
		// Unsetting B.source. B is no longer in either right or left. We'll have to manually check.
		assertSame(DifferenceState.MERGED, diff4.getState());
		assertNull(diff4.getMatch().getLeft());
		assertNull(diff4.getMatch().getRight());
		// 2 required 3, which is equivalent to 5. 5 should thus have been merged too
		assertMerged(comparison, diff5, false, false);

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC4RtoL() throws IOException {
		final Resource left = equivalenceInput.getC4Left();
		final Resource right = equivalenceInput.getC4Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 5 differences
		// 1 : added C
		// 2 : removed B
		// 3 : changed reference "destination" of A to C
		// 4 : unset reference "source" of B
		// 5 : changed reference "source" of C to A
		// 3, 4 and 5 are equivalent
		// 2 requires 3 and 4
		// 3 and 5 require 1
		assertEquals(5, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Requirements", "containmentRef1", "Requirements.C"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				removedFromReference("Requirements", "containmentRef1", "Requirements.B"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.A", "destination", "Requirements.B", "Requirements.C"));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.B", "source", "Requirements.A", null));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Requirements.C", "source", null, "Requirements.A"));

		// 1 is required by 3, which is required by 2 and equivalent to 4 and 5.
		// Resetting 1 should thus reset all other diffs.
		mergerRegistry.getHighestRankingMerger(diff1).copyRightToLeft(diff1, new BasicMonitor());
		assertMerged(comparison, diff1, true, true);
		assertMerged(comparison, diff2, false, true);

		// C has been removed, thus the value match of diff3 has neither left nor right.
		assertSame(DifferenceState.MERGED, diff3.getState());
		final EObject nodeA = diff3.getMatch().getLeft();
		final EObject nodeB = diff4.getMatch().getLeft();
		assertSame(nodeB, nodeA.eGet(diff3.getReference()));

		assertMerged(comparison, diff4, false, true);

		assertSame(DifferenceState.MERGED, diff5.getState());
		assertNull(diff5.getMatch().getLeft());
		assertNull(diff5.getMatch().getRight());

		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC5LtoR() throws IOException {
		final Resource left = equivalenceInput.getC5Left();
		final Resource right = equivalenceInput.getC5Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// Initially 5 differences
		// 1 : Change: Set Node1.source to Node3
		// 2 : Change: Set Node3.destination to Node1
		// 3 : Change: Unset Node4.destination
		// 4 : Add: Node3
		// 5 : Delete Node4
		// 1-2-3 are equivalent

		assertEquals(5, differences.size());

		final ReferenceChange diff1 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node1", "source", "Root.Node4", "Root.Node3"));
		final ReferenceChange diff2 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node3", "destination", null, "Root.Node1"));
		final ReferenceChange diff3 = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node4", "destination", "Root.Node1", null));
		final ReferenceChange diff4 = (ReferenceChange)Iterators.find(differences.iterator(),
				added("Root.Node3"));
		final ReferenceChange diff5 = (ReferenceChange)Iterators.find(differences.iterator(),
				removed("Root.Node4"));

		/*
		 * Merge diff3 first. If the merger blindly merges diff3 without proper looking at the equivalences,
		 * diff1 and diff2 will also be set to status "merged" although the reference to be set is still
		 * missing.
		 */
		mergerRegistry.getHighestRankingMerger(diff3).copyLeftToRight(diff3, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff1).copyLeftToRight(diff1, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff2).copyLeftToRight(diff2, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff4).copyLeftToRight(diff4, new BasicMonitor());
		mergerRegistry.getHighestRankingMerger(diff5).copyLeftToRight(diff5, new BasicMonitor());

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC5RtoL() throws IOException {
		final Resource left = equivalenceInput.getC5Left();
		final Resource right = equivalenceInput.getC5Right();

		// test the other way by reusing the models from C5LtoR
		final IComparisonScope scope = new DefaultComparisonScope(right, left, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		final ReferenceChange unsetDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node4", "destination", null, "Root.Node1"));

		/*
		 * Merge the unsetDiff first. If the merger blindly merges the unsetDiff without proper looking at its
		 * equivalences, the equivalences will also be set to status "merged" although the reference to be set
		 * is still missing.
		 */
		mergerRegistry.getHighestRankingMerger(unsetDiff).copyRightToLeft(unsetDiff, new BasicMonitor());

		// merge the remaining diffs
		for (Diff diff : differences) {
			if (diff != unsetDiff) {
				mergerRegistry.getHighestRankingMerger(diff).copyRightToLeft(diff, new BasicMonitor());
			}
		}

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC6LtoR() throws IOException {
		final Resource left = equivalenceInput.getC6Left();
		final Resource right = equivalenceInput.getC6Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();
		assertEquals(3, differences.size());

		// Initially 3 differences
		// 1 : Change: Set Node1.source to Node3
		// 2 : Change: Set Node3.destination to Node1
		// 3 : Change: Unset Node4.destination
		// 1-2-3 are equivalent

		final ReferenceChange unsetDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node4", "destination", "Root.Node1", null));

		/*
		 * Merge the unsetDiff first. If the merger blindly merges the unsetDiff without proper looking at its
		 * equivalences, the equivalences will also be set to status "merged" although the reference to be set
		 * is still missing.
		 */
		mergerRegistry.getHighestRankingMerger(unsetDiff).copyLeftToRight(unsetDiff, new BasicMonitor());

		// merge the remaining differences
		for (Diff diff : differences) {
			if (diff != unsetDiff) {
				mergerRegistry.getHighestRankingMerger(diff).copyLeftToRight(diff, new BasicMonitor());
			}
		}

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC6RtoL() throws IOException {
		final Resource left = equivalenceInput.getC6Left();
		final Resource right = equivalenceInput.getC6Right();

		// test the other way by reusing the models from C6LtoR
		final IComparisonScope scope = new DefaultComparisonScope(right, left, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();
		assertEquals(3, differences.size());

		final ReferenceChange unsetDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.Node4", "destination", null, "Root.Node1"));

		/*
		 * Merge the unsetDiff first. If the merger blindly merges the unsetDiff without proper looking at its
		 * equivalences, the equivalences will also be set to status "merged" although the reference to be set
		 * is still missing.
		 */
		mergerRegistry.getHighestRankingMerger(unsetDiff).copyRightToLeft(unsetDiff, new BasicMonitor());

		// merge the remaining differences
		for (Diff diff : differences) {
			if (diff != unsetDiff) {
				mergerRegistry.getHighestRankingMerger(diff).copyRightToLeft(diff, new BasicMonitor());
			}
		}

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	/**
	 * Tests a scenario in which two nodes contain interlocked one-to-one references. The merger must handle
	 * these cases with care since diffs can become redundant during merging.
	 */
	@Test
	public void testOneToOneRefMergeL2R() throws IOException {
		final Resource left = twoWayInput.getOneToOneMergeL2RLeft();
		final Resource right = twoWayInput.getOneToOneRefMergeL2RRight();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);
		final List<Diff> differences = comparison.getDifferences();

		// differences:
		// 1. Change c.source to c
		// 2. Change c.destination to c
		// 3. Change d.source to null
		// 4. Change d.destination to null
		// 1,4 and 2,3 are equivalent

		final ReferenceChange setCSourceDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.c", "source", "Root.d", "Root.c"));

		final ReferenceChange setDSourceDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.d", "source", "Root.c", null));

		// By merging diff1 (setCSourceDiff) the model will be in a state where the remaining diffs
		// describe actions which already occurred.
		mergerRegistry.getHighestRankingMerger(setCSourceDiff).copyLeftToRight(setCSourceDiff,
				new BasicMonitor());

		// Check if the non-equivalent diff is also set to merged
		assertEquals(DifferenceState.MERGED, setDSourceDiff.getState());

		// Check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	/**
	 * Tests a scenario in which two nodes contain interlocked one-to-one references. The merger must handle
	 * these cases with care since diffs can become redundant during merging.
	 */
	@Test
	public void testOneToOneRefMergeR2L() throws IOException {
		final Resource left = twoWayInput.getOneToOneMergeR2LLeft();
		final Resource right = twoWayInput.getOneToOneRefMergeR2LRight();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);
		final List<Diff> differences = comparison.getDifferences();

		// differences:
		// 1. Change c.source to d
		// 2. Change c.destination to d
		// 3. Change d.source to c
		// 4. Change d.destination to c
		// 1,4 and 2,3 are equivalent

		final ReferenceChange setCSourceDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.c", "source", "Root.c", "Root.d"));

		final ReferenceChange setDSourceDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				changedReference("Root.d", "source", null, "Root.c"));

		// By merging diff1 (setCSourceDiff) R2L the model will be in a state where the remaining diffs
		// describe actions which already occurred.
		mergerRegistry.getHighestRankingMerger(setCSourceDiff).copyRightToLeft(setCSourceDiff,
				new BasicMonitor());

		// Check if the non-equivalent diff is marked as merged
		assertEquals(DifferenceState.MERGED, setDSourceDiff.getState());

		// Check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC7LtoR() throws IOException {
		final Resource left = equivalenceInput.getC7Left();
		final Resource right = equivalenceInput.getC7Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();
		assertEquals(4, differences.size());

		final ReferenceChange deleteDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				removedFromReference("Root.a", "destination", "Root.a"));

		/*
		 * Merge the deleteDiff first. If the merger blindly merges the deleteDiff without proper looking at
		 * its equivalences, the equivalences will also be set to status "merged" although the reference to be
		 * added is still missing.
		 */
		mergerRegistry.getHighestRankingMerger(deleteDiff).copyLeftToRight(deleteDiff, new BasicMonitor());

		// merge the remaining differences
		for (Diff diff : differences) {
			if (diff != deleteDiff) {
				mergerRegistry.getHighestRankingMerger(diff).copyLeftToRight(diff, new BasicMonitor());
			}
		}

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testEquivalenceC7RtoL() throws IOException {
		final Resource left = equivalenceInput.getC7Left();
		final Resource right = equivalenceInput.getC7Right();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();
		assertEquals(4, differences.size());

		final ReferenceChange deleteDiff = (ReferenceChange)Iterators.find(differences.iterator(),
				addedToReference("Root.b", "destination", "Root.a"));

		/*
		 * Merge the diff resulting in a delete first. If the merger blindly merges the deleteDiff without
		 * proper looking at its equivalences, the equivalences will also be set to status "merged" although
		 * the reference to be added is still missing.
		 */
		mergerRegistry.getHighestRankingMerger(deleteDiff).copyRightToLeft(deleteDiff, new BasicMonitor());

		// merge the remaining differences
		for (Diff diff : differences) {
			if (diff != deleteDiff) {
				mergerRegistry.getHighestRankingMerger(diff).copyRightToLeft(diff, new BasicMonitor());
			}
		}

		// check if no differences between models are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testFeatureMapDependencyL2R() throws IOException {
		ResourceSetImpl resourceSet = new ResourceSetImpl();

		final Resource left = twoWayInput.getFeatureMapDependencyL2RLeft(resourceSet);
		final Resource right = twoWayInput.getFeatureMapDependencyL2RRight(resourceSet);

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// There should be 3 differences
		// 1. Add first key (ReferenceChange)
		// 2. Add first key (FeatureMapChange)
		// 3. Add NodeFeatureMapContainment (ReferenceChange)
		assertEquals(3, comparison.getDifferences().size());

		FeatureMapChange addFirstKey = (FeatureMapChange)Iterators.find(differences.iterator(),
				instanceOf(FeatureMapChange.class));
		assertNotNull(addFirstKey);

		// Execute FeatureMapChange to test if it properly resolves its dependencies
		mergerRegistry.getHighestRankingMerger(addFirstKey).copyLeftToRight(addFirstKey, new BasicMonitor());

		// Execute the remaining differences
		for (Diff diff : differences) {
			if (diff != addFirstKey) {
				mergerRegistry.getHighestRankingMerger(diff).copyLeftToRight(diff, new BasicMonitor());
			}
		}

		// Check if no differences are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testRemoveFeatureMapR2L() throws IOException {
		ResourceSetImpl resourceSet = new ResourceSetImpl();

		final Resource left = twoWayInput.getRemoveFeatureMapR2LLeft(resourceSet);
		final Resource right = twoWayInput.getRemoveFeatureMapR2LRight(resourceSet);

		final IComparisonScope scope = new DefaultComparisonScope(left, right, null);
		Comparison comparison = EMFCompare.builder().build().compare(scope);

		final List<Diff> differences = comparison.getDifferences();

		// There should be 5 differences
		// 1. Remove first key (ReferenceChange)
		// 2. Remove first key (FeatureMapChange)
		// 3. Remove second key (ReferenceChange)
		// 4. Remove second key (FeatureMapChange)
		// 5. Remove NodeFeatureMapContainment (ReferenceChange)
		assertEquals(5, comparison.getDifferences().size());

		// Also test dependencies by merging the FeatureMapChanges first
		Iterator<Diff> featureMapChangesIt = Iterators.filter(differences.iterator(),
				instanceOf(FeatureMapChange.class));
		List<Diff> featureMapChanges = Lists.newArrayList(featureMapChangesIt);
		assertEquals(2, featureMapChanges.size());

		// Execute FeatureMapChanges first to test if they properly resolve their dependencies
		for (Diff diff : featureMapChanges) {
			mergerRegistry.getHighestRankingMerger(diff).copyRightToLeft(diff, new BasicMonitor());
		}

		// Execute the remaining differences
		for (Diff diff : differences) {
			if (!featureMapChanges.contains(diff)) {
				mergerRegistry.getHighestRankingMerger(diff).copyRightToLeft(diff, new BasicMonitor());
			}
		}

		// Check if no differences are left
		comparison = EMFCompare.builder().build().compare(scope);
		assertEquals(0, comparison.getDifferences().size());
	}

	@Test
	public void testMergeAllDiffsTwice() throws IOException {
		final IdentifierMatchInputData inputData = new IdentifierMatchInputData();
		final Resource left = inputData.getExtlibraryLeft();
		final Resource origin = inputData.getExtlibraryOrigin();
		final Resource right = inputData.getExtlibraryRight();

		final IComparisonScope scope = new DefaultComparisonScope(left, right, origin);
		final Comparison comparison = EMFCompare.builder().build().compare(scope);
		final List<Diff> differences = comparison.getDifferences();

		assertFalse(differences.isEmpty());

		// Just test no NPE is raising
		for (Diff diff : differences) {
			ComparisonUtil.getSubDiffs(true).apply(diff);
			mergerRegistry.getHighestRankingMerger(diff).copyLeftToRight(diff, new BasicMonitor());
			ComparisonUtil.getSubDiffs(true).apply(diff);
			mergerRegistry.getHighestRankingMerger(diff).copyLeftToRight(diff, new BasicMonitor());
		}
	}

	/**
	 * Ensures that the two given lists contain the same elements in the same order. The kind of list does not
	 * matter.
	 * 
	 * @param list1
	 *            First of the two lists to compare.
	 * @param list2
	 *            Second of the two lists to compare.
	 */
	private static <T extends EObject> void assertEqualContents(Comparison comparison, List<T> list1,
			List<T> list2) {
		final int size = list1.size();
		assertEquals(size, list2.size());

		for (int i = 0; i < size; i++) {
			final EObject eObject1 = list1.get(i);
			final EObject eObject2 = list2.get(i);
			final Match match = comparison.getMatch(eObject1);
			if (match.getLeft() == eObject1) {
				assertEquals(match.getRight(), eObject2);
			} else {
				assertEquals(match.getRight(), eObject1);
				assertEquals(match.getLeft(), eObject2);
			}
		}
	}

	/* NOTE : not meant for containment changes */
	private static void assertMerged(Comparison comparison, ReferenceChange referenceChange, boolean unset,
			boolean rightToLeft) {
		assertSame(referenceChange.getState(), DifferenceState.MERGED);

		final EObject container;
		if (rightToLeft) {
			container = referenceChange.getMatch().getLeft();
		} else {
			container = referenceChange.getMatch().getRight();
		}

		final EReference ref = referenceChange.getReference();
		final Match valueMatch = comparison.getMatch(referenceChange.getValue());
		if (unset && ref.isContainment()) {
			assertNull(valueMatch);
		} else if (ref.isMany()) {
			@SuppressWarnings("unchecked")
			final List<EObject> refValue = (List<EObject>)container.eGet(ref);
			if (rightToLeft && unset) {
				assertTrue(!refValue.contains(valueMatch.getLeft()));
			} else if (rightToLeft) {
				assertTrue(refValue.contains(valueMatch.getLeft()));
			} else if (unset) {
				assertTrue(!refValue.contains(valueMatch.getRight()));
			} else {
				assertTrue(refValue.contains(valueMatch.getRight()));
			}
		} else {
			final EObject refValue = (EObject)container.eGet(ref);
			if (unset) {
				assertSame(null, refValue);
			} else if (rightToLeft) {
				assertSame(valueMatch.getLeft(), refValue);
			} else {
				assertSame(valueMatch.getRight(), refValue);
			}
		}
	}

	private static void assertValueIndexIs(ReferenceChange diff, boolean rightToLeft, int expectedIndex) {
		final Match containerMatch = diff.getMatch();
		final Match valueMatch = containerMatch.getComparison().getMatch(diff.getValue());

		if (rightToLeft) {
			if (expectedIndex != -1) {
				assertNotNull(valueMatch.getLeft());
				assertSame(containerMatch.getLeft().eResource(), valueMatch.getLeft().eResource());
				final EObject addedToLeft = valueMatch.getLeft();
				final List<EObject> values = getAsList(containerMatch.getLeft(), diff.getReference());
				assertEquals(expectedIndex, values.indexOf(addedToLeft));
			} else {
				assertTrue(valueMatch == null || valueMatch.getLeft() == null);
			}
		} else {
			if (expectedIndex != -1) {
				assertNotNull(valueMatch.getRight());
				assertSame(containerMatch.getRight().eResource(), valueMatch.getRight().eResource());
				final EObject addedToRight = valueMatch.getRight();
				final List<EObject> values = getAsList(containerMatch.getRight(), diff.getReference());
				assertEquals(expectedIndex, values.indexOf(addedToRight));
			} else {
				assertTrue(valueMatch == null || valueMatch.getRight() == null);
			}
		}
	}

	@SuppressWarnings("unchecked")
	private static List<EObject> getAsList(EObject object, EReference feature) {
		if (object != null) {
			Object value = object.eGet(feature, false);
			final List<EObject> asList;
			if (value instanceof List) {
				asList = (List<EObject>)value;
			} else if (value instanceof Iterable) {
				asList = ImmutableList.copyOf((Iterable<EObject>)value);
			} else if (value != null) {
				asList = ImmutableList.of((EObject)value);
			} else {
				asList = Collections.emptyList();
			}
			return asList;
		}
		return Collections.emptyList();
	}
}

Back to the top