summaryrefslogtreecommitdiffstats
path: root/RichString.c
blob: 38cb76c5f9ab3e16c36f60ade99d8cffcd90ca2a (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

#include "RichString.h"

#ifndef CONFIG_H
#define CONFIG_H
#include "config.h"
#endif

#include <stdlib.h>
#include <string.h>
#include <ctype.h>

#include "debug.h"
#include <assert.h>
#ifdef HAVE_LIBNCURSESW
#include <curses.h>
#else
#include <ncursesw/curses.h>
#endif

#define RICHSTRING_MAXLEN 300

/*{

#define RichString_init(this) (this)->len = 0
#define RichString_initVal(this) (this).len = 0

#ifdef HAVE_LIBNCURSESW
#define RichString_printVal(this, y, x) mvadd_wchstr(y, x, this.chstr)
#define RichString_printoffnVal(this, y, x, off, n) mvadd_wchnstr(y, x, this.chstr + off, n)
#define RichString_getCharVal(this, i) (this.chstr[i].chars[0] & 255)
#else
#define RichString_printVal(this, y, x) mvaddchstr(y, x, this.chstr)
#define RichString_printoffnVal(this, y, x, off, n) mvaddchnstr(y, x, this.chstr + off, n)
#define RichString_getCharVal(this, i) (this.chstr[i])
#endif

typedef struct RichString_ {
   int len;
#ifdef HAVE_LIBNCURSESW
   cchar_t chstr[RICHSTRING_MAXLEN+1];
#else
   chtype chstr[RICHSTRING_MAXLEN+1];
#endif
} RichString;

}*/

#ifndef MIN
#define MIN(a,b) ((a)<(b)?(a):(b))
#endif

#ifdef HAVE_LIBNCURSESW

inline void RichString_appendn(RichString* this, int attrs, char* data_c, int len) {
   wchar_t data[RICHSTRING_MAXLEN];
   len = mbstowcs(data, data_c, RICHSTRING_MAXLEN);
   if (len<0)
      return;
   int last = MIN(RICHSTRING_MAXLEN - 1, len + this->len);
   for (int i = this->len, j = 0; i < last; i++, j++) {
      memset(&this->chstr[i], 0, sizeof(this->chstr[i]));
      this->chstr[i].chars[0] = data[j];
      this->chstr[i].attr = attrs;
   }
   this->chstr[last].chars[0] = 0;
   this->len = last;
}

inline void RichString_setAttrn(RichString *this, int attrs, int start, int finish) {
   cchar_t* ch = this->chstr + start;
   for (int i = start; i <= finish; i++) {
      ch->attr = attrs;
      ch++;
   }
}

int RichString_findChar(RichString *this, char c, int start) {
   wchar_t wc = btowc(c);
   cchar_t* ch = this->chstr + start;
   for (int i = start; i < this->len; i++) {
      if (ch->chars[0] == wc)
         return i;
      ch++;
   }
   return -1;
}

#else

inline void RichString_appendn(RichString* this, int attrs, char* data_c, int len) {
   int last = MIN(RICHSTRING_MAXLEN - 1, len + this->len);
   for (int i = this->len, j = 0; i < last; i++, j++)
      this->chstr[i] = (isprint(data_c[j]) ? data_c[j] : '?') | attrs;

   this->chstr[last] = 0;
   this->len = last;
}

void RichString_setAttrn(RichString *this, int attrs, int start, int finish) {
   chtype* ch = this->chstr + start;
   for (int i = start; i <= finish; i++) {
      *ch = (*ch & 0xff) | attrs;
      ch++;
   }
}

int RichString_findChar(RichString *this, char c, int start) {
   chtype* ch = this->chstr + start;
   for (int i = start; i < this->len; i++) {
      if ((*ch & 0xff) == c)
         return i;
      ch++;
   }
   return -1;
}

#endif

void RichString_prune(RichString* this) {
   this->len = 0;
}

void RichString_setAttr(RichString *this, int attrs) {
   RichString_setAttrn(this, attrs, 0, this->len - 1);
}

inline void RichString_append(RichString* this, int attrs, char* data) {
   RichString_appendn(this, attrs, data, strlen(data));
}

void RichString_write(RichString* this, int attrs, char* data) {
   RichString_init(this);
   RichString_append(this, attrs, data);
}

RichString RichString_quickString(int attrs, char* data) {
   RichString str;
   RichString_initVal(str);
   RichString_write(&str, attrs, data);
   return str;
}

© 2014-2024 Faster IT GmbH | imprint | privacy policy