i belive that isn't right by some reason
0 - normal animation;
1 - frame1 + frame2(these frame has the same size)(transparent);
2 - frame1 + frame2(only part of the image for be changed)(transparent).
(at least i belive that these is the right "formulas")
can anyone help me?
This takes a byte at the position lngFind+4, shifts it right by 2 bits and masks the last two bits.
The result of this operation can be a value from 0 to 3.
The value was contained there in a byte: xxxxccxx, where cc denote the bits of the disposal code.
I don't understand how you compute lngFind, because this value +4 makes the actual pointer to the byte read.
Unfortunately, I don't know the format of the gif files so I don't know right from wrong here, but I can definitely say,
the result of the above operation gives either 0, 1, or 2, or even 3 if that is a valid disposal code, too.
ok.. finally is almost corrected
my problem is that if every frame are 1(disposed method value), how can i see if the frame is complete(in that gif the 2 and 3 are both complete frames(don't need be combined))?.
(heres the function apdated).
(if is needed, i can put a complet example)