diff --git a/.cache/.kdev4/study_cpp.kdev4 b/.cache/.kdev4/study_cpp.kdev4 deleted file mode 100644 index 58de3f2..0000000 --- a/.cache/.kdev4/study_cpp.kdev4 +++ /dev/null @@ -1,19 +0,0 @@ -[Buildset] -BuildItems=@Variant(\x00\x00\x00\t\x00\x00\x00\x00\x01\x00\x00\x00\x0b\x00\x00\x00\x00\x01\x00\x00\x00\x12\x00s\x00t\x00u\x00d\x00y\x00_\x00c\x00p\x00p) - -[CMake] -Build Directory Count=1 -Current Build Directory Index-主机系统=0 - -[CMake][CMake Build Directory 0] -Build Directory Path=/home/hmtsai/projects/study_cpp/build -Build Type=Debug -CMake Binary=/usr/bin/cmake -CMake Executable=/usr/bin/cmake -Environment Profile= -Extra Arguments= -Install Directory= -Runtime=主机系统 - -[Project] -VersionControlSupport=kdevgit diff --git a/src/algorithm/beizeng/mi.cpp b/src/algorithm/beizeng/mi.cpp new file mode 100644 index 0000000..dad65b3 --- /dev/null +++ b/src/algorithm/beizeng/mi.cpp @@ -0,0 +1,23 @@ +#include "iostream" + +typedef long long int ll; + +ll ksm(int a, int n) { + ll base = a; + ll res = 1; + while (n > 0) { + if ((n & 1) == 1) { + res *= base; + } + base *= base; + n >>= 1; + } + return res; +} + +int main() { + int a, n; + std::cin >> a >> n; + printf("%lld\n", ksm(a, n)); + return 0; +} diff --git a/src/algorithm/digui/ksm.cpp b/src/algorithm/digui/ksm.cpp new file mode 100644 index 0000000..871fb38 --- /dev/null +++ b/src/algorithm/digui/ksm.cpp @@ -0,0 +1,24 @@ +#include "iostream" + +long long int ksm(int a, int n) { + long long int ans = 1; + if (a == 1) { + return 1; + } + if (n == 1) { + return a; + } + ans = ksm(a, n / 2); + ans *= ans; + if (n % 2 == 1) { + ans *= a; + } + return ans; +} + +int main() { + int a, n; + std::cin >> a >> n; + printf("%lld\n", ksm(a, n)); + return 0; +} diff --git a/src/algorithm/enum/rect.cpp b/src/algorithm/enum/rect.cpp new file mode 100644 index 0000000..e89d245 --- /dev/null +++ b/src/algorithm/enum/rect.cpp @@ -0,0 +1,12 @@ +#include + +int main() { + int n, count = 0; + std::cin >> n; + for (int i = 1; i * i <= n; i++) { + if (n % i == 0) { + count++; + } + } + std::cout << count; +} diff --git a/src/algorithm/fenzhi/findLastXiaoyvDengyvNumber b/src/algorithm/fenzhi/findLastXiaoyvDengyvNumber deleted file mode 100755 index e30fc2f..0000000 Binary files a/src/algorithm/fenzhi/findLastXiaoyvDengyvNumber and /dev/null differ diff --git a/src/algorithm/fenzhi/functionZeroPoint.cpp b/src/algorithm/fenzhi/functionZeroPoint.cpp new file mode 100644 index 0000000..e625fb8 --- /dev/null +++ b/src/algorithm/fenzhi/functionZeroPoint.cpp @@ -0,0 +1,29 @@ +#include +#include +auto f = [](double x) { + return std::pow(x, 5) - (15 * std::pow(x, 4)) + (85 * std::pow(x, 3)) + + (225 * std::pow(x, 2)) + (274 * x) - 121; +}; + +double compute(double l, double r) { + if (!(l < r - 0.000000001)) { + return 0; + } + double mid = (l + r) / 2; + if (f(mid) > 0) { + compute(mid, r); + } + if (f(mid) < 0) { + compute(l, mid); + } + if (f(l) == 0) { + return l; + } else { + return r; + } +} + +int main() { + printf("%.6lf", compute(1.5, 2.4)); + return 0; +} diff --git a/src/algorithm/fenzhi/mergeSortPlus.cpp b/src/algorithm/fenzhi/mergeSortPlus.cpp new file mode 100644 index 0000000..83d8b88 --- /dev/null +++ b/src/algorithm/fenzhi/mergeSortPlus.cpp @@ -0,0 +1,53 @@ +#include + +void merge(long long s, long long t, long long *a, long long *r, + long long &ans) { + long long mid, i, j, k; + if (s == t) { + return; + } + mid = (s + t) / 2; + merge(s, mid, &a, &r, ans); + merge(mid + 1, t, &a, &r, ans); + i = s; + j = mid + 1; + k = s; + while (i <= mid && j <= t) { + if (a[j] < a[i]) { + ans += j - k; + r[k] += a[j]; + k++; + j++; + } else { + r[k] = a[i]; + k++; + i++; + } + } + while (i <= mid) { + r[k] = a[i]; + k++; + i++; + } + while (j <= t) { + r[k] = a[j]; + j++; + k++; + } + for (i = s; i <= t; i++) { + a[i] = r[i]; + } +} + +int main(int argc, char *argv[]) { + long long *a = new long long[999999]; + long long *r = new long long[999999]; + long long n, i, ans; + std::cin >> n; + for (i = 1; i <= n; i++) { + std::cin >> a[i]; + } + merge(1, n, a, r, ans); + std::cout << ans; + return 0; +} diff --git a/src/algorithm/fenzhi/mianxiangjieguobiancheng b/src/algorithm/fenzhi/mianxiangjieguobiancheng deleted file mode 100755 index 64b3923..0000000 Binary files a/src/algorithm/fenzhi/mianxiangjieguobiancheng and /dev/null differ diff --git a/src/algorithm/fenzhi/mod.cpp b/src/algorithm/fenzhi/mod.cpp index d4c94fb..47f06bf 100644 --- a/src/algorithm/fenzhi/mod.cpp +++ b/src/algorithm/fenzhi/mod.cpp @@ -1,9 +1,6 @@ #include int f(int p, int k, int b) { - if (p == 0) { - return 1; - } int tmp = f(p / 2, k, b) % k; tmp = (tmp * tmp) % k; if (p % 2 == 1) { diff --git a/src/algorithm/fenzhi/qiegeshengzi.cpp b/src/algorithm/fenzhi/qiegeshengzi.cpp new file mode 100644 index 0000000..79637b6 --- /dev/null +++ b/src/algorithm/fenzhi/qiegeshengzi.cpp @@ -0,0 +1,36 @@ +#include + +int n, m, i, lbound, ubound, mid, count; +int len[100]; + +int main() { + std::cin >> n; + int 计数器 = 0; + for (i = 0; i < n; i++) { + std::cin >> len[i]; + count += len[i]; // B + } + + if (count < m) { // B + std::cout << "Failed" << std::endl; + return 0; + } + + lbound = 1; + ubound = 1000000; + while (lbound < ubound) { // C + mid = (lbound + ubound + 1) / 2; // A + count = 0; + for (i = 0; i < n; i++) { + count += len[i] / mid; // A + } + if (count < m) { + ubound = mid - 1; + } else { + lbound = mid; + } + } + + std::cout << lbound << std::endl; + return 0; +} diff --git a/src/algorithm/fenzhi/shuchuKdadeshu b/src/algorithm/fenzhi/shuchuKdadeshu deleted file mode 100755 index 30502c0..0000000 Binary files a/src/algorithm/fenzhi/shuchuKdadeshu and /dev/null differ diff --git a/src/algorithm/findNumber b/src/algorithm/findNumber deleted file mode 100755 index 1bdbdfd..0000000 Binary files a/src/algorithm/findNumber and /dev/null differ diff --git a/src/algorithm/meiyuetianshu.cpp b/src/algorithm/meiyuetianshu.cpp new file mode 100644 index 0000000..ddea92a --- /dev/null +++ b/src/algorithm/meiyuetianshu.cpp @@ -0,0 +1,14 @@ +#include + +int main() { + int year, month, + month_days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; + std::cin >> year >> month; + if (((year % 4 == 0) && (year % 100 != 0) || (year % 400 == 0)) && + month == 2) { + std::cout << "29" << std::endl; + } else { + std::cout << month_days[month - 1] << std::endl; + } + return 0; +} diff --git a/src/computeTime.cpp b/src/computeTime.cpp new file mode 100644 index 0000000..54c2eeb --- /dev/null +++ b/src/computeTime.cpp @@ -0,0 +1,16 @@ +#include + +int main() { + struct { + short hour, minute; + } begin, end; + + std::cin >> begin.hour >> begin.minute; + std::cin >> end.hour >> end.minute; + + std::cout << (end.hour < begin.hour ? (24 + (begin.hour - end.hour)) * 60 + : (end.hour - begin.hour) * 60) + + (end.minute - begin.minute) + << std::endl; + return 0; +} diff --git a/src/huanfang.cpp b/src/huanfang.cpp new file mode 100644 index 0000000..7238def --- /dev/null +++ b/src/huanfang.cpp @@ -0,0 +1,36 @@ +#include +#include + +int main() { + int N; + std::cin >> N; + int listn[N][N]; + memset(listn, 0, sizeof(listn)); + listn[0][N / 2] = 1; + struct { + int x, y; + } pos; + pos.x = N / 2; + pos.y = 0; + for (int i = 2; i <= N * N; i++) { + if ((pos.x == N - 1 && pos.y == 0) || (!(pos.y-1 < 0 || pos.x+1>=N-1) && listn[pos.y - 1][pos.x + 1] != 0)) { + pos.y++; + } else if (pos.x + 1 == N) { + pos.x = 0; + pos.y--; + } else if (pos.y - 1 > 0) { + pos.x++; + pos.y = N - 1; + } else { + pos.x++; + pos.y--; + } + listn[pos.y][pos.x] = i; + } + for (int i = 0; i < N; i++) { + for (int j = 0; j < N; j++) { + std::cout << listn[i][j] << " "; + } + std::cout << std::endl; + } +} diff --git a/src/hunfang.cpp b/src/hunfang.cpp new file mode 100644 index 0000000..fcb6049 --- /dev/null +++ b/src/hunfang.cpp @@ -0,0 +1 @@ +#include "hunfang.h" diff --git a/src/imageZip.cpp b/src/imageZip.cpp new file mode 100644 index 0000000..f794519 --- /dev/null +++ b/src/imageZip.cpp @@ -0,0 +1,115 @@ +#include +#include +#include +#include +#include +#include +#include + +std::map tongji; +std::map iMap; +std::map hMap = {{'0', 0}, {'1', 1}, {'2', 2}, {'3', 3}, + {'4', 4}, {'5', 5}, {'6', 6}, {'7', 7}, + {'8', 8}, {'9', 9}, {'A', 10}, {'B', 11}, + {'C', 12}, {'D', 13}, {'E', 14}, {'F', 15}}; +char dMap[] = {'0', '1', '2', '3', '4', '5', '6', '7', + '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'}; + +int change(std::string s) { + int result = 0; + int count = 1; + for (auto i : s) { + if (hMap[i] != 0) { + result += hMap[i] * count; + count++; + } else { + throw std::runtime_error("Unknow Hex Number"); + } + } + return result; +} + +std::string changeDec(int in) { + std::stack tmp; + while (in != 0) { + tmp.push(dMap[in % 16]); + in /= 16; + } + std::string result = ""; + { + int count = tmp.size(); + while (!tmp.empty()) { + result += tmp.top() * (count * 10); + tmp.pop(); + count--; + } + } + return result; +} + +int zip(int in) { + int minValue = INT_MAX; + for (auto i : iMap) { + int tmp = abs(abs(in) - abs(i.second)); + if (tmp == 0) { + return i.second; + } else if (tmp < minValue) { + minValue = i.second; + } + } + return minValue; +} + +int main() { + int N; + std::cin >> N; + + std::vector image; + + for (int i = 0; i < N; i++) { + std::string tmp; + std::cin >> tmp; + for (int j = 0; j < tmp.size() / 2; j++) { + std::string tmp2; + for (int k = 0; k < 2; k++) { + tmp2.push_back(tmp[j * 2 + k]); + } + if (tongji[change(tmp2)] == 0) { + tongji[change(tmp2)] = 1; + } else { + tongji[change(tmp2)]++; + } + image.push_back(change(tmp2)); + } + } + { + std::vector> v(tongji.begin(), tongji.end()); + std::sort(v.begin(), v.end(), + [](std::pair a, std::pair b) { + return a.second > b.second; + }); + auto Itm = tongji.begin(); + for (auto Item : v) { + Itm->first = Item.first; + } + } + { + int i = 0; + for (std::pair element : tongji) { + if (i == 16) { + break; + } + iMap.insert(element); + i++; + } + } + + for (int i = 0; i < N; i++) { + for (int j = 0; i < image.size() / N; j++) { + std::cout << changeDec(zip(image[j + (i * 10)])); + } + std::cout << std::endl; + } + + return 0; +} diff --git a/src/jueduisushu.cpp b/src/jueduisushu.cpp new file mode 100644 index 0000000..67c01c9 --- /dev/null +++ b/src/jueduisushu.cpp @@ -0,0 +1,27 @@ +#include + +bool check(int in){ + bool result = true; + for(int i=2;i> a >> b; + for(int i=a;i<=b;i++){ + if(check(i) && check(exchange(i))){ + std::cout << i << std::endl; + } + } + return 0; +} diff --git a/src/leijixiangjia.cpp b/src/leijixiangjia.cpp new file mode 100644 index 0000000..beadbef --- /dev/null +++ b/src/leijixiangjia.cpp @@ -0,0 +1,12 @@ +#include + +int main() { + int N; + std::cin >> N; + int last = 0, sum = 0; + for (int i = 1; i <= N; i++) { + last = last + i; + sum += last; + } + std::cout << sum; +} diff --git a/src/luckyNumber.cpp b/src/luckyNumber.cpp index 5cd37a3..bac239b 100644 --- a/src/luckyNumber.cpp +++ b/src/luckyNumber.cpp @@ -1,37 +1,51 @@ #include -#include + +int length(int in) { + int count = 0; + while (in != 0) { + count++; + in /= 10; + } + return count; +} + +int bitSum(int in) { + int sum = 0; + while (in != 0) { + sum += in % 10; + in /= 10; + } + return sum; +} +bool check(int &in) { + int len = length(in); + int bits[len]; + int sum = 0, wei = in % 10; + for (int i = 1; i <= len; i++) { + bits[i - 1] = wei; + if (i % 2 != 0) { + wei = wei * 7; + if (wei > 9) { + while (wei > 9) { + wei = bitSum(wei); + } + } + } else { + wei = in % 10; + in /= 10; + } + } + int result = 0; + for(int i=0;i> n; - std::string slistn[n]; - for (int i = 0; i < n; i++) { - std::getline(std::cin, slistn[i]); - for (int j = 0; j < slistn[i].size(); j++) { - slistn[i][j] = slistn[i][j] - '0'; - } - } - for (int i = 0; i < n; i++) { - for (int j = 0; j < n; j++) { - slistn[i][j] *= 7; - } - } - for (int i = 0; i < n; i++) { - for (int j = 0; j < n; j += 2) { - while (slistn[i][j] > 9) { - slistn[i][j] = (slistn[i][j] / 10) + (slistn[i][j] % 10); - } - } - } - int sum[n]; - for (int i = 0; i < n; i++) { - for (int j : slistn[i]) { - sum[i] += j; - } - if (sum[i] % 8 == 0) { - std::cout << "T" << std::endl; - } - std::cout << "F" << std::endl; - } - return 0; -} \ No newline at end of file + int n; + std::cin >> n; + std::string s(check(n)?"T\n":"F\n"); + std::cout << s; + return 0 ; +} diff --git a/src/type/linkList/.josphe.cpp.~undo-tree~ b/src/type/linkList/.josphe.cpp.~undo-tree~ new file mode 100644 index 0000000..36528d3 --- /dev/null +++ b/src/type/linkList/.josphe.cpp.~undo-tree~ @@ -0,0 +1,300 @@ +(undo-tree-save-format-version . 1) +"947c8096f79e1c4282729fab9d1bb097ddac5c8d" +[nil nil nil nil (26043 27981 54868 704000) 0 nil] +([nil nil ((1 . 2) (t 26043 27405 802562 663000)) nil (26043 27981 54867 966000) 0 nil]) +([nil nil ((2 . 10)) nil (26043 27981 54867 268000) 0 nil]) +([nil nil ((10 . 12)) nil (26043 27981 54866 822000) 0 nil]) +([nil nil ((#("<" 0 1 (face font-lock-string-face fontified t)) . -11) (undo-tree-id605 . -1) (undo-tree-id606 . -1) (undo-tree-id607 . -1) (undo-tree-id608 . -1) 12) nil (26043 27981 54866 93000) 0 nil]) +([nil nil ((11 . 15)) nil (26043 27981 54864 61000) 0 nil]) +([nil nil ((#("6" 0 1 (face font-lock-string-face fontified t)) . -14) (undo-tree-id603 . -1) (undo-tree-id604 . -1) 15) nil (26043 27981 54863 330000) 0 nil]) +([nil nil ((14 . 19)) nil (26043 27981 54861 961000) 0 nil]) +([nil nil ((19 . 20)) nil (26043 27981 54861 347000) 0 nil]) +([nil nil ((21 . 21) (21 . 22) (20 . 20) (20 . 21)) nil (26043 27981 54860 429000) 0 nil]) +([nil nil ((22 . 29)) nil (26043 27981 54859 585000) 0 nil]) +([nil nil ((#("s" 0 1 (c-is-sws t fontified t)) . -22) (undo-tree-id588 . -1) (undo-tree-id589 . -1) (undo-tree-id590 . -1) (#("t" 0 1 (fontified t)) . -23) (undo-tree-id591 . -1) (undo-tree-id592 . -1) (undo-tree-id593 . -1) (#("r" 0 1 (fontified t)) . -24) (undo-tree-id594 . -1) (undo-tree-id595 . -1) (undo-tree-id596 . -1) (#("y" 0 1 (fontified t)) . -25) (undo-tree-id597 . -1) (undo-tree-id598 . -1) (undo-tree-id599 . -1) (#("u" 0 1 (fontified t)) . -26) (undo-tree-id600 . -1) (#("c" 0 1 (fontified t)) . -27) (undo-tree-id601 . -1) (#("t" 0 1 (fontified t)) . -28) (undo-tree-id602 . -1) 29) nil (26043 27981 54858 240000) 0 nil]) +([nil nil ((22 . 36)) nil (26043 27981 54850 545000) 0 nil]) +([nil nil ((36 . 38)) nil (26043 27981 54849 937000) 0 nil]) +([nil nil ((38 . 40) (37 . 39)) nil (26043 27981 54849 449000) 0 nil]) +([nil nil ((42 . 43)) nil (26043 27981 54848 833000) 0 nil]) +([nil nil ((#(" + " 0 3 (fontified t)) . 37) (undo-tree-id587 . -3) 40) nil (26043 27981 54848 215000) 0 nil]) +([nil nil ((37 . 40)) nil (26043 27981 54847 226000) 0 nil]) +([nil nil ((40 . 47)) nil (26043 27981 54846 734000) 0 nil]) +([nil nil ((#(" " 0 2 (fontified nil)) . 38) (47 . 48)) nil (26043 27981 54846 179000) 0 nil]) +([nil nil ((46 . 49)) nil (26043 27981 54845 576000) 0 nil]) +([nil nil ((49 . 52)) nil (26043 27981 54844 595000) 0 nil]) +([nil nil ((21 . 39) (apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 79 96 nil nil nil t nil)) nil 24 nil #s(yas--field 1 79 96 nil nil nil t nil) nil nil)) (49 . 73) (#("std::vector<${1:typename Tp}>" 0 29 (fontified nil)) . 49) (49 . 78) (#("vec" 0 3 (fontified nil)) . 49) (49 . 52) (#("std::vector" 0 11 (fontified nil) 11 12 (fontified nil c-<>-c-types-set t category c-<-as-paren-syntax) 12 23 (fontified nil) 23 24 (fontified nil c-type c-<>-arg-sep) 24 39 (fontified nil) 39 40 (fontified nil category c->-as-paren-syntax)) . -49) (49 . 89) (#("vec" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t)) . -49) (undo-tree-id584 . -3) (undo-tree-id585 . -3) (undo-tree-id586 . -3) 52) nil (26043 27981 54843 422000) 0 nil]) +([nil nil ((80 . 83) (#("typename Tp" 0 8 (face font-lock-keyword-face fontified nil) 8 9 (fontified nil) 9 11 (face font-lock-type-face fontified nil)) . 80) (79 . 80)) nil (26043 27981 54840 490000) 0 nil]) +([nil nil ((#("u" 0 1 (fontified t)) . -82) (undo-tree-id581 . -1) (undo-tree-id582 . -1) (undo-tree-id583 . -1) 83) nil (26043 27981 54839 754000) 0 nil]) +([nil nil ((82 . 86)) nil (26043 27981 54838 138000) 0 nil]) +([nil nil ((86 . 88)) nil (26043 27981 54837 724000) 0 nil]) +([nil nil ((88 . 92) (87 . 91)) nil (26043 27981 54837 256000) 0 nil]) +([nil nil ((apply yas--snippet-revive 67 97 #s(yas--snippet nil (#s(yas--field 1 79 96 nil nil nil t nil)) nil 24 nil #s(yas--field 1 79 96 nil nil nil t nil) nil nil))) nil (26043 27981 54836 714000) 0 nil]) +([nil nil ((97 . 98)) nil (26043 27981 54836 272000) 0 nil]) +([nil nil ((96 . 98)) nil (26043 27981 54835 653000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -95) (undo-tree-id574 . -1) (undo-tree-id575 . -1) (undo-tree-id576 . -1) (#("l" 0 1 (fontified t)) . -96) (undo-tree-id577 . -1) (undo-tree-id578 . -1) (undo-tree-id579 . -1) (#("s" 0 1 (fontified t)) . -97) (undo-tree-id580 . -1) 98) nil (26043 27981 54834 638000) 0 nil]) +([nil nil ((#(" + + " 0 6 (fontified t) 6 8 (fontified t)) . 87) (undo-tree-id571 . -8) (undo-tree-id572 . -8) (undo-tree-id573 . -8) 95) nil (26043 27981 54830 779000) 0 nil]) +([nil nil ((#("{" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -86) (undo-tree-id568 . -1) (undo-tree-id569 . -1) (undo-tree-id570 . -1) 87) nil (26043 27981 54828 948000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 85) (undo-tree-id565 . -1) (undo-tree-id566 . -1) (undo-tree-id567 . -1) 86) nil (26043 27981 54826 822000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -79) (undo-tree-id547 . -1) (undo-tree-id548 . -1) (undo-tree-id549 . -1) (#("t" 0 1 (fontified t)) . -80) (undo-tree-id550 . -1) (undo-tree-id551 . -1) (undo-tree-id552 . -1) (#("r" 0 1 (fontified t)) . -81) (undo-tree-id553 . -1) (undo-tree-id554 . -1) (undo-tree-id555 . -1) (#("u" 0 1 (fontified t)) . -82) (undo-tree-id556 . -1) (undo-tree-id557 . -1) (undo-tree-id558 . -1) (#("c" 0 1 (fontified t)) . -83) (undo-tree-id559 . -1) (undo-tree-id560 . -1) (undo-tree-id561 . -1) (#("t" 0 1 (face font-lock-keyword-face fontified t)) . -84) (undo-tree-id562 . -1) (undo-tree-id563 . -1) (undo-tree-id564 . -1) 85) nil (26043 27981 54824 26000) 0 nil]) +([nil nil ((64 . 67)) nil (26043 27981 54814 942000) 0 nil]) +([nil nil ((67 . 78)) nil (26043 27981 54814 488000) 0 nil]) +([nil nil ((78 . 80)) nil (26043 27981 54813 988000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -83) (undo-tree-id533 . -1) (#("t" 0 1 (fontified t)) . -84) (undo-tree-id534 . -1) (#("d" 0 1 (fontified t)) . -85) (undo-tree-id535 . -1) (#(":" 0 1 (c-type c-decl-end fontified t)) . -86) (undo-tree-id536 . -1) (#(":" 0 1 (fontified t)) . -87) (undo-tree-id537 . -1) (#("v" 0 1 (fontified t)) . -88) (undo-tree-id538 . -1) (#("e" 0 1 (fontified t)) . -89) (undo-tree-id539 . -1) (#("c" 0 1 (fontified t)) . -90) (undo-tree-id540 . -1) (#("t" 0 1 (fontified t)) . -91) (undo-tree-id541 . -1) (#("o" 0 1 (fontified t)) . -92) (undo-tree-id542 . -1) (#("r" 0 1 (fontified t)) . -93) (undo-tree-id543 . -1) (#("<" 0 1 (fontified t)) . -94) (undo-tree-id544 . -1) (#(">" 0 1 (face (rainbow-delimiters-depth-2-face) c-type c-decl-id-start fontified t)) . -95) (undo-tree-id545 . -1) (#(";" 0 1 (fontified t)) . -96) (undo-tree-id546 . -1) 97) nil (26043 27981 54811 783000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 80) (undo-tree-id532 . -3) 83) nil (26043 27981 54803 655000) 0 nil]) +([nil nil ((#("n" 0 1 (face font-lock-type-face fontified t)) . -74) (undo-tree-id518 . -1) (undo-tree-id519 . -1) (undo-tree-id520 . -1) (#("o" 0 1 (face font-lock-type-face fontified t)) . -75) (undo-tree-id521 . -1) (undo-tree-id522 . -1) (undo-tree-id523 . -1) (#("d" 0 1 (face font-lock-type-face fontified t)) . -76) (undo-tree-id524 . -1) (undo-tree-id525 . -1) (undo-tree-id526 . -1) (#("e" 0 1 (face font-lock-type-face fontified t)) . -77) (undo-tree-id527 . -1) (undo-tree-id528 . -1) (undo-tree-id529 . -1) (#("{" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -78) (undo-tree-id530 . -1) (#("}" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -79) (undo-tree-id531 . -1) 80) nil (26043 27981 54801 892000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 73) (undo-tree-id515 . -1) (undo-tree-id516 . -1) (undo-tree-id517 . -1) 74) nil (26043 27981 54795 179000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -67) (undo-tree-id497 . -1) (undo-tree-id498 . -1) (undo-tree-id499 . -1) (#("t" 0 1 (fontified t)) . -68) (undo-tree-id500 . -1) (undo-tree-id501 . -1) (undo-tree-id502 . -1) (#("r" 0 1 (fontified t)) . -69) (undo-tree-id503 . -1) (undo-tree-id504 . -1) (undo-tree-id505 . -1) (#("u" 0 1 (fontified t)) . -70) (undo-tree-id506 . -1) (undo-tree-id507 . -1) (undo-tree-id508 . -1) (#("c" 0 1 (fontified t)) . -71) (undo-tree-id509 . -1) (undo-tree-id510 . -1) (undo-tree-id511 . -1) (#("t" 0 1 (c-type c-decl-type-start face font-lock-keyword-face fontified t)) . -72) (undo-tree-id512 . -1) (undo-tree-id513 . -1) (undo-tree-id514 . -1) 73) nil (26043 27981 54791 765000) 0 nil]) +([nil nil ((39 . 39) (39 . 40)) nil (26043 27981 54783 718000) 0 nil]) +([nil nil ((40 . 51)) nil (26043 27981 54783 235000) 0 nil]) +([nil nil ((51 . 52)) nil (26043 27981 54782 901000) 0 nil]) +([nil nil ((52 . 54)) nil (26043 27981 54782 542000) 0 nil]) +([nil nil ((54 . 56) (53 . 55)) nil (26043 27981 54782 134000) 0 nil]) +([nil nil ((56 . 59)) nil (26043 27981 54781 663000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -56) (undo-tree-id488 . -1) (undo-tree-id489 . -1) (undo-tree-id490 . -1) (#("n" 0 1 (fontified t)) . -57) (undo-tree-id491 . -1) (undo-tree-id492 . -1) (undo-tree-id493 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -58) (undo-tree-id494 . -1) (undo-tree-id495 . -1) (undo-tree-id496 . -1) 59) nil (26043 27981 54780 721000) 0 nil]) +([nil nil ((56 . 60)) nil (26043 27981 54774 210000) 0 nil]) +([nil nil ((60 . 61)) nil (26043 27981 54773 812000) 0 nil]) +([nil nil ((61 . 62)) nil (26043 27981 54773 468000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -61) (undo-tree-id487 . -1) 62) nil (26043 27981 54773 33000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 60) (undo-tree-id486 . -1) 61) nil (26043 27981 54765 802000) 0 nil]) +([nil nil ((60 . 61)) nil (26043 27981 54764 957000) 0 nil]) +([nil nil ((61 . 65)) nil (26043 27981 54764 394000) 0 nil]) +([nil nil ((60 . 61)) nil (26043 27981 54764 47000) 0 nil]) +([nil nil ((66 . 67)) nil (26043 27981 54763 718000) 0 nil]) +([nil nil ((67 . 70)) nil (26043 27981 54763 227000) 0 nil]) +([nil nil ((70 . 76)) nil (26043 27981 54762 843000) 0 nil]) +([nil nil ((76 . 79)) nil (26043 27981 54762 489000) 0 nil]) +([nil nil ((#("v" 0 1 (face font-lock-variable-name-face fontified t)) . -74) (undo-tree-id475 . -1) (undo-tree-id476 . -1) (undo-tree-id477 . -1) (#("a" 0 1 (face font-lock-variable-name-face fontified t)) . -75) (undo-tree-id478 . -1) (undo-tree-id479 . -1) (undo-tree-id480 . -1) (#("l" 0 1 (face font-lock-variable-name-face fontified t)) . -76) (undo-tree-id481 . -1) (undo-tree-id482 . -1) (undo-tree-id483 . -1) (#("u" 0 1 (face font-lock-variable-name-face fontified t)) . -77) (undo-tree-id484 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -78) (undo-tree-id485 . -1) 79) nil (26043 27981 54761 112000) 0 nil]) +([nil nil ((74 . 76)) nil (26043 27981 54755 986000) 0 nil]) +([nil nil ((76 . 77)) nil (26043 27981 54755 670000) 0 nil]) +([nil nil ((77 . 80)) nil (26043 27981 54755 352000) 0 nil]) +([nil nil ((80 . 85)) nil (26043 27981 54754 880000) 0 nil]) +([nil nil ((85 . 86)) nil (26043 27981 54754 560000) 0 nil]) +([nil nil ((86 . 90)) nil (26043 27981 54754 156000) 0 nil]) +([nil nil ((90 . 91)) nil (26043 27981 54753 683000) 0 nil]) +([nil nil ((93 . 94)) nil (26043 27981 54753 180000) 0 nil]) +([nil nil ((122 . 127)) nil (26043 27981 54752 781000) 0 nil]) +([nil nil ((127 . 128)) nil (26043 27981 54752 330000) 0 nil]) +([nil nil ((128 . 132)) nil (26043 27981 54752 4000) 0 nil]) +([nil nil ((132 . 133)) nil (26043 27981 54751 604000) 0 nil]) +([nil nil ((#("l" 0 1 (face font-lock-variable-name-face fontified t)) . -128) (undo-tree-id469 . -1) (undo-tree-id470 . -1) (undo-tree-id471 . -1) (#("i" 0 1 (face font-lock-variable-name-face fontified t)) . -129) (undo-tree-id472 . -1) (#("s" 0 1 (face font-lock-variable-name-face fontified t)) . -130) (undo-tree-id473 . -1) (#("t" 0 1 (face font-lock-variable-name-face fontified t)) . -131) (undo-tree-id474 . -1) 132) nil (26043 27981 54750 642000) 0 nil]) +([nil nil ((128 . 132)) nil (26043 27981 54746 345000) 0 nil]) +([nil nil ((133 . 136)) nil (26043 27981 54745 844000) 0 nil]) +([nil nil ((136 . 141)) nil (26043 27981 54745 419000) 0 nil]) +([nil nil ((141 . 142)) nil (26043 27981 54745 9000) 0 nil]) +([nil nil ((142 . 143)) nil (26043 27981 54744 572000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-variable-name-face fontified t)) . -142) (undo-tree-id466 . -1) (undo-tree-id467 . -1) (undo-tree-id468 . -1) 143) nil (26043 27981 54743 921000) 0 nil]) +([nil nil ((142 . 146)) nil (26043 27981 54742 223000) 0 nil]) +([nil nil ((146 . 147)) nil (26043 27981 54741 776000) 0 nil]) +([nil nil ((147 . 150)) nil (26043 27981 54741 403000) 0 nil]) +([nil nil ((150 . 156)) nil (26043 27981 54741 52000) 0 nil]) +([nil nil ((#("8" 0 1 (fontified t)) . -155) (undo-tree-id463 . -1) (undo-tree-id464 . -1) (undo-tree-id465 . -1) 156) nil (26043 27981 54740 488000) 0 nil]) +([nil nil ((155 . 156)) nil (26043 27981 54738 867000) 0 nil]) +([nil nil ((156 . 160)) nil (26043 27981 54738 438000) 0 nil]) +([nil nil ((160 . 161)) nil (26043 27981 54737 949000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t)) . -162) (undo-tree-id461 . -1) (#(";" 0 1 (fontified t)) . -163) (undo-tree-id462 . -1) 164) nil (26043 27981 54737 152000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 161) (undo-tree-id460 . -1) 162) nil (26043 27981 54735 197000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -155) (undo-tree-id450 . -1) (undo-tree-id451 . -1) (undo-tree-id452 . -1) (#("t" 0 1 (face font-lock-variable-name-face fontified t)) . -156) (undo-tree-id453 . -1) (undo-tree-id454 . -1) (undo-tree-id455 . -1) (#("a" 0 1 (face font-lock-variable-name-face fontified t)) . -157) (undo-tree-id456 . -1) (#("i" 0 1 (face font-lock-variable-name-face fontified t)) . -158) (undo-tree-id457 . -1) (#("l" 0 1 (face font-lock-variable-name-face fontified t)) . -159) (undo-tree-id458 . -1) (#(";" 0 1 (fontified t)) . -160) (undo-tree-id459 . -1) 161) nil (26043 27981 54733 232000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 154) (undo-tree-id447 . -1) (undo-tree-id448 . -1) (undo-tree-id449 . -1) 155) nil (26043 27981 54726 578000) 0 nil]) +([nil nil ((#("n" 0 1 (fontified t)) . -150) (undo-tree-id435 . -1) (undo-tree-id436 . -1) (undo-tree-id437 . -1) (#("o" 0 1 (fontified t)) . -151) (undo-tree-id438 . -1) (undo-tree-id439 . -1) (undo-tree-id440 . -1) (#("d" 0 1 (fontified t)) . -152) (undo-tree-id441 . -1) (undo-tree-id442 . -1) (undo-tree-id443 . -1) (#("e" 0 1 (fontified t)) . -153) (undo-tree-id444 . -1) (undo-tree-id445 . -1) (undo-tree-id446 . -1) 154) nil (26043 27981 54723 892000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 147) (undo-tree-id432 . -3) (undo-tree-id433 . -3) (undo-tree-id434 . -3) 150) nil (26043 27981 54718 177000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -141) (undo-tree-id414 . -1) (undo-tree-id415 . -1) (undo-tree-id416 . -1) (#("h" 0 1 (face font-lock-variable-name-face fontified t)) . -142) (undo-tree-id417 . -1) (undo-tree-id418 . -1) (undo-tree-id419 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -143) (undo-tree-id420 . -1) (undo-tree-id421 . -1) (undo-tree-id422 . -1) (#("a" 0 1 (face font-lock-variable-name-face fontified t)) . -144) (undo-tree-id423 . -1) (undo-tree-id424 . -1) (undo-tree-id425 . -1) (#("d" 0 1 (face font-lock-variable-name-face fontified t)) . -145) (undo-tree-id426 . -1) (undo-tree-id427 . -1) (undo-tree-id428 . -1) (#(";" 0 1 (fontified t)) . -146) (undo-tree-id429 . -1) (undo-tree-id430 . -1) (undo-tree-id431 . -1) 147) nil (26043 27981 54714 619000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 140) (undo-tree-id411 . -1) (undo-tree-id412 . -1) (undo-tree-id413 . -1) 141) nil (26043 27981 54706 677000) 0 nil]) +([nil nil ((#("n" 0 1 (fontified t)) . -136) (undo-tree-id399 . -1) (undo-tree-id400 . -1) (undo-tree-id401 . -1) (#("o" 0 1 (fontified t)) . -137) (undo-tree-id402 . -1) (undo-tree-id403 . -1) (undo-tree-id404 . -1) (#("d" 0 1 (fontified t)) . -138) (undo-tree-id405 . -1) (undo-tree-id406 . -1) (undo-tree-id407 . -1) (#("e" 0 1 (fontified t)) . -139) (undo-tree-id408 . -1) (undo-tree-id409 . -1) (undo-tree-id410 . -1) 140) nil (26043 27981 54703 199000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 133) (undo-tree-id396 . -3) (undo-tree-id397 . -3) (undo-tree-id398 . -3) 136) nil (26043 27981 54697 576000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -127) (undo-tree-id378 . -1) (undo-tree-id379 . -1) (undo-tree-id380 . -1) (#("N" 0 1 (face font-lock-variable-name-face fontified t)) . -128) (undo-tree-id381 . -1) (undo-tree-id382 . -1) (undo-tree-id383 . -1) (#("o" 0 1 (face font-lock-variable-name-face fontified t)) . -129) (undo-tree-id384 . -1) (undo-tree-id385 . -1) (undo-tree-id386 . -1) (#("d" 0 1 (face font-lock-variable-name-face fontified t)) . -130) (undo-tree-id387 . -1) (undo-tree-id388 . -1) (undo-tree-id389 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -131) (undo-tree-id390 . -1) (undo-tree-id391 . -1) (undo-tree-id392 . -1) (#(";" 0 1 (fontified t)) . -132) (undo-tree-id393 . -1) (undo-tree-id394 . -1) (undo-tree-id395 . -1) 133) nil (26043 27981 54694 804000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 126) (undo-tree-id375 . -1) (undo-tree-id376 . -1) (undo-tree-id377 . -1) 127) nil (26043 27981 54686 69000) 0 nil]) +([nil nil ((#("n" 0 1 (fontified t)) . -122) (undo-tree-id363 . -1) (undo-tree-id364 . -1) (undo-tree-id365 . -1) (#("o" 0 1 (fontified t)) . -123) (undo-tree-id366 . -1) (undo-tree-id367 . -1) (undo-tree-id368 . -1) (#("d" 0 1 (fontified t)) . -124) (undo-tree-id369 . -1) (undo-tree-id370 . -1) (undo-tree-id371 . -1) (#("e" 0 1 (fontified t)) . -125) (undo-tree-id372 . -1) (undo-tree-id373 . -1) (undo-tree-id374 . -1) 126) nil (26043 27981 54683 476000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 119) (undo-tree-id360 . -3) (undo-tree-id361 . -3) (undo-tree-id362 . -3) 122) nil (26043 27981 54677 247000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -111) (undo-tree-id336 . -1) (undo-tree-id337 . -1) (undo-tree-id338 . -1) (#("r" 0 1 (fontified t)) . -112) (undo-tree-id339 . -1) (undo-tree-id340 . -1) (undo-tree-id341 . -1) (#("i" 0 1 (fontified t)) . -113) (undo-tree-id342 . -1) (undo-tree-id343 . -1) (undo-tree-id344 . -1) (#("v" 0 1 (fontified t)) . -114) (undo-tree-id345 . -1) (undo-tree-id346 . -1) (undo-tree-id347 . -1) (#("a" 0 1 (fontified t)) . -115) (undo-tree-id348 . -1) (undo-tree-id349 . -1) (undo-tree-id350 . -1) (#("t" 0 1 (fontified t)) . -116) (undo-tree-id351 . -1) (undo-tree-id352 . -1) (undo-tree-id353 . -1) (#("e" 0 1 (face font-lock-keyword-face fontified t)) . -117) (undo-tree-id354 . -1) (undo-tree-id355 . -1) (undo-tree-id356 . -1) (#(":" 0 1 (c-type c-decl-end fontified t)) . -118) (undo-tree-id357 . -1) (undo-tree-id358 . -1) (undo-tree-id359 . -1) 119) nil (26043 27981 54673 761000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 110) (undo-tree-id333 . -1) (undo-tree-id334 . -1) (undo-tree-id335 . -1) 111) nil (26043 27981 54662 180000) 0 nil]) +([nil nil ((#("l" 0 1 (face font-lock-type-face fontified t)) . -101) (undo-tree-id306 . -1) (undo-tree-id307 . -1) (undo-tree-id308 . -1) (#("i" 0 1 (face font-lock-type-face fontified t)) . -102) (undo-tree-id309 . -1) (undo-tree-id310 . -1) (undo-tree-id311 . -1) (#("n" 0 1 (face font-lock-type-face fontified t)) . -103) (undo-tree-id312 . -1) (undo-tree-id313 . -1) (undo-tree-id314 . -1) (#("k" 0 1 (face font-lock-type-face fontified t)) . -104) (undo-tree-id315 . -1) (undo-tree-id316 . -1) (undo-tree-id317 . -1) (#("L" 0 1 (face font-lock-type-face fontified t)) . -105) (undo-tree-id318 . -1) (undo-tree-id319 . -1) (undo-tree-id320 . -1) (#("i" 0 1 (face font-lock-type-face fontified t)) . -106) (undo-tree-id321 . -1) (undo-tree-id322 . -1) (undo-tree-id323 . -1) (#("s" 0 1 (face font-lock-type-face fontified t)) . -107) (undo-tree-id324 . -1) (undo-tree-id325 . -1) (undo-tree-id326 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -108) (undo-tree-id327 . -1) (undo-tree-id328 . -1) (undo-tree-id329 . -1) (#("{" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t)) . -109) (undo-tree-id330 . -1) (undo-tree-id331 . -1) (undo-tree-id332 . -1) 110) nil (26043 27981 54658 785000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 100) (undo-tree-id303 . -1) (undo-tree-id304 . -1) (undo-tree-id305 . -1) 101) nil (26043 27981 54640 775000) 0 nil]) +([nil nil ((#("c" 0 1 (fontified t c-is-sws t)) . -95) (undo-tree-id288 . -1) (undo-tree-id289 . -1) (undo-tree-id290 . -1) (#("l" 0 1 (fontified t)) . -96) (undo-tree-id291 . -1) (undo-tree-id292 . -1) (undo-tree-id293 . -1) (#("a" 0 1 (fontified t)) . -97) (undo-tree-id294 . -1) (undo-tree-id295 . -1) (undo-tree-id296 . -1) (#("s" 0 1 (fontified t)) . -98) (undo-tree-id297 . -1) (undo-tree-id298 . -1) (undo-tree-id299 . -1) (#("s" 0 1 (c-type c-decl-type-start face font-lock-keyword-face fontified t)) . -99) (undo-tree-id300 . -1) (undo-tree-id301 . -1) (undo-tree-id302 . -1) 100) nil (26043 27981 54637 866000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 94) (undo-tree-id285 . -1) (undo-tree-id286 . -1) (undo-tree-id287 . -1) 95) nil (26043 27981 54630 725000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t)) . -92) (undo-tree-id279 . -1) (undo-tree-id280 . -1) (undo-tree-id281 . -1) (#(";" 0 1 (fontified t)) . -93) (undo-tree-id282 . -1) (undo-tree-id283 . -1) (undo-tree-id284 . -1) 94) nil (26043 27981 54620 0) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 91) (undo-tree-id276 . -1) (undo-tree-id277 . -1) (undo-tree-id278 . -1) 92) nil (26043 27981 54616 927000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -85) (undo-tree-id258 . -1) (undo-tree-id259 . -1) (undo-tree-id260 . -1) (#("n" 0 1 (face font-lock-variable-name-face fontified t)) . -86) (undo-tree-id261 . -1) (undo-tree-id262 . -1) (undo-tree-id263 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -87) (undo-tree-id264 . -1) (undo-tree-id265 . -1) (undo-tree-id266 . -1) (#("x" 0 1 (face font-lock-variable-name-face fontified t)) . -88) (undo-tree-id267 . -1) (undo-tree-id268 . -1) (undo-tree-id269 . -1) (#("t" 0 1 (face font-lock-variable-name-face fontified t)) . -89) (undo-tree-id270 . -1) (undo-tree-id271 . -1) (undo-tree-id272 . -1) (#(";" 0 1 (fontified t)) . -90) (undo-tree-id273 . -1) (undo-tree-id274 . -1) (undo-tree-id275 . -1) 91) nil (26043 27981 54613 999000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 84) (undo-tree-id255 . -1) (undo-tree-id256 . -1) (undo-tree-id257 . -1) 85) nil (26043 27981 54604 146000) 0 nil]) +([nil nil ((#("n" 0 1 (fontified t)) . -80) (undo-tree-id243 . -1) (undo-tree-id244 . -1) (undo-tree-id245 . -1) (#("o" 0 1 (fontified t)) . -81) (undo-tree-id246 . -1) (undo-tree-id247 . -1) (undo-tree-id248 . -1) (#("d" 0 1 (fontified t)) . -82) (undo-tree-id249 . -1) (undo-tree-id250 . -1) (undo-tree-id251 . -1) (#("e" 0 1 (fontified t)) . -83) (undo-tree-id252 . -1) (undo-tree-id253 . -1) (undo-tree-id254 . -1) 84) nil (26043 27981 54601 520000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 77) (undo-tree-id240 . -3) (undo-tree-id241 . -3) (undo-tree-id242 . -3) 80) nil (26043 27981 54594 571000) 0 nil]) +([nil nil ((#("i" 0 1 (face font-lock-variable-name-face fontified t)) . -74) (undo-tree-id231 . -1) (undo-tree-id232 . -1) (undo-tree-id233 . -1) (#("d" 0 1 (face font-lock-variable-name-face fontified t)) . -75) (undo-tree-id234 . -1) (undo-tree-id235 . -1) (undo-tree-id236 . -1) (#(";" 0 1 (fontified t)) . -76) (undo-tree-id237 . -1) (undo-tree-id238 . -1) (undo-tree-id239 . -1) 77) nil (26043 27981 54592 300000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 73) (undo-tree-id228 . -1) (undo-tree-id229 . -1) (undo-tree-id230 . -1) 74) nil (26043 27981 54587 642000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -70) (undo-tree-id219 . -1) (undo-tree-id220 . -1) (undo-tree-id221 . -1) (#("n" 0 1 (fontified t)) . -71) (undo-tree-id222 . -1) (undo-tree-id223 . -1) (undo-tree-id224 . -1) (#("t" 0 1 (face font-lock-type-face c-type c-decl-id-start fontified t)) . -72) (undo-tree-id225 . -1) (undo-tree-id226 . -1) (undo-tree-id227 . -1) 73) nil (26043 27981 54585 92000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 67) (undo-tree-id216 . -3) (undo-tree-id217 . -3) (undo-tree-id218 . -3) 70) nil (26043 27981 54579 671000) 0 nil]) +([nil nil ((#("*" 0 1 (fontified t)) . -61) (undo-tree-id198 . -1) (undo-tree-id199 . -1) (undo-tree-id200 . -1) (#("p" 0 1 (fontified t)) . -62) (undo-tree-id201 . -1) (undo-tree-id202 . -1) (undo-tree-id203 . -1) (#("r" 0 1 (fontified t)) . -63) (undo-tree-id204 . -1) (undo-tree-id205 . -1) (undo-tree-id206 . -1) (#("e" 0 1 (fontified t)) . -64) (undo-tree-id207 . -1) (undo-tree-id208 . -1) (undo-tree-id209 . -1) (#("v" 0 1 (fontified t)) . -65) (undo-tree-id210 . -1) (undo-tree-id211 . -1) (undo-tree-id212 . -1) (#(";" 0 1 (fontified t)) . -66) (undo-tree-id213 . -1) (undo-tree-id214 . -1) (undo-tree-id215 . -1) 67) nil (26043 27981 54572 975000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 60) (undo-tree-id195 . -1) (undo-tree-id196 . -1) (undo-tree-id197 . -1) 61) nil (26043 27981 54563 545000) 0 nil]) +([nil nil ((#("n" 0 1 (fontified t)) . -56) (undo-tree-id183 . -1) (undo-tree-id184 . -1) (undo-tree-id185 . -1) (#("o" 0 1 (fontified t)) . -57) (undo-tree-id186 . -1) (undo-tree-id187 . -1) (undo-tree-id188 . -1) (#("d" 0 1 (fontified t)) . -58) (undo-tree-id189 . -1) (undo-tree-id190 . -1) (undo-tree-id191 . -1) (#("e" 0 1 (fontified t)) . -59) (undo-tree-id192 . -1) (undo-tree-id193 . -1) (undo-tree-id194 . -1) 60) nil (26043 27981 54560 470000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 53) (undo-tree-id180 . -3) (undo-tree-id181 . -3) (undo-tree-id182 . -3) 56) nil (26043 27981 54554 401000) 0 nil]) +([nil nil ((#("{" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t)) . -52) (undo-tree-id177 . -1) (undo-tree-id178 . -1) (undo-tree-id179 . -1) 53) nil (26043 27981 54551 909000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 51) (undo-tree-id174 . -1) (undo-tree-id175 . -1) (undo-tree-id176 . -1) 52) nil (26043 27981 54549 846000) 0 nil]) +([nil nil ((#("n" 0 1 (face font-lock-type-face fontified t)) . -47) (undo-tree-id162 . -1) (undo-tree-id163 . -1) (undo-tree-id164 . -1) (#("o" 0 1 (face font-lock-type-face fontified t)) . -48) (undo-tree-id165 . -1) (undo-tree-id166 . -1) (undo-tree-id167 . -1) (#("d" 0 1 (face font-lock-type-face fontified t)) . -49) (undo-tree-id168 . -1) (undo-tree-id169 . -1) (undo-tree-id170 . -1) (#("e" 0 1 (face font-lock-type-face fontified t)) . -50) (undo-tree-id171 . -1) (undo-tree-id172 . -1) (undo-tree-id173 . -1) 51) nil (26043 27981 54547 68000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 46) (undo-tree-id159 . -1) (undo-tree-id160 . -1) (undo-tree-id161 . -1) 47) nil (26043 27981 54540 946000) 0 nil]) +([nil nil ((#("s" 0 1 (c-is-sws t fontified t)) . -40) (undo-tree-id141 . -1) (undo-tree-id142 . -1) (undo-tree-id143 . -1) (#("t" 0 1 (fontified t)) . -41) (undo-tree-id144 . -1) (undo-tree-id145 . -1) (undo-tree-id146 . -1) (#("r" 0 1 (fontified t)) . -42) (undo-tree-id147 . -1) (undo-tree-id148 . -1) (undo-tree-id149 . -1) (#("u" 0 1 (fontified t)) . -43) (undo-tree-id150 . -1) (undo-tree-id151 . -1) (undo-tree-id152 . -1) (#("c" 0 1 (fontified t)) . -44) (undo-tree-id153 . -1) (undo-tree-id154 . -1) (undo-tree-id155 . -1) (#("t" 0 1 (c-type c-decl-type-start face font-lock-keyword-face fontified t)) . -45) (undo-tree-id156 . -1) (undo-tree-id157 . -1) (undo-tree-id158 . -1) 46) nil (26043 27981 54537 111000) 0 nil]) +([nil nil ((#(" + +" 0 1 (c-in-sws t fontified t) 1 2 (c-in-sws t c-is-sws t fontified t)) . 38) (undo-tree-id138 . -2) (undo-tree-id139 . -2) (undo-tree-id140 . -2) 40) nil (26043 27981 54524 639000) 0 nil]) +([nil nil ((38 . 39)) nil (26043 27981 54522 553000) 0 nil]) +([nil nil ((#("\\" 0 1 (fontified t)) . 38) (undo-tree-id136 . -1) (undo-tree-id137 . -1) 39) nil (26043 27981 54521 821000) 0 nil]) +([nil nil ((#("<" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -30) (undo-tree-id104 . -1) (undo-tree-id105 . -1) (undo-tree-id106 . -1) (undo-tree-id107 . -1) (#("v" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -31) (undo-tree-id108 . -1) (undo-tree-id109 . -1) (undo-tree-id110 . -1) (undo-tree-id111 . -1) (#("e" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -32) (undo-tree-id112 . -1) (undo-tree-id113 . -1) (undo-tree-id114 . -1) (undo-tree-id115 . -1) (#("c" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -33) (undo-tree-id116 . -1) (undo-tree-id117 . -1) (undo-tree-id118 . -1) (undo-tree-id119 . -1) (#("t" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -34) (undo-tree-id120 . -1) (undo-tree-id121 . -1) (undo-tree-id122 . -1) (undo-tree-id123 . -1) (#("o" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -35) (undo-tree-id124 . -1) (undo-tree-id125 . -1) (undo-tree-id126 . -1) (undo-tree-id127 . -1) (#("r" 0 1 (face font-lock-string-face fontified t c-in-sws t)) . -36) (undo-tree-id128 . -1) (undo-tree-id129 . -1) (undo-tree-id130 . -1) (undo-tree-id131 . -1) (#(">" 0 1 (face (rainbow-delimiters-depth-1-face font-lock-string-face) fontified t c-in-sws t)) . -37) (undo-tree-id132 . -1) (undo-tree-id133 . -1) (undo-tree-id134 . -1) (undo-tree-id135 . -1) 38) nil (26043 27981 54518 727000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t c-in-sws t)) . 29) (undo-tree-id100 . -1) (undo-tree-id101 . -1) (undo-tree-id102 . -1) (undo-tree-id103 . -1) 30) nil (26043 27981 54504 270000) 0 nil]) +([nil nil ((#("#" 0 1 (fontified t c-is-sws t c-in-sws t)) . -21) (undo-tree-id68 . -1) (undo-tree-id69 . -1) (undo-tree-id70 . -1) (undo-tree-id71 . -1) (#("i" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -22) (undo-tree-id72 . -1) (undo-tree-id73 . -1) (undo-tree-id74 . -1) (undo-tree-id75 . -1) (#("n" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -23) (undo-tree-id76 . -1) (undo-tree-id77 . -1) (undo-tree-id78 . -1) (undo-tree-id79 . -1) (#("c" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -24) (undo-tree-id80 . -1) (undo-tree-id81 . -1) (undo-tree-id82 . -1) (undo-tree-id83 . -1) (#("l" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -25) (undo-tree-id84 . -1) (undo-tree-id85 . -1) (undo-tree-id86 . -1) (undo-tree-id87 . -1) (#("u" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -26) (undo-tree-id88 . -1) (undo-tree-id89 . -1) (undo-tree-id90 . -1) (undo-tree-id91 . -1) (#("d" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -27) (undo-tree-id92 . -1) (undo-tree-id93 . -1) (undo-tree-id94 . -1) (undo-tree-id95 . -1) (#("e" 0 1 (face font-lock-preprocessor-face fontified t c-in-sws t)) . -28) (undo-tree-id96 . -1) (undo-tree-id97 . -1) (undo-tree-id98 . -1) (undo-tree-id99 . -1) 29) nil (26043 27981 54499 632000) 0 nil]) +([nil nil ((#(" +" 0 1 (c-in-sws t fontified t)) . 20) (undo-tree-id65 . -1) (undo-tree-id66 . -1) (undo-tree-id67 . -1) 21) nil (26043 27981 54443 143000) 0 nil]) +([nil nil ((21 . 21) (21 . 22) (20 . 20) (20 . 21)) nil (26043 27981 54440 143000) 0 nil]) +([nil nil ((22 . 23) (22 . 23)) nil (26043 27981 54439 181000) 0 nil]) +([nil nil ((24 . 27)) nil (26043 27981 54438 577000) 0 nil]) +([nil nil ((#("," 0 1 (c-is-sws t fontified t)) . -23) (undo-tree-id55 . -1) (undo-tree-id56 . -1) (undo-tree-id57 . -1) (#("a" 0 1 (fontified t)) . -24) (undo-tree-id58 . -1) (undo-tree-id59 . -1) (undo-tree-id60 . -1) (#("o" 0 1 (fontified t)) . -25) (undo-tree-id61 . -1) (undo-tree-id62 . -1) (undo-tree-id63 . -1) (#("m" 0 1 (fontified t)) . -26) (undo-tree-id64 . -1) 27) nil (26043 27981 54437 155000) 0 nil]) +([nil nil ((#(" + + " 0 1 (c-in-sws t fontified t) 1 2 (c-in-sws t c-is-sws t fontified t) 2 3 (c-is-sws t fontified t)) . 20) (undo-tree-id52 . -3) (undo-tree-id53 . -3) (undo-tree-id54 . -3) 23) nil (26043 27981 54432 140000) 0 nil]) +([nil nil ((20 . 20) (20 . 21)) nil (26043 27981 54428 120000) 0 nil]) +([nil nil ((21 . 26)) nil (26043 27981 54427 569000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 25) (undo-tree-id51 . -1) 26) nil (26043 27981 54427 26000) 0 nil]) +([nil nil ((#("m" 0 1 (c-is-sws t fontified t)) . -21) (undo-tree-id39 . -1) (undo-tree-id40 . -1) (undo-tree-id41 . -1) (#("a" 0 1 (fontified t)) . -22) (undo-tree-id42 . -1) (undo-tree-id43 . -1) (undo-tree-id44 . -1) (#("i" 0 1 (fontified t)) . -23) (undo-tree-id45 . -1) (undo-tree-id46 . -1) (undo-tree-id47 . -1) (#("n" 0 1 (fontified t)) . -24) (undo-tree-id48 . -1) (undo-tree-id49 . -1) (undo-tree-id50 . -1) 25) nil (26043 27981 54425 47000) 0 nil]) +([nil nil ((#(" +" 0 1 (c-in-sws t fontified t)) . 20) (undo-tree-id36 . -1) (undo-tree-id37 . -1) (undo-tree-id38 . -1) 21) nil (26043 27981 54419 467000) 0 nil]) +([nil nil ((21 . 21) (21 . 22) (20 . 20) (20 . 21)) nil (26043 27981 54417 691000) 0 nil]) +([nil nil ((22 . 30)) nil (26043 27981 54417 39000) 0 nil]) +([nil nil ((30 . 32)) nil (26043 27981 54416 651000) 0 nil]) +([nil nil ((32 . 34)) nil (26043 27981 54416 279000) 0 nil]) +([nil nil ((34 . 36) (33 . 35)) nil (26043 27981 54415 808000) 0 nil]) +([nil nil ((36 . 41)) nil (26043 27981 54415 331000) 0 nil]) +([nil nil ((41 . 42)) nil (26043 27981 54414 927000) 0 nil]) +([nil nil ((42 . 45)) nil (26043 27981 54414 509000) 0 nil]) +([nil nil ((45 . 48)) nil (26043 27981 54414 91000) 0 nil]) +([nil nil ((43 . 45) (#(" " 0 1 (fontified nil)) . 43) (48 . 49) (43 . 44) (#(" " 0 2 (fontified nil)) . 43) (48 . 49)) nil (26043 27981 54413 59000) 0 nil]) +([nil nil ((50 . 54)) nil (26043 27981 54412 217000) 0 nil]) +([nil nil ((#("?" 0 1 (fontified t)) . -53) (undo-tree-id35 . -1) 54) nil (26043 27981 54411 616000) 0 nil]) +([nil nil ((53 . 55)) nil (26043 27981 54410 562000) 0 nil]) +([nil nil ((55 . 56)) nil (26043 27981 54410 151000) 0 nil]) +([nil nil ((#("N" 0 1 (fontified t)) . -55) (undo-tree-id32 . -1) (undo-tree-id33 . -1) (undo-tree-id34 . -1) 56) nil (26043 27981 54409 493000) 0 nil]) +([nil nil ((55 . 56)) nil (26043 27981 54407 694000) 0 nil]) +([nil nil ((56 . 57)) nil (26043 27981 54407 231000) 0 nil]) +([nil nil ((57 . 60)) nil (26043 27981 54406 693000) 0 nil]) +([nil nil ((#("m" 0 1 (fontified t)) . -55) (undo-tree-id29 . -1) (undo-tree-id30 . -1) (undo-tree-id31 . -1) 56) nil (26043 27981 54406 97000) 0 nil]) +([nil nil ((55 . 56)) nil (26043 27981 54404 441000) 0 nil]) +([nil nil ((53 . 54)) nil (26043 27981 54404 90000) 0 nil]) +([nil nil ((56 . 57)) nil (26043 27981 54403 644000) 0 nil]) +([nil nil ((42 . 43)) nil (26043 27981 54403 273000) 0 nil]) +([nil nil ((#("." 0 1 (fontified t)) . -42) (undo-tree-id28 . -1) 43) nil (26043 27981 54402 676000) 0 nil]) +([nil nil ((41 . 42)) nil (26043 27981 54401 808000) 0 nil]) +([nil nil ((42 . 43)) nil (26043 27981 54401 438000) 0 nil]) +([nil nil ((64 . 73)) nil (26043 27981 54401 51000) 0 nil]) +([nil nil ((74 . 77) (73 . 75)) nil (26043 27981 54400 677000) 0 nil]) +([nil nil ((78 . 79)) nil (26043 27981 54400 234000) 0 nil]) +([nil nil ((78 . 79)) nil (26043 27981 54399 880000) 0 nil]) +([nil nil ((79 . 82)) nil (26043 27981 54399 550000) 0 nil]) +([nil nil ((82 . 84)) nil (26043 27981 54399 127000) 0 nil]) +([nil nil ((#("," 0 1 (fontified t)) . -83) (undo-tree-id27 . -1) 84) nil (26043 27981 54398 543000) 0 nil]) +([nil nil ((83 . 86)) nil (26043 27981 54397 657000) 0 nil]) +([nil nil ((86 . 87)) nil (26043 27981 54397 254000) 0 nil]) +([nil nil ((87 . 90)) nil (26043 27981 54396 917000) 0 nil]) +([nil nil ((91 . 94)) nil (26043 27981 54396 542000) 0 nil]) +([nil nil ((94 . 97)) nil (26043 27981 54396 92000) 0 nil]) +([nil nil ((97 . 99)) nil (26043 27981 54395 616000) 0 nil]) +([nil nil ((98 . 105)) nil (26043 27981 54395 91000) 0 nil]) +([nil nil ((105 . 106)) nil (26043 27981 54394 745000) 0 nil]) +([nil nil ((106 . 107)) nil (26043 27981 54394 297000) 0 nil]) +([nil nil ((107 . 108)) nil (26043 27981 54393 859000) 0 nil]) +([nil nil ((108 . 109)) nil (26043 27981 54393 345000) 0 nil]) +([nil nil ((109 . 110)) nil (26043 27981 54392 891000) 0 nil]) +([nil nil ((110 . 111)) nil (26043 27981 54392 446000) 0 nil]) +([nil nil ((#("o" 0 1 (fontified t)) . -110) (undo-tree-id24 . -1) (undo-tree-id25 . -1) (undo-tree-id26 . -1) 111) nil (26043 27981 54391 924000) 0 nil]) +([nil nil ((110 . 113)) nil (26043 27981 54390 309000) 0 nil]) +([nil nil ((114 . 116)) nil (26043 27981 54389 866000) 0 nil]) +([nil nil ((116 . 120) (115 . 119)) nil (26043 27981 54389 404000) 0 nil]) +([nil nil ((122 . 123) (120 . 123)) nil (26043 27981 54388 895000) 0 nil]) +([nil nil ((124 . 126)) nil (26043 27981 54388 254000) 0 nil]) +([nil nil ((126 . 128)) nil (26043 27981 54387 735000) 0 nil]) +([nil nil ((128 . 129)) nil (26043 27981 54387 342000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -120) (undo-tree-id23 . -1) 121) nil (26043 27981 54386 721000) 0 nil]) +([nil nil ((120 . 125)) nil (26043 27981 54385 716000) 0 nil]) +([nil nil ((137 . 140)) nil (26043 27981 54385 222000) 0 nil]) +([nil nil ((140 . 145)) nil (26043 27981 54384 783000) 0 nil]) +([nil nil ((145 . 147) (#(" x" 0 2 (fontified nil)) . -145) (145 . 147) (#("while" 0 1 (face font-lock-keyword-face fontified nil) 1 2 (face font-lock-keyword-face fontified nil) 2 3 (face font-lock-keyword-face fontified nil) 3 4 (face font-lock-keyword-face fontified nil) 4 5 (face font-lock-keyword-face fontified nil)) . 145) (undo-tree-id20 . -5) (undo-tree-id21 . -5) (undo-tree-id22 . -5) (140 . 145) 145) nil (26043 27981 54383 839000) 0 nil]) +([nil nil ((146 . 147)) nil (26043 27981 54381 875000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -146) (undo-tree-id17 . -1) (undo-tree-id18 . -1) (undo-tree-id19 . -1) 147) nil (26043 27981 54381 270000) 0 nil]) +([nil nil ((146 . 148)) nil (26043 27981 54379 588000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -146) (undo-tree-id11 . -1) (undo-tree-id12 . -1) (undo-tree-id13 . -1) (#("M" 0 1 (fontified t)) . -147) (undo-tree-id14 . -1) (undo-tree-id15 . -1) (undo-tree-id16 . -1) 148) nil (26043 27981 54378 710000) 0 nil]) +([nil nil ((146 . 147)) nil (26043 27981 54375 509000) 0 nil]) +([nil nil ((147 . 148)) nil (26043 27981 54375 150000) 0 nil]) +([nil nil ((148 . 149)) nil (26043 27981 54374 745000) 0 nil]) +([nil nil ((150 . 152)) nil (26043 27981 54374 262000) 0 nil]) +([nil nil ((152 . 156) (151 . 155)) nil (26043 27981 54373 788000) 0 nil]) +([nil nil ((156 . 159)) nil (26043 27981 54373 191000) 0 nil]) +([nil nil ((159 . 161)) nil (26043 27981 54372 667000) 0 nil]) +([nil nil ((161 . 163) (#(" x" 0 2 (fontified nil)) . -161) (161 . 163) (#("while" 0 1 (face font-lock-keyword-face fontified nil) 1 2 (face font-lock-keyword-face fontified nil) 2 3 (face font-lock-keyword-face fontified nil) 3 4 (face font-lock-keyword-face fontified nil) 4 5 (face font-lock-keyword-face fontified nil)) . 161) (undo-tree-id8 . -5) (undo-tree-id9 . -5) (undo-tree-id10 . -5) (156 . 161) 161) nil (26043 27981 54371 738000) 0 nil]) +([nil nil ((162 . 163)) nil (26043 27981 54369 421000) 0 nil]) +([nil nil ((163 . 164)) nil (26043 27981 54369 49000) 0 nil]) +([nil nil ((164 . 165)) nil (26043 27981 54368 604000) 0 nil]) +([nil nil ((166 . 168)) nil (26043 27981 54368 198000) 0 nil]) +([nil nil ((168 . 174) (167 . 173)) nil (26043 27981 54367 818000) 0 nil]) +([nil nil ((174 . 176)) nil (26043 27981 54367 271000) 0 nil]) +([nil nil ((178 . 179) (176 . 179)) nil (26043 27981 54366 858000) 0 nil]) +([nil nil ((180 . 181)) nil (26043 27981 54366 277000) 0 nil]) +([nil nil ((181 . 188)) nil (26043 27981 54365 800000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -176) (undo-tree-id7 . -1) 177) nil (26043 27981 54365 136000) 0 nil]) +([nil nil ((176 . 181)) nil (26043 27981 54364 261000) 0 nil]) +([nil nil ((192 . 195)) nil (26043 27981 54363 921000) 0 nil]) +([nil nil ((195 . 196)) nil (26043 27981 54363 554000) 0 nil]) +([nil nil ((202 . 207)) nil (26043 27981 54363 45000) 0 nil]) +([nil nil ((207 . 213)) nil (26043 27981 54362 716000) 0 nil]) +([nil nil ((213 . 215)) nil (26043 27981 54362 288000) 0 nil]) +([nil nil ((215 . 216)) nil (26043 27981 54361 945000) 0 nil]) +([nil nil ((215 . 217) (214 . 216) (#("\"" 0 1 (face (rainbow-delimiters-depth-3-face) fontified nil)) . -214) (214 . 215)) nil (26043 27981 54361 440000) 0 nil]) +([nil nil ((217 . 218)) nil (26043 27981 54360 712000) 0 nil]) +([nil nil ((219 . 220)) nil (26043 27981 54360 332000) 0 nil]) +([nil nil ((222 . 223) (220 . 223)) nil (26043 27981 54359 543000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -220) (undo-tree-id6 . -1) 221) nil (26043 27981 54358 739000) 0 nil]) +([nil nil ((220 . 225)) nil (26043 27981 54357 784000) 0 nil]) +([nil nil ((229 . 236)) nil (26043 27981 54357 405000) 0 nil]) +([nil nil ((#(" + " 0 7 (fontified t)) . 229) (undo-tree-id5 . -7) 236) nil (26043 27981 54356 743000) 0 nil]) +([nil nil ((#(")" 0 1 (face (rainbow-delimiters-depth-3-face) fontified t)) . -228) (undo-tree-id4 . -1) 229) nil (26043 27981 54355 527000) 0 nil]) +([nil nil ((228 . 229) (#(")" 0 1 (face (rainbow-delimiters-depth-4-face) fontified nil)) . -228) (228 . 229)) nil (26043 27981 54354 211000) 0 nil]) +([nil nil ((230 . 235)) nil (26043 27981 54353 563000) 0 nil]) +([nil nil ((235 . 238)) nil (26043 27981 54353 209000) 0 nil]) +([nil nil ((238 . 239)) nil (26043 27981 54352 797000) 0 nil]) +([nil nil ((239 . 244)) nil (26043 27981 54352 312000) 0 nil]) +([nil nil ((246 . 247) (244 . 247)) nil (26043 27981 54351 841000) 0 nil]) +([nil nil ((248 . 249)) nil (26043 27981 54351 192000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -244) (undo-tree-id3 . -1) 245) nil (26043 27981 54350 495000) 0 nil]) +([nil nil ((244 . 249)) nil (26043 27981 54349 491000) 0 nil]) +([nil nil ((265 . 266) (259 . 266) (253 . 260)) nil (26043 27981 54349 11000) 0 nil]) +([nil nil ((268 . 269)) nil (26043 27981 54348 209000) 0 nil]) +([nil nil ((269 . 274)) nil (26043 27981 54347 755000) 0 nil]) +([nil nil ((274 . 277)) nil (26043 27981 54347 319000) 0 nil]) +([nil nil ((278 . 284) (#(" " 0 2 (fontified nil)) . 278) (undo-tree-id2 . -2) (280 . 281)) nil (26043 27981 54346 585000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -284) (undo-tree-id1 . -1) 285) nil (26043 27981 54344 941000) 0 nil]) +([nil nil ((#(" + " 0 7 (fontified t)) . 277) (undo-tree-id0 . -7) 284) nil (26043 27981 54342 753000) 0 nil]) +([nil nil ((277 . 278)) nil (26043 27981 54317 686000) 0 nil]) +([nil nil ((278 . 281)) nil (26043 27981 54317 100000) 0 nil]) +([nil nil ((282 . 285)) nil (26043 27981 54316 618000) 0 nil]) +([nil nil ((285 . 293)) nil (26043 27981 54316 67000) 0 nil]) +([nil nil ((293 . 294)) nil (26043 27981 54315 3000) 0 nil]) +([nil nil ((296 . 297) 294) nil (26043 27981 54310 888000) 0 nil]) +([nil nil ((137 . 140) (t 26043 27981 110993 756000)) nil (26043 28053 191256 333000) 0 nil]) +([nil nil ((142 . 143) (140 . 143)) nil (26043 28053 191255 682000) 0 nil]) +([nil nil ((144 . 146)) nil (26043 28053 191255 30000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -140) (undo-tree-id611 . -1) 141) nil (26043 28053 191254 3000) 0 nil]) +([nil nil ((140 . 145)) nil (26043 28053 191252 718000) 0 nil]) +([nil nil ((150 . 151)) nil (26043 28053 191251 967000) 0 nil]) +([nil nil ((151 . 152)) nil (26043 28053 191250 989000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -150) (undo-tree-id609 . -1) (#(";" 0 1 (fontified t)) . -151) (undo-tree-id610 . -1) 152) nil (26043 28053 191248 655000) 0 nil]) +([nil current ((150 . 151)) nil (26043 28053 191235 868000) 0 nil]) +nil diff --git a/src/algorithm/hanoi b/src/type/linkList/josphe similarity index 68% rename from src/algorithm/hanoi rename to src/type/linkList/josphe index 069a675..645eaa0 100755 Binary files a/src/algorithm/hanoi and b/src/type/linkList/josphe differ diff --git a/src/type/linkList/josphe.cpp b/src/type/linkList/josphe.cpp new file mode 100644 index 0000000..b4acb51 --- /dev/null +++ b/src/type/linkList/josphe.cpp @@ -0,0 +1,22 @@ +#include + +int main(){ + int n,m; + std::cin >> n; + int listn[n+1],j=n,k=1,p=0; + for(int i=1;i -- via pvector command +# std::list -- via plist or plist_member command +# std::map -- via pmap or pmap_member command +# std::multimap -- via pmap or pmap_member command +# std::set -- via pset command +# std::multiset -- via pset command +# std::deque -- via pdequeue command +# std::stack -- via pstack command +# std::queue -- via pqueue command +# std::priority_queue -- via ppqueue command +# std::bitset -- via pbitset command +# std::string -- via pstring command +# std::widestring -- via pwstring command +# +# The end of this file contains (optional) C++ beautifiers +# Make sure your debugger supports $argc +# +# Simple GDB Macros writen by Dan Marinescu (H-PhD) - License GPL +# Inspired by intial work of Tom Malnar, +# Tony Novac (PhD) / Cornell / Stanford, +# Gilad Mishne (PhD) and Many Many Others. +# Contact: dan_c_marinescu@yahoo.com (Subject: STL) +# +# Modified to work with g++ 4.3 by Anders Elton +# Also added _member functions, that instead of printing the entire class in map, prints a member. + + + +# +# std::vector<> +# + +define pvector + if $argc == 0 + help pvector + else + set $size = $arg0._M_impl._M_finish - $arg0._M_impl._M_start + set $capacity = $arg0._M_impl._M_end_of_storage - $arg0._M_impl._M_start + set $size_max = $size - 1 + end + if $argc == 1 + set $i = 0 + while $i < $size + printf "elem[%u]: ", $i + p *($arg0._M_impl._M_start + $i) + set $i++ + end + end + if $argc == 2 + set $idx = $arg1 + if $idx < 0 || $idx > $size_max + printf "idx1, idx2 are not in acceptable range: [0..%u].\n", $size_max + else + printf "elem[%u]: ", $idx + p *($arg0._M_impl._M_start + $idx) + end + end + if $argc == 3 + set $start_idx = $arg1 + set $stop_idx = $arg2 + if $start_idx > $stop_idx + set $tmp_idx = $start_idx + set $start_idx = $stop_idx + set $stop_idx = $tmp_idx + end + if $start_idx < 0 || $stop_idx < 0 || $start_idx > $size_max || $stop_idx > $size_max + printf "idx1, idx2 are not in acceptable range: [0..%u].\n", $size_max + else + set $i = $start_idx + while $i <= $stop_idx + printf "elem[%u]: ", $i + p *($arg0._M_impl._M_start + $i) + set $i++ + end + end + end + if $argc > 0 + printf "Vector size = %u\n", $size + printf "Vector capacity = %u\n", $capacity + printf "Element " + whatis $arg0._M_impl._M_start + end +end + +document pvector + Prints std::vector information. + Syntax: pvector + Note: idx, idx1 and idx2 must be in acceptable range [0...size()-1]. + Examples: + pvector v - Prints vector content, size, capacity and T typedef + pvector v 0 - Prints element[idx] from vector + pvector v 1 2 - Prints elements in range [idx1..idx2] from vector +end + +# +# std::list<> +# + +define plist + if $argc == 0 + help plist + else + set $head = &$arg0._M_impl._M_node + set $current = $arg0._M_impl._M_node._M_next + set $size = 0 + while $current != $head + if $argc == 2 + printf "elem[%u]: ", $size + p *($arg1*)($current + 1) + end + if $argc == 3 + if $size == $arg2 + printf "elem[%u]: ", $size + p *($arg1*)($current + 1) + end + end + set $current = $current._M_next + set $size++ + end + printf "List size = %u \n", $size + if $argc == 1 + printf "List " + whatis $arg0 + printf "Use plist to see the elements in the list.\n" + end + end +end + +document plist + Prints std::list information. + Syntax: plist : Prints list size, if T defined all elements or just element at idx + Examples: + plist l - prints list size and definition + plist l int - prints all elements and list size + plist l int 2 - prints the third element in the list (if exists) and list size +end + +define plist_member + if $argc == 0 + help plist_member + else + set $head = &$arg0._M_impl._M_node + set $current = $arg0._M_impl._M_node._M_next + set $size = 0 + while $current != $head + if $argc == 3 + printf "elem[%u]: ", $size + p (*($arg1*)($current + 1)).$arg2 + end + if $argc == 4 + if $size == $arg3 + printf "elem[%u]: ", $size + p (*($arg1*)($current + 1)).$arg2 + end + end + set $current = $current._M_next + set $size++ + end + printf "List size = %u \n", $size + if $argc == 1 + printf "List " + whatis $arg0 + printf "Use plist_member to see the elements in the list.\n" + end + end +end + +document plist_member + Prints std::list information. + Syntax: plist : Prints list size, if T defined all elements or just element at idx + Examples: + plist_member l int member - prints all elements and list size + plist_member l int member 2 - prints the third element in the list (if exists) and list size +end + + +# +# std::map and std::multimap +# + +define pmap + if $argc == 0 + help pmap + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Map " + whatis $tree + printf "Use pmap to see the elements in the map.\n" + end + if $argc == 3 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u].left: ", $i + p *($arg1*)$value + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p *($arg2*)$value + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 4 + set $idx = $arg3 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u].left: ", $i + p *($arg1*)$value + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p *($arg2*)$value + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + if $argc == 5 + set $idx1 = $arg3 + set $idx2 = $arg4 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + set $valueLeft = *($arg1*)$value + set $valueRight = *($arg2*)($value + sizeof($arg1)) + if $valueLeft == $idx1 && $valueRight == $idx2 + printf "elem[%u].left: ", $i + p $valueLeft + printf "elem[%u].right: ", $i + p $valueRight + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Map size = %u\n", $tree_size + end +end + +document pmap + Prints std::map or std::multimap information. Works for std::multimap as well. + Syntax: pmap : Prints map size, if T defined all elements or just element(s) with val(s) + Examples: + pmap m - prints map size and definition + pmap m int int - prints all elements and map size + pmap m int int 20 - prints the element(s) with left-value = 20 (if any) and map size + pmap m int int 20 200 - prints the element(s) with left-value = 20 and right-value = 200 (if any) and map size +end + + +define pmap_member + if $argc == 0 + help pmap_member + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Map " + whatis $tree + printf "Use pmap to see the elements in the map.\n" + end + if $argc == 5 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u].left: ", $i + p (*($arg1*)$value).$arg2 + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p (*($arg3*)$value).$arg4 + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 6 + set $idx = $arg5 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u].left: ", $i + p (*($arg1*)$value).$arg2 + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p (*($arg3*)$value).$arg4 + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Map size = %u\n", $tree_size + end +end + +document pmap_member + Prints std::map or std::multimap information. Works for std::multimap as well. + Syntax: pmap : Prints map size, if T defined all elements or just element(s) with val(s) + Examples: + pmap_member m class1 member1 class2 member2 - prints class1.member1 : class2.member2 + pmap_member m class1 member1 class2 member2 lvalue - prints class1.member1 : class2.member2 where class1 == lvalue +end + + +# +# std::set and std::multiset +# + +define pset + if $argc == 0 + help pset + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Set " + whatis $tree + printf "Use pset to see the elements in the set.\n" + end + if $argc == 2 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u]: ", $i + p *($arg1*)$value + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 3 + set $idx = $arg2 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u]: ", $i + p *($arg1*)$value + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Set size = %u\n", $tree_size + end +end + +document pset + Prints std::set or std::multiset information. Works for std::multiset as well. + Syntax: pset : Prints set size, if T defined all elements or just element(s) having val + Examples: + pset s - prints set size and definition + pset s int - prints all elements and the size of s + pset s int 20 - prints the element(s) with value = 20 (if any) and the size of s +end + + + +# +# std::dequeue +# + +define pdequeue + if $argc == 0 + help pdequeue + else + set $size = 0 + set $start_cur = $arg0._M_impl._M_start._M_cur + set $start_last = $arg0._M_impl._M_start._M_last + set $start_stop = $start_last + while $start_cur != $start_stop + p *$start_cur + set $start_cur++ + set $size++ + end + set $finish_first = $arg0._M_impl._M_finish._M_first + set $finish_cur = $arg0._M_impl._M_finish._M_cur + set $finish_last = $arg0._M_impl._M_finish._M_last + if $finish_cur < $finish_last + set $finish_stop = $finish_cur + else + set $finish_stop = $finish_last + end + while $finish_first != $finish_stop + p *$finish_first + set $finish_first++ + set $size++ + end + printf "Dequeue size = %u\n", $size + end +end + +document pdequeue + Prints std::dequeue information. + Syntax: pdequeue : Prints dequeue size, if T defined all elements + Deque elements are listed "left to right" (left-most stands for front and right-most stands for back) + Example: + pdequeue d - prints all elements and size of d +end + + + +# +# std::stack +# + +define pstack + if $argc == 0 + help pstack + else + set $start_cur = $arg0.c._M_impl._M_start._M_cur + set $finish_cur = $arg0.c._M_impl._M_finish._M_cur + set $size = $finish_cur - $start_cur + set $i = $size - 1 + while $i >= 0 + p *($start_cur + $i) + set $i-- + end + printf "Stack size = %u\n", $size + end +end + +document pstack + Prints std::stack information. + Syntax: pstack : Prints all elements and size of the stack + Stack elements are listed "top to buttom" (top-most element is the first to come on pop) + Example: + pstack s - prints all elements and the size of s +end + + + +# +# std::queue +# + +define pqueue + if $argc == 0 + help pqueue + else + set $start_cur = $arg0.c._M_impl._M_start._M_cur + set $finish_cur = $arg0.c._M_impl._M_finish._M_cur + set $size = $finish_cur - $start_cur + set $i = 0 + while $i < $size + p *($start_cur + $i) + set $i++ + end + printf "Queue size = %u\n", $size + end +end + +document pqueue + Prints std::queue information. + Syntax: pqueue : Prints all elements and the size of the queue + Queue elements are listed "top to bottom" (top-most element is the first to come on pop) + Example: + pqueue q - prints all elements and the size of q +end + + + +# +# std::priority_queue +# + +define ppqueue + if $argc == 0 + help ppqueue + else + set $size = $arg0.c._M_impl._M_finish - $arg0.c._M_impl._M_start + set $capacity = $arg0.c._M_impl._M_end_of_storage - $arg0.c._M_impl._M_start + set $i = $size - 1 + while $i >= 0 + p *($arg0.c._M_impl._M_start + $i) + set $i-- + end + printf "Priority queue size = %u\n", $size + printf "Priority queue capacity = %u\n", $capacity + end +end + +document ppqueue + Prints std::priority_queue information. + Syntax: ppqueue : Prints all elements, size and capacity of the priority_queue + Priority_queue elements are listed "top to buttom" (top-most element is the first to come on pop) + Example: + ppqueue pq - prints all elements, size and capacity of pq +end + + + +# +# std::bitset +# + +define pbitset + if $argc == 0 + help pbitset + else + p /t $arg0._M_w + end +end + +document pbitset + Prints std::bitset information. + Syntax: pbitset : Prints all bits in bitset + Example: + pbitset b - prints all bits in b +end + + + +# +# std::string +# + +define pstring + if $argc == 0 + help pstring + else + printf "String \t\t\t= \"%s\"\n", $arg0._M_data() + printf "String size/length \t= %u\n", $arg0._M_rep()._M_length + printf "String capacity \t= %u\n", $arg0._M_rep()._M_capacity + printf "String ref-count \t= %d\n", $arg0._M_rep()._M_refcount + end +end + +document pstring + Prints std::string information. + Syntax: pstring + Example: + pstring s - Prints content, size/length, capacity and ref-count of string s +end + +# +# std::wstring +# + +define pwstring + if $argc == 0 + help pwstring + else + call printf("WString \t\t= \"%ls\"\n", $arg0._M_data()) + printf "WString size/length \t= %u\n", $arg0._M_rep()._M_length + printf "WString capacity \t= %u\n", $arg0._M_rep()._M_capacity + printf "WString ref-count \t= %d\n", $arg0._M_rep()._M_refcount + end +end + +document pwstring + Prints std::wstring information. + Syntax: pwstring + Example: + pwstring s - Prints content, size/length, capacity and ref-count of wstring s +end + +# +# C++ related beautifiers (optional) +# + +set print pretty on +set print object on +set print static-members on +set print vtbl on +set print demangle on +set demangle-style gnu-v3 +set print sevenbit-strings off diff --git a/src/type/list/.list.cpp.~undo-tree~ b/src/type/list/.list.cpp.~undo-tree~ new file mode 100644 index 0000000..e877fe6 --- /dev/null +++ b/src/type/list/.list.cpp.~undo-tree~ @@ -0,0 +1,10 @@ +(undo-tree-save-format-version . 1) +"cddbc736aaa74ebd61462730c1ff770ca3a0a9ed" +[nil nil nil nil (26039 25046 781624 865000) 0 nil] +([nil nil ((#("#include " 0 1 (face font-lock-preprocessor-face fontified t c-is-sws t c-in-sws t) 1 8 (face font-lock-preprocessor-face fontified t c-in-sws t) 8 9 (fontified t c-in-sws t) 9 10 (category c-<-as-paren-syntax face (rainbow-delimiters-depth-1-face font-lock-string-face) fontified t c-in-sws t) 10 18 (face font-lock-string-face fontified t c-in-sws t) 18 19 (category c->-as-paren-syntax face (rainbow-delimiters-depth-1-face font-lock-string-face) fontified t c-in-sws t)) . 1) (undo-tree-id0 . -19) (t 26039 25044 727270 188000)) nil (26039 25060 206462 603000) 0 nil]) +([nil nil ((1 . 2)) nil (26039 25060 206437 766000) 0 nil]) +([nil nil ((2 . 10)) nil (26039 25060 206437 519000) 0 nil]) +([nil nil ((10 . 11)) nil (26039 25060 206437 64000) 0 nil]) +([nil nil ((11 . 19)) nil (26039 25060 206436 514000) 0 nil]) +([nil current ((19 . 20)) nil (26039 25060 206433 34000) 0 nil]) +nil diff --git a/src/type/list/.listWithClass.cpp.~undo-tree~ b/src/type/list/.listWithClass.cpp.~undo-tree~ new file mode 100644 index 0000000..0436a0b --- /dev/null +++ b/src/type/list/.listWithClass.cpp.~undo-tree~ @@ -0,0 +1,446 @@ +(undo-tree-save-format-version . 1) +"f8c51e5cc36d6145cb5e4a623877de8802541e1e" +[nil nil nil nil (26039 25813 735748 775000) 0 nil] +([nil nil ((1 . 2) (t 26039 25668 799058 698000)) nil (26039 25813 735748 26000) 0 nil]) +([nil nil ((2 . 10)) nil (26039 25813 735747 691000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 9) (undo-tree-id110 . -1) (undo-tree-id111 . -1) 10) nil (26039 25813 735747 290000) 0 nil]) +([nil nil ((#("l" 0 1 (face font-lock-preprocessor-face fontified t)) . -5) (undo-tree-id98 . -1) (undo-tree-id99 . -1) (undo-tree-id100 . -1) (undo-tree-id101 . -1) (#("d" 0 1 (face font-lock-preprocessor-face fontified t)) . -6) (undo-tree-id102 . -1) (undo-tree-id103 . -1) (undo-tree-id104 . -1) (undo-tree-id105 . -1) (#("u" 0 1 (face font-lock-preprocessor-face fontified t)) . -7) (undo-tree-id106 . -1) (undo-tree-id107 . -1) (#("e" 0 1 (face font-lock-preprocessor-face fontified t)) . -8) (undo-tree-id108 . -1) (undo-tree-id109 . -1) 9) nil (26039 25813 735745 911000) 0 nil]) +([nil nil ((5 . 11)) nil (26039 25813 735740 972000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 10) (undo-tree-id96 . -1) (undo-tree-id97 . -1) 11) nil (26039 25813 735740 428000) 0 nil]) +([nil nil ((#("c" 0 1 (face font-lock-preprocessor-face fontified t)) . -9) (undo-tree-id92 . -1) (undo-tree-id93 . -1) (undo-tree-id94 . -1) (undo-tree-id95 . -1) 10) nil (26039 25813 735733 396000) 0 nil]) +([nil nil ((9 . 10)) nil (26039 25813 735731 905000) 0 nil]) +([nil nil ((10 . 11)) nil (26039 25813 735731 645000) 0 nil]) +([nil nil ((11 . 12)) nil (26039 25813 735731 378000) 0 nil]) +([nil nil ((12 . 20)) nil (26039 25813 735731 24000) 0 nil]) +([nil nil ((#("？" 0 1 (face font-lock-string-face fontified t)) . -19) (undo-tree-id90 . -1) (undo-tree-id91 . -1) 20) nil (26039 25813 735730 615000) 0 nil]) +([nil nil ((19 . 20)) nil (26039 25813 735729 707000) 0 nil]) +([nil nil ((20 . 20) (20 . 21)) nil (26039 25813 735729 377000) 0 nil]) +([nil nil ((21 . 22)) nil (26039 25813 735729 71000) 0 nil]) +([nil nil ((22 . 29)) nil (26039 25813 735728 830000) 0 nil]) +([nil nil ((29 . 30)) nil (26039 25813 735728 577000) 0 nil]) +([nil nil ((30 . 31)) nil (26039 25813 735728 320000) 0 nil]) +([nil nil ((31 . 35)) nil (26039 25813 735728 78000) 0 nil]) +([nil nil ((35 . 36)) nil (26039 25813 735727 817000) 0 nil]) +([nil nil ((37 . 37) (37 . 38) (36 . 36) (36 . 37)) nil (26039 25813 735727 494000) 0 nil]) +([nil nil ((38 . 50)) nil (26039 25813 735727 83000) 0 nil]) +([nil nil ((50 . 52)) nil (26039 25813 735726 816000) 0 nil]) +([nil nil ((#("(" 0 1 (face (rainbow-delimiters-depth-1-face) fontified nil)) . -50) (undo-tree-id89 . -1) (#(")" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t)) . 51)) nil (26039 25813 735726 258000) 0 nil]) +([nil nil ((50 . 52)) nil (26039 25813 735725 621000) 0 nil]) +([nil nil ((52 . 54) (51 . 53)) nil (26039 25813 735725 328000) 0 nil]) +([nil nil ((54 . 60)) nil (26039 25813 735725 42000) 0 nil]) +([nil nil ((#(" " 0 2 (fontified nil)) . 52) (60 . 61)) nil (26039 25813 735724 624000) 0 nil]) +([nil nil ((59 . 62)) nil (26039 25813 735724 314000) 0 nil]) +([nil nil ((62 . 65)) nil (26039 25813 735724 8000) 0 nil]) +([nil nil ((#("r" 0 1 (fontified t)) . -64) (undo-tree-id86 . -1) (undo-tree-id87 . -1) (undo-tree-id88 . -1) 65) nil (26039 25813 735723 570000) 0 nil]) +([nil nil ((64 . 65)) nil (26039 25813 735722 203000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -62) (undo-tree-id79 . -1) (undo-tree-id80 . -1) (undo-tree-id81 . -1) (#("e" 0 1 (fontified t)) . -63) (undo-tree-id82 . -1) (undo-tree-id83 . -1) (undo-tree-id84 . -1) (#("s" 0 1 (fontified t)) . -64) (undo-tree-id85 . -1) 65) nil (26039 25813 735721 613000) 0 nil]) +([nil nil ((62 . 64)) nil (26039 25813 735718 419000) 0 nil]) +([nil nil ((#("{" 0 1 (face (rainbow-delimiters-depth-2-face) fontified nil)) . -62) (undo-tree-id78 . -1) (#("}" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . 63)) nil (26039 25813 735717 920000) 0 nil]) +([nil nil ((62 . 65)) nil (26039 25813 735717 302000) 0 nil]) +([nil nil ((62 . 68) (#("Per" 0 3 (fontified nil)) . 62) (62 . 65) (#("Person" 0 6 (fontified nil)) . -62) (62 . 68) (#("Per" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t)) . -62) (undo-tree-id75 . -3) (undo-tree-id76 . -3) (undo-tree-id77 . -3) 65) nil (26039 25813 735716 873000) 0 nil]) +([nil nil ((68 . 70)) nil (26039 25813 735715 534000) 0 nil]) +([nil nil ((70 . 71)) nil (26039 25813 735715 233000) 0 nil]) +([nil nil ((#(":" 0 1 (fontified t)) . -70) (undo-tree-id74 . -1) 71) nil (26039 25813 735714 852000) 0 nil]) +([nil nil ((69 . 75)) nil (26039 25813 735714 284000) 0 nil]) +([nil nil ((37 . 55) (nil fontified nil 69 . 80) (nil face (rainbow-delimiters-depth-2-face) 69 . 80) (69 . 80) (#("stri" 0 4 (fontified nil)) . 69) (nil fontified nil 69 . 73) (nil face (rainbow-delimiters-depth-2-face) 69 . 73) (69 . 73) (#("std::string" 0 11 (fontified nil)) . -69) (nil fontified nil 69 . 80) (nil face (rainbow-delimiters-depth-2-face) 69 . 80) (69 . 80) (#("string" 0 1 (face font-lock-type-face fontified t) 1 2 (face font-lock-type-face fontified t) 2 3 (face font-lock-type-face fontified t) 3 4 (face font-lock-type-face fontified t) 4 5 (face font-lock-type-face fontified t) 5 6 (face font-lock-type-face fontified t)) . -69) (undo-tree-id71 . -6) (undo-tree-id72 . -6) (undo-tree-id73 . -6) 75) nil (26039 25813 735713 717000) 0 nil]) +([nil nil ((98 . 103)) nil (26039 25813 735712 228000) 0 nil]) +([nil nil ((103 . 104)) nil (26039 25813 735712 74000) 0 nil]) +([nil nil ((104 . 107)) nil (26039 25813 735711 827000) 0 nil]) +([nil nil ((107 . 109)) nil (26039 25813 735711 563000) 0 nil]) +([nil nil ((109 . 112)) nil (26039 25813 735711 303000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -111) (undo-tree-id68 . -1) (undo-tree-id69 . -1) (undo-tree-id70 . -1) 112) nil (26039 25813 735710 886000) 0 nil]) +([nil nil ((111 . 115)) nil (26039 25813 735709 715000) 0 nil]) +([nil nil ((115 . 119)) nil (26039 25813 735709 482000) 0 nil]) +([nil nil ((119 . 120)) nil (26039 25813 735709 227000) 0 nil]) +([nil nil ((120 . 130)) nil (26039 25813 735708 871000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-variable-name-face fontified t)) . -125) (undo-tree-id67 . -1) 126) nil (26039 25813 735708 518000) 0 nil]) +([nil nil ((125 . 126)) nil (26039 25813 735707 937000) 0 nil]) +([nil nil ((131 . 133)) nil (26039 25813 735707 676000) 0 nil]) +([nil nil ((133 . 137) (132 . 136)) nil (26039 25813 735707 333000) 0 nil]) +([nil nil ((137 . 141)) nil (26039 25813 735707 10000) 0 nil]) +([nil nil ((#("t" 0 1 (fontified t)) . -137) (undo-tree-id57 . -1) (undo-tree-id58 . -1) (undo-tree-id59 . -1) (#("h" 0 1 (fontified t)) . -138) (undo-tree-id60 . -1) (undo-tree-id61 . -1) (undo-tree-id62 . -1) (#("s" 0 1 (fontified t)) . -139) (undo-tree-id63 . -1) (undo-tree-id64 . -1) (undo-tree-id65 . -1) (#("i" 0 1 (fontified t)) . -140) (undo-tree-id66 . -1) 141) nil (26039 25813 735706 413000) 0 nil]) +([nil nil ((141 . 144)) nil (26039 25813 735700 975000) 0 nil]) +([nil nil ((#(" + " 0 3 (fontified t)) . 141) (undo-tree-id56 . -3) 144) nil (26039 25813 735700 668000) 0 nil]) +([nil nil ((141 . 148)) nil (26039 25813 735700 6000) 0 nil]) +([nil nil ((#("v" 0 1 (fontified t)) . -144) (undo-tree-id44 . -1) (undo-tree-id45 . -1) (undo-tree-id46 . -1) (#("a" 0 1 (fontified t)) . -145) (undo-tree-id47 . -1) (undo-tree-id48 . -1) (undo-tree-id49 . -1) (#("t" 0 1 (fontified t)) . -146) (undo-tree-id50 . -1) (undo-tree-id51 . -1) (undo-tree-id52 . -1) (#("e" 0 1 (fontified t)) . -147) (undo-tree-id53 . -1) (undo-tree-id54 . -1) (undo-tree-id55 . -1) 148) nil (26039 25813 735699 300000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -141) (undo-tree-id35 . -1) (undo-tree-id36 . -1) (undo-tree-id37 . -1) (#("r" 0 1 (fontified t)) . -142) (undo-tree-id38 . -1) (undo-tree-id39 . -1) (undo-tree-id40 . -1) (#("o" 0 1 (fontified t)) . -143) (undo-tree-id41 . -1) (undo-tree-id42 . -1) (undo-tree-id43 . -1) 144) nil (26039 25813 735695 753000) 0 nil]) +([nil nil ((141 . 144)) nil (26039 25813 735693 46000) 0 nil]) +([nil nil ((144 . 149)) nil (26039 25813 735692 766000) 0 nil]) +([nil nil ((#("a" 0 1 (fontified t)) . -147) (undo-tree-id33 . -1) (#("v" 0 1 (fontified t)) . -148) (undo-tree-id34 . -1) 149) nil (26039 25813 735692 206000) 0 nil]) +([nil nil ((147 . 149)) nil (26039 25813 735691 357000) 0 nil]) +([nil nil ((#("b" 0 1 (fontified t)) . -147) (undo-tree-id31 . -1) (#("a" 0 1 (fontified t)) . -148) (undo-tree-id32 . -1) 149) nil (26039 25813 735690 586000) 0 nil]) +([nil nil ((147 . 149)) nil (26039 25813 735689 530000) 0 nil]) +([nil nil ((apply yas--snippet-revive 144 152 #s(yas--snippet nil nil nil 7 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil nil 7 nil nil nil nil)) (144 . 152) (#("private:" 0 8 (fontified nil)) . 144) (144 . 152) (#("priva" 0 5 (fontified nil)) . 144) (144 . 149) (#("private:" 0 8 (fontified nil)) . -144) (144 . 152) (#("priva" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t) 4 5 (fontified t)) . -144) (undo-tree-id28 . -5) (undo-tree-id29 . -5) (undo-tree-id30 . -5) 149) nil (26039 25813 735688 663000) 0 nil]) +([nil nil ((152 . 155)) nil (26039 25813 735687 95000) 0 nil]) +([nil nil ((155 . 164)) nil (26039 25813 735686 846000) 0 nil]) +([nil nil ((164 . 166)) nil (26039 25813 735686 364000) 0 nil]) +([nil nil ((155 . 158)) nil (26039 25813 735686 114000) 0 nil]) +([nil nil ((153 . 155) (157 . 158) (#(" " 0 2 (fontified nil)) . 153) (158 . 159)) nil (26039 25813 735685 791000) 0 nil]) +([nil nil ((171 . 172)) nil (26039 25813 735685 379000) 0 nil]) +([nil nil ((172 . 175)) nil (26039 25813 735685 140000) 0 nil]) +([nil nil ((#("s" 0 1 (face font-lock-type-face fontified t)) . -104) (undo-tree-id17 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -105) (undo-tree-id18 . -1) (#("d" 0 1 (face font-lock-type-face fontified t)) . -106) (undo-tree-id19 . -1) (#(":" 0 1 (fontified t)) . -107) (undo-tree-id20 . -1) (#(":" 0 1 (fontified t)) . -108) (undo-tree-id21 . -1) (#("s" 0 1 (face font-lock-type-face fontified t)) . -109) (undo-tree-id22 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -110) (undo-tree-id23 . -1) (#("r" 0 1 (face font-lock-type-face fontified t)) . -111) (undo-tree-id24 . -1) (#("i" 0 1 (face font-lock-type-face fontified t)) . -112) (undo-tree-id25 . -1) (#("n" 0 1 (face font-lock-type-face fontified t)) . -113) (undo-tree-id26 . -1) (#("g" 0 1 (face font-lock-type-face fontified t)) . -114) (undo-tree-id27 . -1) 115) nil (26039 25813 735683 856000) 0 nil]) +([nil nil ((104 . 107)) nil (26039 25813 735680 389000) 0 nil]) +([nil nil ((167 . 174)) nil (26039 25813 735680 141000) 0 nil]) +([nil nil ((174 . 175)) nil (26039 25813 735679 889000) 0 nil]) +([nil nil ((175 . 180)) nil (26039 25813 735679 649000) 0 nil]) +([nil nil ((180 . 181)) nil (26039 25813 735679 390000) 0 nil]) +([nil nil ((#("," 0 1 (c-type c-decl-id-start fontified t)) . -174) (undo-tree-id4 . -1) (undo-tree-id5 . -1) (undo-tree-id6 . -1) (#("h" 0 1 (face font-lock-variable-name-face fontified t)) . -175) (undo-tree-id7 . -1) (undo-tree-id8 . -1) (undo-tree-id9 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -176) (undo-tree-id10 . -1) (undo-tree-id11 . -1) (undo-tree-id12 . -1) (#("i" 0 1 (face font-lock-variable-name-face fontified t)) . -177) (undo-tree-id13 . -1) (#("g" 0 1 (face font-lock-variable-name-face fontified t)) . -178) (undo-tree-id14 . -1) (#("h" 0 1 (face font-lock-variable-name-face fontified t)) . -179) (undo-tree-id15 . -1) (#("t" 0 1 (face font-lock-variable-name-face fontified t)) . -180) (undo-tree-id16 . -1) 181) nil (26039 25813 735678 245000) 0 nil]) +([nil nil ((174 . 175)) nil (26039 25813 735673 529000) 0 nil]) +([nil nil ((175 . 178)) nil (26039 25813 735673 154000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-variable-name-face fontified t)) . -176) (undo-tree-id0 . -1) (undo-tree-id1 . -1) (undo-tree-id2 . -1) (#("i" 0 1 (face font-lock-variable-name-face fontified t)) . -177) (undo-tree-id3 . -1) 178) nil (26039 25813 735672 449000) 0 nil]) +([nil nil ((176 . 181)) nil (26039 25813 735650 296000) 0 nil]) +([nil nil ((181 . 182)) nil (26039 25813 735649 976000) 0 nil]) +([nil nil ((184 . 185) 144) nil (26039 25813 735647 7000) 0 nil]) +([nil nil ((184 . 185) (t 26039 25813 790966 437000)) nil (26039 25853 785216 669000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 133) (undo-tree-id132 . -3) 136) nil (26039 25853 785216 11000) 0 nil]) +([nil nil ((nil fontified nil 104 . 105) (104 . 105) (nil fontified nil 112 . 113) (112 . 113) (123 . 124) (#(" + + " 0 1 (fontified t) 1 5 (fontified t) 5 6 (fontified t) 6 8 (fontified nil)) . -124) (134 . 136) (133 . 133) (133 . 134)) nil (26039 25853 785215 191000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 128) (undo-tree-id130 . -1) (undo-tree-id131 . -1) 129) nil (26039 25853 785214 552000) 0 nil]) +([nil nil ((#(" " 0 2 (fontified nil)) . 129) (128 . 129)) nil (26039 25853 785213 466000) 0 nil]) +([nil nil ((128 . 132) (127 . 131)) nil (26039 25853 785213 118000) 0 nil]) +([nil nil ((132 . 137)) nil (26039 25853 785212 758000) 0 nil]) +([nil nil ((137 . 138)) nil (26039 25853 785212 425000) 0 nil]) +([nil nil ((138 . 142)) nil (26039 25853 785212 169000) 0 nil]) +([nil nil ((142 . 147)) nil (26039 25853 785211 893000) 0 nil]) +([nil nil ((147 . 148)) nil (26039 25853 785211 618000) 0 nil]) +([nil nil ((148 . 153)) nil (26039 25853 785211 372000) 0 nil]) +([nil nil ((153 . 158)) nil (26039 25853 785211 118000) 0 nil]) +([nil nil ((158 . 159)) nil (26039 25853 785210 871000) 0 nil]) +([nil nil ((159 . 166)) nil (26039 25853 785210 540000) 0 nil]) +([nil nil ((166 . 167)) nil (26039 25853 785210 258000) 0 nil]) +([nil nil ((167 . 172)) nil (26039 25853 785209 858000) 0 nil]) +([nil nil ((172 . 177)) nil (26039 25853 785209 591000) 0 nil]) +([nil nil ((177 . 178)) nil (26039 25853 785209 316000) 0 nil]) +([nil nil ((178 . 183)) nil (26039 25853 785208 999000) 0 nil]) +([nil nil ((183 . 188)) nil (26039 25853 785208 389000) 0 nil]) +([nil nil ((185 . 191) (#("hei" 0 3 (fontified nil)) . 185) (185 . 188) (#("height" 0 6 (fontified nil)) . -185) (185 . 191) (#("hei" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t)) . -185) (undo-tree-id112 . -3) (undo-tree-id113 . -2) (undo-tree-id114 . -2) (undo-tree-id115 . -2) (undo-tree-id116 . -2) (undo-tree-id117 . -2) (undo-tree-id118 . -3) (undo-tree-id119 . -3) (undo-tree-id120 . -3) (undo-tree-id121 . -3) (undo-tree-id122 . -3) (undo-tree-id123 . -3) (undo-tree-id124 . -3) (undo-tree-id125 . -3) (undo-tree-id126 . -3) (undo-tree-id127 . -3) (undo-tree-id128 . -3) (undo-tree-id129 . -3) 188) nil (26039 25853 785207 19000) 0 nil]) +([nil nil ((191 . 192)) nil (26039 25853 785191 14000) 0 nil]) +([nil nil ((196 . 199) (t 26039 25853 791675 524000)) nil (26039 26098 802585 607000) 0 nil]) +([nil nil ((199 . 202)) nil (26039 26098 802585 269000) 0 nil]) +([nil nil ((#("v" 0 1 (fontified t)) . -199) (undo-tree-id502 . -1) (undo-tree-id503 . -1) (undo-tree-id504 . -1) (#("o" 0 1 (fontified t)) . -200) (undo-tree-id505 . -1) (undo-tree-id506 . -1) (undo-tree-id507 . -1) (#("l" 0 1 (fontified t)) . -201) (undo-tree-id508 . -1) (undo-tree-id509 . -1) (undo-tree-id510 . -1) 202) nil (26039 26098 802584 682000) 0 nil]) +([nil nil ((199 . 206)) nil (26039 26098 802574 494000) 0 nil]) +([nil nil ((#("m" 0 1 (face font-lock-variable-name-face fontified t)) . -205) (undo-tree-id501 . -1) 206) nil (26039 26098 802574 218000) 0 nil]) +([nil nil ((205 . 208)) nil (26039 26098 802572 778000) 0 nil]) +([nil nil ((208 . 209)) nil (26039 26098 802572 599000) 0 nil]) +([nil nil ((#("a" 0 1 (face font-lock-variable-name-face fontified t)) . -208) (undo-tree-id500 . -1) 209) nil (26039 26098 802572 165000) 0 nil]) +([nil nil ((208 . 210)) nil (26039 26098 802571 673000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-variable-name-face fontified t)) . -208) (undo-tree-id497 . -1) (undo-tree-id498 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -209) (undo-tree-id499 . -1) 210) nil (26039 26098 802571 144000) 0 nil]) +([nil nil ((208 . 211)) nil (26039 26098 802570 75000) 0 nil]) +([nil nil ((211 . 213)) nil (26039 26098 802569 731000) 0 nil]) +([nil nil ((212 . 215)) nil (26039 26098 802569 552000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -212) (undo-tree-id488 . -1) (undo-tree-id489 . -1) (undo-tree-id490 . -1) (#("e" 0 1 (fontified t)) . -213) (undo-tree-id491 . -1) (undo-tree-id492 . -1) (undo-tree-id493 . -1) (#("r" 0 1 (fontified t)) . -214) (undo-tree-id494 . -1) (undo-tree-id495 . -1) (undo-tree-id496 . -1) 215) nil (26039 26098 802568 941000) 0 nil]) +([nil nil ((212 . 213)) nil (26039 26098 802566 328000) 0 nil]) +([nil nil ((213 . 220)) nil (26039 26098 802566 12000) 0 nil]) +([nil nil ((#("%" 0 1 (fontified t)) . -219) (undo-tree-id487 . -1) 220) nil (26039 26098 802565 694000) 0 nil]) +([nil nil ((219 . 222)) nil (26039 26098 802565 83000) 0 nil]) +([nil nil ((#("2" 0 1 (face font-lock-variable-name-face fontified t)) . -221) (undo-tree-id486 . -1) 222) nil (26039 26098 802564 761000) 0 nil]) +([nil nil ((221 . 222)) nil (26039 26098 802564 149000) 0 nil]) +([nil nil ((222 . 223)) nil (26039 26098 802563 971000) 0 nil]) +([nil nil ((223 . 231)) nil (26039 26098 802563 705000) 0 nil]) +([nil nil ((231 . 233)) nil (26039 26098 802563 528000) 0 nil]) +([nil nil ((234 . 236)) nil (26039 26098 802563 204000) 0 nil]) +([nil nil ((236 . 240) (235 . 239)) nil (26039 26098 802562 990000) 0 nil]) +([nil nil ((240 . 242)) nil (26039 26098 802562 666000) 0 nil]) +([nil nil ((242 . 244)) nil (26039 26098 802562 471000) 0 nil]) +([nil nil ((#("&" 0 1 (fontified t)) . -219) (undo-tree-id482 . -1) (#("p" 0 1 (face font-lock-variable-name-face fontified t)) . -220) (undo-tree-id483 . -1) (#("1" 0 1 (face font-lock-variable-name-face fontified t)) . -221) (undo-tree-id484 . -1) (#("," 0 1 (c-type c-decl-arg-start fontified t)) . -222) (undo-tree-id485 . -1) 223) nil (26039 26098 802561 557000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 218) (undo-tree-id481 . -1) 219) nil (26039 26098 802559 976000) 0 nil]) +([nil nil ((#("P" 0 1 (face font-lock-type-face fontified t)) . -212) (undo-tree-id475 . -1) (#("e" 0 1 (face font-lock-type-face fontified t)) . -213) (undo-tree-id476 . -1) (#("r" 0 1 (face font-lock-type-face fontified t)) . -214) (undo-tree-id477 . -1) (#("s" 0 1 (face font-lock-type-face fontified t)) . -215) (undo-tree-id478 . -1) (#("o" 0 1 (face font-lock-type-face fontified t)) . -216) (undo-tree-id479 . -1) (#("n" 0 1 (face font-lock-type-face fontified t)) . -217) (undo-tree-id480 . -1) 218) nil (26039 26098 802558 629000) 0 nil]) +([nil nil ((232 . 236)) nil (26039 26098 802556 229000) 0 nil]) +([nil nil ((236 . 237)) nil (26039 26098 802555 930000) 0 nil]) +([nil nil ((237 . 238)) nil (26039 26098 802555 739000) 0 nil]) +([nil nil ((238 . 246)) nil (26039 26098 802555 462000) 0 nil]) +([nil nil ((#("2" 0 1 (face font-lock-variable-name-face fontified t)) . -221) (undo-tree-id474 . -1) 222) nil (26039 26098 802555 225000) 0 nil]) +([nil nil ((245 . 246)) nil (26039 26098 802554 647000) 0 nil]) +([nil nil ((246 . 252) (#("height" 0 6 (fontified nil)) . -246) (246 . 252)) nil (26039 26098 802554 403000) 0 nil]) +([nil nil ((253 . 255)) nil (26039 26098 802554 36000) 0 nil]) +([nil nil ((255 . 261) (254 . 260)) nil (26039 26098 802553 818000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -270) (undo-tree-id472 . -1) (undo-tree-id473 . -1) 271) nil (26039 26098 802553 170000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 267) (undo-tree-id470 . -3) (undo-tree-id471 . -3) 270) nil (26039 26098 802552 305000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-3-face) fontified t)) . -266) (undo-tree-id468 . -1) (undo-tree-id469 . -1) 267) nil (26039 26098 802551 298000) 0 nil]) +([nil nil ((#(" + + " 0 8 (fontified t) 8 12 (fontified t)) . 254) (undo-tree-id465 . -7) (undo-tree-id466 . -12) (undo-tree-id467 . -12) 266) nil (26039 26098 802550 353000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -244) (undo-tree-id423 . -1) (undo-tree-id424 . -1) (undo-tree-id425 . -1) (undo-tree-id426 . -1) (undo-tree-id427 . -1) (#("." 0 1 (fontified t)) . -245) (undo-tree-id428 . -1) (undo-tree-id429 . -1) (undo-tree-id430 . -1) (undo-tree-id431 . -1) (undo-tree-id432 . -1) (#("h" 0 1 (fontified t)) . -246) (undo-tree-id433 . -1) (undo-tree-id434 . -1) (undo-tree-id435 . -1) (undo-tree-id436 . -1) (#("e" 0 1 (fontified t)) . -247) (undo-tree-id437 . -1) (undo-tree-id438 . -1) (undo-tree-id439 . -1) (undo-tree-id440 . -1) (#("i" 0 1 (fontified t)) . -248) (undo-tree-id441 . -1) (undo-tree-id442 . -1) (undo-tree-id443 . -1) (undo-tree-id444 . -1) (#("g" 0 1 (fontified t)) . -249) (undo-tree-id445 . -1) (undo-tree-id446 . -1) (undo-tree-id447 . -1) (undo-tree-id448 . -1) (#("h" 0 1 (fontified t)) . -250) (undo-tree-id449 . -1) (undo-tree-id450 . -1) (undo-tree-id451 . -1) (undo-tree-id452 . -1) (#("t" 0 1 (fontified t)) . -251) (undo-tree-id453 . -1) (undo-tree-id454 . -1) (undo-tree-id455 . -1) (undo-tree-id456 . -1) (#(")" 0 1 (face (rainbow-delimiters-depth-3-face) fontified t)) . -252) (undo-tree-id457 . -1) (undo-tree-id458 . -1) (undo-tree-id459 . -1) (undo-tree-id460 . -1) (#("{" 0 1 (face (rainbow-delimiters-depth-3-face) fontified t)) . -253) (undo-tree-id461 . -1) (undo-tree-id462 . -1) (undo-tree-id463 . -1) (undo-tree-id464 . -1) 254) nil (26039 26098 802547 675000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 243) (undo-tree-id418 . -1) (undo-tree-id419 . -1) (undo-tree-id420 . -1) (undo-tree-id421 . -1) (undo-tree-id422 . -1) 244) nil (26039 26098 802534 71000) 0 nil]) +([nil nil ((#("=" 0 1 (fontified t)) . -241) (undo-tree-id408 . -1) (undo-tree-id409 . -1) (undo-tree-id410 . -1) (undo-tree-id411 . -1) (undo-tree-id412 . -1) (#("=" 0 1 (fontified t)) . -242) (undo-tree-id413 . -1) (undo-tree-id414 . -1) (undo-tree-id415 . -1) (undo-tree-id416 . -1) (undo-tree-id417 . -1) 243) nil (26039 26098 802531 811000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 240) (undo-tree-id403 . -1) (undo-tree-id404 . -1) (undo-tree-id405 . -1) (undo-tree-id406 . -1) (undo-tree-id407 . -1) 241) nil (26039 26098 802528 471000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -228) (undo-tree-id343 . -1) (undo-tree-id344 . -1) (undo-tree-id345 . -1) (undo-tree-id346 . -1) (undo-tree-id347 . -1) (#("f" 0 1 (face font-lock-keyword-face fontified t)) . -229) (undo-tree-id348 . -1) (undo-tree-id349 . -1) (undo-tree-id350 . -1) (undo-tree-id351 . -1) (undo-tree-id352 . -1) (#("(" 0 1 (face (rainbow-delimiters-depth-3-face) fontified t)) . -230) (undo-tree-id353 . -1) (undo-tree-id354 . -1) (undo-tree-id355 . -1) (undo-tree-id356 . -1) (undo-tree-id357 . -1) (#("t" 0 1 (fontified t)) . -231) (undo-tree-id358 . -1) (undo-tree-id359 . -1) (undo-tree-id360 . -1) (undo-tree-id361 . -1) (undo-tree-id362 . -1) (#("h" 0 1 (fontified t)) . -232) (undo-tree-id363 . -1) (undo-tree-id364 . -1) (undo-tree-id365 . -1) (undo-tree-id366 . -1) (undo-tree-id367 . -1) (#("i" 0 1 (fontified t)) . -233) (undo-tree-id368 . -1) (undo-tree-id369 . -1) (undo-tree-id370 . -1) (undo-tree-id371 . -1) (undo-tree-id372 . -1) (#("s" 0 1 (face font-lock-keyword-face fontified t)) . -234) (undo-tree-id373 . -1) (undo-tree-id374 . -1) (undo-tree-id375 . -1) (undo-tree-id376 . -1) (undo-tree-id377 . -1) (#("-" 0 1 (fontified t)) . -235) (undo-tree-id378 . -1) (undo-tree-id379 . -1) (undo-tree-id380 . -1) (undo-tree-id381 . -1) (undo-tree-id382 . -1) (#(">" 0 1 (fontified t)) . -236) (undo-tree-id383 . -1) (undo-tree-id384 . -1) (undo-tree-id385 . -1) (undo-tree-id386 . -1) (undo-tree-id387 . -1) (#("a" 0 1 (fontified t)) . -237) (undo-tree-id388 . -1) (undo-tree-id389 . -1) (undo-tree-id390 . -1) (undo-tree-id391 . -1) (undo-tree-id392 . -1) (#("g" 0 1 (fontified t)) . -238) (undo-tree-id393 . -1) (undo-tree-id394 . -1) (undo-tree-id395 . -1) (undo-tree-id396 . -1) (undo-tree-id397 . -1) (#("e" 0 1 (fontified t)) . -239) (undo-tree-id398 . -1) (undo-tree-id399 . -1) (undo-tree-id400 . -1) (undo-tree-id401 . -1) (undo-tree-id402 . -1) 240) nil (26039 26098 802524 768000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 5 (fontified t)) . 223) (undo-tree-id338 . -5) (undo-tree-id339 . -5) (undo-tree-id340 . -5) (undo-tree-id341 . -5) (undo-tree-id342 . -5) 228) nil (26039 26098 802507 62000) 0 nil]) +([nil nil ((#("&" 0 1 (fontified t)) . -219) (undo-tree-id314 . -1) (undo-tree-id315 . -1) (undo-tree-id316 . -1) (undo-tree-id317 . -1) (undo-tree-id318 . -1) (undo-tree-id319 . -1) (#("p" 0 1 (face font-lock-variable-name-face fontified t)) . -220) (undo-tree-id320 . -1) (undo-tree-id321 . -1) (undo-tree-id322 . -1) (undo-tree-id323 . -1) (undo-tree-id324 . -1) (undo-tree-id325 . -1) (#(")" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -221) (undo-tree-id326 . -1) (undo-tree-id327 . -1) (undo-tree-id328 . -1) (undo-tree-id329 . -1) (undo-tree-id330 . -1) (undo-tree-id331 . -1) (#("{" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -222) (undo-tree-id332 . -1) (undo-tree-id333 . -1) (undo-tree-id334 . -1) (undo-tree-id335 . -1) (undo-tree-id336 . -1) (undo-tree-id337 . -1) 223) nil (26039 26098 802497 102000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 218) (undo-tree-id308 . -1) (undo-tree-id309 . -1) (undo-tree-id310 . -1) (undo-tree-id311 . -1) (undo-tree-id312 . -1) (undo-tree-id313 . -1) 219) nil (26039 26098 802489 944000) 0 nil]) +([nil nil ((#("c" 0 1 (face font-lock-variable-name-face fontified t)) . -204) (undo-tree-id224 . -1) (undo-tree-id225 . -1) (undo-tree-id226 . -1) (undo-tree-id227 . -1) (undo-tree-id228 . -1) (undo-tree-id229 . -1) (#("o" 0 1 (face font-lock-variable-name-face fontified t)) . -205) (undo-tree-id230 . -1) (undo-tree-id231 . -1) (undo-tree-id232 . -1) (undo-tree-id233 . -1) (undo-tree-id234 . -1) (undo-tree-id235 . -1) (#("m" 0 1 (face font-lock-variable-name-face fontified t)) . -206) (undo-tree-id236 . -1) (undo-tree-id237 . -1) (undo-tree-id238 . -1) (undo-tree-id239 . -1) (undo-tree-id240 . -1) (undo-tree-id241 . -1) (#("p" 0 1 (face font-lock-variable-name-face fontified t)) . -207) (undo-tree-id242 . -1) (undo-tree-id243 . -1) (undo-tree-id244 . -1) (undo-tree-id245 . -1) (undo-tree-id246 . -1) (undo-tree-id247 . -1) (#("a" 0 1 (face font-lock-variable-name-face fontified t)) . -208) (undo-tree-id248 . -1) (undo-tree-id249 . -1) (undo-tree-id250 . -1) (undo-tree-id251 . -1) (undo-tree-id252 . -1) (undo-tree-id253 . -1) (#("r" 0 1 (face font-lock-variable-name-face fontified t)) . -209) (undo-tree-id254 . -1) (undo-tree-id255 . -1) (undo-tree-id256 . -1) (undo-tree-id257 . -1) (undo-tree-id258 . -1) (undo-tree-id259 . -1) (#("e" 0 1 (face font-lock-variable-name-face fontified t)) . -210) (undo-tree-id260 . -1) (undo-tree-id261 . -1) (undo-tree-id262 . -1) (undo-tree-id263 . -1) (undo-tree-id264 . -1) (undo-tree-id265 . -1) (#("(" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -211) (undo-tree-id266 . -1) (undo-tree-id267 . -1) (undo-tree-id268 . -1) (undo-tree-id269 . -1) (undo-tree-id270 . -1) (undo-tree-id271 . -1) (#("P" 0 1 (fontified t)) . -212) (undo-tree-id272 . -1) (undo-tree-id273 . -1) (undo-tree-id274 . -1) (undo-tree-id275 . -1) (undo-tree-id276 . -1) (undo-tree-id277 . -1) (#("e" 0 1 (fontified t)) . -213) (undo-tree-id278 . -1) (undo-tree-id279 . -1) (undo-tree-id280 . -1) (undo-tree-id281 . -1) (undo-tree-id282 . -1) (undo-tree-id283 . -1) (#("r" 0 1 (fontified t)) . -214) (undo-tree-id284 . -1) (undo-tree-id285 . -1) (undo-tree-id286 . -1) (undo-tree-id287 . -1) (undo-tree-id288 . -1) (undo-tree-id289 . -1) (#("s" 0 1 (fontified t)) . -215) (undo-tree-id290 . -1) (undo-tree-id291 . -1) (undo-tree-id292 . -1) (undo-tree-id293 . -1) (undo-tree-id294 . -1) (undo-tree-id295 . -1) (#("o" 0 1 (fontified t)) . -216) (undo-tree-id296 . -1) (undo-tree-id297 . -1) (undo-tree-id298 . -1) (undo-tree-id299 . -1) (undo-tree-id300 . -1) (undo-tree-id301 . -1) (#("n" 0 1 (fontified t)) . -217) (undo-tree-id302 . -1) (undo-tree-id303 . -1) (undo-tree-id304 . -1) (undo-tree-id305 . -1) (undo-tree-id306 . -1) (undo-tree-id307 . -1) 218) nil (26039 26098 802485 633000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 203) (undo-tree-id218 . -1) (undo-tree-id219 . -1) (undo-tree-id220 . -1) (undo-tree-id221 . -1) (undo-tree-id222 . -1) (undo-tree-id223 . -1) 204) nil (26039 26098 802455 88000) 0 nil]) +([nil nil ((#("b" 0 1 (fontified t)) . -199) (undo-tree-id194 . -1) (undo-tree-id195 . -1) (undo-tree-id196 . -1) (undo-tree-id197 . -1) (undo-tree-id198 . -1) (undo-tree-id199 . -1) (#("o" 0 1 (fontified t)) . -200) (undo-tree-id200 . -1) (undo-tree-id201 . -1) (undo-tree-id202 . -1) (undo-tree-id203 . -1) (undo-tree-id204 . -1) (undo-tree-id205 . -1) (#("o" 0 1 (fontified t)) . -201) (undo-tree-id206 . -1) (undo-tree-id207 . -1) (undo-tree-id208 . -1) (undo-tree-id209 . -1) (undo-tree-id210 . -1) (undo-tree-id211 . -1) (#("l" 0 1 (face font-lock-type-face c-type c-decl-id-start fontified t)) . -202) (undo-tree-id212 . -1) (undo-tree-id213 . -1) (undo-tree-id214 . -1) (undo-tree-id215 . -1) (undo-tree-id216 . -1) (undo-tree-id217 . -1) 203) nil (26039 26098 802452 594000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 3 (fontified t)) . 196) (undo-tree-id188 . -3) (undo-tree-id189 . -3) (undo-tree-id190 . -3) (undo-tree-id191 . -3) (undo-tree-id192 . -3) (undo-tree-id193 . -3) 199) nil (26039 26098 802444 721000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -195) (undo-tree-id180 . -1) (undo-tree-id181 . -1) (undo-tree-id182 . -1) (undo-tree-id183 . -1) (undo-tree-id184 . -1) (undo-tree-id185 . -1) (undo-tree-id186 . -1) (undo-tree-id187 . -1) 196) nil (26039 26098 802442 593000) 0 nil]) +([nil nil ((195 . 196) (#("}" 0 1 (fontified nil)) . -195) (195 . 196)) nil (26039 26098 802438 67000) 0 nil]) +([nil nil ((#("i" 0 1 (face font-lock-constant-face fontified t)) . -199) (undo-tree-id175 . -1) (#("v" 0 1 (face font-lock-constant-face fontified t)) . -200) (undo-tree-id176 . -1) (#("a" 0 1 (face font-lock-constant-face fontified t)) . -201) (undo-tree-id177 . -1) (#("t" 0 1 (face font-lock-constant-face fontified t)) . -202) (undo-tree-id178 . -1) (#("e" 0 1 (face font-lock-keyword-face fontified t)) . -203) (undo-tree-id179 . -1) 204) nil (26039 26098 802436 913000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-constant-face fontified t)) . -198) (undo-tree-id174 . -1) 199) nil (26039 26098 802435 101000) 0 nil]) +([nil nil ((198 . 203)) nil (26039 26098 802434 436000) 0 nil]) +([nil nil ((246 . 246) (246 . 247) (245 . 245) (245 . 246)) nil (26039 26098 802434 184000) 0 nil]) +([nil nil ((247 . 249)) nil (26039 26098 802433 735000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -247) (undo-tree-id168 . -1) (undo-tree-id169 . -1) (undo-tree-id170 . -1) (#("n" 0 1 (fontified t)) . -248) (undo-tree-id171 . -1) (undo-tree-id172 . -1) (undo-tree-id173 . -1) 249) nil (26039 26098 802433 204000) 0 nil]) +([nil nil ((247 . 256)) nil (26039 26098 802431 103000) 0 nil]) +([nil nil ((256 . 261)) nil (26039 26098 802430 897000) 0 nil]) +([nil nil ((#("c" 0 1 (fontified t)) . -257) (undo-tree-id156 . -1) (undo-tree-id157 . -1) (undo-tree-id158 . -1) (#("o" 0 1 (fontified t)) . -258) (undo-tree-id159 . -1) (undo-tree-id160 . -1) (undo-tree-id161 . -1) (#("m" 0 1 (fontified t)) . -259) (undo-tree-id162 . -1) (undo-tree-id163 . -1) (undo-tree-id164 . -1) (#("p" 0 1 (fontified t)) . -260) (undo-tree-id165 . -1) (undo-tree-id166 . -1) (undo-tree-id167 . -1) 261) nil (26039 26098 802430 239000) 0 nil]) +([nil nil ((257 . 259)) nil (26039 26098 802344 409000) 0 nil]) +([nil nil ((259 . 261)) nil (26039 26098 802344 130000) 0 nil]) +([nil nil ((260 . 270)) nil (26039 26098 802343 953000) 0 nil]) +([nil nil ((270 . 271)) nil (26039 26098 802343 663000) 0 nil]) +([nil nil ((271 . 281)) nil (26039 26098 802343 487000) 0 nil]) +([nil nil ((282 . 284)) nil (26039 26098 802343 223000) 0 nil]) +([nil nil ((284 . 286) (283 . 286)) nil (26039 26098 802343 17000) 0 nil]) +([nil nil ((286 . 288)) nil (26039 26098 802342 679000) 0 nil]) +([nil nil ((288 . 290)) nil (26039 26098 802342 491000) 0 nil]) +([nil nil ((289 . 292)) nil (26039 26098 802342 206000) 0 nil]) +([nil nil ((#("2" 0 1 (fontified t)) . -290) (undo-tree-id150 . -1) (undo-tree-id151 . -1) (undo-tree-id152 . -1) (#("." 0 1 (fontified t)) . -291) (undo-tree-id153 . -1) (undo-tree-id154 . -1) (undo-tree-id155 . -1) 292) nil (26039 26098 802341 711000) 0 nil]) +([nil nil ((290 . 293)) nil (26039 26098 802339 791000) 0 nil]) +([nil nil ((#("m" 0 1 (fontified t)) . -292) (undo-tree-id147 . -1) (undo-tree-id148 . -1) (undo-tree-id149 . -1) 293) nil (26039 26098 802339 450000) 0 nil]) +([nil nil ((292 . 305)) nil (26039 26098 802338 197000) 0 nil]) +([nil nil ((306 . 308)) nil (26039 26098 802338 10000) 0 nil]) +([nil nil ((308 . 312) (307 . 311)) nil (26039 26098 802337 696000) 0 nil]) +([nil nil ((312 . 322)) nil (26039 26098 802337 375000) 0 nil]) +([nil nil ((322 . 328) (#("height" 0 6 (fontified nil)) . -322) (322 . 328)) nil (26039 26098 802337 21000) 0 nil]) +([nil nil ((328 . 329)) nil (26039 26098 802336 694000) 0 nil]) +([nil nil ((329 . 332)) nil (26039 26098 802336 401000) 0 nil]) +([nil nil ((332 . 338) (#("height" 0 6 (fontified nil)) . -332) (332 . 338)) nil (26039 26098 802335 993000) 0 nil]) +([nil nil ((342 . 345)) nil (26039 26098 802335 542000) 0 nil]) +([nil nil ((#(" + " 0 3 (fontified t)) . 342) (undo-tree-id146 . -3) 345) nil (26039 26098 802335 35000) 0 nil]) +([nil nil ((342 . 346)) nil (26039 26098 802334 350000) 0 nil]) +([nil nil ((339 . 345) (#(" " 0 2 (fontified nil)) . 339) (346 . 348) (#("else" 0 1 (face font-lock-keyword-face fontified nil) 1 2 (face font-lock-keyword-face fontified nil) 2 3 (face font-lock-keyword-face fontified nil) 3 4 (face font-lock-keyword-face fontified nil)) . 346) (undo-tree-id143 . -4) (undo-tree-id144 . -4) (undo-tree-id145 . -4) (342 . 346) 346) nil (26039 26098 802333 843000) 0 nil]) +([nil nil ((352 . 356) (351 . 355)) nil (26039 26098 802332 27000) 0 nil]) +([nil nil ((356 . 360)) nil (26039 26098 802331 667000) 0 nil]) +([nil nil ((#("t" 0 1 (fontified t)) . -357) (undo-tree-id134 . -1) (undo-tree-id135 . -1) (undo-tree-id136 . -1) (#("e" 0 1 (fontified t)) . -358) (undo-tree-id137 . -1) (undo-tree-id138 . -1) (undo-tree-id139 . -1) (#("u" 0 1 (fontified t)) . -359) (undo-tree-id140 . -1) (undo-tree-id141 . -1) (undo-tree-id142 . -1) 360) nil (26039 26098 802330 813000) 0 nil]) +([nil nil ((357 . 363)) nil (26039 26098 802327 588000) 0 nil]) +([nil nil ((363 . 369)) nil (26039 26098 802327 195000) 0 nil]) +([nil nil ((#("2" 0 1 (fontified t)) . -364) (undo-tree-id133 . -1) 365) nil (26039 26098 802326 423000) 0 nil]) +([nil nil ((364 . 365)) nil (26039 26098 802319 369000) 0 nil]) +([nil nil ((369 . 370)) nil (26039 26098 802319 84000) 0 nil]) +([nil nil ((370 . 371)) nil (26039 26098 802318 810000) 0 nil]) +([nil nil ((371 . 378)) nil (26039 26098 802318 425000) 0 nil]) +([nil nil ((378 . 379)) nil (26039 26098 802314 660000) 0 nil]) +([nil nil ((338 . 339) (t 26039 26098 806968 278000)) nil (26039 26101 449254 649000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t) 1 7 (fontified t)) . 339) (undo-tree-id816 . -7) 346 (t 26039 26101 454950 406000)) nil (26039 26502 357425 261000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -338) (undo-tree-id814 . -1) (undo-tree-id815 . -1) 339) nil (26039 26502 357424 582000) 0 nil]) +([nil nil ((338 . 339)) nil (26039 26502 357423 761000) 0 nil]) +([nil nil ((339 . 342)) nil (26039 26502 357423 587000) 0 nil]) +([nil nil ((381 . 382) (#(" " 0 1 (fontified nil)) . 381) (383 . 384)) nil (26039 26502 357423 206000) 0 nil]) +([nil nil ((282 . 283)) nil (26039 26502 357422 964000) 0 nil]) +([nil nil ((283 . 284)) nil (26039 26502 357422 683000) 0 nil]) +([nil nil ((284 . 288)) nil (26039 26502 357422 507000) 0 nil]) +([nil nil ((386 . 389)) nil (26039 26502 357422 243000) 0 nil]) +([nil nil ((#(" + " 0 3 (fontified t)) . 386) (undo-tree-id813 . -3) 389) nil (26039 26502 357421 953000) 0 nil]) +([nil nil ((396 . 396) (396 . 397) (256 . 257) (257 . 258) (nil fontified nil 271 . 272) (271 . 272) (282 . 283) (284 . 285) (288 . 289) (#(" " 0 1 (fontified t)) . -387) 388 (390 . 390) (390 . 391)) nil (26039 26502 357421 95000) 0 nil]) +([nil nil ((397 . 405)) nil (26039 26502 357420 530000) 0 nil]) +([nil nil ((apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 410 432 nil nil nil nil #s(yas--exit 438 nil))) #s(yas--exit 438 nil) 8 nil #s(yas--field 1 410 432 nil nil nil nil #s(yas--exit 438 nil)) nil nil)) (439 . 441) (#(" " 0 4 (fontified nil)) . -439) (436 . 438) (#(" " 0 4 (fontified nil)) . -436) (401 . 457) (#("main" 0 4 (face font-lock-variable-name-face fontified t)) . 401) (undo-tree-id810 . -4) (undo-tree-id811 . -4) (undo-tree-id812 . -4) 405) nil (26039 26502 357419 870000) 0 nil]) +([nil nil ((apply yas--snippet-revive 401 453 #s(yas--snippet nil (#s(yas--field 1 410 432 nil nil nil nil #s(yas--exit 438 nil))) #s(yas--exit 438 nil) 8 nil #s(yas--field 1 410 432 nil nil nil nil #s(yas--exit 438 nil)) nil nil))) nil (26039 26502 357418 716000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 400) (undo-tree-id807 . -1) (undo-tree-id808 . -1) (undo-tree-id809 . -1) 401) nil (26039 26502 357418 373000) 0 nil]) +([nil nil ((#("i" 0 1 (face font-lock-type-face fontified t)) . -397) (undo-tree-id798 . -1) (undo-tree-id799 . -1) (undo-tree-id800 . -1) (#("n" 0 1 (face font-lock-type-face fontified t)) . -398) (undo-tree-id801 . -1) (undo-tree-id802 . -1) (undo-tree-id803 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -399) (undo-tree-id804 . -1) (undo-tree-id805 . -1) (undo-tree-id806 . -1) 400) nil (26039 26502 357416 889000) 0 nil]) +([nil nil ((434 . 438)) nil (26039 26502 357413 870000) 0 nil]) +([nil nil ((438 . 439)) nil (26039 26502 357413 713000) 0 nil]) +([nil nil ((439 . 445)) nil (26039 26502 357413 451000) 0 nil]) +([nil nil ((445 . 446)) nil (26039 26502 357413 296000) 0 nil]) +([nil nil ((446 . 448)) nil (26039 26502 357413 39000) 0 nil]) +([nil nil ((448 . 449)) nil (26039 26502 357412 882000) 0 nil]) +([nil nil ((449 . 452)) nil (26039 26502 357412 617000) 0 nil]) +([nil nil ((434 . 437)) nil (26039 26502 357412 445000) 0 nil]) +([nil nil ((432 . 434) (#(" " 0 1 (fontified nil)) . 432) (437 . 438) (432 . 433) (#(" " 0 2 (fontified nil)) . 432) (437 . 438)) nil (26039 26502 357412 77000) 0 nil]) +([nil nil ((457 . 460)) nil (26039 26502 357411 711000) 0 nil]) +([nil nil ((#("p" 0 1 (fontified t)) . -457) (undo-tree-id789 . -1) (undo-tree-id790 . -1) (undo-tree-id791 . -1) (#("e" 0 1 (fontified t)) . -458) (undo-tree-id792 . -1) (undo-tree-id793 . -1) (undo-tree-id794 . -1) (#("r" 0 1 (fontified t)) . -459) (undo-tree-id795 . -1) (undo-tree-id796 . -1) (undo-tree-id797 . -1) 460) nil (26039 26502 357410 950000) 0 nil]) +([nil nil ((457 . 458)) nil (26039 26502 357408 652000) 0 nil]) +([nil nil ((#("L" 0 1 (fontified t)) . -457) (undo-tree-id788 . -1) 458) nil (26039 26502 357408 347000) 0 nil]) +([nil nil ((457 . 463)) nil (26039 26502 357407 778000) 0 nil]) +([nil nil ((459 . 464) (#("push" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -459) (undo-tree-id785 . -4) (undo-tree-id786 . -4) (undo-tree-id787 . -4) 463) nil (26039 26502 357407 339000) 0 nil]) +([nil nil ((464 . 468)) nil (26039 26502 357406 360000) 0 nil]) +([nil nil ((468 . 470)) nil (26039 26502 357406 96000) 0 nil]) +([nil nil ((470 . 471)) nil (26039 26502 357405 936000) 0 nil]) +([nil nil ((469 . 471)) nil (26039 26502 357405 676000) 0 nil]) +([nil nil ((#("r" 0 1 (fontified t)) . -470) (undo-tree-id782 . -1) (undo-tree-id783 . -1) (undo-tree-id784 . -1) 471) nil (26039 26502 357405 432000) 0 nil]) +([nil nil ((470 . 475)) nil (26039 26502 357404 350000) 0 nil]) +([nil nil ((475 . 477)) nil (26039 26502 357404 178000) 0 nil]) +([nil nil ((477 . 481) (476 . 478) (#("\"" 0 1 (face (rainbow-delimiters-depth-3-face) fontified nil)) . -476) (476 . 477)) nil (26039 26502 357403 932000) 0 nil]) +([nil nil ((#("H" 0 1 (face font-lock-string-face fontified t)) . -477) (undo-tree-id774 . -1) (undo-tree-id775 . -1) (#("e" 0 1 (face font-lock-string-face fontified t)) . -478) (undo-tree-id776 . -1) (undo-tree-id777 . -1) (#("o" 0 1 (face font-lock-string-face fontified t)) . -479) (undo-tree-id778 . -1) (undo-tree-id779 . -1) (#("g" 0 1 (face font-lock-string-face fontified t)) . -480) (undo-tree-id780 . -1) (undo-tree-id781 . -1) 481) nil (26039 26502 357403 270000) 0 nil]) +([nil nil ((477 . 478)) nil (26039 26502 357400 443000) 0 nil]) +([nil nil ((#("L" 0 1 (face font-lock-string-face fontified t)) . -477) (undo-tree-id772 . -1) (undo-tree-id773 . -1) 478) nil (26039 26502 357400 164000) 0 nil]) +([nil nil ((477 . 481)) nil (26039 26502 357399 302000) 0 nil]) +([nil nil ((481 . 488)) nil (26039 26502 357399 145000) 0 nil]) +([nil nil ((490 . 491)) nil (26039 26502 357398 609000) 0 nil]) +([nil nil ((#("," 0 1 (fontified t)) . -490) (undo-tree-id770 . -1) (undo-tree-id771 . -1) 491) nil (26039 26502 357398 393000) 0 nil]) +([nil nil ((489 . 490)) nil (26039 26502 357397 509000) 0 nil]) +([nil nil ((490 . 492)) nil (26039 26502 357397 342000) 0 nil]) +([nil nil ((492 . 493)) nil (26039 26502 357397 84000) 0 nil]) +([nil nil ((493 . 495)) nil (26039 26502 357396 929000) 0 nil]) +([nil nil ((495 . 496)) nil (26039 26502 357396 678000) 0 nil]) +([nil nil ((499 . 502)) nil (26039 26502 357396 508000) 0 nil]) +([nil nil ((502 . 503)) nil (26039 26502 357396 225000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -502) (undo-tree-id769 . -1) 503) nil (26039 26502 357396 2000) 0 nil]) +([nil nil ((502 . 508)) nil (26039 26502 357395 352000) 0 nil]) +([nil nil ((504 . 509) (#("push" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -504) (undo-tree-id766 . -4) (undo-tree-id767 . -4) (undo-tree-id768 . -4) 508) nil (26039 26502 357395 79000) 0 nil]) +([nil nil ((apply yas--snippet-revive 504 515 #s(yas--snippet nil nil #s(yas--exit 514 nil) 9 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil #s(yas--exit 514 nil) 9 nil nil nil nil)) (504 . 515) (#("push_back($0)" 0 13 (fontified nil)) . 504) (504 . 517) (#("push_back(…)" 0 12 (fontified nil)) . -504) (504 . 516) (#("push_" 0 5 (fontified t)) . -504) (undo-tree-id763 . -5) (undo-tree-id764 . -5) (undo-tree-id765 . -5) 509) nil (26039 26502 357393 858000) 0 nil]) +([nil nil ((514 . 520)) nil (26039 26502 357392 483000) 0 nil]) +([nil nil ((520 . 522)) nil (26039 26502 357392 190000) 0 nil]) +([nil nil ((521 . 523) (#("\"" 0 1 (face (rainbow-delimiters-depth-3-face) fontified nil)) . -521) (521 . 522)) nil (26039 26502 357391 902000) 0 nil]) +([nil nil ((522 . 534)) nil (26039 26502 357391 564000) 0 nil]) +([nil nil ((#("n" 0 1 (face font-lock-string-face fontified t)) . -532) (undo-tree-id759 . -1) (undo-tree-id760 . -1) (#("g" 0 1 (face font-lock-string-face fontified t)) . -533) (undo-tree-id761 . -1) (undo-tree-id762 . -1) 534) nil (26039 26502 357391 293000) 0 nil]) +([nil nil ((532 . 535)) nil (26039 26502 357389 950000) 0 nil]) +([nil nil ((536 . 537)) nil (26039 26502 357389 767000) 0 nil]) +([nil nil ((#("3" 0 1 (fontified t)) . -490) (undo-tree-id755 . -1) (undo-tree-id756 . -1) (#("5" 0 1 (fontified t)) . -491) (undo-tree-id757 . -1) (undo-tree-id758 . -1) 492) nil (26039 26502 357389 392000) 0 nil]) +([nil nil ((490 . 492)) nil (26039 26502 357387 215000) 0 nil]) +([nil nil ((#("1" 0 1 (fontified t)) . -490) (undo-tree-id751 . -1) (undo-tree-id752 . -1) (#("2" 0 1 (fontified t)) . -491) (undo-tree-id753 . -1) (undo-tree-id754 . -1) 492) nil (26039 26502 357386 819000) 0 nil]) +([nil nil ((490 . 492)) nil (26039 26502 357385 565000) 0 nil]) +([nil nil ((537 . 539)) nil (26039 26502 357385 275000) 0 nil]) +([nil nil ((539 . 540)) nil (26039 26502 357385 22000) 0 nil]) +([nil nil ((540 . 543)) nil (26039 26502 357384 744000) 0 nil]) +([nil nil ((#("7" 0 1 (fontified t)) . -494) (undo-tree-id747 . -1) (undo-tree-id748 . -1) (#("5" 0 1 (fontified t)) . -495) (undo-tree-id749 . -1) (undo-tree-id750 . -1) 496) nil (26039 26502 357384 390000) 0 nil]) +([nil nil ((494 . 496)) nil (26039 26502 357382 802000) 0 nil]) +([nil nil ((545 . 546)) nil (26039 26502 357382 623000) 0 nil]) +([nil nil ((546 . 549)) nil (26039 26502 357382 279000) 0 nil]) +([nil nil ((549 . 553)) nil (26039 26502 357382 121000) 0 nil]) +([nil nil ((553 . 555)) nil (26039 26502 357381 860000) 0 nil]) +([nil nil ((551 . 556) (#("push" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -551) (undo-tree-id744 . -4) (undo-tree-id745 . -4) (undo-tree-id746 . -4) 555) nil (26039 26502 357381 595000) 0 nil]) +([nil nil ((556 . 560)) nil (26039 26502 357380 315000) 0 nil]) +([nil nil ((560 . 562)) nil (26039 26502 357380 162000) 0 nil]) +([nil nil ((562 . 563)) nil (26039 26502 357379 990000) 0 nil]) +([nil nil ((561 . 567)) nil (26039 26502 357379 836000) 0 nil]) +([nil nil ((567 . 569)) nil (26039 26502 357379 573000) 0 nil]) +([nil nil ((568 . 570) (#("\"" 0 1 (face (rainbow-delimiters-depth-3-face) fontified nil)) . -568) (568 . 569)) nil (26039 26502 357379 270000) 0 nil]) +([nil nil ((569 . 573)) nil (26039 26502 357378 921000) 0 nil]) +([nil nil ((#("q" 0 1 (face font-lock-string-face fontified t)) . -571) (undo-tree-id740 . -1) (undo-tree-id741 . -1) (#("u" 0 1 (face font-lock-string-face fontified t)) . -572) (undo-tree-id742 . -1) (undo-tree-id743 . -1) 573) nil (26039 26502 357378 427000) 0 nil]) +([nil nil ((571 . 579)) nil (26039 26502 357377 8000) 0 nil]) +([nil nil ((580 . 581)) nil (26039 26502 357376 830000) 0 nil]) +([nil nil ((581 . 583)) nil (26039 26502 357376 559000) 0 nil]) +([nil nil ((583 . 584)) nil (26039 26502 357376 398000) 0 nil]) +([nil nil ((584 . 587)) nil (26039 26502 357376 140000) 0 nil]) +([nil nil ((#("-" 0 1 (fontified t)) . -586) (undo-tree-id738 . -1) (undo-tree-id739 . -1) 587) nil (26039 26502 357375 927000) 0 nil]) +([nil nil ((586 . 587)) nil (26039 26502 357375 42000) 0 nil]) +([nil nil ((592 . 594) (#(" " 0 2 (fontified nil)) . 591) (undo-tree-id737 . -2) (590 . 594)) nil (26039 26502 357374 817000) 0 nil]) +([nil nil ((594 . 597)) nil (26039 26502 357374 193000) 0 nil]) +([nil nil ((597 . 599)) nil (26039 26502 357374 30000) 0 nil]) +([nil nil ((598 . 600)) nil (26039 26502 357373 775000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -599) (undo-tree-id734 . -1) (undo-tree-id735 . -1) (undo-tree-id736 . -1) 600) nil (26039 26502 357373 450000) 0 nil]) +([nil nil ((599 . 605)) nil (26039 26502 357349 958000) 0 nil]) +([nil nil ((605 . 606)) nil (26039 26502 357349 779000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -605) (undo-tree-id733 . -1) 606) nil (26039 26502 357349 390000) 0 nil]) +([nil nil ((605 . 606)) nil (26039 26502 357348 775000) 0 nil]) +([nil nil ((606 . 607)) nil (26039 26502 357348 494000) 0 nil]) +([nil nil ((608 . 610)) nil (26039 26502 357348 328000) 0 nil]) +([nil nil ((610 . 614) (609 . 613)) nil (26039 26502 357348 7000) 0 nil]) +([nil nil ((614 . 617)) nil (26039 26502 357347 785000) 0 nil]) +([nil nil ((610 . 614) (#(" " 0 2 (fontified nil)) . 610) (616 . 617) (610 . 612) (#(" " 0 4 (fontified nil)) . 610) (617 . 618)) nil (26039 26502 357347 286000) 0 nil]) +([nil nil ((619 . 623)) nil (26039 26502 357346 940000) 0 nil]) +([nil nil ((623 . 625)) nil (26039 26502 357346 666000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -614) (undo-tree-id704 . -1) (undo-tree-id705 . -1) (undo-tree-id706 . -1) (#("t" 0 1 (fontified t)) . -615) (undo-tree-id707 . -1) (undo-tree-id708 . -1) (undo-tree-id709 . -1) (#("d" 0 1 (fontified t)) . -616) (undo-tree-id710 . -1) (undo-tree-id711 . -1) (undo-tree-id712 . -1) (#(":" 0 1 (c-type c-decl-end fontified t)) . -617) (undo-tree-id713 . -1) (undo-tree-id714 . -1) (undo-tree-id715 . -1) (#(":" 0 1 (fontified t)) . -618) (undo-tree-id716 . -1) (undo-tree-id717 . -1) (undo-tree-id718 . -1) (#("c" 0 1 (fontified t)) . -619) (undo-tree-id719 . -1) (undo-tree-id720 . -1) (undo-tree-id721 . -1) (#("o" 0 1 (fontified t)) . -620) (undo-tree-id722 . -1) (undo-tree-id723 . -1) (undo-tree-id724 . -1) (#("u" 0 1 (fontified t)) . -621) (undo-tree-id725 . -1) (undo-tree-id726 . -1) (undo-tree-id727 . -1) (#("t" 0 1 (fontified t)) . -622) (undo-tree-id728 . -1) (undo-tree-id729 . -1) (undo-tree-id730 . -1) (#("<" 0 1 (fontified t)) . -623) (undo-tree-id731 . -1) (#("<" 0 1 (fontified t)) . -624) (undo-tree-id732 . -1) 625) nil (26039 26502 357345 661000) 0 nil]) +([nil nil ((614 . 620)) nil (26039 26502 357337 160000) 0 nil]) +([nil nil ((620 . 622)) nil (26039 26502 357337 1000) 0 nil]) +([nil nil ((621 . 623) (#("\"" 0 1 (face (rainbow-delimiters-depth-3-face) fontified nil)) . -621) (621 . 622)) nil (26039 26502 357336 693000) 0 nil]) +([nil nil ((622 . 627)) nil (26039 26502 357336 435000) 0 nil]) +([nil nil ((#(" " 0 1 (face font-lock-string-face fontified t)) . -626) (undo-tree-id702 . -1) (undo-tree-id703 . -1) 627) nil (26039 26502 357336 14000) 0 nil]) +([nil nil ((626 . 627)) nil (26039 26502 357335 318000) 0 nil]) +([nil nil ((627 . 628)) nil (26039 26502 357335 56000) 0 nil]) +([nil nil ((#(" " 0 1 (face font-lock-string-face fontified t)) . -627) (undo-tree-id700 . -1) (undo-tree-id701 . -1) 628) nil (26039 26502 357334 732000) 0 nil]) +([nil nil ((627 . 630)) nil (26039 26502 357333 855000) 0 nil]) +([nil nil ((#("a" 0 1 (face font-lock-string-face fontified t)) . -629) (undo-tree-id698 . -1) (undo-tree-id699 . -1) 630) nil (26039 26502 357333 547000) 0 nil]) +([nil nil ((629 . 630)) nil (26039 26502 357332 640000) 0 nil]) +([nil nil ((630 . 633)) nil (26039 26502 357332 482000) 0 nil]) +([nil nil ((633 . 634)) nil (26039 26502 357332 217000) 0 nil]) +([nil nil ((634 . 643)) nil (26039 26502 357331 964000) 0 nil]) +([nil nil ((#("r" 0 1 (face font-lock-string-face fontified t)) . -638) (undo-tree-id688 . -1) (undo-tree-id689 . -1) (#("i" 0 1 (face font-lock-string-face fontified t)) . -639) (undo-tree-id690 . -1) (undo-tree-id691 . -1) (#("g" 0 1 (face font-lock-string-face fontified t)) . -640) (undo-tree-id692 . -1) (undo-tree-id693 . -1) (#("h" 0 1 (face font-lock-string-face fontified t)) . -641) (undo-tree-id694 . -1) (undo-tree-id695 . -1) (#("t" 0 1 (face font-lock-string-face fontified t)) . -642) (undo-tree-id696 . -1) (undo-tree-id697 . -1) 643) nil (26039 26502 357331 343000) 0 nil]) +([nil nil ((638 . 643)) nil (26039 26502 357327 466000) 0 nil]) +([nil nil ((643 . 644)) nil (26039 26502 357327 162000) 0 nil]) +([nil nil ((644 . 646)) nil (26039 26502 357326 991000) 0 nil]) +([nil nil ((628 . 629)) nil (26039 26502 357326 684000) 0 nil]) +([nil nil ((#("4" 0 1 (face font-lock-string-face fontified t)) . -628) (undo-tree-id686 . -1) (undo-tree-id687 . -1) 629) nil (26039 26502 357326 321000) 0 nil]) +([nil nil ((628 . 630)) nil (26039 26502 357325 506000) 0 nil]) +([nil nil ((#("1" 0 1 (face font-lock-string-face fontified t)) . -628) (undo-tree-id682 . -1) (undo-tree-id683 . -1) (#("0" 0 1 (face font-lock-string-face fontified t)) . -629) (undo-tree-id684 . -1) (undo-tree-id685 . -1) 630) nil (26039 26502 357325 136000) 0 nil]) +([nil nil ((628 . 629)) nil (26039 26502 357323 837000) 0 nil]) +([nil nil ((629 . 630)) nil (26039 26502 357323 671000) 0 nil]) +([nil nil ((637 . 638)) nil (26039 26502 357323 410000) 0 nil]) +([nil nil ((648 . 649)) nil (26039 26502 357323 160000) 0 nil]) +([nil nil ((#("s" 0 1 (face font-lock-string-face fontified t)) . -649) (undo-tree-id679 . -1) (undo-tree-id680 . -1) (undo-tree-id681 . -1) 650) nil (26039 26502 357322 669000) 0 nil]) +([nil nil ((649 . 650)) nil (26039 26502 357321 714000) 0 nil]) +([nil nil ((651 . 652)) nil (26039 26502 357321 428000) 0 nil]) +([nil nil ((652 . 654)) nil (26039 26502 357321 147000) 0 nil]) +([nil nil ((654 . 658) (#("name" 0 4 (fontified nil)) . -654) (654 . 658)) nil (26039 26502 357320 937000) 0 nil]) +([nil nil ((658 . 661)) nil (26039 26502 357320 571000) 0 nil]) +([nil nil ((apply yas--snippet-revive 659 666 #s(yas--snippet nil nil nil 10 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil nil 10 nil nil nil nil)) (659 . 666) (#("c_str()" 0 7 (fontified nil)) . 659) (659 . 666) (#("c_str() const" 0 13 (fontified nil)) . -659) (659 . 672) (#("c_" 0 1 (fontified t) 1 2 (fontified t)) . -659) (undo-tree-id676 . -2) (undo-tree-id677 . -2) (undo-tree-id678 . -2) 661) nil (26039 26502 357319 905000) 0 nil]) +([nil nil ((666 . 667)) nil (26039 26502 357318 640000) 0 nil]) +([nil nil ((667 . 670)) nil (26039 26502 357318 382000) 0 nil]) +([nil nil ((669 . 672) (#("age" 0 3 (fontified nil)) . -669) (669 . 672) (#("a" 0 1 (fontified t)) . -669) (undo-tree-id673 . -1) (undo-tree-id674 . -1) (undo-tree-id675 . -1) 670) nil (26039 26502 357317 911000) 0 nil]) +([nil nil ((672 . 674)) nil (26039 26502 357316 748000) 0 nil]) +([nil nil ((#("." 0 1 (fontified t)) . -672) (undo-tree-id667 . -1) (undo-tree-id668 . -1) (undo-tree-id669 . -1) (#("i" 0 1 (fontified t)) . -673) (undo-tree-id670 . -1) (undo-tree-id671 . -1) (undo-tree-id672 . -1) 674) nil (26039 26502 357316 268000) 0 nil]) +([nil nil ((672 . 673)) nil (26039 26502 357314 25000) 0 nil]) +([nil nil ((673 . 674)) nil (26039 26502 357313 751000) 0 nil]) +([nil nil ((674 . 675)) nil (26039 26502 357313 464000) 0 nil]) +([nil nil ((675 . 681) (#("height" 0 6 (fontified nil)) . -675) (675 . 681)) nil (26039 26502 357313 77000) 0 nil]) +([nil nil ((682 . 683)) nil (26039 26502 357312 748000) 0 nil]) +([nil nil ((650 . 652)) nil (26039 26502 357312 498000) 0 nil]) +([nil nil ((689 . 692)) nil (26039 26502 357312 227000) 0 nil]) +([nil nil ((692 . 696)) nil (26039 26502 357311 940000) 0 nil]) +([nil nil ((#("c" 0 1 (fontified t)) . -693) (undo-tree-id658 . -1) (undo-tree-id659 . -1) (undo-tree-id660 . -1) (#("o" 0 1 (fontified t)) . -694) (undo-tree-id661 . -1) (undo-tree-id662 . -1) (undo-tree-id663 . -1) (#("u" 0 1 (fontified t)) . -695) (undo-tree-id664 . -1) (undo-tree-id665 . -1) (undo-tree-id666 . -1) 696) nil (26039 26502 357311 341000) 0 nil]) +([nil nil ((#(" + \\" 0 1 (fontified t) 1 3 (fontified t) 3 4 (c-is-sws t fontified t)) . 689) (undo-tree-id655 . -4) (undo-tree-id656 . -4) (undo-tree-id657 . -4) 693) nil (26039 26502 357308 515000) 0 nil]) +([nil nil ((691 . 693) (#(" " 0 2 (fontified nil)) . 690) (undo-tree-id654 . -2) (689 . 693)) nil (26039 26502 357307 452000) 0 nil]) +([nil nil ((693 . 697)) nil (26039 26502 357306 767000) 0 nil]) +([nil nil ((#("c" 0 1 (fontified t)) . -693) (undo-tree-id642 . -1) (undo-tree-id643 . -1) (undo-tree-id644 . -1) (#("o" 0 1 (fontified t)) . -694) (undo-tree-id645 . -1) (undo-tree-id646 . -1) (undo-tree-id647 . -1) (#("u" 0 1 (fontified t)) . -695) (undo-tree-id648 . -1) (undo-tree-id649 . -1) (undo-tree-id650 . -1) (#("t" 0 1 (fontified t)) . -696) (undo-tree-id651 . -1) (undo-tree-id652 . -1) (undo-tree-id653 . -1) 697) nil (26039 26502 357305 953000) 0 nil]) +([nil nil ((693 . 699)) nil (26039 26502 357302 224000) 0 nil]) +([nil nil ((699 . 701)) nil (26039 26502 357301 965000) 0 nil]) +([nil nil ((700 . 704)) nil (26039 26502 357301 688000) 0 nil]) +([nil nil ((705 . 706)) nil (26039 26502 357301 399000) 0 nil]) +([nil nil ((708 . 710) (#(" " 0 2 (fontified nil)) . 707) (undo-tree-id641 . -2) (706 . 710)) nil (26039 26502 357300 944000) 0 nil]) +([nil nil ((nil rear-nonsticky nil 804 . 805) (nil fontified nil 804 . 805) (nil fontified nil 802 . 804) (nil fontified nil 801 . 802) (nil fontified nil 800 . 801) (nil fontified nil 799 . 800) (nil fontified nil 793 . 799) (nil fontified nil 792 . 793) (nil fontified nil 791 . 792) (nil fontified nil 790 . 791) (nil fontified nil 787 . 790) (nil fontified nil 786 . 787) (nil fontified nil 785 . 786) (nil fontified nil 784 . 785) (nil fontified nil 783 . 784) (nil fontified nil 782 . 783) (nil fontified nil 777 . 782) (nil fontified nil 776 . 777) (nil fontified nil 772 . 776) (nil fontified nil 771 . 772) (nil fontified nil 770 . 771) (nil fontified nil 769 . 770) (nil fontified nil 768 . 769) (nil fontified nil 767 . 768) (nil fontified nil 766 . 767) (nil fontified nil 765 . 766) (nil fontified nil 764 . 765) (nil fontified nil 763 . 764) (nil fontified nil 762 . 763) (nil fontified nil 761 . 762) (nil fontified nil 760 . 761) (nil fontified nil 759 . 760) (nil fontified nil 758 . 759) (nil fontified nil 757 . 758) (nil fontified nil 756 . 757) (nil fontified nil 755 . 756) (nil fontified nil 754 . 755) (nil fontified nil 753 . 754) (nil fontified nil 752 . 753) (nil fontified nil 751 . 752) (nil fontified nil 750 . 751) (nil fontified nil 749 . 750) (nil fontified nil 748 . 749) (nil fontified nil 747 . 748) (nil fontified nil 746 . 747) (nil fontified nil 745 . 746) (nil fontified nil 744 . 745) (nil fontified nil 743 . 744) (nil fontified nil 742 . 743) (nil fontified nil 738 . 742) (nil fontified nil 737 . 738) (nil fontified nil 736 . 737) (nil fontified nil 735 . 736) (nil fontified nil 734 . 735) (nil fontified nil 733 . 734) (nil fontified nil 732 . 733) (nil fontified nil 731 . 732) (nil fontified nil 730 . 731) (nil fontified nil 726 . 730) (nil fontified nil 725 . 726) (nil fontified nil 724 . 725) (nil fontified nil 723 . 724) (nil fontified nil 722 . 723) (nil fontified nil 721 . 722) (nil fontified nil 720 . 721) (nil fontified nil 719 . 720) (nil fontified nil 718 . 719) (nil fontified nil 717 . 718) (nil fontified nil 716 . 717) (nil fontified nil 715 . 716) (nil fontified nil 714 . 715) (nil fontified nil 713 . 714) (nil fontified nil 712 . 713) (nil fontified nil 711 . 712) (nil fontified nil 710 . 711) (710 . 805)) nil (26039 26502 357299 430000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t display #("^J" 0 2 (face escape-glyph)))) . 801) (undo-tree-id640 . -1) 802) nil (26039 26502 357297 62000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -800) (undo-tree-id639 . -1) 801) nil (26039 26502 357296 483000) 0 nil]) +([nil nil ((800 . 801)) nil (26039 26502 357295 897000) 0 nil]) +([nil nil ((#(" + " 0 1 (fontified t display #("^J" 0 2 (face escape-glyph))) 1 2 (fontified t)) . 725) (undo-tree-id638 . -2) 727) nil (26039 26502 357295 560000) 0 nil]) +([nil nil ((#("{" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . -724) (undo-tree-id637 . -1) 725) nil (26039 26502 357294 867000) 0 nil]) +([nil nil ((724 . 725)) nil (26039 26502 357294 272000) 0 nil]) +([nil nil ((726 . 730) (#(" " 0 3 (fontified nil)) . 726) (725 . 726)) nil (26039 26502 357293 920000) 0 nil]) +([nil nil ((802 . 804) (#(" " 0 2 (fontified nil)) . 801) (undo-tree-id635 . -2) (undo-tree-id636 . -2) (803 . 804)) nil (26039 26502 357293 420000) 0 nil]) +([nil nil ((807 . 809) (#(" " 0 2 (fontified nil)) . 806) (undo-tree-id634 . -2) (805 . 809)) nil (26039 26502 357292 266000) 0 nil]) +([nil nil ((809 . 817)) nil (26039 26502 357291 644000) 0 nil]) +([nil nil ((817 . 818)) nil (26039 26502 357291 375000) 0 nil]) +([nil nil ((#("0" 0 1 (fontified t)) . -816) (undo-tree-id632 . -1) (#(";" 0 1 (fontified t)) . -817) (undo-tree-id633 . -1) 818) nil (26039 26502 357291 14000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 815) (undo-tree-id631 . -1) 816) nil (26039 26502 357289 975000) 0 nil]) +([nil nil ((#("r" 0 1 (fontified t)) . -809) (undo-tree-id613 . -1) (undo-tree-id614 . -1) (undo-tree-id615 . -1) (#("e" 0 1 (fontified t)) . -810) (undo-tree-id616 . -1) (undo-tree-id617 . -1) (undo-tree-id618 . -1) (#("t" 0 1 (fontified t)) . -811) (undo-tree-id619 . -1) (undo-tree-id620 . -1) (undo-tree-id621 . -1) (#("u" 0 1 (fontified t)) . -812) (undo-tree-id622 . -1) (undo-tree-id623 . -1) (undo-tree-id624 . -1) (#("r" 0 1 (fontified t)) . -813) (undo-tree-id625 . -1) (undo-tree-id626 . -1) (undo-tree-id627 . -1) (#("n" 0 1 (face font-lock-keyword-face fontified t)) . -814) (undo-tree-id628 . -1) (undo-tree-id629 . -1) (undo-tree-id630 . -1) 815) nil (26039 26502 357288 443000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 805) (undo-tree-id612 . -1) 806) nil (26039 26502 357283 389000) 0 nil]) +([nil nil ((707 . 710)) nil (26039 26502 357282 892000) 0 nil]) +([nil nil ((710 . 714)) nil (26039 26502 357282 579000) 0 nil]) +([nil nil ((apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) #s(yas--field 2 743 745 nil nil nil nil nil)) #s(yas--exit 734 #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil))) 11 nil #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) nil nil)) (710 . 733) (#("cout" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . 710) (undo-tree-id583 . -4) (undo-tree-id584 . -2) (undo-tree-id585 . -2) (undo-tree-id586 . -2) (undo-tree-id587 . -2) (undo-tree-id588 . -2) (undo-tree-id589 . -3) (undo-tree-id590 . -3) (undo-tree-id591 . -3) (undo-tree-id592 . -3) (undo-tree-id593 . -3) (undo-tree-id594 . -3) (undo-tree-id595 . -3) (undo-tree-id596 . -3) (undo-tree-id597 . -3) (undo-tree-id598 . -3) (undo-tree-id599 . -4) (undo-tree-id600 . -4) (undo-tree-id601 . -4) (undo-tree-id602 . -4) (undo-tree-id603 . -4) (undo-tree-id604 . -4) (undo-tree-id605 . -4) (undo-tree-id606 . -4) (undo-tree-id607 . -4) (undo-tree-id608 . -4) (undo-tree-id609 . -4) (undo-tree-id610 . -4) (undo-tree-id611 . -4) 714) nil (26039 26502 357281 867000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 722) (undo-tree-id568 . -1) (undo-tree-id569 . -1) (undo-tree-id570 . -1) (undo-tree-id571 . -1) (undo-tree-id572 . -1) (undo-tree-id573 . -1) (undo-tree-id574 . -1) (undo-tree-id575 . -1) (undo-tree-id576 . -1) (undo-tree-id577 . -1) (undo-tree-id578 . -1) (undo-tree-id579 . -1) (undo-tree-id580 . -1) (undo-tree-id581 . -1) (undo-tree-id582 . -1) 723) nil (26039 26502 357270 869000) 0 nil]) +([nil nil ((#("<" 0 1 (fontified t)) . -720) (undo-tree-id511 . -1) (undo-tree-id512 . -1) (undo-tree-id513 . -1) (undo-tree-id514 . -1) (undo-tree-id515 . -1) (undo-tree-id516 . -1) (undo-tree-id517 . -1) (undo-tree-id518 . -1) (undo-tree-id519 . -1) (undo-tree-id520 . -1) (undo-tree-id521 . -1) (undo-tree-id522 . -1) (undo-tree-id523 . -1) (undo-tree-id524 . -1) (undo-tree-id525 . -1) (undo-tree-id526 . -1) (undo-tree-id527 . -1) (undo-tree-id528 . -1) (undo-tree-id529 . -1) (undo-tree-id530 . -1) (undo-tree-id531 . -1) (undo-tree-id532 . -1) (undo-tree-id533 . -1) (undo-tree-id534 . -1) (undo-tree-id535 . -1) (undo-tree-id536 . -1) (undo-tree-id537 . -1) (undo-tree-id538 . -1) (undo-tree-id539 . -1) (undo-tree-id540 . -1) (undo-tree-id541 . -1) (undo-tree-id542 . -1) (undo-tree-id543 . -1) (#("<" 0 1 (fontified t)) . -721) (undo-tree-id544 . -1) (undo-tree-id545 . -1) (undo-tree-id546 . -1) (undo-tree-id547 . -1) (undo-tree-id548 . -1) (undo-tree-id549 . -1) (undo-tree-id550 . -1) (undo-tree-id551 . -1) (undo-tree-id552 . -1) (undo-tree-id553 . -1) (undo-tree-id554 . -1) (undo-tree-id555 . -1) (undo-tree-id556 . -1) (undo-tree-id557 . -1) (undo-tree-id558 . -1) (undo-tree-id559 . -1) (undo-tree-id560 . -1) (undo-tree-id561 . -1) (undo-tree-id562 . -1) (undo-tree-id563 . -1) (undo-tree-id564 . -1) (undo-tree-id565 . -1) (undo-tree-id566 . -1) (undo-tree-id567 . -1) 722) nil (26039 26502 357263 700000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 719) (undo-tree-id881 . -1) (undo-tree-id882 . -1) (undo-tree-id883 . -1) (undo-tree-id884 . -1) (undo-tree-id885 . -1) 720 (t 26039 26502 364339 657000)) nil (26039 26571 635527 334000) 0 nil]) +([nil nil ((#("u" 0 1 (fontified t)) . -717) (undo-tree-id871 . -1) (undo-tree-id872 . -1) (undo-tree-id873 . -1) (undo-tree-id874 . -1) (undo-tree-id875 . -1) (#("t" 0 1 (fontified t)) . -718) (undo-tree-id876 . -1) (undo-tree-id877 . -1) (undo-tree-id878 . -1) (undo-tree-id879 . -1) (undo-tree-id880 . -1) 719) nil (26039 26571 635525 262000) 0 nil]) +([nil nil ((717 . 719)) nil (26039 26571 635522 475000) 0 nil]) +([nil nil ((1 . 20) (apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 736 736 nil nil nil t nil)) nil 12 nil #s(yas--field 1 736 736 nil nil nil t nil) #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) nil)) (715 . 743) (#("codecvt_utf16<${1:typename Elem}>" 0 33 (fontified nil)) . 715) (undo-tree-id862 . -33) (715 . 748) (#("cou" 0 3 (fontified nil)) . 715) (undo-tree-id863 . -3) (715 . 718) (#("codecvt_utf16" 0 13 (fontified nil) 13 14 (fontified nil c-<>-c-types-set t category c-<-as-paren-syntax) 14 27 (fontified nil) 27 28 (fontified nil c-type c-<>-arg-sep) 28 50 (fontified nil) 50 51 (fontified nil c-type c-<>-arg-sep) 51 69 (fontified nil) 69 70 (fontified nil category c->-as-paren-syntax)) . -715) (undo-tree-id864 . -70) (715 . 785) (#("cout" 0 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -715) (undo-tree-id865 . -4) (undo-tree-id866 . -2) (undo-tree-id867 . -4) (undo-tree-id868 . -2) (undo-tree-id869 . -4) (undo-tree-id870 . -4) 719) nil (26039 26571 635521 611000) 0 nil]) +([nil nil ((#("typename Elem" 0 8 (face font-lock-keyword-face fontified t) 8 9 (fontified t) 9 13 (face font-lock-type-face fontified t)) . 748)) nil (26039 26571 635517 237000) 0 nil]) +([nil nil ((#("d" 0 1 (fontified t)) . -736) (undo-tree-id826 . -1) (undo-tree-id827 . -1) (undo-tree-id828 . -1) (#("e" 0 1 (fontified t)) . -737) (undo-tree-id829 . -1) (undo-tree-id830 . -1) (undo-tree-id831 . -1) (#("c" 0 1 (fontified t)) . -738) (undo-tree-id832 . -1) (undo-tree-id833 . -1) (undo-tree-id834 . -1) (#("v" 0 1 (fontified t)) . -739) (undo-tree-id835 . -1) (undo-tree-id836 . -1) (undo-tree-id837 . -1) (#("t" 0 1 (fontified t)) . -740) (undo-tree-id838 . -1) (undo-tree-id839 . -1) (undo-tree-id840 . -1) (#("_" 0 1 (fontified t)) . -741) (undo-tree-id841 . -1) (undo-tree-id842 . -1) (undo-tree-id843 . -1) (#("u" 0 1 (fontified t)) . -742) (undo-tree-id844 . -1) (undo-tree-id845 . -1) (undo-tree-id846 . -1) (#("t" 0 1 (fontified t)) . -743) (undo-tree-id847 . -1) (undo-tree-id848 . -1) (undo-tree-id849 . -1) (#("f" 0 1 (fontified t)) . -744) (undo-tree-id850 . -1) (undo-tree-id851 . -1) (undo-tree-id852 . -1) (#("1" 0 1 (fontified t)) . -745) (undo-tree-id853 . -1) (undo-tree-id854 . -1) (undo-tree-id855 . -1) (#("6" 0 1 (fontified t)) . -746) (undo-tree-id856 . -1) (undo-tree-id857 . -1) (undo-tree-id858 . -1) (#("<" 0 1 (face (rainbow-delimiters-depth-2-face) c-<>-c-types-set t fontified t)) . -747) (undo-tree-id859 . -1) (undo-tree-id860 . -1) (undo-tree-id861 . -1) 748) nil (26039 26571 635515 454000) 0 nil]) +([nil nil ((apply yas--snippet-revive 734 737 #s(yas--snippet nil (#s(yas--field 1 736 736 nil nil nil t nil)) nil 12 nil #s(yas--field 1 736 736 nil nil nil t nil) #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) nil))) nil (26039 26571 635502 40000) 0 nil]) +([nil nil ((#(">" 0 1 (fontified t)) . -736) (undo-tree-id824 . -1) (undo-tree-id825 . -1) 737) nil (26039 26571 635501 628000) 0 nil]) +([nil nil ((736 . 738)) nil (26039 26571 635500 400000) 0 nil]) +([nil nil ((#("u" 0 1 (fontified t)) . -737) (undo-tree-id822 . -1) (undo-tree-id823 . -1) 738) nil (26039 26571 635499 999000) 0 nil]) +([nil nil ((737 . 738)) nil (26039 26571 635498 879000) 0 nil]) +([nil nil ((#("o" 0 1 (fontified t)) . -736) (undo-tree-id817 . -1) (undo-tree-id818 . -1) (undo-tree-id819 . -1) (#("t" 0 1 (fontified t)) . -737) (undo-tree-id820 . -1) (undo-tree-id821 . -1) 738) nil (26039 26571 635498 62000) 0 nil]) +([nil nil ((736 . 738)) nil (26039 26571 635489 77000) 0 nil]) +([nil nil ((apply yas--snippet-revive 729 748 #s(yas--snippet nil (#s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) #s(yas--field 2 743 745 nil nil nil nil nil)) #s(yas--exit 734 #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil))) 11 nil #s(yas--field 1 734 738 nil nil nil t #s(yas--field 2 743 745 nil nil nil nil nil)) nil nil))) nil (26039 26571 635485 922000) 0 nil]) +([nil nil ((#("h" 0 1 (fontified t)) . -197) (undo-tree-id25 . -1) (undo-tree-id26 . -1) (#("e" 0 1 (fontified t)) . -198) (undo-tree-id27 . -1) (undo-tree-id28 . -1) 199 (t 26039 26571 639902 617000)) nil (26039 27126 866505 976000) 0 nil]) +([nil nil ((197 . 201)) nil (26039 27126 866503 560000) 0 nil]) +([nil nil ((#("r" 0 1 (fontified t)) . -199) (undo-tree-id0 . -1) (undo-tree-id1 . -1) (undo-tree-id2 . -1) (undo-tree-id3 . -1) (undo-tree-id4 . -1) (undo-tree-id5 . -1) (undo-tree-id6 . -1) (undo-tree-id7 . -1) (undo-tree-id8 . -1) (undo-tree-id9 . -1) (undo-tree-id10 . -1) (undo-tree-id11 . -1) (undo-tree-id12 . -1) (undo-tree-id13 . -1) (undo-tree-id14 . -1) (undo-tree-id15 . -1) (undo-tree-id16 . -1) (#("i" 0 1 (fontified t)) . -200) (undo-tree-id17 . -1) (undo-tree-id18 . -1) (undo-tree-id19 . -1) (undo-tree-id20 . -1) (undo-tree-id21 . -1) (undo-tree-id22 . -1) (undo-tree-id23 . -1) (undo-tree-id24 . -1) 201) nil (26039 27126 866500 195000) 0 nil]) +([nil nil ((1 . 1) (1 . 2) (t 26039 27126 873477 870000)) nil (26039 27465 472664 834000) 0 nil]) +([nil nil ((850 . 853)) nil (26039 27465 472664 112000) 0 nil]) +([nil nil ((#("f" 0 1 (fontified t)) . -850) (undo-tree-id3 . -1) (undo-tree-id4 . -1) (undo-tree-id5 . -1) (#("o" 0 1 (fontified t)) . -851) (undo-tree-id6 . -1) (undo-tree-id7 . -1) (undo-tree-id8 . -1) (#("r" 0 1 (face font-lock-keyword-face fontified t)) . -852) (undo-tree-id9 . -1) (undo-tree-id10 . -1) (undo-tree-id11 . -1) 853) nil (26039 27465 472662 591000) 0 nil]) +([nil nil ((850 . 851)) nil (26039 27465 472657 35000) 0 nil]) +([nil current ((#("t" 0 1 (fontified t)) . -850) (undo-tree-id0 . -1) (undo-tree-id1 . -1) (undo-tree-id2 . -1) 851) nil (26039 27465 472652 196000) 0 nil]) +nil diff --git a/src/type/list/.list_sort.cpp.~undo-tree~ b/src/type/list/.list_sort.cpp.~undo-tree~ new file mode 100644 index 0000000..1903356 --- /dev/null +++ b/src/type/list/.list_sort.cpp.~undo-tree~ @@ -0,0 +1,260 @@ +(undo-tree-save-format-version . 1) +"dd5e304b901dcc4a288cc9947075d09238d2740a" +[nil nil nil nil (26039 25092 504386 398000) 0 nil] +([nil nil ((1 . 2) (t 26039 25092 507445 782000)) nil (26039 25405 694604 487000) 0 nil]) +([nil nil ((2 . 10)) nil (26039 25405 694604 260000) 0 nil]) +([nil nil ((10 . 11)) nil (26039 25405 694604 81000) 0 nil]) +([nil nil ((11 . 13)) nil (26039 25405 694603 803000) 0 nil]) +([nil nil ((#("s" 0 1 (face font-lock-string-face fontified t)) . -12) (undo-tree-id198 . -1) (undo-tree-id199 . -1) (undo-tree-id200 . -1) (undo-tree-id201 . -1) 13) nil (26039 25405 694603 530000) 0 nil]) +([nil nil ((12 . 19)) nil (26039 25405 694601 824000) 0 nil]) +([nil nil ((19 . 20)) nil (26039 25405 694601 587000) 0 nil]) +([nil nil ((20 . 20) (20 . 21)) nil (26039 25405 694601 376000) 0 nil]) +([nil nil ((21 . 22)) nil (26039 25405 694601 153000) 0 nil]) +([nil nil ((22 . 23)) nil (26039 25405 694600 878000) 0 nil]) +([nil nil ((#("n" 0 1 (face font-lock-preprocessor-face fontified t)) . -22) (undo-tree-id194 . -1) (undo-tree-id195 . -1) (undo-tree-id196 . -1) (undo-tree-id197 . -1) 23) nil (26039 25405 694600 529000) 0 nil]) +([nil nil ((22 . 30)) nil (26039 25405 694599 389000) 0 nil]) +([nil nil ((30 . 31)) nil (26039 25405 694599 204000) 0 nil]) +([nil nil ((31 . 35)) nil (26039 25405 694599 23000) 0 nil]) +([nil nil ((35 . 36)) nil (26039 25405 694598 847000) 0 nil]) +([nil nil ((37 . 37) (37 . 38) (36 . 36) (36 . 37)) nil (26039 25405 694598 532000) 0 nil]) +([nil nil ((38 . 48)) nil (26039 25405 694598 247000) 0 nil]) +([nil nil ((48 . 50)) nil (26039 25405 694598 56000) 0 nil]) +([nil nil ((49 . 57)) nil (26039 25405 694597 775000) 0 nil]) +([nil nil ((#("i" 0 1 (face font-lock-type-face fontified t)) . -55) (undo-tree-id188 . -1) (undo-tree-id189 . -1) (undo-tree-id190 . -1) (#("n" 0 1 (face font-lock-type-face fontified t)) . -56) (undo-tree-id191 . -1) (undo-tree-id192 . -1) (undo-tree-id193 . -1) 57) nil (26039 25405 694597 422000) 0 nil]) +([nil nil ((55 . 59)) nil (26039 25405 694595 770000) 0 nil]) +([nil nil ((59 . 60)) nil (26039 25405 694595 484000) 0 nil]) +([nil nil ((60 . 61)) nil (26039 25405 694595 309000) 0 nil]) +([nil nil ((#("T" 0 1 (fontified t)) . -60) (undo-tree-id187 . -1) 61) nil (26039 25405 694594 990000) 0 nil]) +([nil nil ((60 . 61)) nil (26039 25405 694594 389000) 0 nil]) +([nil nil ((61 . 62)) nil (26039 25405 694594 219000) 0 nil]) +([nil nil ((37 . 37) (37 . 38)) nil (26039 25405 694594 6000) 0 nil]) +([nil nil ((38 . 44)) nil (26039 25405 694593 766000) 0 nil]) +([nil nil ((apply yas--snippet-revive 38 48 #s(yas--snippet nil nil #s(yas--exit 47 nil) 0 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil #s(yas--exit 47 nil) 0 nil nil nil nil)) (38 . 48) (#("template<$0>" 0 1 (fontified nil c-is-sws t) 1 8 (fontified nil) 8 9 (fontified nil c-<>-c-types-set t category c-<-as-paren-syntax) 9 11 (fontified nil) 11 12 (fontified nil category c->-as-paren-syntax)) . 38) (38 . 50) (#("tem" 0 1 (fontified nil c-is-sws t) 1 3 (fontified nil)) . 38) (38 . 41) (#("template" 0 1 (fontified nil c-is-sws t) 1 8 (fontified nil) 8 9 (fontified nil c-<>-c-types-set t category c-<-as-paren-syntax) 9 19 (fontified nil) 19 20 (fontified nil category c->-as-paren-syntax)) . -38) (38 . 58) (#("templa" 0 1 (c-is-sws t fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t) 4 5 (fontified t) 5 6 (fontified t)) . -38) (undo-tree-id184 . -6) (undo-tree-id185 . -6) (undo-tree-id186 . -6) 44) nil (26039 25405 694593 216000) 0 nil]) +([nil nil ((47 . 50)) nil (26039 25405 694591 849000) 0 nil]) +([nil nil ((#("e" 0 1 (fontified t)) . -49) (undo-tree-id183 . -1) 50) nil (26039 25405 694591 433000) 0 nil]) +([nil nil ((49 . 57)) nil (26039 25405 694590 960000) 0 nil]) +([nil nil ((76 . 79)) nil (26039 25405 694590 783000) 0 nil]) +([nil nil ((79 . 81)) nil (26039 25405 694590 601000) 0 nil]) +([nil nil ((88 . 90)) nil (26039 25405 694590 435000) 0 nil]) +([nil nil ((89 . 90)) nil (26039 25405 694590 257000) 0 nil]) +([nil nil ((92 . 94)) nil (26039 25405 694589 844000) 0 nil]) +([nil nil ((94 . 96) (93 . 95)) nil (26039 25405 694589 590000) 0 nil]) +([nil nil ((96 . 99)) nil (26039 25405 694589 340000) 0 nil]) +([nil nil ((99 . 101)) nil (26039 25405 694589 140000) 0 nil]) +([nil nil ((100 . 102)) nil (26039 25405 694588 953000) 0 nil]) +([nil nil ((#("y" 0 1 (fontified t)) . -101) (undo-tree-id180 . -1) (undo-tree-id181 . -1) (undo-tree-id182 . -1) 102) nil (26039 25405 694588 626000) 0 nil]) +([nil nil ((101 . 103)) nil (26039 25405 694587 135000) 0 nil]) +([nil nil ((103 . 105)) nil (26039 25405 694586 956000) 0 nil]) +([nil nil ((105 . 107)) nil (26039 25405 694586 619000) 0 nil]) +([nil nil ((107 . 109)) nil (26039 25405 694586 359000) 0 nil]) +([nil nil ((109 . 110)) nil (26039 25405 694586 84000) 0 nil]) +([nil nil ((110 . 111)) nil (26039 25405 694585 918000) 0 nil]) +([nil nil ((111 . 112)) nil (26039 25405 694585 734000) 0 nil]) +([nil nil ((112 . 114)) nil (26039 25405 694585 453000) 0 nil]) +([nil nil ((114 . 118)) nil (26039 25405 694585 282000) 0 nil]) +([nil nil ((#(":" 0 1 (fontified t)) . -112) (undo-tree-id166 . -1) (undo-tree-id167 . -1) (undo-tree-id168 . -1) (#(":" 0 1 (fontified t)) . -113) (undo-tree-id169 . -1) (undo-tree-id170 . -1) (undo-tree-id171 . -1) (#("c" 0 1 (fontified t)) . -114) (undo-tree-id172 . -1) (undo-tree-id173 . -1) (undo-tree-id174 . -1) (#("o" 0 1 (fontified t)) . -115) (undo-tree-id175 . -1) (undo-tree-id176 . -1) (undo-tree-id177 . -1) (#("n" 0 1 (fontified t)) . -116) (undo-tree-id178 . -1) (#("s" 0 1 (fontified t)) . -117) (undo-tree-id179 . -1) 118) nil (26039 25405 694584 530000) 0 nil]) +([nil nil ((#("T" 0 1 (fontified t)) . -110) (undo-tree-id160 . -1) (undo-tree-id161 . -1) (undo-tree-id162 . -1) (#(">" 0 1 (face (rainbow-delimiters-depth-3-face) c-type c-decl-id-start fontified t)) . -111) (undo-tree-id163 . -1) (undo-tree-id164 . -1) (undo-tree-id165 . -1) 112) nil (26039 25405 694579 975000) 0 nil]) +([nil nil ((110 . 113)) nil (26039 25405 694578 198000) 0 nil]) +([nil nil ((113 . 114)) nil (26039 25405 694578 2000) 0 nil]) +([nil nil ((#("<" 0 1 (fontified t)) . -113) (undo-tree-id159 . -1) 114) nil (26039 25405 694577 579000) 0 nil]) +([nil nil ((113 . 114)) nil (26039 25405 694577 88000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -100) (undo-tree-id119 . -1) (undo-tree-id120 . -1) (undo-tree-id121 . -1) (#("t" 0 1 (fontified t)) . -101) (undo-tree-id122 . -1) (undo-tree-id123 . -1) (undo-tree-id124 . -1) (#("d" 0 1 (fontified t)) . -102) (undo-tree-id125 . -1) (undo-tree-id126 . -1) (undo-tree-id127 . -1) (#(":" 0 1 (fontified t)) . -103) (undo-tree-id128 . -1) (undo-tree-id129 . -1) (undo-tree-id130 . -1) (#(":" 0 1 (fontified t)) . -104) (undo-tree-id131 . -1) (undo-tree-id132 . -1) (undo-tree-id133 . -1) (#("l" 0 1 (fontified t)) . -105) (undo-tree-id134 . -1) (undo-tree-id135 . -1) (undo-tree-id136 . -1) (#("i" 0 1 (fontified t)) . -106) (undo-tree-id137 . -1) (undo-tree-id138 . -1) (undo-tree-id139 . -1) (#("s" 0 1 (fontified t)) . -107) (undo-tree-id140 . -1) (undo-tree-id141 . -1) (undo-tree-id142 . -1) (#("t" 0 1 (fontified t)) . -108) (undo-tree-id143 . -1) (undo-tree-id144 . -1) (undo-tree-id145 . -1) (#("<" 0 1 (fontified t)) . -109) (undo-tree-id146 . -1) (undo-tree-id147 . -1) (undo-tree-id148 . -1) (#("i" 0 1 (fontified t)) . -110) (undo-tree-id149 . -1) (undo-tree-id150 . -1) (undo-tree-id151 . -1) (#("n" 0 1 (fontified t)) . -111) (undo-tree-id152 . -1) (undo-tree-id153 . -1) (undo-tree-id154 . -1) (#("t" 0 1 (face font-lock-type-face fontified t)) . -112) (undo-tree-id155 . -1) (undo-tree-id156 . -1) (undo-tree-id157 . -1) (#(">" 0 1 (face (rainbow-delimiters-depth-3-face) c-type c-decl-id-start fontified t)) . -113) (undo-tree-id158 . -1) 114) nil (26039 25405 694575 547000) 0 nil]) +([nil nil ((100 . 107)) nil (26039 25405 694562 136000) 0 nil]) +([nil nil ((107 . 108)) nil (26039 25405 694561 933000) 0 nil]) +([nil nil ((108 . 109)) nil (26039 25405 694561 649000) 0 nil]) +([nil nil ((110 . 112)) nil (26039 25405 694561 477000) 0 nil]) +([nil nil ((112 . 116) (111 . 115)) nil (26039 25405 694561 178000) 0 nil]) +([nil nil ((116 . 120)) nil (26039 25405 694560 934000) 0 nil]) +([nil nil ((apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil)) #s(yas--field 2 135 137 nil nil nil nil nil)) #s(yas--exit 129 #s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil))) 1 nil #s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil)) nil nil)) (116 . 139) (#("cout" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . 116) (undo-tree-id116 . -4) (undo-tree-id117 . -4) (undo-tree-id118 . -4) 120) nil (26039 25405 694560 490000) 0 nil]) +([nil nil ((129 . 130)) nil (26039 25405 694559 413000) 0 nil]) +([nil nil ((apply yas--snippet-revive 116 140 #s(yas--snippet nil (#s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil)) #s(yas--field 2 135 137 nil nil nil nil nil)) #s(yas--exit 129 #s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil))) 1 nil #s(yas--field 1 129 130 nil nil nil t #s(yas--field 2 135 137 nil nil nil nil nil)) nil nil))) nil (26039 25405 694559 128000) 0 nil]) +([nil nil ((#("\"" 0 1 (face font-lock-warning-face fontified t)) . -134) (undo-tree-id112 . -1) (#("\\" 0 1 (face font-lock-string-face fontified t)) . -135) (undo-tree-id113 . -1) (#("n" 0 1 (face font-lock-string-face fontified t)) . -136) (undo-tree-id114 . -1) (#("\"" 0 1 (face font-lock-string-face fontified t)) . -137) (undo-tree-id115 . -1) 138) nil (26039 25405 694558 798000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 133) (undo-tree-id111 . -1) 134) nil (26039 25405 694555 875000) 0 nil]) +([nil nil ((#("<" 0 1 (fontified t)) . -131) (undo-tree-id109 . -1) (#("<" 0 1 (fontified t)) . -132) (undo-tree-id110 . -1) 133) nil (26039 25405 694555 139000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 130) (undo-tree-id108 . -1) 131) nil (26039 25405 694554 113000) 0 nil]) +([nil nil ((130 . 131)) nil (26039 25405 694553 570000) 0 nil]) +([nil nil ((131 . 133)) nil (26039 25405 694553 359000) 0 nil]) +([nil nil ((133 . 135) (#("\"" 0 1 (fontified nil)) . -133) (133 . 134)) nil (26039 25405 694553 118000) 0 nil]) +([nil nil ((134 . 135)) nil (26039 25405 694552 744000) 0 nil]) +([nil nil ((133 . 134)) nil (26039 25405 694552 552000) 0 nil]) +([nil nil ((#(";" 0 1 (fontified t)) . -107) (undo-tree-id107 . -1) 108) nil (26039 25405 694552 131000) 0 nil]) +([nil nil ((107 . 108)) nil (26039 25405 694551 616000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 138) (undo-tree-id106 . -1) 139) nil (26039 25405 694551 323000) 0 nil]) +([nil nil ((142 . 145)) nil (26039 25405 694550 824000) 0 nil]) +([nil nil ((145 . 149)) nil (26039 25405 694550 520000) 0 nil]) +([nil nil ((apply yas--take-care-of-redo #s(yas--snippet nil (#s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil)) #s(yas--field 2 159 161 nil nil nil nil nil)) #s(yas--exit 154 #s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil))) 2 nil #s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil)) nil nil)) (145 . 168) (#("cout" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . 145) (undo-tree-id103 . -4) (undo-tree-id104 . -4) (undo-tree-id105 . -4) 149) nil (26039 25405 694550 150000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 157) (undo-tree-id102 . -1) 158) nil (26039 25405 694548 942000) 0 nil]) +([nil nil ((#("<" 0 1 (fontified t)) . -155) (undo-tree-id100 . -1) (#("<" 0 1 (fontified t)) . -156) (undo-tree-id101 . -1) 157) nil (26039 25405 694548 179000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 154) (undo-tree-id99 . -1) 155) nil (26039 25405 694547 201000) 0 nil]) +([nil nil ((apply yas--snippet-revive 145 164 #s(yas--snippet nil (#s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil)) #s(yas--field 2 159 161 nil nil nil nil nil)) #s(yas--exit 154 #s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil))) 2 nil #s(yas--field 1 154 154 nil nil nil t #s(yas--field 2 159 161 nil nil nil nil nil)) nil nil))) nil (26039 25405 694546 596000) 0 nil]) +([nil nil ((#(" +" 0 1 (fontified t)) . 163) (undo-tree-id98 . -1) 164) nil (26039 25405 694546 289000) 0 nil]) +([nil nil ((167 . 167) (167 . 168) (166 . 166) (166 . 167) (165 . 165) (165 . 166)) nil (26039 25405 694545 632000) 0 nil]) +([nil nil ((#(" + + +" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t)) . 165) (undo-tree-id97 . -3) 168) nil (26039 25405 694545 142000) 0 nil]) +([nil nil ((166 . 166) (166 . 167) (165 . 165) (165 . 166)) nil (26039 25405 694506 415000) 0 nil]) +([nil nil ((#(" + +" 0 1 (fontified t) 1 2 (fontified t)) . 165) (undo-tree-id96 . -2) 167) nil (26039 25405 694505 796000) 0 nil]) +([nil nil ((166 . 166) (166 . 167) (165 . 165) (165 . 166)) nil (26039 25405 694505 276000) 0 nil]) +([nil nil ((167 . 175)) nil (26039 25405 694504 898000) 0 nil]) +([nil nil ((#("n" 0 1 (face font-lock-variable-name-face fontified t)) . -174) (undo-tree-id93 . -1) (undo-tree-id94 . -1) (undo-tree-id95 . -1) 175) nil (26039 25405 694504 556000) 0 nil]) +([nil nil ((174 . 175)) nil (26039 25405 694502 904000) 0 nil]) +([nil nil ((175 . 177)) nil (26039 25405 694502 740000) 0 nil]) +([nil nil ((177 . 179)) nil (26039 25405 694502 470000) 0 nil]) +([nil nil ((179 . 181) (178 . 180)) nil (26039 25405 694502 281000) 0 nil]) +([nil nil ((181 . 185)) nil (26039 25405 694501 956000) 0 nil]) +([nil nil ((185 . 186)) nil (26039 25405 694501 804000) 0 nil]) +([nil nil ((186 . 189)) nil (26039 25405 694501 559000) 0 nil]) +([nil nil ((189 . 190)) nil (26039 25405 694501 391000) 0 nil]) +([nil nil ((190 . 192)) nil (26039 25405 694501 128000) 0 nil]) +([nil nil ((192 . 193)) nil (26039 25405 694500 963000) 0 nil]) +([nil nil ((193 . 196)) nil (26039 25405 694500 713000) 0 nil]) +([nil nil ((181 . 184)) nil (26039 25405 694500 545000) 0 nil]) +([nil nil ((179 . 181) (#(" " 0 1 (fontified nil)) . 179) (184 . 185) (179 . 180) (#(" " 0 2 (fontified nil)) . 179) (184 . 185)) nil (26039 25405 694500 111000) 0 nil]) +([nil nil ((201 . 203)) nil (26039 25405 694499 743000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -201) (undo-tree-id87 . -1) (undo-tree-id88 . -1) (undo-tree-id89 . -1) (#("." 0 1 (fontified t)) . -202) (undo-tree-id90 . -1) (undo-tree-id91 . -1) (undo-tree-id92 . -1) 203) nil (26039 25405 694499 253000) 0 nil]) +([nil nil ((201 . 202)) nil (26039 25405 694497 552000) 0 nil]) +([nil nil ((202 . 204)) nil (26039 25405 694497 295000) 0 nil]) +([nil nil ((204 . 206)) nil (26039 25405 694497 119000) 0 nil]) +([nil nil ((#("(" 0 1 (face (rainbow-delimiters-depth-2-face) fontified nil)) . -204) (undo-tree-id86 . -1) (#(")" 0 1 (face (rainbow-delimiters-depth-2-face) fontified t)) . 205)) nil (26039 25405 694496 713000) 0 nil]) +([nil nil ((#("f" 0 1 (fontified t)) . -201) (undo-tree-id77 . -1) (undo-tree-id78 . -1) (undo-tree-id79 . -1) (#("o" 0 1 (fontified t)) . -202) (undo-tree-id80 . -1) (undo-tree-id81 . -1) (undo-tree-id82 . -1) (#("r" 0 1 (face font-lock-keyword-face fontified t)) . -203) (undo-tree-id83 . -1) (undo-tree-id84 . -1) (undo-tree-id85 . -1) 204) nil (26039 25405 694495 896000) 0 nil]) +([nil nil ((201 . 204)) nil (26039 25405 694492 948000) 0 nil]) +([nil nil ((#("r" 0 1 (fontified t)) . -201) (undo-tree-id68 . -1) (undo-tree-id69 . -1) (undo-tree-id70 . -1) (#("i" 0 1 (fontified t)) . -202) (undo-tree-id71 . -1) (undo-tree-id72 . -1) (undo-tree-id73 . -1) (#("n" 0 1 (fontified t)) . -203) (undo-tree-id74 . -1) (undo-tree-id75 . -1) (undo-tree-id76 . -1) 204) nil (26039 25405 694492 451000) 0 nil]) +([nil nil ((201 . 211)) nil (26039 25405 694488 456000) 0 nil]) +([nil nil ((#("=" 0 1 (fontified t)) . -210) (undo-tree-id67 . -1) 211) nil (26039 25405 694488 169000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 209) (undo-tree-id66 . -1) 210) nil (26039 25405 694487 415000) 0 nil]) +([nil nil ((210 . 212) (209 . 211)) nil (26039 25405 694486 817000) 0 nil]) +([nil nil ((#("=" 0 1 (fontified t)) . -211) (undo-tree-id65 . -1) 212) nil (26039 25405 694486 319000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 210) (undo-tree-id64 . -1) 211) nil (26039 25405 694484 608000) 0 nil]) +([nil nil ((211 . 214)) nil (26039 25405 694460 78000) 0 nil]) +([nil nil ((214 . 216)) nil (26039 25405 694459 913000) 0 nil]) +([nil nil ((215 . 217)) nil (26039 25405 694459 666000) 0 nil]) +([nil nil ((217 . 218)) nil (26039 25405 694459 500000) 0 nil]) +([nil nil ((218 . 220)) nil (26039 25405 694459 237000) 0 nil]) +([nil nil ((220 . 221)) nil (26039 25405 694459 69000) 0 nil]) +([nil nil ((221 . 223)) nil (26039 25405 694458 772000) 0 nil]) +([nil nil ((223 . 224)) nil (26039 25405 694458 604000) 0 nil]) +([nil nil ((224 . 226)) nil (26039 25405 694458 303000) 0 nil]) +([nil nil ((226 . 227)) nil (26039 25405 694458 62000) 0 nil]) +([nil nil ((227 . 229)) nil (26039 25405 694457 794000) 0 nil]) +([nil nil ((230 . 231)) nil (26039 25405 694457 537000) 0 nil]) +([nil nil ((231 . 234)) nil (26039 25405 694457 196000) 0 nil]) +([nil nil ((234 . 237)) nil (26039 25405 694456 961000) 0 nil]) +([nil nil ((237 . 239)) nil (26039 25405 694456 712000) 0 nil]) +([nil nil ((238 . 246)) nil (26039 25405 694456 471000) 0 nil]) +([nil nil ((#("l" 0 1 (face font-lock-variable-name-face fontified t)) . -245) (undo-tree-id61 . -1) (undo-tree-id62 . -1) (undo-tree-id63 . -1) 246) nil (26039 25405 694456 73000) 0 nil]) +([nil nil ((245 . 246)) nil (26039 25405 694454 984000) 0 nil]) +([nil nil ((246 . 250)) nil (26039 25405 694454 654000) 0 nil]) +([nil nil ((251 . 253)) nil (26039 25405 694454 403000) 0 nil]) +([nil nil ((253 . 257) (252 . 256)) nil (26039 25405 694454 69000) 0 nil]) +([nil nil ((257 . 263)) nil (26039 25405 694453 760000) 0 nil]) +([nil nil ((apply yas--snippet-revive 259 270 #s(yas--snippet nil nil #s(yas--exit 269 nil) 3 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil #s(yas--exit 269 nil) 3 nil nil nil nil)) (259 . 270) (#("push_back($0)" 0 13 (fontified nil)) . 259) (259 . 272) (#("push_back(…)" 0 12 (fontified nil)) . -259) (259 . 271) (#("push" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -259) (undo-tree-id58 . -4) (undo-tree-id59 . -4) (undo-tree-id60 . -4) 263) nil (26039 25405 694453 102000) 0 nil]) +([nil nil ((269 . 270)) nil (26039 25405 694451 724000) 0 nil]) +([nil nil ((271 . 272)) nil (26039 25405 694451 467000) 0 nil]) +([nil nil ((276 . 279)) nil (26039 25405 694451 230000) 0 nil]) +([nil nil ((279 . 284)) nil (26039 25405 694451 70000) 0 nil]) +([nil nil ((284 . 286)) nil (26039 25405 694450 813000) 0 nil]) +([nil nil ((285 . 286)) nil (26039 25405 694450 549000) 0 nil]) +([nil nil ((287 . 288)) nil (26039 25405 694450 259000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -287) (undo-tree-id55 . -1) (undo-tree-id56 . -1) (undo-tree-id57 . -1) 288) nil (26039 25405 694449 849000) 0 nil]) +([nil nil ((287 . 288)) nil (26039 25405 694448 818000) 0 nil]) +([nil nil ((290 . 292) (#(" " 0 2 (fontified nil)) . 289) (undo-tree-id54 . -2) (288 . 292)) nil (26039 25405 694448 414000) 0 nil]) +([nil nil ((292 . 296)) nil (26039 25405 694447 769000) 0 nil]) +([nil nil ((296 . 297)) nil (26039 25405 694447 506000) 0 nil]) +([nil nil ((#("s" 0 1 (fontified t)) . -296) (undo-tree-id51 . -1) (undo-tree-id52 . -1) (undo-tree-id53 . -1) 297) nil (26039 25405 694447 85000) 0 nil]) +([nil nil ((296 . 299)) nil (26039 25405 694444 759000) 0 nil]) +([nil nil ((apply yas--snippet-revive 294 303 #s(yas--snippet nil nil nil 4 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil nil 4 nil nil nil nil)) (294 . 303) (#("reverse()" 0 9 (fontified nil)) . 294) (294 . 303) (#("reverse()" 0 9 (fontified nil)) . -294) (294 . 303) (#("rever" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t) 4 5 (fontified t)) . -294) (undo-tree-id48 . -5) (undo-tree-id49 . -5) (undo-tree-id50 . -5) 299) nil (26039 25405 694444 78000) 0 nil]) +([nil nil ((303 . 304)) nil (26039 25405 694442 881000) 0 nil]) +([nil nil ((304 . 307)) nil (26039 25405 694442 716000) 0 nil]) +([nil nil ((307 . 312)) nil (26039 25405 694442 464000) 0 nil]) +([nil nil ((312 . 314)) nil (26039 25405 694442 206000) 0 nil]) +([nil nil ((313 . 314)) nil (26039 25405 694441 942000) 0 nil]) +([nil nil ((315 . 316)) nil (26039 25405 694441 685000) 0 nil]) +([nil nil ((318 . 320) (#(" " 0 2 (fontified nil)) . 317) (undo-tree-id47 . -2) (316 . 320)) nil (26039 25405 694441 339000) 0 nil]) +([nil nil ((320 . 324)) nil (26039 25405 694440 560000) 0 nil]) +([nil nil ((324 . 326)) nil (26039 25405 694440 267000) 0 nil]) +([nil nil ((apply yas--snippet-revive 322 328 #s(yas--snippet nil nil #s(yas--exit 327 nil) 5 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil #s(yas--exit 327 nil) 5 nil nil nil nil)) (322 . 328) (#("sort($0)" 0 8 (fontified nil)) . 322) (322 . 330) (#("sort(…)" 0 7 (fontified nil)) . -322) (322 . 329) (#("sort" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t) 3 4 (fontified t)) . -322) (undo-tree-id44 . -4) (undo-tree-id45 . -4) (undo-tree-id46 . -4) 326) nil (26039 25405 694439 705000) 0 nil]) +([nil nil ((328 . 329)) nil (26039 25405 694438 320000) 0 nil]) +([nil nil ((329 . 332)) nil (26039 25405 694438 125000) 0 nil]) +([nil nil ((332 . 341)) nil (26039 25405 694437 889000) 0 nil]) +([nil nil ((341 . 343)) nil (26039 25405 694437 589000) 0 nil]) +([nil nil ((#("L" 0 1 (fontified t)) . -337) (undo-tree-id40 . -1) (#("i" 0 1 (fontified t)) . -338) (undo-tree-id41 . -1) (#("s" 0 1 (fontified t)) . -339) (undo-tree-id42 . -1) (#("t" 0 1 (fontified t)) . -340) (undo-tree-id43 . -1) 341) nil (26039 25405 694436 807000) 0 nil]) +([nil nil ((338 . 339)) nil (26039 25405 694435 419000) 0 nil]) +([nil nil ((340 . 341)) nil (26039 25405 694435 155000) 0 nil]) +([nil nil ((343 . 345) (#(" " 0 2 (fontified nil)) . 342) (undo-tree-id39 . -2) (341 . 345)) nil (26039 25405 694434 745000) 0 nil]) +([nil nil ((345 . 351)) nil (26039 25405 694434 148000) 0 nil]) +([nil nil ((351 . 353)) nil (26039 25405 694433 887000) 0 nil]) +([nil nil ((352 . 354)) nil (26039 25405 694433 635000) 0 nil]) +([nil nil ((354 . 356)) nil (26039 25405 694433 232000) 0 nil]) +([nil nil ((355 . 360)) nil (26039 25405 694432 906000) 0 nil]) +([nil nil ((360 . 361)) nil (26039 25405 694432 590000) 0 nil]) +([nil nil ((361 . 366)) nil (26039 25405 694432 310000) 0 nil]) +([nil nil ((367 . 368)) nil (26039 25405 694432 64000) 0 nil]) +([nil nil ((368 . 369)) nil (26039 25405 694431 805000) 0 nil]) +([nil nil ((369 . 373)) nil (26039 25405 694431 554000) 0 nil]) +([nil nil ((373 . 375)) nil (26039 25405 694431 301000) 0 nil]) +([nil nil ((375 . 379) (374 . 378)) nil (26039 25405 694430 703000) 0 nil]) +([nil nil ((379 . 387)) nil (26039 25405 694430 382000) 0 nil]) +([nil nil ((387 . 388)) nil (26039 25405 694430 125000) 0 nil]) +([nil nil ((388 . 389)) nil (26039 25405 694429 589000) 0 nil]) +([nil nil ((389 . 390)) nil (26039 25405 694429 247000) 0 nil]) +([nil nil ((395 . 396)) nil (26039 25405 694428 994000) 0 nil]) +([nil nil ((396 . 399)) nil (26039 25405 694428 706000) 0 nil]) +([nil nil ((399 . 405)) nil (26039 25405 694428 439000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -404) (undo-tree-id38 . -1) 405) nil (26039 25405 694427 914000) 0 nil]) +([nil nil ((404 . 406)) nil (26039 25405 694427 320000) 0 nil]) +([nil nil ((405 . 406)) nil (26039 25405 694427 58000) 0 nil]) +([nil nil ((407 . 408)) nil (26039 25405 694426 789000) 0 nil]) +([nil nil ((408 . 410)) nil (26039 25405 694426 545000) 0 nil]) +([nil nil ((410 . 412)) nil (26039 25405 694426 208000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -410) (undo-tree-id34 . -1) (undo-tree-id35 . -1) (undo-tree-id36 . -1) (#("." 0 1 (fontified t)) . -411) (undo-tree-id37 . -1) 412) nil (26039 25405 694425 629000) 0 nil]) +([nil nil ((#("\\" 0 1 (c-is-sws t c-in-sws t fontified t)) . 409) (undo-tree-id31 . -1) (undo-tree-id32 . -1) (undo-tree-id33 . -1) 410) nil (26039 25405 694424 181000) 0 nil]) +([nil nil ((#("\\" 0 1 (c-is-sws t fontified t)) . 408) (undo-tree-id28 . -1) (undo-tree-id29 . -1) (undo-tree-id30 . -1) 409) nil (26039 25405 694423 89000) 0 nil]) +([nil nil ((410 . 412) (#(" " 0 2 (fontified nil)) . 409) (undo-tree-id27 . -2) (408 . 412)) nil (26039 25405 694421 649000) 0 nil]) +([nil nil ((412 . 413)) nil (26039 25405 694420 973000) 0 nil]) +([nil nil ((#("." 0 1 (fontified t)) . -412) (undo-tree-id26 . -1) 413) nil (26039 25405 694420 577000) 0 nil]) +([nil nil ((412 . 417)) nil (26039 25405 694420 109000) 0 nil]) +([nil nil ((#("i" 0 1 (fontified t)) . -416) (undo-tree-id23 . -1) (undo-tree-id24 . -1) (undo-tree-id25 . -1) 417) nil (26039 25405 694419 609000) 0 nil]) +([nil nil ((416 . 417)) nil (26039 25405 694418 520000) 0 nil]) +([nil nil ((apply yas--snippet-revive 414 422 #s(yas--snippet nil nil #s(yas--exit 421 nil) 6 nil nil nil nil)) (apply yas--take-care-of-redo #s(yas--snippet nil nil #s(yas--exit 421 nil) 6 nil nil nil nil)) (414 . 422) (#("unique($0)" 0 10 (fontified nil)) . 414) (414 . 424) (#("unique(…)" 0 9 (fontified nil)) . -414) (414 . 423) (#("uni" 0 1 (fontified t) 1 2 (fontified t) 2 3 (fontified t)) . -414) (undo-tree-id20 . -3) (undo-tree-id21 . -3) (undo-tree-id22 . -3) 417) nil (26039 25405 694417 795000) 0 nil]) +([nil nil ((422 . 423)) nil (26039 25405 694416 245000) 0 nil]) +([nil nil ((423 . 426)) nil (26039 25405 694415 889000) 0 nil]) +([nil nil ((426 . 432)) nil (26039 25405 694415 649000) 0 nil]) +([nil nil ((#(" " 0 1 (fontified t)) . 431) (undo-tree-id19 . -1) 432) nil (26039 25405 694415 43000) 0 nil]) +([nil nil ((431 . 433)) nil (26039 25405 694414 500000) 0 nil]) +([nil nil ((432 . 433)) nil (26039 25405 694414 176000) 0 nil]) +([nil nil ((434 . 435)) nil (26039 25405 694413 793000) 0 nil]) +([nil nil ((438 . 438) (438 . 439) (437 . 437) (437 . 438)) nil (26039 25405 694413 333000) 0 nil]) +([nil nil ((#(" + +" 0 1 (fontified t) 1 2 (fontified t)) . 437) (undo-tree-id18 . -2) 439) nil (26039 25405 694412 570000) 0 nil]) +([nil nil ((#("}" 0 1 (face (rainbow-delimiters-depth-1-face) fontified t c-is-sws t)) . -436) (undo-tree-id17 . -1) 437) nil (26039 25405 694411 903000) 0 nil]) +([nil nil ((436 . 437) (#("}" 0 1 (fontified nil)) . -436) (436 . 437)) nil (26039 25405 694411 204000) 0 nil]) +([nil nil ((#("i" 0 1 (face font-lock-type-face c-type c-decl-id-start fontified t)) . -167) (undo-tree-id14 . -1) (#("n" 0 1 (face font-lock-type-face c-type c-decl-id-start fontified t)) . -168) (undo-tree-id15 . -1) (#("t" 0 1 (face font-lock-type-face c-type c-decl-id-start fontified t)) . -169) (undo-tree-id16 . -1) 170) nil (26039 25405 694410 401000) 0 nil]) +([nil nil ((167 . 171)) nil (26039 25405 694409 201000) 0 nil]) +([nil nil ((#("m" 0 1 (face font-lock-function-name-face fontified t)) . -172) (undo-tree-id10 . -1) (#("a" 0 1 (face font-lock-function-name-face fontified t)) . -173) (undo-tree-id11 . -1) (#("i" 0 1 (face font-lock-function-name-face fontified t)) . -174) (undo-tree-id12 . -1) (#("n" 0 1 (face font-lock-function-name-face fontified t)) . -175) (undo-tree-id13 . -1) 176) nil (26039 25405 694408 585000) 0 nil]) +([nil nil ((172 . 176)) nil (26039 25405 694407 130000) 0 nil]) +([nil nil ((439 . 439) (439 . 440) (438 . 438) (438 . 439)) nil (26039 25405 694406 827000) 0 nil]) +([nil nil ((440 . 448)) nil (26039 25405 694406 425000) 0 nil]) +([nil nil ((448 . 450)) nil (26039 25405 694406 166000) 0 nil]) +([nil nil ((450 . 452)) nil (26039 25405 694405 897000) 0 nil]) +([nil nil ((452 . 454) (451 . 453)) nil (26039 25405 694405 587000) 0 nil]) +([nil nil ((454 . 458)) nil (26039 25405 694405 139000) 0 nil]) +([nil nil ((458 . 460)) nil (26039 25405 694404 715000) 0 nil]) +([nil nil ((460 . 461)) nil (26039 25405 694404 401000) 0 nil]) +([nil nil ((461 . 464)) nil (26039 25405 694404 145000) 0 nil]) +([nil nil ((464 . 473)) nil (26039 25405 694403 828000) 0 nil]) +([nil nil ((#("l" 0 1 (fontified t)) . -472) (undo-tree-id0 . -1) (undo-tree-id1 . -1) (undo-tree-id2 . -1) (undo-tree-id3 . -1) (undo-tree-id4 . -1) (undo-tree-id5 . -1) (undo-tree-id6 . -1) (undo-tree-id7 . -1) (undo-tree-id8 . -1) (undo-tree-id9 . -1) 473) nil (26039 25405 694403 194000) 0 nil]) +([nil nil ((472 . 473)) nil (26039 25405 694375 624000) 0 nil]) +([nil nil ((475 . 476) 473) nil (26039 25405 694372 17000) 0 nil]) +([nil nil ((343 . 344) (t 26039 25405 756244 924000)) nil (26039 25497 566283 395000) 0 nil]) +([nil nil ((#("x" 0 1 (fontified t)) . -343) (undo-tree-id202 . -1) (undo-tree-id203 . -1) (undo-tree-id204 . -1) 344) nil (26039 25497 566282 657000) 0 nil]) +([nil nil ((320 . 321)) nil (26039 25497 566274 91000) 0 nil]) +([nil nil ((319 . 321) (#(" " 0 1 (fontified nil)) . 319) (321 . 322)) nil (26039 25497 566273 274000) 0 nil]) +([nil nil ((412 . 413)) nil (26039 25497 566272 548000) 0 nil]) +([nil current ((413 . 414)) nil (26039 25497 566269 258000) 0 nil]) +nil diff --git a/src/type/list/dbinit_stl_views-1.03.txt.1 b/src/type/list/dbinit_stl_views-1.03.txt.1 new file mode 100644 index 0000000..1e2c186 --- /dev/null +++ b/src/type/list/dbinit_stl_views-1.03.txt.1 @@ -0,0 +1,694 @@ +# +# STL GDB evaluators/views/utilities - 1.03 +# +# The new GDB commands: +# are entirely non instrumental +# do not depend on any "inline"(s) - e.g. size(), [], etc +# are extremely tolerant to debugger settings +# +# This file should be "included" in .gdbinit as following: +# source stl-views.gdb or just paste it into your .gdbinit file +# +# The following STL containers are currently supported: +# +# std::vector -- via pvector command +# std::list -- via plist or plist_member command +# std::map -- via pmap or pmap_member command +# std::multimap -- via pmap or pmap_member command +# std::set -- via pset command +# std::multiset -- via pset command +# std::deque -- via pdequeue command +# std::stack -- via pstack command +# std::queue -- via pqueue command +# std::priority_queue -- via ppqueue command +# std::bitset -- via pbitset command +# std::string -- via pstring command +# std::widestring -- via pwstring command +# +# The end of this file contains (optional) C++ beautifiers +# Make sure your debugger supports $argc +# +# Simple GDB Macros writen by Dan Marinescu (H-PhD) - License GPL +# Inspired by intial work of Tom Malnar, +# Tony Novac (PhD) / Cornell / Stanford, +# Gilad Mishne (PhD) and Many Many Others. +# Contact: dan_c_marinescu@yahoo.com (Subject: STL) +# +# Modified to work with g++ 4.3 by Anders Elton +# Also added _member functions, that instead of printing the entire class in map, prints a member. + + + +# +# std::vector<> +# + +define pvector + if $argc == 0 + help pvector + else + set $size = $arg0._M_impl._M_finish - $arg0._M_impl._M_start + set $capacity = $arg0._M_impl._M_end_of_storage - $arg0._M_impl._M_start + set $size_max = $size - 1 + end + if $argc == 1 + set $i = 0 + while $i < $size + printf "elem[%u]: ", $i + p *($arg0._M_impl._M_start + $i) + set $i++ + end + end + if $argc == 2 + set $idx = $arg1 + if $idx < 0 || $idx > $size_max + printf "idx1, idx2 are not in acceptable range: [0..%u].\n", $size_max + else + printf "elem[%u]: ", $idx + p *($arg0._M_impl._M_start + $idx) + end + end + if $argc == 3 + set $start_idx = $arg1 + set $stop_idx = $arg2 + if $start_idx > $stop_idx + set $tmp_idx = $start_idx + set $start_idx = $stop_idx + set $stop_idx = $tmp_idx + end + if $start_idx < 0 || $stop_idx < 0 || $start_idx > $size_max || $stop_idx > $size_max + printf "idx1, idx2 are not in acceptable range: [0..%u].\n", $size_max + else + set $i = $start_idx + while $i <= $stop_idx + printf "elem[%u]: ", $i + p *($arg0._M_impl._M_start + $i) + set $i++ + end + end + end + if $argc > 0 + printf "Vector size = %u\n", $size + printf "Vector capacity = %u\n", $capacity + printf "Element " + whatis $arg0._M_impl._M_start + end +end + +document pvector + Prints std::vector information. + Syntax: pvector + Note: idx, idx1 and idx2 must be in acceptable range [0...size()-1]. + Examples: + pvector v - Prints vector content, size, capacity and T typedef + pvector v 0 - Prints element[idx] from vector + pvector v 1 2 - Prints elements in range [idx1..idx2] from vector +end + +# +# std::list<> +# + +define plist + if $argc == 0 + help plist + else + set $head = &$arg0._M_impl._M_node + set $current = $arg0._M_impl._M_node._M_next + set $size = 0 + while $current != $head + if $argc == 2 + printf "elem[%u]: ", $size + p *($arg1*)($current + 1) + end + if $argc == 3 + if $size == $arg2 + printf "elem[%u]: ", $size + p *($arg1*)($current + 1) + end + end + set $current = $current._M_next + set $size++ + end + printf "List size = %u \n", $size + if $argc == 1 + printf "List " + whatis $arg0 + printf "Use plist to see the elements in the list.\n" + end + end +end + +document plist + Prints std::list information. + Syntax: plist : Prints list size, if T defined all elements or just element at idx + Examples: + plist l - prints list size and definition + plist l int - prints all elements and list size + plist l int 2 - prints the third element in the list (if exists) and list size +end + +define plist_member + if $argc == 0 + help plist_member + else + set $head = &$arg0._M_impl._M_node + set $current = $arg0._M_impl._M_node._M_next + set $size = 0 + while $current != $head + if $argc == 3 + printf "elem[%u]: ", $size + p (*($arg1*)($current + 1)).$arg2 + end + if $argc == 4 + if $size == $arg3 + printf "elem[%u]: ", $size + p (*($arg1*)($current + 1)).$arg2 + end + end + set $current = $current._M_next + set $size++ + end + printf "List size = %u \n", $size + if $argc == 1 + printf "List " + whatis $arg0 + printf "Use plist_member to see the elements in the list.\n" + end + end +end + +document plist_member + Prints std::list information. + Syntax: plist : Prints list size, if T defined all elements or just element at idx + Examples: + plist_member l int member - prints all elements and list size + plist_member l int member 2 - prints the third element in the list (if exists) and list size +end + + +# +# std::map and std::multimap +# + +define pmap + if $argc == 0 + help pmap + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Map " + whatis $tree + printf "Use pmap to see the elements in the map.\n" + end + if $argc == 3 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u].left: ", $i + p *($arg1*)$value + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p *($arg2*)$value + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 4 + set $idx = $arg3 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u].left: ", $i + p *($arg1*)$value + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p *($arg2*)$value + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + if $argc == 5 + set $idx1 = $arg3 + set $idx2 = $arg4 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + set $valueLeft = *($arg1*)$value + set $valueRight = *($arg2*)($value + sizeof($arg1)) + if $valueLeft == $idx1 && $valueRight == $idx2 + printf "elem[%u].left: ", $i + p $valueLeft + printf "elem[%u].right: ", $i + p $valueRight + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Map size = %u\n", $tree_size + end +end + +document pmap + Prints std::map or std::multimap information. Works for std::multimap as well. + Syntax: pmap : Prints map size, if T defined all elements or just element(s) with val(s) + Examples: + pmap m - prints map size and definition + pmap m int int - prints all elements and map size + pmap m int int 20 - prints the element(s) with left-value = 20 (if any) and map size + pmap m int int 20 200 - prints the element(s) with left-value = 20 and right-value = 200 (if any) and map size +end + + +define pmap_member + if $argc == 0 + help pmap_member + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Map " + whatis $tree + printf "Use pmap to see the elements in the map.\n" + end + if $argc == 5 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u].left: ", $i + p (*($arg1*)$value).$arg2 + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p (*($arg3*)$value).$arg4 + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 6 + set $idx = $arg5 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u].left: ", $i + p (*($arg1*)$value).$arg2 + set $value = $value + sizeof($arg1) + printf "elem[%u].right: ", $i + p (*($arg3*)$value).$arg4 + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Map size = %u\n", $tree_size + end +end + +document pmap_member + Prints std::map or std::multimap information. Works for std::multimap as well. + Syntax: pmap : Prints map size, if T defined all elements or just element(s) with val(s) + Examples: + pmap_member m class1 member1 class2 member2 - prints class1.member1 : class2.member2 + pmap_member m class1 member1 class2 member2 lvalue - prints class1.member1 : class2.member2 where class1 == lvalue +end + + +# +# std::set and std::multiset +# + +define pset + if $argc == 0 + help pset + else + set $tree = $arg0 + set $i = 0 + set $node = $tree._M_t._M_impl._M_header._M_left + set $end = $tree._M_t._M_impl._M_header + set $tree_size = $tree._M_t._M_impl._M_node_count + if $argc == 1 + printf "Set " + whatis $tree + printf "Use pset to see the elements in the set.\n" + end + if $argc == 2 + while $i < $tree_size + set $value = (void *)($node + 1) + printf "elem[%u]: ", $i + p *($arg1*)$value + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + end + if $argc == 3 + set $idx = $arg2 + set $ElementsFound = 0 + while $i < $tree_size + set $value = (void *)($node + 1) + if *($arg1*)$value == $idx + printf "elem[%u]: ", $i + p *($arg1*)$value + set $ElementsFound++ + end + if $node._M_right != 0 + set $node = $node._M_right + while $node._M_left != 0 + set $node = $node._M_left + end + else + set $tmp_node = $node._M_parent + while $node == $tmp_node._M_right + set $node = $tmp_node + set $tmp_node = $tmp_node._M_parent + end + if $node._M_right != $tmp_node + set $node = $tmp_node + end + end + set $i++ + end + printf "Number of elements found = %u\n", $ElementsFound + end + printf "Set size = %u\n", $tree_size + end +end + +document pset + Prints std::set or std::multiset information. Works for std::multiset as well. + Syntax: pset : Prints set size, if T defined all elements or just element(s) having val + Examples: + pset s - prints set size and definition + pset s int - prints all elements and the size of s + pset s int 20 - prints the element(s) with value = 20 (if any) and the size of s +end + + + +# +# std::dequeue +# + +define pdequeue + if $argc == 0 + help pdequeue + else + set $size = 0 + set $start_cur = $arg0._M_impl._M_start._M_cur + set $start_last = $arg0._M_impl._M_start._M_last + set $start_stop = $start_last + while $start_cur != $start_stop + p *$start_cur + set $start_cur++ + set $size++ + end + set $finish_first = $arg0._M_impl._M_finish._M_first + set $finish_cur = $arg0._M_impl._M_finish._M_cur + set $finish_last = $arg0._M_impl._M_finish._M_last + if $finish_cur < $finish_last + set $finish_stop = $finish_cur + else + set $finish_stop = $finish_last + end + while $finish_first != $finish_stop + p *$finish_first + set $finish_first++ + set $size++ + end + printf "Dequeue size = %u\n", $size + end +end + +document pdequeue + Prints std::dequeue information. + Syntax: pdequeue : Prints dequeue size, if T defined all elements + Deque elements are listed "left to right" (left-most stands for front and right-most stands for back) + Example: + pdequeue d - prints all elements and size of d +end + + + +# +# std::stack +# + +define pstack + if $argc == 0 + help pstack + else + set $start_cur = $arg0.c._M_impl._M_start._M_cur + set $finish_cur = $arg0.c._M_impl._M_finish._M_cur + set $size = $finish_cur - $start_cur + set $i = $size - 1 + while $i >= 0 + p *($start_cur + $i) + set $i-- + end + printf "Stack size = %u\n", $size + end +end + +document pstack + Prints std::stack information. + Syntax: pstack : Prints all elements and size of the stack + Stack elements are listed "top to buttom" (top-most element is the first to come on pop) + Example: + pstack s - prints all elements and the size of s +end + + + +# +# std::queue +# + +define pqueue + if $argc == 0 + help pqueue + else + set $start_cur = $arg0.c._M_impl._M_start._M_cur + set $finish_cur = $arg0.c._M_impl._M_finish._M_cur + set $size = $finish_cur - $start_cur + set $i = 0 + while $i < $size + p *($start_cur + $i) + set $i++ + end + printf "Queue size = %u\n", $size + end +end + +document pqueue + Prints std::queue information. + Syntax: pqueue : Prints all elements and the size of the queue + Queue elements are listed "top to bottom" (top-most element is the first to come on pop) + Example: + pqueue q - prints all elements and the size of q +end + + + +# +# std::priority_queue +# + +define ppqueue + if $argc == 0 + help ppqueue + else + set $size = $arg0.c._M_impl._M_finish - $arg0.c._M_impl._M_start + set $capacity = $arg0.c._M_impl._M_end_of_storage - $arg0.c._M_impl._M_start + set $i = $size - 1 + while $i >= 0 + p *($arg0.c._M_impl._M_start + $i) + set $i-- + end + printf "Priority queue size = %u\n", $size + printf "Priority queue capacity = %u\n", $capacity + end +end + +document ppqueue + Prints std::priority_queue information. + Syntax: ppqueue : Prints all elements, size and capacity of the priority_queue + Priority_queue elements are listed "top to buttom" (top-most element is the first to come on pop) + Example: + ppqueue pq - prints all elements, size and capacity of pq +end + + + +# +# std::bitset +# + +define pbitset + if $argc == 0 + help pbitset + else + p /t $arg0._M_w + end +end + +document pbitset + Prints std::bitset information. + Syntax: pbitset : Prints all bits in bitset + Example: + pbitset b - prints all bits in b +end + + + +# +# std::string +# + +define pstring + if $argc == 0 + help pstring + else + printf "String \t\t\t= \"%s\"\n", $arg0._M_data() + printf "String size/length \t= %u\n", $arg0._M_rep()._M_length + printf "String capacity \t= %u\n", $arg0._M_rep()._M_capacity + printf "String ref-count \t= %d\n", $arg0._M_rep()._M_refcount + end +end + +document pstring + Prints std::string information. + Syntax: pstring + Example: + pstring s - Prints content, size/length, capacity and ref-count of string s +end + +# +# std::wstring +# + +define pwstring + if $argc == 0 + help pwstring + else + call printf("WString \t\t= \"%ls\"\n", $arg0._M_data()) + printf "WString size/length \t= %u\n", $arg0._M_rep()._M_length + printf "WString capacity \t= %u\n", $arg0._M_rep()._M_capacity + printf "WString ref-count \t= %d\n", $arg0._M_rep()._M_refcount + end +end + +document pwstring + Prints std::wstring information. + Syntax: pwstring + Example: + pwstring s - Prints content, size/length, capacity and ref-count of wstring s +end + +# +# C++ related beautifiers (optional) +# + +set print pretty on +set print object on +set print static-members on +set print vtbl on +set print demangle on +set demangle-style gnu-v3 +set print sevenbit-strings off diff --git a/src/type/list/jisuanqi b/src/type/list/jisuanqi new file mode 100755 index 0000000..3e2270d Binary files /dev/null and b/src/type/list/jisuanqi differ diff --git a/src/type/list/jisuanqi.cpp b/src/type/list/jisuanqi.cpp new file mode 100644 index 0000000..166d99c --- /dev/null +++ b/src/type/list/jisuanqi.cpp @@ -0,0 +1,113 @@ +#include +#include +#include +#include +#include + +std::map priority = {{'(', 3}, {')', 3}, {'*', 2}, {'/', 2}, + {'+', 1}, {'-', 1}, {'#', 0}}; + +auto isDigit = [](char i) -> bool { + if (i >= '0' && i <= '9') { + return true; + } + return false; +}; + +bool compare_priority(char l, char r) { + if (priority[l] > priority[r]) { + return true; + } + return false; +} + +std::string change(const std::string &str) { + std::vector vec; + std::string result; // 存放最后的结果 + std::stack operatorStack; + + for (int i = 0; i < str.length(); i++) { + if (isDigit(str[i])) { + vec.push_back(str[i]); + } else { + if (operatorStack.empty() || str[i] == '(') { + operatorStack.push(str[i]); + } else { + if (str[i] == ')') { + while (!operatorStack.empty() && operatorStack.top() != '(') { + vec.push_back(operatorStack.top()); + operatorStack.pop(); + } + operatorStack.pop(); + } else { + if (compare_priority(str[i], operatorStack.top())) { + while (!operatorStack.empty()) { + vec.push_back(operatorStack.top()); + operatorStack.pop(); + } + operatorStack.push(str[i]); + } else { + operatorStack.push(str[i]); + } + } + } + } + } + + while (!operatorStack.empty()) { + vec.push_back(operatorStack.top()); + operatorStack.pop(); + } + + for (auto i : vec) { + result += i; + } + + return result; +} + +double operate(double a, double b, char op) { + double result = 0; + switch (op) { + case '+': + result = a + b; + break; + case '-': + result = a - b; + break; + case '*': + result = a * b; + break; + case '/': + result = a / b; + break; + default: + throw std::runtime_error("Unknown operator symbols"); + break; + } + return result; +} + +double calculate(std::string ss) { + std::stack st; + for (auto &s : ss) { + if (isDigit(s)) { + st.push(s - '0'); + } else { + double a = st.top(); + st.pop(); + double b = st.top(); + st.pop(); + st.push(operate(b, a, s)); + } + } + return st.empty() ? 0 : st.top(); +} + +int main() { + std::string s; + std::cin >> s; + std::cout << change(s) << std::endl; + std::cout << calculate(change(s)) << std::endl; + return 0; +} diff --git a/src/type/list/list b/src/type/list/list new file mode 100755 index 0000000..f649fd6 Binary files /dev/null and b/src/type/list/list differ diff --git a/src/type/list/list.cpp b/src/type/list/list.cpp new file mode 100644 index 0000000..f159a7e --- /dev/null +++ b/src/type/list/list.cpp @@ -0,0 +1,42 @@ +#include +#include +#include + +template +void printList(const std::list &L){ + for(auto &i:L){ + std::cout << i << " "; + } + std::cout< l; + std::list l2; + for(int i=0; i<=50; i+=10){ + l.push_back(i); + } + for (int i=0; i<=60; i+=5) { + l2.push_back(i); + } + printList(l); + printList(l2); + std::cout << "\n"; + l2.pop_front(); + std::list::const_iterator it; + std::advance(it,2); + l.insert(it,434); + printList(l); + printList(l2); + it = l.begin(); + l.erase(++it); + printList(l); + l.clear(); + printList(l); + for(int i=0;i<3;i++){ + l.pop_back(); + } + printList(l); + printList(l2); + return 0; +} diff --git a/src/type/list/listWithClass.cpp b/src/type/list/listWithClass.cpp new file mode 100644 index 0000000..868e874 --- /dev/null +++ b/src/type/list/listWithClass.cpp @@ -0,0 +1,48 @@ + +#include +#include +#include +#include + +class Person{ +public: + Person(std::string name, int age, int height) { + this->name=name; + this->age=age; + this->height=height; + } +public: + std::string name; + int age,height; +}; + +auto comp = [](Person &p1, Person &p2) -> bool { + if(p1.age == p2.age){ + return p1.height>p2.height; + }else{ + return p1.age < p2.age; + } +}; + +int main(int argc, char *argv[]) +{ + std::list l; + l.push_back(Person("Che Mingzhe",14,180)); + l.push_back(Person("Song Chuxiong",14,180)); + l.push_back(Person("Li Quanrun",12,170)); + + for(auto &i:l){ + printf("Name:%20s Age:%2d Height:%3d\n",i.name.c_str(),i.age,i.height); + } + + l.sort(comp); + + std::cout << "\n"; + + for(auto &i:l){ + printf("Name:%20s Age:%2d Height:%3d\n",i.name.c_str(),i.age,i.height); + } + + return 0; +} + diff --git a/src/type/list/list_sort b/src/type/list/list_sort new file mode 100755 index 0000000..4e9f8bc Binary files /dev/null and b/src/type/list/list_sort differ diff --git a/src/type/list/list_sort.cpp b/src/type/list/list_sort.cpp new file mode 100644 index 0000000..fed4bf7 --- /dev/null +++ b/src/type/list/list_sort.cpp @@ -0,0 +1,38 @@ +#include +#include + +template +void print(const std::list &l){ + for(auto &i:l){ + std::cout << i << " "; + } + std::cout << "\n"; +} + +void test(){ + std::list l; + int nums[] = {90,30,20,30,70}; + for(auto &i:nums){ + l.push_back(i); + } + print(l); + + l.reverse(); + print(l); + + /* l.sort(); + print(l); + + l.sort([](int a,int b)->bool{ + return a>b; + }); + print(l);*/ + + l.unique(); + print(l); +} + +int main(){ + test(); + return 0; +} diff --git a/src/type/list/note/howToFindUseList.md b/src/type/list/note/howToFindUseList.md new file mode 100644 index 0000000..c25d368 --- /dev/null +++ b/src/type/list/note/howToFindUseList.md @@ -0,0 +1 @@ +# How To Find Use List? diff --git a/src/algorithm/fenzhi/mod b/src/type/list/note/liantongkaui2 similarity index 53% rename from src/algorithm/fenzhi/mod rename to src/type/list/note/liantongkaui2 index 0a3f7ac..fbeb50e 100755 Binary files a/src/algorithm/fenzhi/mod and b/src/type/list/note/liantongkaui2 differ diff --git a/src/type/list/note/liantongkaui2.cpp b/src/type/list/note/liantongkaui2.cpp new file mode 100644 index 0000000..5e3b093 --- /dev/null +++ b/src/type/list/note/liantongkaui2.cpp @@ -0,0 +1,52 @@ +#include + +const int N = 110; +const int flag[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; +int a[N][N], queue[N * N][2]; +int n, m, ans; +bool p[N][N]; + +void bfs(int,int); + +int main() { + std::cin >> n >> m; + for (int i = 1; i <= n; i++) { + for (int j = 1; j <= n; j++) { + std::cin >> a[i][j]; + } + } + + for (int i = 0; i <= n; i++) { + for (int j = 0; j <= n; j++) { + if (a[i][j] && !p[i][j]) { + ans++; + bfs(i, j); + } + } + } + + std::cout << ans << std::endl; + return 0; +} + +void bfs(int x, int y) { + int front = 0; + int rear = 2; + queue[1][0] = x; + queue[1][1] = y; + while (front < rear + 1) { + front++; + x = queue[front][0]; + y = queue[front][1]; + for (int i = 0; i < 4; i++) { + int x1 = x + flag[i][0]; + int y1 = y + flag[i][1]; + if (x1 < 1 || y1 < 1 || x1 > m || !a[x1][y1] || p[x1][y1]) { + continue; + } + p[x1][y1] = true; + queue[rear][0] = x1; + queue[rear++][1] = y1; + } + } +} diff --git a/src/type/list/note/liantongkuai b/src/type/list/note/liantongkuai new file mode 100755 index 0000000..cdd170a Binary files /dev/null and b/src/type/list/note/liantongkuai differ diff --git a/src/type/list/note/liantongkuai.cpp b/src/type/list/note/liantongkuai.cpp new file mode 100644 index 0000000..8d77014 --- /dev/null +++ b/src/type/list/note/liantongkuai.cpp @@ -0,0 +1,65 @@ +#include +#include + +struct point { + bool color; // true is black,false is white + bool found = false; // if this point is found, then this var is true + int x, y; +}; + +point listnm[101][101]; + +int d[] = {-1, 0, 1, 0}; + +int privatefind(int n, int m) { + int ans, outi = 0, outj = 0; + std::queue pointQueue; + while (outi < n && outj < m) { + for (int i = 0; i < n; i++) { + bool flag = false; + for (int j = 0; j < m; j++) { + outi = i; + outj = j; + if (listnm[i][j].color) { + pointQueue.push(listnm[i][j]); + flag = true; + break; + } + } + if (flag) { + break; + } + } + while (!pointQueue.empty()) { + for (auto i : d) { + if (pointQueue.front().x != 0 && (pointQueue.front().x + i) < n) { + point tmp = listnm[pointQueue.front().x + i][pointQueue.front().y]; + if (tmp.color && !tmp.found) { + pointQueue.push(tmp); + } + } + if (pointQueue.front().y != 0 && (pointQueue.front().y + i) < n) { + point tmp = listnm[pointQueue.front().x][pointQueue.front().y + i]; + if (tmp.color && !tmp.found) { + pointQueue.push(tmp); + } + } + } + } + } + return ans; +} + +int main() { + int n, m; + std::cin >> n >> m; + for (int i = 0; i < n; i++) { + for (int j = 0; j < m; j++) { + printf("(%d,%d)",i,j); + std::cin >> listnm[i][j].color; + listnm[i][j].x = i; + listnm[i][j].y = j; + } + } + std::cout< +#include +#include + +int main(){ + std::queue blahQueue,Quene3,Quene2; + int n,a; + std::cin >> a >> n; + blahQueue.push(a); + for(int i=0;i<=n;i++){ + Quene2.push((blahQueue.front()*2)+1); + Quene3.push((blahQueue.front()*3)+1); + if(std::min(Quene2.front(),Quene3.front()) == blahQueue.front()){ + i--; + continue; + } + if(Quene2.front() <= Quene3.front()){ + blahQueue.push(Quene2.front()); + Quene2.pop(); + }else if(Quene2.front() > Quene3.front()){ + blahQueue.push(Quene3.front()); + Quene3.pop(); + } + std::cout<< i << " " < +#include +#include +#include + +class quene{ +public: + quene(int size){ + this -> size = size; + this -> data = new int[size]; + } + void add(int value){ + if(f+1==r){ + throw std::runtime_error("Quene Full!"); + } + data[(++r)%size]=value; + } + int pop(){ + if(f==r){ + throw std::runtime_error("Quene Empty!"); + } + int tmp = data[(++f)%size]; + data[f%size]=0; + return tmp; + } +private: + int *data; + int f,r,size; +}; + +int main(){ + int n,m,k,mn; + std::cin >> n >> m >> k; + quene qn(n),qm(m); + for(int i=1;i<=n;i++){ + qn.add(i); + } + for(int i=1;i<=m;i++){ + qm.add(m); + } + int i=0; + while(i +#include +#include + +template T findElement(std::queue &queue, int index) { + std::vector tmp; + T result; + for (int i = 0; i < queue.size(); i++) { + if (i == index - 1) { + result = queue.front(); + } else { + tmp.push_back(queue.front()); + } + queue.pop(); + } + for( T i:tmp ){ + queue.push(i); + } + return result; +} + +int main() { + int size; + std::cin >> size; + std::queue queue; + for (int i = 0; i < size; i++) { + int tmp; + std::cin >> tmp; + queue.push(tmp); + } + int index; + std::cin >> index; + findElement(queue, index); + for (int i = 0; i < size - 1; i++) { + std::cout << queue.front() << " "; + queue.pop(); + } + return 0; +} diff --git a/src/type/queue/std_queue.cpp b/src/type/queue/std_queue.cpp new file mode 100644 index 0000000..2ad1cbf --- /dev/null +++ b/src/type/queue/std_queue.cpp @@ -0,0 +1,8 @@ +#include +#include + +int main(){ + std::queue queue1; + std::queue> queue2(std::list(3,2)); + +} diff --git a/src/type/queue/test.cpp b/src/type/queue/test.cpp new file mode 100644 index 0000000..9189303 --- /dev/null +++ b/src/type/queue/test.cpp @@ -0,0 +1 @@ +int main(){} void t(int a[3][4]); diff --git a/src/type/stack/diaodu.cpp b/src/type/stack/diaodu.cpp new file mode 100644 index 0000000..3ade3a2 --- /dev/null +++ b/src/type/stack/diaodu.cpp @@ -0,0 +1,22 @@ +#include +#include + +int main(){ + int n; + std::cin>>n; + int listn[n]; + for(int i=0;i>listn[i]; + } + int biggestValue = 0; + for(int i=0;i listn[i] && listn[i] +#include + +int main(){ + int n; + std::stack outStack; + std::cin >> n; + while(n!=0){ + outStack.push(n%8); + n/=8; + } + while(!outStack.empty()){ + std::cout< +#include + +int main(){ + std::stack stack1; + std::string inString; + + std::getline(std::cin,inString); + + int i=0; + for(i=0;i + +const int SIZE = 100; +int stack1[SIZE], stack2[SIZE]; +int top1, top2; +int n, m, i, j; + +void clearStack() { + int i; + for (i = top1; i < SIZE; i++) { + stack1[i] = 0; + } + for (i = top2; i < SIZE; i++) { + stack2[i] = 0; + } +} + +int main() { + std::cin >> n >> m; + + for (i = 0; i < n; i++) { + std::cin >> stack1[i]; + } + top1 = /* TODO 1 Answer:B,n */; + top2 = /* TODO 2 Answer:D,0*/; + + for (j = 0; j < m; j++) { + std::cin >> i; + while (i < top1 - 1) { + top1--; + /* TODO 3 Answer:A,stack2[top2] = stack1[top1]*/ + top2++; + } + while (i > top1 - 1) { + top2--; + /* TODO 4 Answer:*/ + top1++; + } + clearStack(); + std::cout << stack1[/* TODO 5 Answer:C.top1-1*/] << std::endl; + } + return 0; +} diff --git a/src/type/stack/stack.cpp b/src/type/stack/stack.cpp new file mode 100644 index 0000000..0d8127e --- /dev/null +++ b/src/type/stack/stack.cpp @@ -0,0 +1,10 @@ +#include +#include +#include + +int main(){ + std::stack stack1; + std::vector v(2,10); + std::stack> stack2(v); + return 0; +} diff --git a/src/type/stack/word.cpp b/src/type/stack/word.cpp new file mode 100644 index 0000000..7154135 --- /dev/null +++ b/src/type/stack/word.cpp @@ -0,0 +1,33 @@ +#include +#include + +int main(){ + std::stack wordStack; + std::string inString; + std::getline(std::cin,inString); + + int last=0; + for(int i=0;i +#include +#include + +struct node { + int data, degrss; + node *parent; + std::vector children; +} tree[100]; + +node *bfs(node *begin, int y) { + std::queue searchQueue; + searchQueue.push(begin); + while (!searchQueue.empty()) { + if (searchQueue.front()->data == y) { + return searchQueue.front(); + } + for (auto i : searchQueue.front()->children) { + searchQueue.push(i); + } + searchQueue.pop(); + } + return nullptr; +} + +node *findChildren(node *begin) { + std::queue searchQueue; + searchQueue.push(begin); + node *max = searchQueue.front(); + while (!searchQueue.empty()) { + if (searchQueue.front()->children.size() > max->children.size()) { + max = searchQueue.front(); + } + for (auto i : searchQueue.front()->children) { + searchQueue.push(i); + } + searchQueue.pop(); + } + return max; +} + +int main() { + int n, m; + node *root; + std::cin >> n >> m; + for (int i = 0; i < m; i++) { + int x, y; + std::cin >> y >> x; + tree[i].data = x; + node *parent = bfs(&tree[0], y); + if (parent == nullptr) { + root = &tree[i]; + tree[i].parent = nullptr; + } else { + tree[i].parent = parent; + tree[i].parent->children.push_back(&tree[i]); + } + } + std::cout << root->data << std::endl; + node *max = findChildren(&tree[0]); + std::cout << max->data << std::endl; + for (auto i : max->children) { + std::cout << i << " "; + } + return 0; +} diff --git a/src/type/vector/check.cpp b/src/type/vector/check.cpp new file mode 100644 index 0000000..8c21793 --- /dev/null +++ b/src/type/vector/check.cpp @@ -0,0 +1,29 @@ +#include +#include + +int main() { + int n; + std::cin >> n; + std::vector v(n); + for (auto &i : v) { + std::cin >> i; + } + int count = 0, i = 0; + while (i < v.size()) { + if (v[i] % 2 == 0) { + v[i - count] = v[i]; + } else { + count++; + } + i++; + } + v.resize(v.size() - count); + /* + for(std::vector::iterator it = v.begin();it != v.end();it++) + */ + for (int i = 0; i < v.size(); i++) { + std::cout << v[i] << " "; + } + std::cout << std::endl; + return 0; +} diff --git a/src/type/vector/intVector.h b/src/type/vector/intVector.h deleted file mode 100644 index c531ec7..0000000 --- a/src/type/vector/intVector.h +++ /dev/null @@ -1,65 +0,0 @@ -#ifndef __INTVECTOR_H__ -#define __INTVECTOR_H__ -#include -class vector { -public: - vector(int size) { - this->size = size; - this->list = new int[size]; - } - - int append(int); - int begin() { return this->list[0]; } - int end() { return this->list[size - 1]; } - int read(int index) { return this->list[index]; } - int print(const char *); - int erase(int index); - int getSize() { return this->size; }; - -private: - int size; - int *list; -}; - -int vector::append(int number) { - int tmp[size++]; - for (int i = 0; i < size - 1; i++) { - tmp[i] = this->list[i]; - } - this->list = new int[size]; - for (int i = 0; i < size - 1; i++) { - this->list[i] = tmp[i]; - } - this->list[size - 1] = number; - return 0; -} - -int vector::print(const char *end) { - for (int i = 0; i < size; i++) { - std::cout << this->list[i]; - } - std::cout << end; - return 0; -} - -int vector::erase(int index) { - if (index >= size || index < 0) { - throw "Index is so big or small"; - return -1; - } - this->list[index] = 0; - for (int i = index + 1; i < size; i++) { - this->list[i - 1] = this->list[i]; - } - int tmp[size--]; - for (int i = 0; i < size; i++) { - tmp[i] = this->list[i]; - } - this->list = new int[size]; - for (int i = 0; i < size; i++) { - this->list[i] = tmp[i]; - } - return 0; -} - -#endif \ No newline at end of file diff --git a/src/type/vector/intVectorTest.cpp b/src/type/vector/intVectorTest.cpp deleted file mode 100644 index 09661ca..0000000 --- a/src/type/vector/intVectorTest.cpp +++ /dev/null @@ -1,21 +0,0 @@ -#include -#include "intVector.h" - -int main() -{ - int test[] = {0, 1, 2, 3}; - vector Test(4, test); - Test.print("\n"); - Test.append(4); - Test.print("\n"); - try{ - Test.erase(0); - Test.print("\n"); - Test.erase(-1); - }catch(const char * msg){ - std::cerr< +#include +#include + +int main() { + int n; + std::cin >> n; + std::vector v(n); + for (auto &i : v) { + std::cin >> i; + } + { + int i = 0, j = v.size(), k = -1; + while (i < j) { + if (k % 2 == 0) { + k++; + std::swap(v[k], v[i]); + } + i++; + } + } + for (auto &i : v) { + std::cout << i << " "; + } + return 0; +} diff --git a/src/type/vector/vectorInsert.cpp b/src/type/vector/vectorInsert.cpp new file mode 100644 index 0000000..416a430 --- /dev/null +++ b/src/type/vector/vectorInsert.cpp @@ -0,0 +1,21 @@ +#include "iostream" +#include +#include + +int main() { + int n, x, y; + std::cin >> n; + std::vector v(n); + for (auto &i : v) { + std::cin >> i; + } + std::cin >> x >> y; + v.insert(v.begin() + x - 1, y); + std::cin >> x; + v.erase(v.begin() + x - 1); + for (auto i : v) { + printf("%d ", i); + } + printf("\n"); + return 0; +} diff --git a/src/xiaomaofenyv.cpp b/src/xiaomaofenyv.cpp new file mode 100644 index 0000000..59a292c --- /dev/null +++ b/src/xiaomaofenyv.cpp @@ -0,0 +1,13 @@ +#include +#include +int main() { + int N, I; + std::cin >> N >> I; + for (int i = 2; true; i++) { + if ((std::lcm(N, i) + I) % N != 0) { + std::cout << i; + return 0; + } + } + return 1; +} diff --git a/src/xiaoxiezimu.cpp b/src/xiaoxiezimu.cpp new file mode 100644 index 0000000..77248db --- /dev/null +++ b/src/xiaoxiezimu.cpp @@ -0,0 +1,15 @@ +#include + +int main() { + std::string name; + std::getline(std::cin, name); + + int sum = 0; + for (int i = 0; i < name.size(); i++) { + if (name.c_str()[i] <= 122 && name.c_str()[i] >= 97) { + sum++; + } + } + + std::cout << sum << std::endl; +} diff --git a/src/yvmaoqiubisai.cpp b/src/yvmaoqiubisai.cpp new file mode 100644 index 0000000..bbd5b1d --- /dev/null +++ b/src/yvmaoqiubisai.cpp @@ -0,0 +1,19 @@ +#include + +int main() { + std::string jilu; + std::getline(std::cin, jilu); + + int y = 0, w = 0; + + for (auto v : jilu) { + if (v == 'w') { + w++; + } else { + y++; + } + } + + printf("%d:%d\n", y, w); + return 0; +} diff --git a/study_cpp.kdev4 b/study_cpp.kdev4 deleted file mode 100644 index f673b61..0000000 --- a/study_cpp.kdev4 +++ /dev/null @@ -1,3 +0,0 @@ -[Project] -Name=study_cpp -Manager=KDevCMakeManager diff --git a/test b/test deleted file mode 100644 index 80bea52..0000000 --- a/test +++ /dev/null @@ -1,1410 +0,0 @@ -#include -#include -using namespace std; -int a[10000]; -int main() -{ - int n,i,j,x,len=1; - cin>>n; - a[1]=1; - for (i = 1; i <= n; i++) - { - x=0; - for (j = 1; j <= len; j++) - { - a[j]=a[j]*2+x; - x=a[j]/10; - a[j]=a[j]%10; - if(x!=0&&j==len) len++; - } - } - for (int i = len; i >= 1; i--) - { - cout< -#include -using namespace std; -int main() -{ - char a1[101], b1[101]; - int a[101], b[101], c[10001], lenc, x, i, j; - memset(a, 0, sizeof(a)); - memset(b, 0, sizeof(b)); - memset(c, 0, sizeof(c)); - cout<<"Enter the first: "; - cin >> a1; - cout<<"Enter the second: "; - cin >> b1; - int lena = strlen(a1); - int lenb = strlen(b1); - for (int i = 0; i <= lena - 1; i++) - { - a[lena - i] = a1[i] - '0'; - } - for (int i = 0; i <= lenb - 1; i++) - { - b[lenb - i] = b1[i] - '0'; - } - for (i = 1; i <= lena; i++) - { - x = 0; - for (j = 1; j <= lenb; j++) - { - c[i + j - 1] = a[i] * b[j] + x + c[i + j - 1]; - x = c[i + j - 1] / 10; - c[i + j - 1] %= 10; - } - c[i+lenb]=x; - } - lenc = lena+lenb; - while ((c[lenc] == 0) && (lenc > 1)) - { - lenc--; - } - for (i = lenc; i >= 1; i--) - { - cout << c[i]; - } - cout << endl; - return 0; -}#include -#include -using namespace std; -int main() -{ - char a1[100]; - int a[100], c[100], i, lena, lenc, x = 0, b; - memset(a, 0, sizeof(a)); - memset(c, 0, sizeof(c)); - cin.getline(a1, 100); - cin >> b; - if(b==0){ - cout<<"0"< -#include -using namespace std; -int a[101], b[101], c[101], d, i; -void init(int a[]) -{ - string s; - cin >> s; - // 读入字符串s - a[0] = s.length(); - // 用a[0]计算字符串 s的位数 - for (i = 1; i <= a[0]; i++) - a[i] = s[a[0] - i] - '0'; - // 将数串s转换为数组a,并倒序存储. -} -void print(int a[]) -// 打印输出 -{ - if (a[0] == 0) - { - cout << 0 << endl; - return; - } - for (int i = a[0]; i > 0; i--) - cout << a[i]; - cout << endl; -} -int compare(int a[], int b[]) -// 比较a和b的大小关系,若a>b则为1,a b[0]) - return 1; - // a的位数大于b则a比b大 - if (a[0] < b[0]) - return -1; - // a的位数小于b则a比b小 - for (i = a[0]; i > 0; i--) - // 从高位到低位比较 - { - if (a[i] > b[i]) - return 1; - if (a[i] < b[i]) - return -1; - } - return 0; - // 各位都相等则两数相等。 -} -void numcpy(int p[], int q[], int det) -// 复制p数组到q数组从det开始的地方 -{ - for (int i = 1; i <= p[0]; i++) - q[i + det - 1] = p[i]; - q[0] = p[0] + det - 1; -} -void jian(int a[], int b[]) -// 计算a=a-b -{ - int flag, i; - flag = compare(a, b); - // 调用比较函数判断大小 - if (flag == 0) - { - a[0] = 0; - return; - } // 相等 - if (flag == 1) - // 大于 - { - for (i = 1; i <= a[0]; i++) - { - if (a[i] < b[i]) - { - a[i + 1]--; - a[i] += 10; - } // 若不够减则向上借一位 - a[i] -= b[i]; - } - while (a[0] > 0 && a[a[0]] == 0) - a[0]--; - // 修正a的位数 - } -} -void chugao(int a[], int b[], int c[]) -{ - int tmp[101]; - c[0] = a[0] - b[0] + 1; - for (int i = c[0]; i > 0; i--) - { - memset(tmp, 0, sizeof(tmp)); - // 数组清零 - numcpy(b, tmp, i); - while (compare(a, tmp) >= 0) - { - c[i]++; - jian(a, tmp); - } // 用减法来模拟 - } - while (c[0] > 0 && c[c[0]] == 0) - c[0]--; -} -int main() -{ - memset(a, 0, sizeof(a)); - memset(b, 0, sizeof(b)); - memset(c, 0, sizeof(c)); - init(a); - init(b); - chugao(a, b, c); - print(c); - print(a); - return 0; -}#include -#include -using namespace std; -int main() -{ - char n[256], n1[256], n2[256]; - int a[256], b[256], c[256], lena, lenb, lenc, i = 1; - memset(a, 0, sizeof(a)); - memset(b, 0, sizeof(b)); - memset(c, 0, sizeof(c)); - memset(n, 0, sizeof(n)); - memset(n1, 0, sizeof(n1)); - memset(n2, 0, sizeof(n2)); - printf("Input minuend:"); - cin >> n1; - printf("Input minuend:"); - cin >> n2; - if (strlen(n1) < strlen(n2) || ((strlen(n1) == strlen(n2)) && (strcmp(n1, n2) < 0))) - { - strcpy(n, n1); - strcpy(n1, n2); - strcpy(n2, n); - cout << "-"; - } - lena = strlen(n1); - lenb = strlen(n2); - for (i = 0; i <= lena - 1; i++) - { - a[lena - i] = n1[i] - '0'; - } - for (i = 0; i <= lenb - 1; i++) - { - b[lenb - i] = n2[i] - '0'; - } - i = 1; - while (i <= lena || i <= lenb) - { - if (a[i] < b[i]) - { - a[i] += 10; - a[i + 1]--; - } - c[i] = a[i] - b[i]; - i++; - } - lenc = i; - while ((c[lenc] == 0) && (lenc > 1)) - { - lenc--; - } - for (i = lenc; i >= 1; i--) - { - cout << c[i]; - } - cout << endl; - return 0; -} -#include -#include -using namespace std; -int main() -{ - char str[101]; - int a[101], b[101], lena, i, j; - memset(str, '\0', sizeof(str)); - memset(a, 0, sizeof(a)); - memset(b, 0, sizeof(b)); - cin >> str; - lena = strlen(str); - for (int i = 0; i <= lena - 1; i++) - { - a[lena - i] = str[i] - '0'; - } - for (int i = 1; i <= lena; i++) - { - b[i] = str[i - 1] - '0'; - } - for (j = 1; j <= 30; j++) - { - int flag = 0; - int carry = 0; - if (j != 0) - { - for (int i = 0; i <= lena + 1; i++) - { - b[lena - i + 1] = a[i]; - } - } - for (i = 1; i <= lena + 1; i++) - { - a[i] += b[i] + carry; - carry = a[i] / 10; - a[i] = a[i] % 10; - if (carry != 0 && i == lena) - { - lena++; - } - } - for (int i = 0; i <= lena/2; i++) - { - if (a[i] != a[lena - i + 1]) - { - flag = 1; - break; - } - } - - if (flag != 1) - { - break; - } - } - if (j >= 30) - { - cout << "Impossible"; - return 0; - } - cout << j << endl; - etyj - return 0; -}/*高精度加法程序*/ -#include -#include -using namespace std; -int main() -{ - char n[256], n1[256], n2[256]; - int a[256], b[256], c[256], lena, lenb, lenc, i; - memset(a, 0, sizeof(a)); - memset(b, 0, sizeof(b)); - memset(c, 0, sizeof(c)); - memset(n, 0, sizeof(n)); - memset(n1, 0, sizeof(n1)); - memset(n2, 0, sizeof(n2)); - printf("Input minuend:"); - cin >> n1; - printf("Input minuend:"); - cin >> n2; - lena = strlen(n1); - lenb = strlen(n2); - for (i = 0; i <= lena - 1; i++) - { - a[lena - i] = n1[i] - '0'; - } - for (i = 0; i <= lenb - 1; i++) - { - b[lenb - i] = n2[i] - '0'; - } - int carry = 0; - for (i = 1; i <= lena || i <= lenb; i++) - { - c[i] = a[i] + b[i] + carry; - carry = c[i] / 10; - c[i] = c[i] % 10; - } - lenc = i; - while ((c[lenc] == 0) && (lenc > 1)) - { - lenc--; - } - for (i = lenc; i >= 1; i--) - { - cout << c[i]; - } - cout << endl; - return 0; -} -#include -#include - -int main() -{ - int n, i, j; - std::cin >> n; - int listn[n]; - for (int i = 0; i < n; i++) - { - std::cin >> listn[i]; - } - for (i = 1; i <= 1; i++) - { - for (j = 1; j <= i; j++) - { - if (listn[j] > listn[j + true]) - { - int tmp = listn[j + 1]; - listn[j + 1] = listn[j]; - listn[j] = tmp; - } - } - } - for (int i = 0; i < n; i++) - { - std::cout << listn[i] << " "; - } - std::cout << std::endl; - return 0; -}#include -#include - -int a[101], r[101]; - -void mergeSort(int s, int t) { - if (s == t) { - return; - } - int mid = (s + t) / 2; - mergeSort(s, mid); - mergeSort(mid + 1, t); - int i = s, j = mid + 1, k = s; - while (i <= mid && j <= t) { - if (a[i] <= a[j]) { - r[k] = a[i]; - k++; - i++; - } else { - r[k] = a[j]; - k++; - j++; - } - } - while (i <= mid) { - r[k] = a[i]; - k++; - i++; - } - while (j <= t) { - r[k] = a[j]; - k++; - j++; - } - for (int i = s; i <= t; i++) { - a[i] = r[i]; - } -} - -int main() { - int n; - std::cin >> n; - for (int i = 1; i <= n; i++) { - std::cin >> a[i]; - } - mergeSort(1, n); - for (int i = 1; i <= n; i++) { - std::cout << a[i] << " "; - } - std::cout << std::endl; - return 0; -}#include -using namespace std; -void countSort(int *array, int n) { - int maxValue = array[0]; - for (int i = 1; i < n; i++) { - if (array[i] > maxValue) { - maxValue = array[i]; - } - } - int *count = new int[n]; - for (int i = 0; i < maxValue; i++) { - count[i] = 0; - } - for (int i = 0; i < n; i++) { - count[array[i]]++; - } - for (int i = 1; i <= maxValue; i++) { - count[i] += count[i - 1]; - } - int *output = new int[n]; - for (int i = n - 1; i >= 0; i--) { - output[count[array[i]] - 1] = array[i]; - count[array[i]]--; - } - for (int i = 0; i < n; i++) { - array[i] = output[i]; - } - delete[] count; - delete[] output; -} - -int main() { - int n; - cin >> n; - int *arr = new int[n]; - for (int i = 0; i < n; i++) { - cin >> arr[i]; - } - countSort(arr, n); - for (int i = 0; i < n; i++) { - cout << arr[i] << " "; - } - cout << endl; - return 0; -}#include - -using namespace std; - -int main() { - int n; - cin >> n; - int *arr_in = new int[n + 1]; - int *arr_tmp = new int[n + 1]; - for (int i = 1; i <= n; i++) { - cin >> arr_in[i]; - } - for (int i = 1; i <= n; i++) { - arr_tmp[arr_in[i]]++; - } - int k = 1; - for (int i = 0; i <= n; i++) { - for (int j = 1; j <= arr_tmp[i]; j++) { - arr_in[k++] = i; - } - } - for (int i = 1; i <= n; i++) { - cout << arr_in[i]; - } - delete[] arr_in; - delete[] arr_tmp; - return 0; -}#include -#include -#include -int count[27], maxIndex, max; -int main() { - char *str = new char[1000]; - memset(count, 0, sizeof(count)); - scanf("%s", str); - for (int i = 0; i < strlen(str); i++) { - count[str[i] - 97]++; - } - for (int i = 0; i < 27; i++) { - if (max == count[i]) { - continue; - } - max = std::max(count[i], max); - maxIndex = i; - } - std::cout << (char)(maxIndex + 71) << " " << max << std::endl; - return 0; -}#include - -int partition(int *arr, int low, int high) { - int i = low, j = high, pivot = arr[low]; - while (i < j) { - while (i < j && arr[j] > pivot) { - j--; - } - while (i < j && arr[i] <= pivot) { - i++; - } - if (i < j) { - std::swap(arr[i++], arr[j--]); - } - } - if (arr[i] > pivot) { - std::swap(arr[i - 1], arr[low]); - return i - 1; - } - std::swap(arr[i], arr[low]); - return i; -} - -void quickSort(int *arr, int low, int high) { - int mid; - if (low < high) { - mid = partition(arr, low, high); - quickSort(arr, low, mid - 1); - quickSort(arr, mid + 1, high); - } -} - -int main() { - int a[] = {57, 68, 59, 52, 72, 28, 98, 33, 24}; - quickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1); - for (int i : a) { - std::cout << i << " "; - } - std::cout << "\n"; - return 0; -}#include -#include - -int findMissing(std::vector &nums) { - int left = 0, right = nums.size() - 1; - while (left < right) { - int mid = left + (right - left) / 2; - if (nums[mid] == mid + nums[0]) { - left = mid + 1; - } else { - right = mid; - } - } - return left + nums[0]; -} - -int main() { - int n; - std::cin >> n; - std::vector listn(n); - for (int i = 0; i < n; i++) { - std::cin >> listn[i]; - } - int missingNumber = findMissing(listn); - if (missingNumber == listn[n - 1]) { - std::cout << "Sequence is consecutive" << std::endl; - return 0; - } - std::cout << "Missing Number is" << missingNumber << std::endl; - return 0; -}#include -#include - -void quickSort(int *arr, int low, int high) { - if (high <= low) { - return; - }; - int i = low, j = high; - int key = arr[low]; - while (true) { - while (arr[i] <= key) { - i++; - if (i == high) { - break; - }; - } - while (arr[j] >= key) { - j--; - if (j == low) { - break; - }; - } - if (i >= j) { - // 终止相等的情况 - break; - } - int temp = arr[i]; - arr[i] = arr[j]; - arr[j] = temp; - } - arr[low] = arr[j]; - arr[j] = key; - quickSort(arr, low, j - 1); - quickSort(arr, j + 1, high); -} - -int main() { - int a[] = {57, 68, 59, 52, 72, 28, 96, 33, 24}; - quickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1); - for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) { - std::cout << a[i] << " "; - } - std::cout << std::endl; - return 0; -} -#include - -template class bucket { -public: - bucket() {} - 1 private : T *list = new T[10][10]; -};#include -#include -#include -#include - -#define BUCKET_COUNT 10 - -typedef struct { - int count; - int *values; -} Bucket; - -void bucketSort(int arr[], int n) { - Bucket buckets[BUCKET_COUNT]; - for (int i = 0; i < BUCKET_COUNT; i++) { - buckets[i].count = 0; - buckets[i].values = nullptr; - } - for (int i = 0; i < n; i++) { - int bucketIndex = arr[i]; - Bucket *bucket = &buckets[bucketIndex]; - bucket->values = - (int *)realloc(bucket->values, (bucket->count + 1) * sizeof(int)); - bucket->values[bucket->count] = arr[i]; - bucket->count++; - } - for (int i = 0; i < BUCKET_COUNT; i++) { - Bucket *bucket = &buckets[i]; - int bucketSize = bucket->count; - for (int j = 1; j < bucketSize; j++) { - int key = bucket->values[j]; - int k = j - 1; - while (k >= 0 && bucket->values[k] > key) { - bucket->values[k + 1] = bucket->values[k]; - k--; - } - bucket->values[k + 1] = key; - } - } - int index = 0; - for (int i = 0; i < BUCKET_COUNT; i++) { - Bucket *bucket = &buckets[i]; - int bucketSize = bucket->count; - for (int j = 0; j < bucketSize; j++) { - arr[index] = bucket->values[j]; - index++; - } - free(buckets->values); - } -} - -int main() { - int arr[] = {29, 25, 3, 49, 9, 37, 21, 43, 5}; - int n = sizeof(arr) / sizeof(arr[0]); - for (int i : arr) { - std::cout << i << " "; - } - std::cout << std::endl; - bucketSort(arr, n); - for (int i : arr) { - std::cout << i << " "; - } - std::cout << std::endl; - return 0; -} -#include - -int main() -{ - int minIndex, n; - std::cin >> n; - int listn[n]; - for (int i = 0; i < n; i++) - { - std::cin >> listn[i]; - } - for (int i = 0; i < n; i++) - { - minIndex = i; - for (int j = i; j < n; j++) - { - if (listn[minIndex] > listn[j]) - { - minIndex = j; - } - } - if (!minIndex == i) - { - int tmp = listn[i]; - listn[i] = listn[minIndex]; - listn[minIndex] = tmp; - } - } - for (int i = 0; i < n; i++) - { - std::cout << listn[i] << " "; - } - std::cout << std::endl; - return 0; -}#include - -int main() -{ - int n,i,j,k; - std::cin >> n; - int listn[n]; - for (int i = 0; i < n; i++) - { - std::cin >> listn[i]; - } - for (i = 0; i < n; i++) - { - for (j = i-1; j>=0; j--) - { - if(listn[j]j;k--){ - listn[k+1]=listn[k]; - } - listn[k+1]=tmp; - } - - /* 另一种方式： - ** int num = listn[i]; - ** int j = i - 1; - ** while ((j >= 0) && (listn[j] > num)) - ** { - ** listn[j + 1] = listn[j]; - ** j--; - ** } - ** listn[j + 1] = num; - */ - } - for (int i = 0; i < n; i++) - { - std::cout << listn[i] << " "; - } - std::cout << std::endl; - return 0; -}#include -#include -#include - -using namespace std; - -struct student { - char name[20]; - int sorce; -}; -int comp ( student & a,student & b ) -{ - return a.sorce>b.sorce|| ( a.sorce==b.sorce&&strcmp ( a.name,b.name ) ) >0; -} -int main() -{ - int studentSum; - cin>>studentSum; - student studentList[studentSum+1]; - for ( int i=0; i>studentList[i].name>>studentList[i].sorce; - } - sort ( studentList+0,studentList+studentSum,comp ); - for ( int j=0; j -#include - -using namespace std; - -int main() { - char *s = "GoldenGlobalView"; - memset(s, 'G', 6); - return 0; -} -#include -using namespace std; - -struct account { - char type; - union { - char idcard[19]; - long long qid; - }; -}; - -int main() -{ - int accountSum,men=0,women=0,qidSum=0,qidNum=0; - cin>>accountSum; - account accountList[accountSum+1]; - for ( int i=0; i>accountList[i].type; - if ( accountList[i].type=='q' ) { - cin>>accountList[i].qid; - qidSum+=accountList[i].qid; - qidNum++; - } else { - cin>>accountList[i].idcard; - if ( ( ( accountList[i].idcard[16]-'0' ) %2 ) ==0 ) { - women++; - } else { - men++; - } - } - } - cout< -#include -using namespace std; -int main() -{ - int num; - scanf ( "%d",&num ); - int array[num+1]; - int *ptr=array+1; - for ( int i=1; i<=num; i++ ) { - cin>>*ptr; - ptr++; - } - ptr=array+1; - for ( int i=1; i<=num; i++ ) { - printf ( "%d ",*ptr ); - ptr++; - } - return 0; -} -#include -using namespace std; -int a=10,*p=&a,**pp=&p; -int main(){ - cout<<"a="< -#include -#include -using namespace std; -struct student { - char name[20]; - char sex; - int score; -} studentList[3] = {{"SB1", 'F', 239}, {"SB2", 'F', 232}, {"SB3", 'M', 832}}; -int main() { - student *ptr; - cout << setw(10) << "Name " << setw(4) << "Sex " - << "Score " << endl; - for (ptr = studentList; ptr < studentList + 3; ptr++) { - cout << setw(9) << ptr->name << " " << setw(3) << ptr->sex << " " - << setw(3) << ptr->score << endl; - } - return 0; -} -#include -#include -#include -using namespace std; -void swapchar(char &a,char&b){ - char temp=a; - b=a; - a=temp; -} - -int reverse(char *string_in){ - int string_len=strlen(string_in); - char string_out[string_len]; - for(int i=0;i -using namespace std; -#include -using namespace std; -int main(){ - int a[5],i,*pa=a; - for(i=0;i<5;i++){ - scanf("%d",pa); - pa++; - } - pa=a; - for(i=0;i<5;i++){ - printf("a[%d]=%d\n",i,*pa); - pa++; - } - return 0; -} -#include -#include -using namespace std; -void swap ( int *a,int *b ) -{ - int temp=*a; - *a=*b; - *b=temp; -} -int sortInt ( int *a,int *b,int *c ) -{ - /* - int list[4]={ *a,*b,*c }; - sort ( list+0,list+3 ); - *a=list[0]; - *b=list[1]; - *c=list[2]; - //这是一个神奇的方法 - */ - if ( a>b ) { - swap ( a,b ); - } - if ( a>c ) { - swap ( a,c ); - } - if ( b>c ) { - swap ( b,c ); - } - //这是一个正常的方法 - return 0; -} -int main() -{ - int a,b,c,*ptr_a=&a,*ptr_b=&b,*ptr_c=&c; - cin>>a>>b>>c; - sortInt ( ptr_a,ptr_b,ptr_c ); - cout< -using namespace std; - -struct student { - string name; - int chinese,math,total; -}; - -int main() -{ - int studentSum; - cin>>studentSum; - student studentList[studentSum+1]; - for ( int i=0; i>studentList[i].name>>studentList[i].chinese>>studentList[i].math; - } - for ( int i=0; istudentList[j].total ) { - swap ( studentList[i],studentList[j] ); - } - } - } - for ( int i=studentSum-1; i>=0; i-- ) { - cout< -using namespace std; -int main() { - long long int n; - cin>>n; - for(int i=2;i -using namespace std; - -class Tdate -{ -public: - Tdate(int setDay, int setMouth, int setYear) // 构造函数没有返回类型，一个类可以由多个构造函数 - { - set(setDay, setMouth, setYear); - } - void set(int setDay, int setMouth, int setYear) - { - day = setDay; - mouth = setMouth; - year = setYear; - } - int isLeapYear() - { - return ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)); - } - void printYear() - { - cout << year << "/" << mouth << "/" << day << endl; - } - void nextDay() - { - if (mouth == 2) - { - if (isLeapYear()) - { - if (day + 1 > 29) - { - mouth++; - day = 1; - } - else - { - day++; - } - } - else - { - if (day + 1 > 28) - { - mouth++; - day = 1; - } - else - { - day++; - } - } - } - else if (isBigMouth(mouth)) - { - if (day + 1 > 31) - { - mouth++; - day = 1; - } - else - { - day++; - } - } - else if (mouth == 12) - { - if (day + 1 > 31) - { - year++; - mouth = 1; - day = 1; - } - else - { - day++; - } - } - else - { - if (day + 1 > 20) - { - mouth++; - day = 1; - } - else - { - day++; - } - } - } - -private: - int day, mouth, year; - int isBigMouth(int inMouth) - { - int bigMouth[7] = {1, 3, 5, 7, 8, 10}; - for (int i = 0; i < 7; i++) - { - if (inMouth == bigMouth[i]) - { - return 1; - } - } - return 0; - } -}; - -int main() -{ - Tdate date(31, 12, 2011); - date.printYear(); - date.nextDay(); - date.printYear(); - cout << date.isLeapYear() << endl; - return 0; -} -#include -#include - -int main() -{ - int n, m; - std::cin >> n >> m; - std::vector alive(n); - for (int i = 0; i < n; i++) - { - alive[i] = i + 1; - } - int cur = 0; - while (alive.size()) - { - cur = (cur + m - 1) % alive.size(); - std::cout << alive[cur] << " "; - alive.erase(alive.begin() + cur); - } - std::cout << "\n"; -}#include -#include -#include - -int main() -{ - int n, x, y, a[40][40]; - memset(a, 0, sizeof(a)); - std::cin >> n; - x = 1, y = (n + 1) / 2; - - for (int i = 1; i <= n * n; i++) - { - a[x][y] = i; - if (!a[(x - 2 + n) % n + 1][y % n + 1]) - { - x = (x - 2 + n) % n + true; - y = y % n + true; - } - else - { - x = x % n + true; - } - } - - for (int i = 1; i <= n; i++) - { - for (int j = 1; j <= n; j++) - { - printf("%4d", a[i][j]); - } - printf("\n"); - } -}#include -int main() -{ - bool alive[100] = {0}; - int f = 0, n, m, t = 0, s = 0; - std::cin >> n >> m; - do - { - t++; - if (t > n) - { - t = 1; - } - if (!alive[t]) - { - s++; - } - if (s == m) - { - s = 0; - std::cout << t << ' '; - alive[t] = 1; - f++; - } - } while (f != n); - std::cout << std::endl; - return 0; -}#include -#include "../vector/intVector.h" - -int main() -{ - int n, k, num; - std::cin >> n >> k; - vector *listn = new vector(n); - for (int i = 0; i < n; i++) - { - int tmp; - scanf("&d",&tmp); - listn->append(tmp); - } - - for (int i = 0; i < n; i++) - { - for (int j = i; j < n; j++) - { - if ((listn->read(j)%listn->read(i))!=0){ - listn->erase(n); - } - } - } - std::cout<getSize(); - return 0; -}#include -#include "intVector.h" - -int main() -{ - int test[] = {0, 1, 2, 3}; - vector Test(4, test); - Test.print("\n"); - Test.append(4); - Test.print("\n"); - try{ - Test.erase(0); - Test.print("\n"); - Test.erase(-1); - }catch(const char * msg){ - std::cerr< -class vector { -public: - vector(int size) { - this->size = size; - this->list = new int[size]; - } - - int append(int); - int begin() { return this->list[0]; } - int end() { return this->list[size - 1]; } - int read(int index) { return this->list[index]; } - int print(const char *); - int erase(int index); - int getSize() { return this->size; }; - -private: - int size; - int *list; -}; - -int vector::append(int number) { - int tmp[size++]; - for (int i = 0; i < size - 1; i++) { - tmp[i] = this->list[i]; - } - this->list = new int[size]; - for (int i = 0; i < size - 1; i++) { - this->list[i] = tmp[i]; - } - this->list[size - 1] = number; - return 0; -} - -int vector::print(const char *end) { - for (int i = 0; i < size; i++) { - std::cout << this->list[i]; - } - std::cout << end; - return 0; -} - -int vector::erase(int index) { - if (index >= size || index < 0) { - throw "Index is so big or small"; - return -1; - } - this->list[index] = 0; - for (int i = index + 1; i < size; i++) { - this->list[i - 1] = this->list[i]; - } - int tmp[size--]; - for (int i = 0; i < size; i++) { - tmp[i] = this->list[i]; - } - this->list = new int[size]; - for (int i = 0; i < size; i++) { - this->list[i] = tmp[i]; - } - return 0; -} - -#endif \ No newline at end of file