Emulating Modula-3's FOR loop

[davidf@worf.mks.com (David J. Fiander)]

I just ran across something minor, but annoying.  Suppose I've
got an array, indexed by the type Subscript, and I want to
operate on every n'th element of the array.  In Modula-3, I'd say
something like

	FOR i FROM n TO last BY n do
	    (* process the array elements *)
	END;

Now, if last is not divisible by n, this will still work, without
raising a Constraint_Error (or the modula equivalent).  But in
Ada, the obvious translation

	procedure Operate(Arr: in out Array(Subscript) of Elt;
			  N: in Subscript) is
	    I: Subscript := N;
	begin
	    while I <= Subscript'Last loop
	        -- Process the array
	        I := I + N;
	    end loop;
	end Operate;

will raise a Constraint_Error on the last addition.  Is there a
better way to deal with this than

	...
	begin
	    while I <= Subscript'Last loop
	        -- process
	        I := I + N;
	    end loop;
	exception
	    when Constraint_Error => null;
	end;