|
|
1.1 ! root 1: #include "frame.h" ! 2: ! 3: select(f) /* when called, button1 is down and we own mouse */ ! 4: register Frame *f; ! 5: { ! 6: Posn p0, p1, q; ! 7: Point pt0, pt1, qt; ! 8: selectp(f, F_XOR); ! 9: p0=p1=charofpt(f, mouse.xy); ! 10: pt0=ptofchar(f, p0); ! 11: pt1=ptofchar(f, p1); ! 12: selectf(f, pt0, pt1, F_XOR); ! 13: do{ ! 14: q=charofpt(f, mouse.xy); ! 15: if(p1!=q){ ! 16: if(p0==p1) ! 17: selectf(f, pt0, pt1, F_XOR); ! 18: qt=ptofchar(f, q); ! 19: if(p1<q) ! 20: selectf(f, pt1, qt, F_XOR); ! 21: else ! 22: selectf(f, qt, pt1, F_XOR); ! 23: p1=q, pt1=qt; ! 24: if(p0==p1) ! 25: selectf(f, pt0, pt1, F_XOR); ! 26: } ! 27: }while(button1()); ! 28: if(p0<p1) ! 29: f->p0=p0, f->p1=p1; ! 30: else ! 31: f->p0=p1, f->p1=p0; ! 32: } ! 33: /* it is assumed p0<=p1 and both were generated by ptofchar() */ ! 34: selectf(f, p0, p1, c) ! 35: register Frame *f; ! 36: Point p0, p1; ! 37: Code c; ! 38: { ! 39: int n; ! 40: Point q0, q1; ! 41: p0.x--, p1.x--; ! 42: q0=p0, q1=p1; ! 43: q0.y+=f->font->height, q1.y+=f->font->height; ! 44: n=(p1.y-p0.y)/f->font->height; ! 45: if(f->b==0) ! 46: panic("selectf b==0"); ! 47: if(p0.y==f->r.corner.y) ! 48: return; ! 49: if(n==0){ ! 50: if(p0.x==p1.x) ! 51: q1.x++; ! 52: rectf(B, Rpt(p0, q1), c); ! 53: }else{ ! 54: rectf(B, Rect(p0.x, p0.y, f->r.corner.x, q0.y), c); ! 55: if(n>1) ! 56: rectf(B, Rect(f->r.origin.x, q0.y, f->r.corner.x, p1.y), c); ! 57: rectf(B, Rect(f->r.origin.x, p1.y, q1.x, q1.y), c); ! 58: } ! 59: } ! 60: selectp(f, c) ! 61: register Frame *f; ! 62: Code c; ! 63: { ! 64: Point pt0, pt1; ! 65: pt0=ptofchar(f, f->p0); ! 66: pt1=f->p0==f->p1? pt0 : ptofchar(f, f->p1); ! 67: selectf(f, pt0, pt1, c); ! 68: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.