5 // Alexander Chebaturkin (chebaturkin@gmail.com)
7 // Copyright (C) 2011 Alexander Chebaturkin
9 // Permission is hereby granted, free of charge, to any person obtaining
10 // a copy of this software and associated documentation files (the
11 // "Software"), to deal in the Software without restriction, including
12 // without limitation the rights to use, copy, modify, merge, publish,
13 // distribute, sublicense, and/or sell copies of the Software, and to
14 // permit persons to whom the Software is furnished to do so, subject to
15 // the following conditions:
17 // The above copyright notice and this permission notice shall be
18 // included in all copies or substantial portions of the Software.
20 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
24 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
25 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
32 using Mono
.CodeContracts
.Static
.DataStructures
;
34 namespace Mono
.CodeContracts
.Static
.Lattices
{
35 struct SetDomain
<T
> : IAbstractDomain
<SetDomain
<T
>>
36 where T
: IEquatable
<T
> {
37 public static readonly SetDomain
<T
> TopValue
= new SetDomain
<T
> (ImmutableSet
<T
>.Empty ());
38 public static readonly SetDomain
<T
> BottomValue
= new SetDomain
<T
> ((IImmutableSet
<T
>) null);
40 readonly IImmutableSet
<T
> set;
42 SetDomain (IImmutableSet
<T
> set)
47 public SetDomain (Func
<T
, int> keyConverter
)
49 set = ImmutableSet
<T
>.Empty (keyConverter
);
52 public SetDomain
<T
> Top { get { return TopValue; }
}
54 public SetDomain
<T
> Bottom { get { return BottomValue; }
}
56 public bool IsTop { get { return set != null && set.Count == 0; }
}
58 public bool IsBottom { get { return set == null; }
}
60 public SetDomain
<T
> Join (SetDomain
<T
> that
)
63 if (this.TryTrivialJoin (that
, out result
))
66 return new SetDomain
<T
> (set.Intersect (that
.set));
69 public SetDomain
<T
> Join (SetDomain
<T
> that
, bool widening
, out bool weaker
)
71 if (set == that
.set) {
76 weaker
= !that
.IsBottom
;
79 if (that
.IsBottom
|| IsTop
) {
88 var join = set.Intersect (that
.set);
90 weaker
= join.Count
< set.Count
;
91 return new SetDomain
<T
> (join);
94 public SetDomain
<T
> Widen (SetDomain
<T
> that
)
96 //no widening - finite lattice
101 public SetDomain
<T
> Meet (SetDomain
<T
> that
)
104 if (this.TryTrivialMeet (that
, out result
))
107 return new SetDomain
<T
> (set.Union (that
.set));
110 public bool LessEqual (SetDomain
<T
> that
)
117 return that
.set.IsContainedIn (set);
120 public SetDomain
<T
> ImmutableVersion ()
125 public SetDomain
<T
> Clone ()
130 public SetDomain
<T
> With (T elem
)
132 return new SetDomain
<T
> (set.Add (elem
));
135 public SetDomain
<T
> Without (T elem
)
137 return new SetDomain
<T
> (set.Remove (elem
));
140 public bool Contains (T item
)
142 return set.Contains (item
);
145 public void Dump (TextWriter tw
)
148 tw
.WriteLine ("Bot");
150 tw
.WriteLine ("Top");