Hi folks, I decided to write a computer simulator (16-bit machine as the one built in nand2tetris course) in Racket. The computer maps the screen to a memory space where bits represent the pixel colors (black and white).
Right now, I am generating the screen image by converting the bits to a vector of argb pixels and then converting it to bitmap using argb-pixels->pict and then pict-bitmap. The screen updates 10 frames per second but this conversion bits->bitmap is a bottleneck even in this low rate of update. How would be a better approach for this process? I can imagine how an incremental approach can be faster by only changing the necessary parts of the image, but my idea of representing the screen as a quadtree sounds too complex to be the right path. Thanks, Wanderley Guimarães -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/CAAmHZocH9NaV2hwvQsi%2B_dXZy%3DT4nkPd-HmwhzTGKABh89kntg%40mail.gmail.com.
