May 2000
Intermediate to advanced
594 pages
11h 32m
English
Q: | |
23-20. | The most elegant (not necessarily the most efficient) solution involves recursion:
|
Q: | |
23-21. | To obtain this behavior, add the following exception section to the implementation of println: EXCEPTION
WHEN OTHERS
THEN
DBMS_OUTPUT.ENABLE (1000000);
println (val);
END;
/In other words, if any problem occurs, expand the buffer to its maximum size and then try, try again. |
Q: | |
23-22. | The most interesting aspect of the solution is the implementation of the Boolean overloading. Here is one possible approach:
|