nlp.h 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465
  1. #ifndef __NLP_H
  2. #define __NLP_H
  3. #include "rcode.h"
  4. #include "strings_bank.h"
  5. namespace nlp {
  6. struct parsed_name {
  7. enum cmd_t {
  8. CHARS,
  9. WHEN_ONE,
  10. WHEN_MANY,
  11. NUMBER,
  12. NUMBER_WHEN_MANY,
  13. RCODE
  14. };
  15. std::vector< std::pair<cmd_t, std::string> > pattern;
  16. parsed_name(const std::string& name) {
  17. enum {
  18. TEXT,
  19. PCT,
  20. ONE,
  21. MANY
  22. } state = TEXT;
  23. for (unsigned char c : name) {
  24. switch (state) {
  25. case TEXT:
  26. if (c == '%') {
  27. state = PCT;
  28. } else {
  29. if (pattern.empty() || pattern.back().first != CHARS) {
  30. pattern.push_back(std::make_pair(CHARS, ""));
  31. }
  32. pattern.back().second += c;
  33. }
  34. break;
  35. case PCT:
  36. if (c == '{') {
  37. state = ONE;
  38. } else if (c == '(') {
  39. state = MANY;
  40. } else if (c == '#') {
  41. state = TEXT;
  42. pattern.push_back(std::make_pair(NUMBER, ""));
  43. } else if (c == '*') {
  44. state = TEXT;
  45. pattern.push_back(std::make_pair(RCODE, ""));
  46. } else {
  47. state = TEXT;
  48. if (pattern.empty() || pattern.back().first != CHARS) {
  49. pattern.push_back(std::make_pair(CHARS, ""));
  50. }
  51. pattern.back().second += c;
  52. }
  53. break;
  54. case ONE:
  55. if (c == '}') {
  56. state = TEXT;
  57. } else {
  58. if (pattern.empty() || pattern.back().first != WHEN_ONE) {
  59. pattern.push_back(std::make_pair(WHEN_ONE, ""));
  60. }
  61. pattern.back().second += c;
  62. }
  63. break;
  64. case MANY:
  65. if (c == ')') {
  66. state = TEXT;
  67. } else if (c == '#') {
  68. pattern.push_back(std::make_pair(NUMBER_WHEN_MANY, ""));
  69. } else {
  70. if (pattern.empty() || pattern.back().first != WHEN_MANY) {
  71. pattern.push_back(std::make_pair(WHEN_MANY, ""));
  72. }
  73. pattern.back().second += c;
  74. }
  75. break;
  76. }
  77. }
  78. }
  79. std::string make(size_t n, bool capitals) {
  80. std::string ret;
  81. for (const auto& i : pattern) {
  82. switch (i.first) {
  83. case CHARS:
  84. ret += i.second;
  85. break;
  86. case NUMBER:
  87. {
  88. char tmp[256];
  89. ::snprintf(tmp, 255, "%zu", n);
  90. ret += tmp;
  91. break;
  92. }
  93. case NUMBER_WHEN_MANY:
  94. if (n > 1) {
  95. char tmp[256];
  96. ::snprintf(tmp, 255, "%zu", n);
  97. ret += tmp;
  98. }
  99. break;
  100. case WHEN_ONE:
  101. if (n == 1) {
  102. ret += i.second;
  103. }
  104. break;
  105. case WHEN_MANY:
  106. if (n > 1) {
  107. ret += i.second;
  108. }
  109. break;
  110. case RCODE:
  111. ret += rcode::magick_encode(n);
  112. break;
  113. }
  114. }
  115. if (capitals && ret.size() > 0) {
  116. ret[0] = ::toupper(ret[0]);
  117. }
  118. return ret;
  119. }
  120. };
  121. struct _buffer {
  122. std::string::const_iterator ti;
  123. std::string::const_iterator te;
  124. std::string& out;
  125. bool is_start;
  126. enum {
  127. TEXT,
  128. PCT,
  129. PERIOD
  130. } state;
  131. _buffer(const std::string& tmpl, std::string& _out) :
  132. ti(tmpl.begin()), te(tmpl.end()), out(_out), is_start(true), state(TEXT)
  133. {}
  134. unsigned char consume() {
  135. while (ti != te) {
  136. unsigned char c = *(ti);
  137. ++ti;
  138. if (c == '%') {
  139. state = PCT;
  140. } else if (c == '.') {
  141. out += c;
  142. state = PERIOD;
  143. } else {
  144. switch (state) {
  145. case TEXT:
  146. out += c;
  147. is_start = false;
  148. break;
  149. case PCT:
  150. state = TEXT;
  151. if (c == '%') {
  152. out += c;
  153. } else {
  154. return c;
  155. }
  156. break;
  157. case PERIOD:
  158. out += c;
  159. if (::isspace(c)) {
  160. is_start = true;
  161. } else {
  162. is_start = false;
  163. }
  164. break;
  165. }
  166. }
  167. }
  168. return '\0';
  169. }
  170. };
  171. struct count {};
  172. void message(_buffer& b) {
  173. b.out.append(b.ti, b.te);
  174. return;
  175. }
  176. template <typename... TAIL>
  177. void message(_buffer& b, const std::string& s, const TAIL&... args) {
  178. unsigned char c = b.consume();
  179. if (c == '\0')
  180. return;
  181. if (c == 's') {
  182. b.out += s;
  183. } else if (c == 'S' && s.size() > 0) {
  184. b.out += ::toupper(s[0]);
  185. b.out += s.substr(1);
  186. }
  187. message(b, args...);
  188. }
  189. template <typename... TAIL>
  190. void message(_buffer& b, unsigned int v, const TAIL&... args) {
  191. unsigned char c = b.consume();
  192. if (c == '\0')
  193. return;
  194. if (c == 'd') {
  195. char tmp[256];
  196. ::snprintf(tmp, 255, "%zu", (size_t)v);
  197. b.out += tmp;
  198. }
  199. message(b, args...);
  200. }
  201. template <typename... TAIL>
  202. void message(_buffer& b, unsigned long long v, const TAIL&... args) {
  203. unsigned char c = b.consume();
  204. if (c == '\0')
  205. return;
  206. if (c == 'd') {
  207. char tmp[256];
  208. ::snprintf(tmp, 255, "%llu", v);
  209. b.out += tmp;
  210. }
  211. message(b, args...);
  212. }
  213. template <typename... TAIL>
  214. void message(_buffer& b, unsigned long v, const TAIL&... args) {
  215. unsigned char c = b.consume();
  216. if (c == '\0')
  217. return;
  218. if (c == 'd') {
  219. char tmp[256];
  220. ::snprintf(tmp, 255, "%lu", v);
  221. b.out += tmp;
  222. }
  223. message(b, args...);
  224. }
  225. template <typename... TAIL>
  226. void message(_buffer& b, long long v, const TAIL&... args) {
  227. unsigned char c = b.consume();
  228. if (c == '\0')
  229. return;
  230. if (c == 'd') {
  231. char tmp[256];
  232. ::snprintf(tmp, 255, "%lld", v);
  233. b.out += tmp;
  234. }
  235. message(b, args...);
  236. }
  237. template <typename... TAIL>
  238. void message(_buffer& b, long v, const TAIL&... args) {
  239. unsigned char c = b.consume();
  240. if (c == '\0')
  241. return;
  242. if (c == 'd') {
  243. char tmp[256];
  244. ::snprintf(tmp, 255, "%ld", v);
  245. b.out += tmp;
  246. }
  247. message(b, args...);
  248. }
  249. template <typename... TAIL>
  250. void message(_buffer& b, int v, const TAIL&... args) {
  251. unsigned char c = b.consume();
  252. if (c == '\0')
  253. return;
  254. if (c == 'd') {
  255. char tmp[256];
  256. ::snprintf(tmp, 255, "%zd", (ssize_t)v);
  257. b.out += tmp;
  258. }
  259. message(b, args...);
  260. }
  261. template <typename... TAIL>
  262. void message(_buffer& b, double v, const TAIL&... args) {
  263. unsigned char c = b.consume();
  264. if (c == '\0')
  265. return;
  266. if (c == 'd') {
  267. char tmp[256];
  268. ::snprintf(tmp, 255, "%g", v);
  269. b.out += tmp;
  270. } else if (c == 'f') {
  271. char tmp[256];
  272. ::snprintf(tmp, 255, "%.2f", v);
  273. b.out += tmp;
  274. }
  275. message(b, args...);
  276. }
  277. template <typename... TAIL>
  278. void message(_buffer& b, float v, const TAIL&... args) {
  279. unsigned char c = b.consume();
  280. if (c == '\0')
  281. return;
  282. if (c == 'd') {
  283. char tmp[256];
  284. ::snprintf(tmp, 255, "%g", v);
  285. b.out += tmp;
  286. } else if (c == 'f') {
  287. char tmp[256];
  288. ::snprintf(tmp, 255, "%.2f", v);
  289. b.out += tmp;
  290. }
  291. message(b, args...);
  292. }
  293. template <typename... TAIL>
  294. void message(_buffer& b, char v, const TAIL&... args) {
  295. unsigned char c = b.consume();
  296. if (c == '\0')
  297. return;
  298. if (c == 'c') {
  299. b.out += v;
  300. }
  301. message(b, args...);
  302. }
  303. template <typename T, typename... TAIL>
  304. void message(_buffer& b, count, const T& val, unsigned int count, const TAIL&... args) {
  305. unsigned char c = b.consume();
  306. if (c == '\0')
  307. return;
  308. if (c == 's' || c == 'S') {
  309. parsed_name pn(val.name);
  310. b.out += pn.make(count, (c == 'S' ? true : b.is_start));
  311. }
  312. message(b, args...);
  313. }
  314. template <typename T, typename... TAIL>
  315. void message(_buffer& b, const T& val, const TAIL&... args) {
  316. unsigned char c = b.consume();
  317. if (c == '\0')
  318. return;
  319. if (c == 's' || c == 'S') {
  320. parsed_name pn(val.name);
  321. b.out += pn.make(1, (c == 'S' ? true : b.is_start));
  322. }
  323. message(b, args...);
  324. }
  325. template <typename... ARGS>
  326. std::string message(const std::string& tmpl, const ARGS&... args) {
  327. std::string ret;
  328. _buffer b(tmpl, ret);
  329. message(b, args...);
  330. return ret;
  331. }
  332. }
  333. #endif