Skip to main content

PL/SQL Puzzle: when implicit conversions come calling

I posted the following puzzle on Twitter:
A quick little #PLSQL puzzle: I set serveroutput on. After running the code you see in the block below, what will be displayed on the screen?
Try it yourself before reading the rest of the post!


White space


so you do not immediately



see my answer. 



:-)


The output is:

10
1
9

I expect most of you got the first two right and maybe the third one wrong. Note also that the block does not fail with any kind of exception, such as VALUE_ERROR. The reason for all this can be summed up in one phrase: implicit conversion.

As noted by several people, this is a collection indexed by strings, not integers. Only associative arrays (INDEX BY) types support this. And that makes all the difference in this puzzle.

The value being used in the assignment of 100 to elements in the array is an integer (indx).

Since the index type is a string, the PL/SQL engine implicitly converts integers 1 through 10 yto strings "1", "2" ... "9", and finally "10". These are the actual index values used.

So certainly ten elements are added to the collection and so the count returned is 10.

But when it comes to FIRST and LAST, you have to understand how PL/SQL will determine the "lowest" defined index value and the "highest" defined index value.

For integer-indexed collections, it is clear: whichever number is lowest or highest.

But for a string-indexed collection, "lowest" and "highest" are determined by the character set ordering. And in this case "1" comes before "2", "2" before "3" ... "8" before "9".... but "10"? That is not greater than "9". It is greater than "1" and less than "2" as you can see by running this block:

DECLARE  
   TYPE t IS TABLE OF INTEGER  
      INDEX BY VARCHAR2 (3);  
  
   tt   t;  
 
   l_index VARCHAR2 (3); 
BEGIN  
   FOR indx IN 1 .. 10  
   LOOP  
      tt (indx) := 100;  
   END LOOP;  
  
   l_index := tt.FIRST; 
 
   WHILE l_index IS NOT NULL 
   LOOP 
      DBMS_OUTPUT.put_line (l_index); 
      l_index := tt.NEXT (l_index); 
   END LOOP;  
END; 

1
10
2
3
4
5
6
7
8
9

Sometimes PL/SQL makes it too, too easy to work with compatible datatypes. :-)

Check out my LiveSQL script demonstrating all of this.

Also, Hasan Alizada was kind enough to offer this screenshot on Twitter offering a very nice explanation. Thanks, Hasan!


Comments

  1. Hasan's answer in the third case (tt.LAST) should be 9 if I'm not mistaken?

    ReplyDelete
  2. You are correct! Thanks for catching that. I have asked Hasan to provide a replacement.

    ReplyDelete

Post a Comment

Popular posts from this blog

Quick Guide to User-Defined Types in Oracle PL/SQL

A Twitter follower recently asked for more information on user-defined types in the PL/SQL language, and I figured the best way to answer is to offer up this blog post. PL/SQL is a strongly-typed language . Before you can work with a variable or constant, it must be declared with a type (yes, PL/SQL also supports lots of implicit conversions from one type to another, but still, everything must be declared with a type). PL/SQL offers a wide array of pre-defined data types , both in the language natively (such as VARCHAR2, PLS_INTEGER, BOOLEAN, etc.) and in a variety of supplied packages (e.g., the NUMBER_TABLE collection type in the DBMS_SQL package). Data types in PL/SQL can be scalars, such as strings and numbers, or composite (consisting of one or more scalars), such as record types, collection types and object types. You can't really declare your own "user-defined" scalars, though you can define subtypes  from those scalars, which can be very helpful from the p

The differences between deterministic and result cache features

 EVERY once in a while, a developer gets in touch with a question like this: I am confused about the exact difference between deterministic and result_cache. Do they have different application use cases? I have used deterministic feature in many functions which retrieve data from some lookup tables. Is it essential to replace these 'deterministic' key words with 'result_cache'?  So I thought I'd write a post about the differences between these two features. But first, let's make sure we all understand what it means for a function to be  deterministic. From Wikipedia : In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.  Another way of putting this is that a deterministic subprogram (procedure or function) has no side-effects. If you pass a certain set of arguments for the parameters, you will always get

How to Pick the Limit for BULK COLLECT

This question rolled into my In Box today: In the case of using the LIMIT clause of BULK COLLECT, how do we decide what value to use for the limit? First I give the quick answer, then I provide support for that answer Quick Answer Start with 100. That's the default (and only) setting for cursor FOR loop optimizations. It offers a sweet spot of improved performance over row-by-row and not-too-much PGA memory consumption. Test to see if that's fast enough (likely will be for many cases). If not, try higher values until you reach the performance level you need - and you are not consuming too much PGA memory.  Don't hard-code the limit value: make it a parameter to your subprogram or a constant in a package specification. Don't put anything in the collection you don't need. [from Giulio Dottorini] Remember: each session that runs this code will use that amount of memory. Background When you use BULK COLLECT, you retrieve more than row with each fetch,