alright, so here's what I got:
# -*- coding: utf-8 -*-
W = 25
l = [[u'░' for c in range(W)] for r in range(5)]
_Y = 2
for X in range(W):
Y = _Y+((X&3)-(X&2))-(2*((X&3)==3)) # <-- this could be better
l[Y][X] = u'█'
for r in l: print ''.join(r)
which generates:
░░░░░░░░░░░░░░░░░░░░░░░░░
░░░█░░░█░░░█░░░█░░░█░░░█░
█░█░█░█░█░█░█░█░█░█░█░█░█
░█░░░█░░░█░░░█░░░█░░░█░░░
░░░░░░░░░░░░░░░░░░░░░░░░░
this is for typos and such for my IDE, like like what spell check does in MS Word
how could I make the pattern generation more efficient??
EDIT: lol, looks like Daniweb doesn't understand unicode characters :P
here's another test using numbers:
0000000000000000000000000
0008000800080008000800080
8080808080808080808080808
0800080008000800080008000
0000000000000000000000000