1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
#include <stdio.h>
#define i_extern
#include <stc/cstr.h>
#include <stc/csview.h>
#include <stc/algo/filter.h>
#include <stc/algo/crange.h>
#define i_type IVec
#define i_val int
#include <stc/cstack.h>
#define i_type SVec
#define i_valclass csview
#include <stc/cstack.h>
// filters and transforms:
#define flt_skipValue(i, x) (*i.ref != (x))
#define flt_isEven(i) ((*i.ref & 1) == 0)
#define flt_isOdd(i) (*i.ref & 1)
#define flt_square(i) (*i.ref * *i.ref)
void demo1(void)
{
c_auto (IVec, vec) {
c_forlist (i, int, {0, 1, 2, 3, 4, 5, 80, 6, 7, 80, 8, 9, 80,
10, 11, 12, 13, 14, 15, 80, 16, 17})
IVec_push(&vec, *i.ref);
puts("demo1:");
c_forfilter (i, IVec, vec, flt_skipValue(i, 80))
printf(" %d", *i.ref);
puts("");
int res, sum = 0;
c_forfilter (i, IVec, vec
, c_flt_skipwhile(i, *i.ref != 80)
&& c_flt_skip(i, 1)
&& c_flt_skipwhile(i, *i.ref != 80)
&& flt_isEven(i)
&& flt_skipValue(i, 80)
&& c_flt_take(i, 5) // short-circuit
){
sum += res = flt_square(i);
printf(" %d", res);
}
printf("\n sum: %d\n", sum);
}
}
/* Rust:
fn main() {
let vector = (1..) // Infinite range of integers
.skip_while(|x| *x != 11) // Skip initial numbers unequal 11
.filter(|x| x % 2 != 0) // Collect odd numbers
.take(5) // Only take five numbers
.map(|x| x * x) // Square each number
.collect::<Vec<usize>>(); // Return as a new Vec<usize>
println!("{:?}", vector); // Print result
}
*/
void demo2(void)
{
c_auto (IVec, vector) {
puts("demo2:");
crange R = crange_make(INT64_MAX);
c_forfilter (x, crange, R
, c_flt_skipwhile(x, *x.ref != 11)
&& *x.ref % 2 != 0
&& c_flt_take(x, 5))
IVec_push(&vector, (int)(*x.ref * *x.ref));
c_foreach (x, IVec, vector)
printf(" %d", *x.ref);
puts("");
}
}
/* Rust:
fn main() {
let sentence = "This is a sentence in Rust.";
let words: Vec<&str> = sentence
.split_whitespace()
.collect();
let words_containing_i: Vec<&str> = words
.into_iter()
.filter(|word| word.contains("i"))
.collect();
println!("{:?}", words_containing_i);
}
*/
void demo3(void)
{
c_auto (SVec, words, words_containing_i) {
const char* sentence = "This is a sentence in C99.";
c_fortoken (w, sentence, " ")
SVec_push(&words, *w.ref);
c_forfilter (w, SVec, words,
csview_contains(*w.ref, "i"))
SVec_push(&words_containing_i, *w.ref);
puts("demo3:");
c_foreach (w, SVec, words_containing_i)
printf(" %.*s", c_SV(*w.ref));
puts("");
}
}
void demo4(void)
{
csview s = c_sv("ab123cReAghNGnΩoEp"); // Ω = multi-byte
c_auto (cstr, out) {
c_forfilter (i, csview, s, utf8_isupper(utf8_peek(i.ref))) {
char chr[4];
utf8_encode(chr, utf8_tolower(utf8_peek(i.ref)));
cstr_push(&out, chr);
}
puts("demo4:");
printf(" %s\n", cstr_str(&out));
}
}
void demo5(void)
{
#define flt_even(i) ((*i.ref & 1) == 0)
#define flt_mid_decade(i) ((*i.ref % 10) != 0)
puts("demo5:");
crange R = crange_make(1963, INT32_MAX);
c_forfilter (i, crange, R
, c_flt_skip(i,15)
&& c_flt_skipwhile(i, flt_mid_decade(i))
&& c_flt_skip(i,30)
&& flt_even(i)
&& c_flt_take(i,5))
printf(" %lld", *i.ref);
puts("");
}
int main(void)
{
demo1();
demo2();
demo3();
demo4();
demo5();
}
|
