diff options
-rw-r--r-- | Dafny/Resolver.cs | 2 | ||||
-rw-r--r-- | Test/VSComp2010/Problem5-DoubleEndedQueue.dfy | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/Dafny/Resolver.cs b/Dafny/Resolver.cs index 87ef94d5..c2d1480a 100644 --- a/Dafny/Resolver.cs +++ b/Dafny/Resolver.cs @@ -2220,7 +2220,7 @@ namespace Microsoft.Dafny { Contract.Assert( ctor != null); // follows from postcondition of TryGetValue
mc.Ctor = ctor;
if (ctor.Formals.Count != mc.Arguments.Count) {
- Error(mc.tok, "member {0} has wrong number of formals (found {1}, expected {2})", mc.Arguments.Count, ctor.Formals.Count);
+ Error(mc.tok, "member {0} has wrong number of formals (found {1}, expected {2})", mc.Id, mc.Arguments.Count, ctor.Formals.Count);
}
if (memberNamesUsed.ContainsKey(mc.Id)) {
Error(mc.tok, "member {0} appears in more than one case", mc.Id);
diff --git a/Test/VSComp2010/Problem5-DoubleEndedQueue.dfy b/Test/VSComp2010/Problem5-DoubleEndedQueue.dfy index 540225a1..fdda243c 100644 --- a/Test/VSComp2010/Problem5-DoubleEndedQueue.dfy +++ b/Test/VSComp2010/Problem5-DoubleEndedQueue.dfy @@ -165,7 +165,7 @@ class LinkedList<T> { }
}
- static function method ReverseSeq(s: seq<T>): seq<T>
+ static function ReverseSeq(s: seq<T>): seq<T>
{
if s == [] then [] else
ReverseSeq(s[1..]) + [s[0]]
|