My problem is started with fill algo with insuffient memory.
(non PC, in mobile programming)
recursive fill algos couldn't accept, so i found non-recursive
fill algo - use stack - , but it could not.
Having 980bytes left memory totally, i have to figure it out.
Besides some variable, i hope this only 500bytes, if possible.
any ideas?
(non PC, in mobile programming)
recursive fill algos couldn't accept, so i found non-recursive
fill algo - use stack - , but it could not.
Having 980bytes left memory totally, i have to figure it out.
Besides some variable, i hope this only 500bytes, if possible.
any ideas?
Mobile programming? Mobile phone? My mobile phone only understands stupid Java :grin:
Yes, there are three formats,
Qualcomm's BREW,
GVM, and Mobile Java... in our country.
In BREW, i can use about 500kb memory,
GVM'S 16Kb, java haven't tried.
In any case, I can't use recursive algos. :confused:
Qualcomm's BREW,
GVM, and Mobile Java... in our country.
In BREW, i can use about 500kb memory,
GVM'S 16Kb, java haven't tried.
In any case, I can't use recursive algos. :confused:
Yes, there are three formats,
Qualcomm's BREW,
GVM, and Mobile Java... in our country.
In BREW, i can use about 500kb memory,
GVM'S 16Kb, java haven't tried.
In any case, I can't use recursive algos. :confused:
BREW? Sounds like beer... do you have any link? :)
EDIT: Nevermind, thanks god & google: http://www.qualcomm.com/brew/developer/developing/developing.html
yes, right...
this is BREW dev site...
coding in C, complie with ARM compiler, not familiar.
this is BREW dev site...
coding in C, complie with ARM compiler, not familiar.
I have found "An Estimate of the Buffer Size for a Flag
STACK/QUEUE Algorithm for Filling 4-Connected Areas on Raster
Devices" in google search.
according above, Required Queue size is...
QueueSize = 8*int( (N+1)/4 ) - 4,
I just need 90 * 80 areas, so this stack method looks good.
but I understand "STACK" method but "QUEUE".
Using queue, have to rearrange array every time?
anyone show me some sample code in "QUEUED" fill algo?
STACK/QUEUE Algorithm for Filling 4-Connected Areas on Raster
Devices" in google search.
according above, Required Queue size is...
QueueSize = 8*int( (N+1)/4 ) - 4,
I just need 90 * 80 areas, so this stack method looks good.
but I understand "STACK" method but "QUEUE".
Using queue, have to rearrange array every time?
anyone show me some sample code in "QUEUED" fill algo?