Beginning Microsoft SQL Server 2008 ... - S3 Tech Training

You can test the arithmetic overflow easily by putting any large number in — anything bigger than
about 13 will work for this example.
Testing the 32-level recursion limit takes a little bit more modification to our sproc. This time, we’ll
determine the triangular of the number. This is very similar to finding the factorial, except that we use
addition rather than multiplication. Therefore, 5 triangular is just 15 (5+4+3+2+1). Let’s create a new
sproc to test this one out — it will look just like the factorial sproc with only a few small changes:
CREATE PROC spTriangular
@ValueIn int,
@ValueOut int OUTPUT
AS
DECLARE @InWorking int;
DECLARE @OutWorking int;
IF @ValueIn != 1
BEGIN
SELECT @InWorking = @ValueIn - 1;
END
ELSE
BEGIN
END
RETURN;
GO
EXEC spTriangular @InWorking, @OutWorking OUTPUT;
SELECT @ValueOut = @ValueIn + @OutWorking;
SELECT @ValueOut = 1;
As you can see, there weren’t that many changes to be made. Similarly, we only need to change our
sproc call and the PRINT text for our test script:
DECLARE @WorkingOut int;
DECLARE @WorkingIn int;
SELECT @WorkingIn = 5;
EXEC spTriangular @WorkingIn, @WorkingOut OUTPUT;
PRINT CAST(@WorkingIn AS varchar) + ‘ Triangular is ‘ + CAST(@WorkingOut AS
varchar);
Running this with an @ValueIn of 5 gets our expected 15:
5 Triangular is 15
Chapter 12: Stored Procedures
However, if you try to run it with an @ValueIn of more than 32, you get an error:
Msg 217, Level 16, State 1, Procedure spTriangular, Line 10
Maximum stored procedure, function, trigger, or view nesting level exceeded (limit 32).
401