Fix compilation errors in samples, extras and benchmarks.

benchmarks/progs/quicksort/qs_always_par.m:
benchmarks/progs/quicksort/qs_utils.m:
extras/moose/check.m:
extras/posix/samples/mdprof_cgid.m:
extras/xml/parsing.m:
samples/muz/zparser.m:
samples/muz/ztype_op.m:
    As above -- the compiler now rejects determinism declarations on
    non-predmode predicate declarations.

    Replace a call to bitmap.new with bitmap.init.

benchmarks/progs/quicksort/qs_always_par.m

@@ -21,7 +21,7 @@
     quicksort(Input, Sorted),
     sink_output(Sorted, !IO).
 
-:- pred quicksort(list(string), list(string)) is det.
+:- pred quicksort(list(string), list(string)).
 :- mode quicksort(in, out) is det.
 :- mode quicksort(list_skel_di, list_skel_uo) is det.
 

benchmarks/progs/quicksort/qs_utils.m

@@ -15,7 +15,7 @@
 :- mode list_skel_di == list_skel_unique >> dead.
 :- mode list_skel_uo == free >> list_skel_unique.
 
-:- pred partition(string, list(string), list(string), list(string)) is det.
+:- pred partition(string, list(string), list(string), list(string)).
 :- mode partition(in, in, out, out) is det.
 :- mode partition(in, list_skel_di, list_skel_uo, list_skel_uo) is det.
 

extras/moose/check.m

@@ -300,8 +300,7 @@ not contains(Decls, NonTermId)
 
 %------------------------------------------------------------------------------%
 
-:- pred id(nonterminal, name, arity) is det.
-:- mode id(in, out, out) is det.
+:- pred id(nonterminal::in, name::out, arity::out) is det.
 
 id(Name/Arity, Name, Arity).
 id(start, _, _) :-

extras/posix/samples/mdprof_cgid.m

@@ -206,7 +206,7 @@
 
 handle_conn(Data, ConnFd, !IO) :-
     TextSize = 1024,
-    Text0 = bitmap.new(TextSize * bits_per_int),
+    Text0 = bitmap.init(TextSize * bits_per_int),
     read(ConnFd, TextSize, ReadResult, Text0, Text, !IO),
     (
         ReadResult = ok(Length),

extras/xml/parsing.m

@@ -616,8 +616,7 @@ Parser			    then (pred(Xs0::in, pdi, puo) is det -->
     return(Xs)
     ).
 
-:- pred filter1(list(opt(T)), list(T)) is det.
-:- mode filter1(in, out) is det.
+:- pred filter1(list(opt(T))::in, list(T)::out) is det.
 
 filter1([], []).
 filter1([X0|Xs0], Xs) :-

samples/muz/zparser.m

@@ -693,7 +693,7 @@
 log_pred3(P) -->
 	c(C), parse_left(x(zAND), basic_pred, lbpred(C, conjunction), P).
 
-:- pred lbpred(zcontext, lconn, zpred, zpred, zpred) is det.
+:- pred lbpred(zcontext, lconn, zpred, zpred, zpred).
 :- mode lbpred(in, in, in, in, out) is det.
 lbpred(C, T, P0, P1, lbpred(T, P0, P1)-C).
 

samples/muz/ztype_op.m

@@ -27,7 +27,7 @@
 
 :- type powerResult ---> yes ; no(ztype).
 
-:- pred powerType(expr, ztype, ztype, powerResult, subst, subst) is det.
+:- pred powerType(expr, ztype, ztype, powerResult, subst, subst).
 :- mode powerType(in, in, out, out, in, out) is det.
 
 :- pred powerType(ztype::in, ztype::out, maybe0::out) is det.
@@ -90,7 +90,7 @@
 
 :- type unify ---> unified ; failed(subst).
 
-:- pred ztunify(ztype, ztype, ztype, unify, subst, subst) is det.
+:- pred ztunify(ztype, ztype, ztype, unify, subst, subst).
 :- mode ztunify(in, in, out, out, in, out) is det.
 
 % :- pred ztunify(ztype, ztype, ztype, subst, subst) is semidet.