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