Advertisement
Guest User

Untitled

a guest
Feb 19th, 2019
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.34 KB | None | 0 0
  1. func test_dynamic_arrays() {
  2. a: int*;
  3. apush(a, 42);
  4. apush(a, 36);
  5. len := alen(a);
  6. cap := acap(a);
  7. for (i := 0; i < alen(a); i++) {
  8. printf("a[%d] = %d\n", i, a[i]);
  9. }
  10. asetcap(a, 1);
  11. apush(a, 82);
  12. for (i := 0; i < alen(a); i++) {
  13. printf("a[%d] = %d\n", i, a[i]);
  14. }
  15. apop(a);
  16. for (i := 0; i < alen(a); i++) {
  17. printf("a[%d] = %d\n", i, a[i]);
  18. }
  19. b: int*;
  20. apush(b, 1);
  21. apush(b, 2);
  22. acat(a, b);
  23. afree(b);
  24. acatn(a, a + 1, 2);
  25. for (i := 0; i < alen(a); i++) {
  26. printf("a[%d] = %d\n", i, a[i]);
  27. }
  28. adel(a, 1);
  29. adeln(a, 2, 10);
  30. for (i := 0; i < alen(a); i++) {
  31. printf("a[%d] = %d\n", i, a[i]);
  32. }
  33. afree(a);
  34. }
  35.  
  36. func test_aprintf() {
  37. a: char*;
  38. aprintf(a, "Hello");
  39. aprintf(a, ", world! %d", 42);
  40. len := alen(a);
  41. printf("%s\n", a);
  42. }
  43.  
  44. func test_index_arrays() {
  45. a: int*;
  46. kadd(a, 42);
  47. kadd(a, 36);
  48. for (i := 0; i < klen(a); i++) {
  49. printf("%d\n", a[i]);
  50. }
  51. kdel(a, 42);
  52. printf("%llu %llu %llu\n", kget(a, 42), kget(a, 36), kget(a, 123));
  53.  
  54. m: {char, int}*;
  55. hput(m, 'x', 42);
  56. hput(m, 'p', 36);
  57. for (i := 0; i < hlen(m); i++) {
  58. printf("[%d] %c => %d\n", i, m[i][0], m[i][1]);
  59. }
  60. hdel(m, 'x');
  61. j := hget(m, 'p');
  62. printf("[%llu] %c => %d\n", j, m[j][0], m[j][1]);
  63. hput(m, 'm', 38);
  64. hdel(m, 'p');
  65. for (i := 0; i < hlen(m); i++) {
  66. printf("[%d] %c => %d\n", i, m[i][0], m[i][1]);
  67. }
  68. }
  69.  
  70. // =>
  71.  
  72. #line 924
  73. void test1_test_dynamic_arrays(void) {
  74. int (*a) = {0};
  75. apush(int, a, 42);
  76. apush(int, a, 36);
  77. ullong len = std_alen(a);
  78. ullong cap = std_acap(a);
  79. for (int i = 0; (i) < (std_alen(a)); (i)++) {
  80. printf("a[%d] = %d\n", i, a[i]);
  81. }
  82. asetcap(a, 1);
  83. apush(int, a, 82);
  84. for (int i = 0; (i) < (std_alen(a)); (i)++) {
  85. printf("a[%d] = %d\n", i, a[i]);
  86. }
  87. std_apop(a);
  88. for (int i = 0; (i) < (std_alen(a)); (i)++) {
  89. printf("a[%d] = %d\n", i, a[i]);
  90. }
  91. int (*b) = {0};
  92. apush(int, b, 1);
  93. apush(int, b, 2);
  94. acat(a, b);
  95. std_afree(b);
  96. acatn(a, (a) + (1), 2);
  97. for (int i = 0; (i) < (std_alen(a)); (i)++) {
  98. printf("a[%d] = %d\n", i, a[i]);
  99. }
  100. adel(a, 1);
  101. adeln(a, 2, 10);
  102. for (int i = 0; (i) < (std_alen(a)); (i)++) {
  103. printf("a[%d] = %d\n", i, a[i]);
  104. }
  105. std_afree(a);
  106. }
  107.  
  108. #line 916
  109. void test1_test_aprintf(void) {
  110. char (*a) = {0};
  111. aprintf(a, "Hello");
  112. aprintf(a, ", world! %d", 42);
  113. ullong len = std_alen(a);
  114. printf("%s\n", a);
  115. }
  116. #line 959
  117. void test1_test_index_arrays(void) {
  118. int (*a) = {0};
  119. kadd(int, a, 42);
  120. kadd(int, a, 36);
  121. for (int i = 0; (i) < (std_klen(a)); (i)++) {
  122. printf("%d\n", a[i]);
  123. }
  124. kdel(int, a, 42);
  125. printf("%llu %llu %llu\n", kget(int, a, 42), kget(int, a, 36), kget(int, a, 123));
  126. #line 969
  127. tuple0 (*m) = {0};
  128. hput(tuple0, _0, m, 'x', 42);
  129. hput(tuple0, _0, m, 'p', 36);
  130. for (int i = 0; (i) < (std_hlen(m)); (i)++) {
  131. printf("[%d] %c => %d\n", i, m[i]._0, m[i]._1);
  132. }
  133. hdel(char, m, 'x');
  134. ullong j = hget(char, m, 'p');
  135. printf("[%llu] %c => %d\n", j, m[j]._0, m[j]._1);
  136. hput(tuple0, _0, m, 'm', 38);
  137. hdel(char, m, 'p');
  138. for (int i = 0; (i) < (std_hlen(m)); (i)++) {
  139. printf("[%d] %c => %d\n", i, m[i]._0, m[i]._1);
  140. }
  141. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement