byte b = 0;for (byte i = 0 ; i < 81 ; i++){ //this buffer is only 80 characters byte txt1 = buffer[i + b]; //look at the first character byte txt2 = buffer[i + b + 1]; //look at the second character byte txt3 = buffer[i + b + 2]; //look at the third character // lets make some of those special html characters readable if (txt1 == '%') // if you find an %, we will start looking for de second and tirth character // than we recalculate those into a new char en replace txt1 with the new one { char ascii[17] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'}; for (byte c = 2; c < 8; c++){ for (byte d = 0; d < 17; d++){ if (txt2 == ascii[c] && txt3 == ascii[d]){ txt1 = 32 + (((c-2)*16)+d); //recalculate 2 separate HEX to one new b= b + 2; // go the the next character and therefore skip 2 } } } }}

But you will not be able to use it as is (it only replaces 2 HEX characters into 1 new)

To help you further, post me your twitter buffer (tweet) as you get it on your console. Second I need to know if in your buffer (tweet) this "&#241" takes 5 places or 3. Because we need to know if 241 is one character or three (2,4,1). if it is three, you'll have to do something like this:

Hi JO3RI, thanks for explaining that to me. is there a way to change the behaviour to show say the 10 latest tweets, and to update if a new one is posted?

Well, If you that every tweet would have to be placed into a buffer in SRAM and every buffer is 140 bytes x 10 times is 1400 bytes only for those tweetbuffers (you only have 2048) and you need some for the libraries too.

You could use only 1 buffer and flow 10 tweets through it, but than you can't compare if it is a new tweet or not. To check if a new tweet is posted, I think you can only check periodically and compare the tweets you have, with the once you just checked.

This Arduino Client just asks the tweet stream, gets all of it and starts looking for the last tweet (the top) one, every 60 seconds.try this in the url of your browser for a tweet account:

Maybe now you'll understand the problems to overcome. If you are going to try this, please ask your questions in the programming section, splitting your problem into small problems and try to tackle one at a time.