I assume that you are saying that, in Servoy, sorting is going to be a faster process than a ‘while’ loop that has to run through all records to give you a result !?
But, why do you need to loop through the records to compare the current record with the maximum ?
I have set up a global method called ‘rec_last’ as follows :
Because of small volume record numbers that I have been experimenting with, I had no idea that there was a limitation in the record indexing function !
To all : Is there a list of this and any other limitations anywhere in the documentation so that I can familiarise myself with them ?
Harry Catharell:
To all : Is there a list of this and any other limitations anywhere in the documentation so that I can familiarise myself with them ?
That depends on your definition of limitation. In my opinion it’s not a limitation but a feature. It just works differently than for example desktopdatabases and although Servoy has the ease of use of a desktop database it is a front-end to SQL systems where having a total record count at all times is not feasible.
User performs a query of people and the found set contains 750 records. User sorts alphabetically by lastname. Then wants to start at everyone with lastname starting with “Z.” In FM, user would just click “go to last record.” How would this be accomplished in Servoy? (Obviously user could sort in descending order, but this isn’t preferred so let’s take it off the table)
I appreciate the superior caching abilities of Servoy, but we’ve got to find a way around this I think.
Thanks Johan. I still think the 200 record caching is great, but I wonder if there could be a feature that allows us to request that Servoy caches all records, or to set manually the number of recs returned at a time.
If not, this is a lower priority at leas tfor me than other things. Thanks again.