1 package org.eclipse.aether.util.graph.transformer;
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22 import java.util.ArrayList;
23 import java.util.Arrays;
24 import java.util.Collection;
25 import java.util.Collections;
26 import java.util.HashMap;
27 import java.util.HashSet;
28 import java.util.IdentityHashMap;
29 import java.util.Iterator;
30 import java.util.List;
31 import java.util.ListIterator;
32 import java.util.Map;
33 import static java.util.Objects.requireNonNull;
34
35 import org.eclipse.aether.RepositoryException;
36 import org.eclipse.aether.artifact.Artifact;
37 import org.eclipse.aether.collection.DependencyGraphTransformationContext;
38 import org.eclipse.aether.collection.DependencyGraphTransformer;
39 import org.eclipse.aether.graph.DefaultDependencyNode;
40 import org.eclipse.aether.graph.Dependency;
41 import org.eclipse.aether.graph.DependencyNode;
42 import org.eclipse.aether.util.ConfigUtils;
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64 public final class ConflictResolver
65 implements DependencyGraphTransformer
66 {
67
68
69
70
71
72 public static final String CONFIG_PROP_VERBOSE = "aether.conflictResolver.verbose";
73
74
75
76
77
78 public static final String NODE_DATA_WINNER = "conflict.winner";
79
80
81
82
83
84 public static final String NODE_DATA_ORIGINAL_SCOPE = "conflict.originalScope";
85
86
87
88
89
90 public static final String NODE_DATA_ORIGINAL_OPTIONALITY = "conflict.originalOptionality";
91
92 private final VersionSelector versionSelector;
93
94 private final ScopeSelector scopeSelector;
95
96 private final ScopeDeriver scopeDeriver;
97
98 private final OptionalitySelector optionalitySelector;
99
100
101
102
103
104
105
106
107
108 public ConflictResolver( VersionSelector versionSelector, ScopeSelector scopeSelector,
109 OptionalitySelector optionalitySelector, ScopeDeriver scopeDeriver )
110 {
111 this.versionSelector = requireNonNull( versionSelector, "version selector cannot be null" );
112 this.scopeSelector = requireNonNull( scopeSelector, "scope selector cannot be null" );
113 this.optionalitySelector = requireNonNull( optionalitySelector, "optionality selector cannot be null" );
114 this.scopeDeriver = requireNonNull( scopeDeriver, "scope deriver cannot be null" );
115 }
116
117 public DependencyNode transformGraph( DependencyNode node, DependencyGraphTransformationContext context )
118 throws RepositoryException
119 {
120 requireNonNull( node, "node cannot be null" );
121 requireNonNull( context, "context cannot be null" );
122 List<?> sortedConflictIds = (List<?>) context.get( TransformationContextKeys.SORTED_CONFLICT_IDS );
123 if ( sortedConflictIds == null )
124 {
125 ConflictIdSorter sorter = new ConflictIdSorter();
126 sorter.transformGraph( node, context );
127
128 sortedConflictIds = (List<?>) context.get( TransformationContextKeys.SORTED_CONFLICT_IDS );
129 }
130
131 @SuppressWarnings( "unchecked" )
132 Map<String, Object> stats = (Map<String, Object>) context.get( TransformationContextKeys.STATS );
133 long time1 = System.nanoTime();
134
135 @SuppressWarnings( "unchecked" )
136 Collection<Collection<?>> conflictIdCycles =
137 (Collection<Collection<?>>) context.get( TransformationContextKeys.CYCLIC_CONFLICT_IDS );
138 if ( conflictIdCycles == null )
139 {
140 throw new RepositoryException( "conflict id cycles have not been identified" );
141 }
142
143 Map<?, ?> conflictIds = (Map<?, ?>) context.get( TransformationContextKeys.CONFLICT_IDS );
144 if ( conflictIds == null )
145 {
146 throw new RepositoryException( "conflict groups have not been identified" );
147 }
148
149 Map<Object, Collection<Object>> cyclicPredecessors = new HashMap<>();
150 for ( Collection<?> cycle : conflictIdCycles )
151 {
152 for ( Object conflictId : cycle )
153 {
154 Collection<Object> predecessors = cyclicPredecessors.
155 computeIfAbsent( conflictId, k -> new HashSet<>() );
156 predecessors.addAll( cycle );
157 }
158 }
159
160 State state = new State( node, conflictIds, sortedConflictIds.size(), context );
161 for ( Iterator<?> it = sortedConflictIds.iterator(); it.hasNext(); )
162 {
163 Object conflictId = it.next();
164
165
166 state.prepare( conflictId, cyclicPredecessors.get( conflictId ) );
167
168
169 gatherConflictItems( node, state );
170
171
172 state.finish();
173
174
175 if ( !state.items.isEmpty() )
176 {
177 ConflictContext ctx = state.conflictCtx;
178 state.versionSelector.selectVersion( ctx );
179 if ( ctx.winner == null )
180 {
181 throw new RepositoryException( "conflict resolver did not select winner among " + state.items );
182 }
183 DependencyNode winner = ctx.winner.node;
184
185 state.scopeSelector.selectScope( ctx );
186 if ( state.verbose )
187 {
188 winner.setData( NODE_DATA_ORIGINAL_SCOPE, winner.getDependency().getScope() );
189 }
190 winner.setScope( ctx.scope );
191
192 state.optionalitySelector.selectOptionality( ctx );
193 if ( state.verbose )
194 {
195 winner.setData( NODE_DATA_ORIGINAL_OPTIONALITY, winner.getDependency().isOptional() );
196 }
197 winner.setOptional( ctx.optional );
198
199 removeLosers( state );
200 }
201
202
203 state.winner();
204
205
206 if ( !it.hasNext() && !conflictIdCycles.isEmpty() && state.conflictCtx.winner != null )
207 {
208 DependencyNode winner = state.conflictCtx.winner.node;
209 state.prepare( state, null );
210 gatherConflictItems( winner, state );
211 }
212 }
213
214 if ( stats != null )
215 {
216 long time2 = System.nanoTime();
217 stats.put( "ConflictResolver.totalTime", time2 - time1 );
218 stats.put( "ConflictResolver.conflictItemCount", state.totalConflictItems );
219 }
220
221 return node;
222 }
223
224 private boolean gatherConflictItems( DependencyNode node, State state )
225 throws RepositoryException
226 {
227 Object conflictId = state.conflictIds.get( node );
228 if ( state.currentId.equals( conflictId ) )
229 {
230
231 state.add( node );
232
233 }
234 else if ( state.loser( node, conflictId ) )
235 {
236
237 return false;
238 }
239 else if ( state.push( node, conflictId ) )
240 {
241
242 for ( Iterator<DependencyNode> it = node.getChildren().iterator(); it.hasNext(); )
243 {
244 DependencyNode child = it.next();
245 if ( !gatherConflictItems( child, state ) )
246 {
247 it.remove();
248 }
249 }
250 state.pop();
251 }
252 return true;
253 }
254
255 private void removeLosers( State state )
256 {
257 ConflictItem winner = state.conflictCtx.winner;
258 List<DependencyNode> previousParent = null;
259 ListIterator<DependencyNode> childIt = null;
260 boolean conflictVisualized = false;
261 for ( ConflictItem item : state.items )
262 {
263 if ( item == winner )
264 {
265 continue;
266 }
267 if ( item.parent != previousParent )
268 {
269 childIt = item.parent.listIterator();
270 previousParent = item.parent;
271 conflictVisualized = false;
272 }
273 while ( childIt.hasNext() )
274 {
275 DependencyNode child = childIt.next();
276 if ( child == item.node )
277 {
278 if ( state.verbose && !conflictVisualized && item.parent != winner.parent )
279 {
280 conflictVisualized = true;
281 DependencyNode loser = new DefaultDependencyNode( child );
282 loser.setData( NODE_DATA_WINNER, winner.node );
283 loser.setData( NODE_DATA_ORIGINAL_SCOPE, loser.getDependency().getScope() );
284 loser.setData( NODE_DATA_ORIGINAL_OPTIONALITY, loser.getDependency().isOptional() );
285 loser.setScope( item.getScopes().iterator().next() );
286 loser.setChildren( Collections.<DependencyNode>emptyList() );
287 childIt.set( loser );
288 }
289 else
290 {
291 childIt.remove();
292 }
293 break;
294 }
295 }
296 }
297
298
299 }
300
301 static final class NodeInfo
302 {
303
304
305
306
307 int minDepth;
308
309
310
311
312
313
314 Object derivedScopes;
315
316
317
318
319
320
321 int derivedOptionalities;
322
323
324
325
326
327 List<ConflictItem> children;
328
329 static final int CHANGE_SCOPE = 0x01;
330
331 static final int CHANGE_OPTIONAL = 0x02;
332
333 private static final int OPT_FALSE = 0x01;
334
335 private static final int OPT_TRUE = 0x02;
336
337 NodeInfo( int depth, String derivedScope, boolean optional )
338 {
339 minDepth = depth;
340 derivedScopes = derivedScope;
341 derivedOptionalities = optional ? OPT_TRUE : OPT_FALSE;
342 }
343
344 @SuppressWarnings( "unchecked" )
345 int update( int depth, String derivedScope, boolean optional )
346 {
347 if ( depth < minDepth )
348 {
349 minDepth = depth;
350 }
351 int changes;
352 if ( derivedScopes.equals( derivedScope ) )
353 {
354 changes = 0;
355 }
356 else if ( derivedScopes instanceof Collection )
357 {
358 changes = ( (Collection<String>) derivedScopes ).add( derivedScope ) ? CHANGE_SCOPE : 0;
359 }
360 else
361 {
362 Collection<String> scopes = new HashSet<>();
363 scopes.add( (String) derivedScopes );
364 scopes.add( derivedScope );
365 derivedScopes = scopes;
366 changes = CHANGE_SCOPE;
367 }
368 int bit = optional ? OPT_TRUE : OPT_FALSE;
369 if ( ( derivedOptionalities & bit ) == 0 )
370 {
371 derivedOptionalities |= bit;
372 changes |= CHANGE_OPTIONAL;
373 }
374 return changes;
375 }
376
377 void add( ConflictItem item )
378 {
379 if ( children == null )
380 {
381 children = new ArrayList<>( 1 );
382 }
383 children.add( item );
384 }
385
386 }
387
388 final class State
389 {
390
391
392
393
394 Object currentId;
395
396
397
398
399 int totalConflictItems;
400
401
402
403
404 final boolean verbose;
405
406
407
408
409
410 final Map<Object, DependencyNode> resolvedIds;
411
412
413
414
415
416
417 final Collection<Object> potentialAncestorIds;
418
419
420
421
422 final Map<?, ?> conflictIds;
423
424
425
426
427 final List<ConflictItem> items;
428
429
430
431
432
433 final Map<List<DependencyNode>, NodeInfo> infos;
434
435
436
437
438
439 final Map<List<DependencyNode>, Object> stack;
440
441
442
443
444 final List<DependencyNode> parentNodes;
445
446
447
448
449 final List<String> parentScopes;
450
451
452
453
454 final List<Boolean> parentOptionals;
455
456
457
458
459
460 final List<NodeInfo> parentInfos;
461
462
463
464
465
466 final ConflictContext conflictCtx;
467
468
469
470
471
472 final ScopeContext scopeCtx;
473
474
475
476
477 final VersionSelector versionSelector;
478
479
480
481
482 final ScopeSelector scopeSelector;
483
484
485
486
487 final ScopeDeriver scopeDeriver;
488
489
490
491
492 final OptionalitySelector optionalitySelector;
493
494 State( DependencyNode root, Map<?, ?> conflictIds, int conflictIdCount,
495 DependencyGraphTransformationContext context )
496 throws RepositoryException
497 {
498 this.conflictIds = conflictIds;
499 verbose = ConfigUtils.getBoolean( context.getSession(), false, CONFIG_PROP_VERBOSE );
500 potentialAncestorIds = new HashSet<>( conflictIdCount * 2 );
501 resolvedIds = new HashMap<>( conflictIdCount * 2 );
502 items = new ArrayList<>( 256 );
503 infos = new IdentityHashMap<>( 64 );
504 stack = new IdentityHashMap<>( 64 );
505 parentNodes = new ArrayList<>( 64 );
506 parentScopes = new ArrayList<>( 64 );
507 parentOptionals = new ArrayList<>( 64 );
508 parentInfos = new ArrayList<>( 64 );
509 conflictCtx = new ConflictContext( root, conflictIds, items );
510 scopeCtx = new ScopeContext( null, null );
511 versionSelector = ConflictResolver.this.versionSelector.getInstance( root, context );
512 scopeSelector = ConflictResolver.this.scopeSelector.getInstance( root, context );
513 scopeDeriver = ConflictResolver.this.scopeDeriver.getInstance( root, context );
514 optionalitySelector = ConflictResolver.this.optionalitySelector.getInstance( root, context );
515 }
516
517 void prepare( Object conflictId, Collection<Object> cyclicPredecessors )
518 {
519 currentId = conflictId;
520 conflictCtx.conflictId = conflictId;
521 conflictCtx.winner = null;
522 conflictCtx.scope = null;
523 conflictCtx.optional = null;
524 items.clear();
525 infos.clear();
526 if ( cyclicPredecessors != null )
527 {
528 potentialAncestorIds.addAll( cyclicPredecessors );
529 }
530 }
531
532 void finish()
533 {
534 List<DependencyNode> previousParent = null;
535 int previousDepth = 0;
536 totalConflictItems += items.size();
537 for ( ListIterator<ConflictItem> iterator = items.listIterator( items.size() ); iterator.hasPrevious(); )
538 {
539 ConflictItem item = iterator.previous();
540 if ( item.parent == previousParent )
541 {
542 item.depth = previousDepth;
543 }
544 else if ( item.parent != null )
545 {
546 previousParent = item.parent;
547 NodeInfo info = infos.get( previousParent );
548 previousDepth = info.minDepth + 1;
549 item.depth = previousDepth;
550 }
551 }
552 potentialAncestorIds.add( currentId );
553 }
554
555 void winner()
556 {
557 resolvedIds.put( currentId, ( conflictCtx.winner != null ) ? conflictCtx.winner.node : null );
558 }
559
560 boolean loser( DependencyNode node, Object conflictId )
561 {
562 DependencyNode winner = resolvedIds.get( conflictId );
563 return winner != null && winner != node;
564 }
565
566 boolean push( DependencyNode node, Object conflictId )
567 throws RepositoryException
568 {
569 if ( conflictId == null )
570 {
571 if ( node.getDependency() != null )
572 {
573 if ( node.getData().get( NODE_DATA_WINNER ) != null )
574 {
575 return false;
576 }
577 throw new RepositoryException( "missing conflict id for node " + node );
578 }
579 }
580 else if ( !potentialAncestorIds.contains( conflictId ) )
581 {
582 return false;
583 }
584
585 List<DependencyNode> graphNode = node.getChildren();
586 if ( stack.put( graphNode, Boolean.TRUE ) != null )
587 {
588 return false;
589 }
590
591 int depth = depth();
592 String scope = deriveScope( node, conflictId );
593 boolean optional = deriveOptional( node, conflictId );
594 NodeInfo info = infos.get( graphNode );
595 if ( info == null )
596 {
597 info = new NodeInfo( depth, scope, optional );
598 infos.put( graphNode, info );
599 parentInfos.add( info );
600 parentNodes.add( node );
601 parentScopes.add( scope );
602 parentOptionals.add( optional );
603 }
604 else
605 {
606 int changes = info.update( depth, scope, optional );
607 if ( changes == 0 )
608 {
609 stack.remove( graphNode );
610 return false;
611 }
612 parentInfos.add( null );
613 parentNodes.add( node );
614 parentScopes.add( scope );
615 parentOptionals.add( optional );
616 if ( info.children != null )
617 {
618 if ( ( changes & NodeInfo.CHANGE_SCOPE ) != 0 )
619 {
620 ListIterator<ConflictItem> itemIterator = info.children.listIterator( info.children.size() );
621 while ( itemIterator.hasPrevious() )
622 {
623 ConflictItem item = itemIterator.previous();
624 String childScope = deriveScope( item.node, null );
625 item.addScope( childScope );
626 }
627 }
628 if ( ( changes & NodeInfo.CHANGE_OPTIONAL ) != 0 )
629 {
630 ListIterator<ConflictItem> itemIterator = info.children.listIterator( info.children.size() );
631 while ( itemIterator.hasPrevious() )
632 {
633 ConflictItem item = itemIterator.previous();
634 boolean childOptional = deriveOptional( item.node, null );
635 item.addOptional( childOptional );
636 }
637 }
638 }
639 }
640
641 return true;
642 }
643
644 void pop()
645 {
646 int last = parentInfos.size() - 1;
647 parentInfos.remove( last );
648 parentScopes.remove( last );
649 parentOptionals.remove( last );
650 DependencyNode node = parentNodes.remove( last );
651 stack.remove( node.getChildren() );
652 }
653
654 void add( DependencyNode node )
655 throws RepositoryException
656 {
657 DependencyNode parent = parent();
658 if ( parent == null )
659 {
660 ConflictItem item = newConflictItem( parent, node );
661 items.add( item );
662 }
663 else
664 {
665 NodeInfo info = parentInfos.get( parentInfos.size() - 1 );
666 if ( info != null )
667 {
668 ConflictItem item = newConflictItem( parent, node );
669 info.add( item );
670 items.add( item );
671 }
672 }
673 }
674
675 private ConflictItem newConflictItem( DependencyNode parent, DependencyNode node )
676 throws RepositoryException
677 {
678 return new ConflictItem( parent, node, deriveScope( node, null ), deriveOptional( node, null ) );
679 }
680
681 private int depth()
682 {
683 return parentNodes.size();
684 }
685
686 private DependencyNode parent()
687 {
688 int size = parentNodes.size();
689 return ( size <= 0 ) ? null : parentNodes.get( size - 1 );
690 }
691
692 private String deriveScope( DependencyNode node, Object conflictId )
693 throws RepositoryException
694 {
695 if ( ( node.getManagedBits() & DependencyNode.MANAGED_SCOPE ) != 0
696 || ( conflictId != null && resolvedIds.containsKey( conflictId ) ) )
697 {
698 return scope( node.getDependency() );
699 }
700
701 int depth = parentNodes.size();
702 scopes( depth, node.getDependency() );
703 if ( depth > 0 )
704 {
705 scopeDeriver.deriveScope( scopeCtx );
706 }
707 return scopeCtx.derivedScope;
708 }
709
710 private void scopes( int parent, Dependency child )
711 {
712 scopeCtx.parentScope = ( parent > 0 ) ? parentScopes.get( parent - 1 ) : null;
713 scopeCtx.derivedScope = scope( child );
714 scopeCtx.childScope = scope( child );
715 }
716
717 private String scope( Dependency dependency )
718 {
719 return ( dependency != null ) ? dependency.getScope() : null;
720 }
721
722 private boolean deriveOptional( DependencyNode node, Object conflictId )
723 {
724 Dependency dep = node.getDependency();
725 boolean optional = ( dep != null ) && dep.isOptional();
726 if ( optional || ( node.getManagedBits() & DependencyNode.MANAGED_OPTIONAL ) != 0
727 || ( conflictId != null && resolvedIds.containsKey( conflictId ) ) )
728 {
729 return optional;
730 }
731 int depth = parentNodes.size();
732 return ( depth > 0 ) ? parentOptionals.get( depth - 1 ) : false;
733 }
734
735 }
736
737
738
739
740
741
742
743
744 public static final class ScopeContext
745 {
746
747 String parentScope;
748
749 String childScope;
750
751 String derivedScope;
752
753
754
755
756
757
758
759
760
761 public ScopeContext( String parentScope, String childScope )
762 {
763 this.parentScope = ( parentScope != null ) ? parentScope : "";
764 derivedScope = ( childScope != null ) ? childScope : "";
765 this.childScope = ( childScope != null ) ? childScope : "";
766 }
767
768
769
770
771
772
773
774 public String getParentScope()
775 {
776 return parentScope;
777 }
778
779
780
781
782
783
784
785 public String getChildScope()
786 {
787 return childScope;
788 }
789
790
791
792
793
794
795
796 public String getDerivedScope()
797 {
798 return derivedScope;
799 }
800
801
802
803
804
805
806 public void setDerivedScope( String derivedScope )
807 {
808 this.derivedScope = ( derivedScope != null ) ? derivedScope : "";
809 }
810
811 }
812
813
814
815
816
817
818
819 public static final class ConflictItem
820 {
821
822
823 final List<DependencyNode> parent;
824
825
826 final Artifact artifact;
827
828 final DependencyNode node;
829
830 int depth;
831
832
833 Object scopes;
834
835
836 int optionalities;
837
838
839
840
841 public static final int OPTIONAL_FALSE = 0x01;
842
843
844
845
846 public static final int OPTIONAL_TRUE = 0x02;
847
848 ConflictItem( DependencyNode parent, DependencyNode node, String scope, boolean optional )
849 {
850 if ( parent != null )
851 {
852 this.parent = parent.getChildren();
853 this.artifact = parent.getArtifact();
854 }
855 else
856 {
857 this.parent = null;
858 this.artifact = null;
859 }
860 this.node = node;
861 this.scopes = scope;
862 this.optionalities = optional ? OPTIONAL_TRUE : OPTIONAL_FALSE;
863 }
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878 public ConflictItem( DependencyNode parent, DependencyNode node, int depth, int optionalities,
879 String... scopes )
880 {
881 this.parent = ( parent != null ) ? parent.getChildren() : null;
882 this.artifact = ( parent != null ) ? parent.getArtifact() : null;
883 this.node = node;
884 this.depth = depth;
885 this.optionalities = optionalities;
886 this.scopes = Arrays.asList( scopes );
887 }
888
889
890
891
892
893
894
895 public boolean isSibling( ConflictItem item )
896 {
897 return parent == item.parent;
898 }
899
900
901
902
903
904
905 public DependencyNode getNode()
906 {
907 return node;
908 }
909
910
911
912
913
914
915 public Dependency getDependency()
916 {
917 return node.getDependency();
918 }
919
920
921
922
923
924
925
926
927 public int getDepth()
928 {
929 return depth;
930 }
931
932
933
934
935
936
937
938
939 @SuppressWarnings( "unchecked" )
940 public Collection<String> getScopes()
941 {
942 if ( scopes instanceof String )
943 {
944 return Collections.singleton( (String) scopes );
945 }
946 return (Collection<String>) scopes;
947 }
948
949 @SuppressWarnings( "unchecked" )
950 void addScope( String scope )
951 {
952 if ( scopes instanceof Collection )
953 {
954 ( (Collection<String>) scopes ).add( scope );
955 }
956 else if ( !scopes.equals( scope ) )
957 {
958 Collection<Object> set = new HashSet<>();
959 set.add( scopes );
960 set.add( scope );
961 scopes = set;
962 }
963 }
964
965
966
967
968
969
970
971
972
973 public int getOptionalities()
974 {
975 return optionalities;
976 }
977
978 void addOptional( boolean optional )
979 {
980 optionalities |= optional ? OPTIONAL_TRUE : OPTIONAL_FALSE;
981 }
982
983 @Override
984 public String toString()
985 {
986 return node + " @ " + depth + " < " + artifact;
987 }
988
989 }
990
991
992
993
994
995
996
997
998
999 public static final class ConflictContext
1000 {
1001
1002 final DependencyNode root;
1003
1004 final Map<?, ?> conflictIds;
1005
1006 final Collection<ConflictItem> items;
1007
1008 Object conflictId;
1009
1010 ConflictItem winner;
1011
1012 String scope;
1013
1014 Boolean optional;
1015
1016 ConflictContext( DependencyNode root, Map<?, ?> conflictIds, Collection<ConflictItem> items )
1017 {
1018 this.root = root;
1019 this.conflictIds = conflictIds;
1020 this.items = Collections.unmodifiableCollection( items );
1021 }
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034 public ConflictContext( DependencyNode root, Object conflictId, Map<DependencyNode, Object> conflictIds,
1035 Collection<ConflictItem> items )
1036 {
1037 this( root, conflictIds, items );
1038 this.conflictId = conflictId;
1039 }
1040
1041
1042
1043
1044
1045
1046 public DependencyNode getRoot()
1047 {
1048 return root;
1049 }
1050
1051
1052
1053
1054
1055
1056
1057 public boolean isIncluded( DependencyNode node )
1058 {
1059 return conflictId.equals( conflictIds.get( node ) );
1060 }
1061
1062
1063
1064
1065
1066
1067 public Collection<ConflictItem> getItems()
1068 {
1069 return items;
1070 }
1071
1072
1073
1074
1075
1076
1077 public ConflictItem getWinner()
1078 {
1079 return winner;
1080 }
1081
1082
1083
1084
1085
1086
1087 public void setWinner( ConflictItem winner )
1088 {
1089 this.winner = winner;
1090 }
1091
1092
1093
1094
1095
1096
1097 public String getScope()
1098 {
1099 return scope;
1100 }
1101
1102
1103
1104
1105
1106
1107 public void setScope( String scope )
1108 {
1109 this.scope = scope;
1110 }
1111
1112
1113
1114
1115
1116
1117 public Boolean getOptional()
1118 {
1119 return optional;
1120 }
1121
1122
1123
1124
1125
1126
1127 public void setOptional( Boolean optional )
1128 {
1129 this.optional = optional;
1130 }
1131
1132 @Override
1133 public String toString()
1134 {
1135 return winner + " @ " + scope + " < " + items;
1136 }
1137
1138 }
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148 public abstract static class VersionSelector
1149 {
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165 public VersionSelector getInstance( DependencyNode root, DependencyGraphTransformationContext context )
1166 throws RepositoryException
1167 {
1168 return this;
1169 }
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180 public abstract void selectVersion( ConflictContext context )
1181 throws RepositoryException;
1182
1183 }
1184
1185
1186
1187
1188
1189
1190
1191
1192 public abstract static class ScopeSelector
1193 {
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209 public ScopeSelector getInstance( DependencyNode root, DependencyGraphTransformationContext context )
1210 throws RepositoryException
1211 {
1212 return this;
1213 }
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224 public abstract void selectScope( ConflictContext context )
1225 throws RepositoryException;
1226
1227 }
1228
1229
1230
1231
1232
1233
1234
1235 public abstract static class ScopeDeriver
1236 {
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252 public ScopeDeriver getInstance( DependencyNode root, DependencyGraphTransformationContext context )
1253 throws RepositoryException
1254 {
1255 return this;
1256 }
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266 public abstract void deriveScope( ScopeContext context )
1267 throws RepositoryException;
1268
1269 }
1270
1271
1272
1273
1274
1275
1276
1277
1278 public abstract static class OptionalitySelector
1279 {
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295 public OptionalitySelector getInstance( DependencyNode root, DependencyGraphTransformationContext context )
1296 throws RepositoryException
1297 {
1298 return this;
1299 }
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310 public abstract void selectOptionality( ConflictContext context )
1311 throws RepositoryException;
1312
1313 }
1314
1315 }