Hi Matt, If you don't want to streamline the code, could you add some documentation on how it works and describe your strategy, and variable naming convention?
For example, I am guessing, based on looking at your 'get' routine, that the lowest range of indexes for the large array, will be found in the _1a section, then _1b, etc. But then there is some further switching back and forth that I don't understand yet. Another question - what happens to arrays that seem to be declared but never used? Are they wasted, or does the JALV2 compiler re-use that space? What is the worst-case 'waste' of memory? I think it is only 255*4 bytes but I am not sure. Thank you, William On Nov 7, 12:41 am, mattschinkel <[email protected]> wrote: > I have created a lib for creating 1 large array. > > I tested and added these files to SVN > \include\jal\large_array.jal > \sample\18f452_large_array.jal > > Tested on 18F, It took lots of code to do this, but works great. > > Let me know what you think. As you know, you can not currently have an > array that takes up more then 256 bytes memory. > > -- Notes: > -- Supports byte array with up to 2048 entries > -- Supports word array with up to 1024 entries > -- Supports dword array with up to 512 entries > -- Creates an array named large_array_1 > -- Use "alias new_array_name is large_array_1" to rename the array > -- > -- Example: > -- const dword ARRAY_SIZE = 600 -- choose number of array > variables > -- const dword ARRAY_VARIABLE_SIZE = 2 -- choose size of variables > (byte*2) > -- include large_array -- include the array library > -- alias test is large_array_1 -- rename/alias the array to > test > -- > > Matt. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "jallib" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/jallib?hl=en -~----------~----~----~----~------~----~------~--~---
