c++ - An algorithm for iterating over a rectangular area inside a 1 dimensional array (bitmapping) -

-

this odd question had tough time writing title for.

i'm working pixels (bitmaps, more specifically) , can't figure out (simple) maths pragmatically accessing each array cell.

my canvas [n16 x 16] pixels, n 1 or greater.

here's photo of basic n = 2 canvas:

http://i.imgur.com/mabwqfj.png

enter image description here

what want magical algorithm run 0 495 without touching lighter grey area go 16 512 (which cell 511, bad) without touching dark grey area.

so, 0 15, skip 16 31 followed 32 47, etc.

and n = 3:

http://i.imgur.com/tqjmwl6.png

enter image description here

in case 0-735 skipping lighter grey areas, 16-751 skipping areas on each side , 32-767 skipping darker grey areas.

what tried:

here's extract code, it's useful , shows tried already. it's part figures out value 'idxpos'.

// let's length = 3 now. (int character = 0; character < length; ++character) {     // in case you're wondering, grabs 16x16 characters ascii spritesheet     charpos = (string[character] - ' ') * 16 * 16;      // runs through spritesheet character map     // huge 16x1520 bitmap.     (int pixel = 0; pixel < 16 * 16; ++pixel)     {         // ignore this, me messing around pixel tinting         r = (((charmap[charpos + pixel] >> 0) & 0xff) + 255 - u);         g = (((charmap[charpos + pixel] >> 8) & 0xff) + 255 - v);         b = (((charmap[charpos + pixel] >> 16) & 0xff) + 255 - w);         newcolour = rgb(r, g, b);          // part stuck on:         idxpos = pixel + (character * 16 * 16);          bitmap[idxpos] = charmap[charpos + j];     } }

you idea. sounds dead simple me can't figure out.

oh, , i'm not interested in magical library can handle bitmap stuff me, i'm not in position can use one.

if question properly, want visit them in order mentioned. here's code (given n):

for(int = 0; < n; i++) //which section going through {   for(int row = 0; row < size; row++) //size = 16, better use on of constants   {      for(int col = 0; col < size; col++)     {       int pixelindex = size * (row * n) + col + size * i;        /*the last 1 offset - moves        index right far need.       if need 2 coordinates (as in (x,y))       instead of 1 number, is: */       int x = row, y = col + size * i;       dosomethingwithpixel(pixelindex);     }   } }

hope helps.


Comments

Post a Comment

Popular posts from this blog

java - Custom OutputStreamAppender not run: LOGBACK: No context given for <MYAPPENDER> -

-
i wish write custom appender on basis of outputstreamappender . wrote following class package tests; import java.io.ioexception; import java.io.outputstream; import ch.qos.logback.core.outputstreamappender; public class myappender<e> extends outputstreamappender<e> { public myappender() { system.out.println("myappender created"); setoutputstream(new outputstream() { @override public void write(int b) throws ioexception { throw new unsupportedoperationexception(); } }); } } then wrote following runner: package tests; import org.slf4j.loggerfactory; import ch.qos.logback.classic.logger; public class runner { private static final logger log = (logger) loggerfactory.getlogger(runner.class); public static void main(string[] args) { //log.addappender(new myappender<iloggingevent>()); log.info("hello world"); } } finall...
Read more

java - UML - How would you draw a try catch in a sequence diagram? -

-
Image
is there standard way of drawing try catch sequence diagrams? i've made attempt based on this feel end result doesn't feel right. code diagram based around: public static void save () { try { filehandle filehandle = gdx.files.external(file); filehandle.writestring(boolean.tostring(constantshandler.soundenabled)+"\n", false); (int = 0; < 5; i++) { filehandle.writestring(integer.tostring(constantshandler.highscores[i])+"\n", true); } } catch (throwable e) { } } my attempt note: know still need add loop. that's ok. fragments meant show conditional control flow in sequence diagram. superstructures puts limitations on use of fragments (see pp. 467 of ss2.1.1). should use critical region try part above. , option catch . however, keep telling can take quite freedom in using uml. it's language , such changes in life time. long reader ge...
Read more

c++ - No viable overloaded operator for references a map -

-
i trying use map can make tag names reference number. when try , use it, in code error (6 in total every time reference map): src/main.cpp:25:45: error: no viable overloaded operator[] type 'std::map<std::string, std::string>' const char* idcs = node.child_value(tagmap[3]); this code: #include "pugi/pugixml.hpp" #include <iostream> #include <string> #include <map> int main() { pugi::xml_document doca, docb; std::map<std::string, pugi::xml_node> mapa, mapb; std::map<std::string, std::string> tagmap {{"1", "data"}, {"2", "entry"}, {"3", "id"}, {"4", "content"}}; if (!doca.load_file("a.xml") || !docb.load_file("b.xml")) { std::cout << "can't find input files"; return 1; } (auto& node: doca.child(tagmap[1]).children(tagmap[2])) { co...
Read more