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
|
#include <stdio.h>
#define i_implement
#include <stc/cstr.h>
#include <stc/cregex.h>
#include <stc/crandom.h>
#include <stc/csview.h>
#define i_val double
#include <time.h>
int main()
{
// Lets find the first sequence of digits in a string
const char *s = "Hello numeric world, there are 24 hours in a day, 3600 seconds in an hour."
" Around 365.25 days a year, and 52 weeks in a year."
" Boltzmann const: 1.38064852E-23, is very small."
" Bohrradius is 5.29177210903e-11, and Avogadros number is 6.02214076e23.";
c_auto (cregex, re)
{
int res = cregex_compile(&re, "[+-]?([0-9]*\\.)?\\d+([Ee][+-]?\\d+)?", 0);
printf("%d\n", res);
cregmatch m[10];
if (cregex_find(&re, s, 10, m, 0) > 0) {
printf("Found digits at position %" PRIuMAX "-%" PRIuMAX "\n", m[0].str - s, m[0].str - s + m[0].size);
} else {
printf("Could not find any digits\n");
}
while (cregex_find(&re, s, 10, m, creg_next) > 0) {
printf("%" c_PRIsv " ; ", c_ARGsv(m[0]));
}
puts("");
}
}
#include "../src/cregex.c"
#include "../src/utf8utils.c"
|
