1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # Licensed under the Apache License, Version 2.0 (the "License");
4 # you may not use this file except in compliance with the License.
5 # You may obtain a copy of the License at
7 # http://www.apache.org/licenses/LICENSE-2.0
9 # Unless required by applicable law or agreed to in writing, software
10 # distributed under the License is distributed on an "AS IS" BASIS,
11 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 # See the License for the specific language governing permissions and
13 # limitations under the License.
15 # Graph coloring tools
18 import rapid_type_analysis
# for type coloration
20 abstract class AbstractColoring[E
: Object]
22 private var sorter
: AbstractSorter[E
]
23 private var reverse_sorter
: AbstractSorter[E
]
25 private var core
: OrderedSet[E
] = new OrderedSet[E
]
26 private var crown
: OrderedSet[E
] = new OrderedSet[E
]
27 private var border
: OrderedSet[E
] = new OrderedSet[E
]
29 private var coloration_result
: Map[E
, Int] = new HashMap[E
, Int]
30 private var conflicts_graph_cache
: nullable HashMap[E
, Set[E
]]
32 init(sorter
: AbstractSorter[E
], reverse_sorter
: AbstractSorter[E
]) do
34 self.reverse_sorter
= reverse_sorter
37 fun colorize
(elements
: Collection[E
]): Map[E
, Int] do
38 # tag each element as part of group core, crown or border
43 #print "core: {core.join(", ")}"
44 #print "border: {border.join(", ")}"
45 #print "crown: {crown.join(", ")}"
47 # sort by reverse linearization order
48 reverse_sorter
.sort
(core
)
49 reverse_sorter
.sort
(border
)
50 reverse_sorter
.sort
(crown
)
53 #for k, v in conflicts_graph do
55 # print "{k}: {v.join(", ")}"
60 colorize_elements
(core
)
61 colorize_elements
(border
)
62 colorize_elements
(crown
)
64 return coloration_result
67 # Colorize a collection of elements
68 private fun colorize_elements
(elements
: Collection[E
]) do
71 for element
in elements
do
73 while not self.is_color_free
(element
, color
) do
76 coloration_result
[element
] = color
81 # Check if a related element to the element already use the color
82 private fun is_color_free
(element
: E
, color
: Int): Bool do
83 if conflicts_graph
.has_key
(element
) then
84 for st
in conflicts_graph
[element
] do
85 if coloration_result
.has_key
(st
) and coloration_result
[st
] == color
then return false
88 for st
in self.super_elements
(element
) do
89 if coloration_result
.has_key
(st
) and coloration_result
[st
] == color
then return false
94 # Tag element as core, crown or border
95 private fun tag_element
(element
: E
) do
96 # Check if sub elements are all in single inheritance
97 var all_subelements_si
= true
98 for subelem
in self.sub_elements
(element
) do
99 if self.is_element_mi
(subelem
) then
100 all_subelements_si
= false
105 # Tag as core, crown or border
106 if self.is_element_mi
(element
) then
107 core
.add_all
(self.super_elements
(element
))
109 if all_subelements_si
then
112 else if not all_subelements_si
then
113 core
.add_all
(self.super_elements
(element
))
120 # Conflicts graph of elements hierarchy (two types are in conflict if they have common subelements)
121 private fun conflicts_graph
: Map[E
, Set[E
]] do
122 if self.conflicts_graph_cache
== null then
123 self.conflicts_graph_cache
= new HashMap[E
, HashSet[E
]]
124 for t
in self.core
do
125 for i
in self.linear_extension
(t
) do
126 if t
== i
then continue
128 var lin_i
= self.linear_extension
(i
)
130 for j
in self.linear_extension
(t
) do
131 if i
== j
or j
== t
then continue
132 var lin_j
= self.linear_extension
(j
)
134 var d_ij
= lin_i
- lin_j
135 var d_ji
= lin_j
- lin_i
138 if not conflicts_graph_cache
.has_key
(ed1
) then conflicts_graph_cache
[ed1
] = new HashSet[E
]
139 # add ed1 x ed2 to conflicts graph
140 for ed2
in d_ji
do conflicts_graph_cache
[ed1
].add
(ed2
)
143 if not conflicts_graph_cache
.has_key
(ed1
) then conflicts_graph_cache
[ed1
] = new HashSet[E
]
144 # add ed1 x ed2 to conflicts graph
145 for ed2
in d_ji
do conflicts_graph_cache
[ed1
].add
(ed2
)
151 return conflicts_graph_cache
.as(not null)
154 # cache for linear_extensions
155 private var linear_extensions_cache
: Map[E
, OrderedSet[E
]] = new HashMap[E
, OrderedSet[E
]]
157 # Return a linear_extension of super_elements of the element
158 private fun linear_extension
(element
: E
): OrderedSet[E
] do
159 if not self.linear_extensions_cache
.has_key
(element
) then
160 var lin
= new OrderedSet[E
]
162 lin
.add_all
(self.super_elements
(element
))
163 self.sorter
.sort
(lin
)
164 self.linear_extensions_cache
[element
] = lin
166 return self.linear_extensions_cache
[element
]
169 # Return all super elements (directs and indirects) of an element
170 private fun super_elements
(element
: E
): Collection[E
] is abstract
172 # Return all sub elements (directs and indirects) of an element
173 private fun sub_elements
(element
: E
): Collection[E
] is abstract
175 # Is the element in multiple inheritance ?
176 private fun is_element_mi
(element
: E
): Bool is abstract
179 # MClassType coloring
181 super AbstractColoring[MType]
185 private var mmodule
: MModule
186 private var mtypes
: Set[T
]
189 private var super_elements_cache
: Map[T
, Set[T
]] = new HashMap[T
, Set[T
]]
190 private var sub_elements_cache
: Map[T
, Set[T
]] = new HashMap[T
, Set[T
]]
192 init(mainmodule
: MModule, mtypes
: Set[T
]) do
193 super(new TypeSorter(mainmodule
), new ReverseTypeSorter(mainmodule
))
194 self.mmodule
= mainmodule
199 fun build_type_tables
(mtypes
: Set[T
], colors
: Map[T
, Int]): Map[T
, Array[nullable T
]] do
200 var tables
= new HashMap[T
, Array[nullable T
]]
202 for mtype
in mtypes
do
203 var table
= new Array[nullable T
]
204 var supers
= new HashSet[T
]
205 supers
.add_all
(self.super_elements
(mtype
))
208 var color
= colors
[sup
]
209 if table
.length
<= color
then
210 for i
in [table
.length
.. color
[ do
216 tables
[mtype
] = table
221 redef fun super_elements
(element
) do
222 if not self.super_elements_cache
.has_key
(element
) then
223 var supers
= new HashSet[T
]
224 for mtype
in self.mtypes
do
225 if element
== mtype
then continue
226 if element
.is_subtype
(self.mmodule
, null, mtype
) then
230 self.super_elements_cache
[element
] = supers
232 return self.super_elements_cache
[element
]
235 # Return all direct super elements of an element
236 redef fun is_element_mi
(element
) do
237 return self.super_elements
(element
).length
> 1
240 # Return all sub elements (directs and indirects) of an element
241 redef fun sub_elements
(element
) do
242 if not self.sub_elements_cache
.has_key
(element
) then
243 var subs
= new HashSet[T
]
244 for mtype
in self.mtypes
do
245 if element
== mtype
then continue
246 if mtype
.is_subtype
(self.mmodule
, null, element
) then
250 self.sub_elements_cache
[element
] = subs
252 return self.sub_elements_cache
[element
]
256 class NaiveTypeColoring
259 init(mainmodule
: MModule, mtypes
: Set[T
]) do
260 super(mainmodule
, mtypes
)
263 # naive coloring that use incremental coloring
264 redef fun colorize_elements
(elements
) do
266 self.coloration_result
[e
] = self.coloration_result
.length
271 # A sorter for linearize list of types
272 private class TypeSorter
273 super AbstractSorter[MType]
275 private var mmodule
: MModule
277 init(mmodule
: MModule) do self.mmodule
= mmodule
279 redef fun compare
(a
, b
) do
282 else if a
.is_subtype
(self.mmodule
, null, b
) then
289 # A sorter for reverse linearization
290 private class ReverseTypeSorter
293 redef fun compare
(a
, b
) do
296 else if a
.is_subtype
(self.mmodule
, null, b
) then
305 super AbstractColoring[MClass]
309 private var mmodule
: MModule
312 private var super_elements_cache
: Map[T
, Set[T
]] = new HashMap[T
, Set[T
]]
313 private var parent_elements_cache
: Map[T
, Set[T
]] = new HashMap[T
, Set[T
]]
314 private var sub_elements_cache
: Map[T
, Set[T
]] = new HashMap[T
, Set[T
]]
316 init(mainmodule
: MModule) do
317 super(new ClassSorter(mainmodule
), new ReverseClassSorter(mainmodule
))
318 self.mmodule
= mainmodule
322 fun build_type_tables
(mclasses
: Array[T
], colors
: Map[T
, Int]): Map[T
, Array[nullable T
]] do
323 var tables
= new HashMap[T
, Array[nullable T
]]
325 for mclasse
in mclasses
do
326 var table
= new Array[nullable T
]
327 var supers
= new HashSet[T
]
328 supers
.add_all
(self.super_elements
(mclasse
))
331 var color
= colors
[sup
]
332 if table
.length
<= color
then
333 for i
in [table
.length
.. color
[ do
339 tables
[mclasse
] = table
344 redef fun super_elements
(element
) do
345 if not self.super_elements_cache
.has_key
(element
) then
346 var supers
= new HashSet[T
]
347 if self.mmodule
.flatten_mclass_hierarchy
.has
(element
) then
348 for sup
in self.mmodule
.flatten_mclass_hierarchy
[element
].greaters
do
349 if element
== sup
then continue
353 self.super_elements_cache
[element
] = supers
355 return self.super_elements_cache
[element
]
358 private fun parent_elements
(element
: T
): Set[T
] do
359 if not self.parent_elements_cache
.has_key
(element
) then
360 var parents
= new HashSet[T
]
361 if self.mmodule
.flatten_mclass_hierarchy
.has
(element
) then
362 for parent
in self.mmodule
.flatten_mclass_hierarchy
[element
].direct_greaters
do
363 if element
== parent
then continue
367 self.parent_elements_cache
[element
] = parents
369 return self.parent_elements_cache
[element
]
372 # Return all sub elements (directs and indirects) of an element
373 redef fun sub_elements
(element
) do
374 if not self.sub_elements_cache
.has_key
(element
) then
375 var subs
= new HashSet[T
]
376 if self.mmodule
.flatten_mclass_hierarchy
.has
(element
) then
377 for sub
in self.mmodule
.flatten_mclass_hierarchy
[element
].smallers
do
381 self.sub_elements_cache
[element
] = subs
383 return self.sub_elements_cache
[element
]
386 # Return all direct super elements of an element
387 redef fun is_element_mi
(element
) do
388 if not self.mmodule
.flatten_mclass_hierarchy
.has
(element
) then return false
389 return self.mmodule
.flatten_mclass_hierarchy
[element
].direct_greaters
.length
> 1
393 # incremental coloring (very naive)
394 class NaiveClassColoring
397 init(mainmodule
: MModule) do
401 # naive coloring that use incremental coloring
402 redef fun colorize_elements
(elements
: Collection[MClass]) do
404 self.coloration_result
[e
] = self.coloration_result
.length
409 # A sorter for linearize list of classes
410 private class ClassSorter
411 super AbstractSorter[MClass]
415 redef fun compare
(a
, b
) do
418 else if self.mmodule
.flatten_mclass_hierarchy
.has
(a
) and self.mmodule
.flatten_mclass_hierarchy
[a
].greaters
.has
(b
) then
425 # A sorter for reverse linearization
426 private class ReverseClassSorter
427 super AbstractSorter[MClass]
431 redef fun compare
(a
, b
) do
434 else if self.mmodule
.flatten_mclass_hierarchy
.has
(a
) and self.mmodule
.flatten_mclass_hierarchy
[a
].greaters
.has
(b
) then
442 class PropertyColoring
444 type MPROP: MProperty
445 type MPROPDEF: MPropDef
447 private var class_coloring
: ClassColoring
448 private var coloration_result
: Map[MPROP, Int] = new HashMap[MPROP, Int]
450 init(class_coloring
: ClassColoring) do
451 self.class_coloring
= class_coloring
454 fun colorize
: Map[MPROP, Int] do
455 colorize_core_properties
456 colorize_crown_properties
457 return self.coloration_result
460 fun build_property_tables
: Map[MClass, Array[nullable MPROPDEF]] do
461 var tables
= new HashMap[MClass, Array[nullable MPROPDEF]]
463 for mclass
in self.class_coloring
.coloration_result
.keys
do
464 var table
= new Array[nullable MPROPDEF]
465 # first, fill table from parents by reverse linearization order
466 var parents
= new OrderedSet[MClass]
467 parents
.add_all
(self.class_coloring
.super_elements
(mclass
))
468 self.class_coloring
.reverse_sorter
.sort
(parents
)
469 for parent
in parents
do
470 for mproperty
in self.properties
(parent
) do
471 var color
= self.coloration_result
[mproperty
]
472 if table
.length
<= color
then
473 for i
in [table
.length
.. color
[ do
477 for mpropdef
in mproperty
.mpropdefs
do
478 if mpropdef
.mclassdef
.mclass
== parent
then
479 table
[color
] = mpropdef
485 # then override with local properties
486 for mproperty
in self.properties
(mclass
) do
487 var color
= self.coloration_result
[mproperty
]
488 if table
.length
<= color
then
489 for i
in [table
.length
.. color
[ do
493 for mpropdef
in mproperty
.mpropdefs
do
494 if mpropdef
.mclassdef
.mclass
== mclass
then
495 table
[color
] = mpropdef
499 tables
[mclass
] = table
504 # Colorize properties of the core hierarchy
505 private fun colorize_core_properties
do
506 var mclasses
= self.class_coloring
.core
509 for mclass
in mclasses
do
510 var color
= min_color
512 # if the class is root, get the minimal color
513 if self.class_coloring
.parent_elements
(mclass
).length
== 0 then
514 colorize_elements
(self.properties
(mclass
), color
)
516 # check last color used by parents
517 color
= max_color
(color
, self.class_coloring
.parent_elements
(mclass
))
518 # check max color used in conflicts
519 if self.class_coloring
.conflicts_graph
.has_key
(mclass
) then
520 color
= max_color
(color
, self.class_coloring
.conflicts_graph
[mclass
])
524 colorize_elements
(self.properties
(mclass
), color
)
529 # Colorize properties of the crown hierarchy
530 private fun colorize_crown_properties
do
531 for mclass
in self.class_coloring
.crown
do
532 colorize_elements
(self.properties
(mclass
), max_color
(0, self.class_coloring
.parent_elements
(mclass
)))
536 # Colorize a collection of properties given a starting color
537 private fun colorize_elements
(elements
: Collection[MPROP], start_color
: Int) do
538 for element
in elements
do
539 if self.coloration_result
.has_key
(element
) then continue
540 self.coloration_result
[element
] = start_color
545 private fun max_color
(min_color
: Int, mclasses
: Collection[MClass]): Int do
546 var max_color
= min_color
548 for mclass
in mclasses
do
549 for mproperty
in self.properties
(mclass
) do
550 var color
= min_color
551 if self.coloration_result
.has_key
(mproperty
) then
552 color
= self.coloration_result
[mproperty
]
553 if color
>= max_color
then max_color
= color
+ 1
561 private var properties_cache
: Map[MClass, Set[MPROP]] = new HashMap[MClass, Set[MPROP]]
563 # All 'mproperties' associated to all 'mclassdefs' of the class
564 private fun properties
(mclass
: MClass): Set[MPROP] do
565 if not self.properties_cache
.has_key
(mclass
) then
566 var properties
= new HashSet[MPROP]
567 var parents
= self.class_coloring
.super_elements
(mclass
)
568 for parent
in parents
do
569 properties
.add_all
(self.properties
(parent
))
572 for mclassdef
in mclass
.mclassdefs
do
573 for mpropdef
in mclassdef
.mpropdefs
do
574 var mproperty
= mpropdef
.mproperty
575 if mproperty
isa MPROP then
576 properties
.add
(mproperty
)
580 self.properties_cache
[mclass
] = properties
582 return properties_cache
[mclass
]
588 super PropertyColoring
590 redef type MPROP: MMethod
591 redef type MPROPDEF: MMethodDef
592 init(class_coloring
: ClassColoring) do end
595 # MAttribute coloring
596 class AttributeColoring
597 super PropertyColoring
599 redef type MPROP: MAttribute
600 redef type MPROPDEF: MAttributeDef
601 init(class_coloring
: ClassColoring) do end
604 # MVirtualTypeProp coloring
606 super PropertyColoring
608 redef type MPROP: MVirtualTypeProp
609 redef type MPROPDEF: MVirtualTypeDef
610 init(class_coloring
: ClassColoring) do end
613 # MParameterType coloring
615 private var class_coloring
: ClassColoring
616 private var coloration_result
: Map[MParameterType, Int] = new HashMap[MParameterType, Int]
618 init(class_coloring
: ClassColoring) do
619 self.class_coloring
= class_coloring
622 fun colorize
: Map[MParameterType, Int] do
623 colorize_core_properties
624 colorize_crown_properties
625 return self.coloration_result
628 # Colorize properties of the core hierarchy
629 private fun colorize_core_properties
do
630 var mclasses
= self.class_coloring
.core
633 for mclass
in mclasses
do
634 var color
= min_color
636 # if the class is root, get the minimal color
637 if self.class_coloring
.parent_elements
(mclass
).length
== 0 then
638 colorize_elements
(self.fts
(mclass
), color
)
640 # check last color used by parents
641 color
= max_color
(color
, self.class_coloring
.parent_elements
(mclass
))
642 # check max color used in conflicts
643 if self.class_coloring
.conflicts_graph
.has_key
(mclass
) then
644 color
= max_color
(color
, self.class_coloring
.conflicts_graph
[mclass
])
647 colorize_elements
(self.fts
(mclass
), color
)
652 # Colorize properties of the crown hierarchy
653 private fun colorize_crown_properties
do
654 for mclass
in self.class_coloring
.crown
do
655 colorize_elements
(self.fts
(mclass
), max_color
(0, self.class_coloring
.parent_elements
(mclass
)))
659 # Colorize a collection of properties given a starting color
660 private fun colorize_elements
(elements
: Collection[MParameterType], start_color
: Int) do
661 for element
in elements
do
662 if self.coloration_result
.has_key
(element
) then continue
663 self.coloration_result
[element
] = start_color
668 private fun max_color
(min_color
: Int, mclasses
: Collection[MClass]): Int do
669 var max_color
= min_color
671 for mclass
in mclasses
do
672 for ft
in self.fts
(mclass
) do
673 var color
= min_color
674 if self.coloration_result
.has_key
(ft
) then
675 color
= self.coloration_result
[ft
]
676 if color
>= max_color
then max_color
= color
+ 1
684 private var fts_cache
: Map[MClass, Set[MParameterType]] = new HashMap[MClass, Set[MParameterType]]
686 private fun fts
(mclass
: MClass): Set[MParameterType] do
687 if not self.fts_cache
.has_key
(mclass
) then
688 var fts
= new HashSet[MParameterType]
689 var mclass_type
= mclass
.mclass_type
690 if mclass_type
isa MGenericType then
691 for ft
in mclass_type
.arguments
do
692 fts
.add
(ft
.as(MParameterType))
695 self.fts_cache
[mclass
] = fts
697 return fts_cache
[mclass
]
700 fun build_ft_tables
: Map[MClass, Array[nullable MParameterType]] do
701 var tables
= new HashMap[MClass, Array[nullable MParameterType]]
703 for mclass
in self.class_coloring
.coloration_result
.keys
do
704 var table
= new Array[nullable MParameterType]
706 # first, fill table from parents
707 for parent
in self.class_coloring
.super_elements
(mclass
) do
708 for ft
in self.fts
(parent
) do
709 var color
= self.coloration_result
[ft
]
710 if table
.length
<= color
then
711 for i
in [table
.length
.. color
[ do
719 # then override with local properties
720 for ft
in self.fts
(mclass
) do
721 var color
= self.coloration_result
[ft
]
722 if table
.length
<= color
then
723 for i
in [table
.length
.. color
[ do
729 tables
[mclass
] = table
735 # Live Entries coloring
736 class LiveEntryColoring
738 private var coloration_result
: Map[MType, Int] = new HashMap[MType, Int]
739 private var conflicts_graph_cache
: nullable HashMap[MType, Set[MType]]
740 var livetypes_tables_sizes
: nullable Map[MClass, Array[Int]]
744 fun colorize
(elements
: Collection[MType]): Map[MType, Int] do
746 build_conflicts_graph
(elements
)
749 colorize_elements
(elements
)
751 return coloration_result
755 fun build_livetype_tables
(mtypes
: Set[MType]): Map[MClass, Array[nullable Object]] do
756 var livetypes_tables
= new HashMap[MClass, Array[nullable Object]]
757 self.livetypes_tables_sizes
= new HashMap[MClass, Array[Int]]
759 for mtype
in mtypes
do
760 if mtype
isa MGenericType then
761 var table
: Array[nullable Object]
762 var sizes
: Array[Int]
763 if livetypes_tables
.has_key
(mtype
.mclass
) then
764 table
= livetypes_tables
[mtype
.mclass
]
766 table
= new Array[nullable Object]
767 livetypes_tables
[mtype
.mclass
] = table
769 if livetypes_tables_sizes
.has_key
(mtype
.mclass
) then
770 sizes
= livetypes_tables_sizes
[mtype
.mclass
]
772 sizes
= new Array[Int]
773 livetypes_tables_sizes
[mtype
.mclass
] = sizes
775 build_livetype_table
(mtype
, 0, table
, sizes
)
779 return livetypes_tables
782 # Build live gentype table recursively
783 private fun build_livetype_table
(mtype
: MGenericType, current_rank
: Int, table
: Array[nullable Object], sizes
: Array[Int]) do
784 var ft
= mtype
.arguments
[current_rank
]
785 if not self.coloration_result
.has_key
(ft
) then return
786 var color
= self.coloration_result
[ft
]
788 if current_rank
>= sizes
.length
then
789 sizes
[current_rank
] = color
+ 1
790 else if color
>= sizes
[current_rank
] then
791 sizes
[current_rank
] = color
+ 1
794 if color
> table
.length
then
795 for i
in [table
.length
.. color
[ do table
[i
] = null
798 if current_rank
== mtype
.arguments
.length
- 1 then
801 var ft_table
: Array[nullable Object]
802 if color
< table
.length
and table
[color
] != null then
803 ft_table
= table
[color
].as(Array[nullable Object])
805 ft_table
= new Array[nullable Object]
807 table
[color
] = ft_table
808 build_livetype_table
(mtype
, current_rank
+ 1, ft_table
, sizes
)
812 # Colorize a collection of elements
813 fun colorize_elements
(elements
: Collection[MType]) do
816 for element
in elements
do
817 var color
= min_color
818 while not self.is_color_free
(element
, color
) do
821 coloration_result
[element
] = color
826 # Check if a related element to the element already use the color
827 private fun is_color_free
(element
: MType, color
: Int): Bool do
828 if conflicts_graph
.has_key
(element
) then
829 for st
in conflicts_graph
[element
] do
830 if coloration_result
.has_key
(st
) and coloration_result
[st
] == color
then return false
836 # look for types in the same generic signatures
837 private fun build_conflicts_graph
(elements
: Collection[MType]) do
838 # regroup types by classes
839 var genclasses
= new HashMap[MClass, Set[MType]]
841 if e
isa MGenericType then
842 if not genclasses
.has_key
(e
.mclass
) then
843 genclasses
[e
.mclass
] = new HashSet[MType]
845 genclasses
[e
.mclass
].add
(e
)
850 self.conflicts_graph_cache
= new HashMap[MType, Set[MType]]
851 for mclass
, mtypes
in genclasses
do
853 for rank
in [0..mclass
.arity
[ do
855 for mtype
in mtypes
do
856 var mclasstype
: MClassType
857 if mtype
isa MNullableType then
858 mclasstype
= mtype
.mtype
.as(MClassType)
860 mclasstype
= mtype
.as(MClassType)
862 var ft
= mclasstype
.arguments
[rank
]
863 for otype
in mtypes
do
864 if mtype
== otype
then continue
865 var oclasstype
: MClassType
866 if otype
isa MNullableType then
867 oclasstype
= otype
.mtype
.as(MClassType)
869 oclasstype
= otype
.as(MClassType)
871 var oft
= oclasstype
.arguments
[rank
]
872 self.add_conflict
(ft
, oft
)
879 private fun add_conflict
(mtype
: MType, otype
: MType) do
880 if mtype
== otype
then return
881 if not self.conflicts_graph_cache
.has_key
(mtype
) then self.conflicts_graph_cache
[mtype
] = new HashSet[MClassType]
882 self.conflicts_graph_cache
[mtype
].add
(otype
)
883 if not self.conflicts_graph_cache
.has_key
(otype
) then self.conflicts_graph_cache
[otype
] = new HashSet[MClassType]
884 self.conflicts_graph_cache
[otype
].add
(mtype
)
886 private fun conflicts_graph
: Map[MType, Set[MType]] do return conflicts_graph_cache
.as(not null)
892 private class OrderedSet[E
]
896 if not self.has
(e
) then
901 # Return a new OrderedSet with the elements only contened in 'self' and not in 'o'
902 fun -(o
: OrderedSet[E
]): OrderedSet[E
] do
903 var res
= new OrderedSet[E
]
904 for e
in self do if not o
.has
(e
) then res
.add
(e
)