I would probably set up an array of associations whose keys are the boundary limits and whose values are the target values (ordered, in this example, from outer to inner).
Then loop over the array's associations using inject:into:, testing for the point where (each < key), at which point you return the previous association's value. -t -- Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html
