summary refs log blame commit diff stats
path: root/examples/extract_keyval_pairs_re.nim
blob: a594c0fa8cc1c318f4b2e3f79832ae9ce804a761 (plain) (tree) 
36818817b ^

b559285b7 ^

36818817b ^


b559285b7 ^

ac5dff2e0 ^

36818817b ^


1

2

3
4

5

6

7
8

                                          
         

                             
                         
                                                    

 
# Filter key=value pairs from "myfile.txt"
import re

for x in lines("myfile.txt"):
  if x =~ re"(\w+)=(.*)":
    echo "Key: ", matches[0], " Value: ", matches[1]
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2025-02-03 20:35:11 +0000
17fc5 ^ 
4de84024e ^

7e747d11c ^

4de84024e ^

7e747d11c ^


4de84024e ^

d68181246 ^

4de84024e ^




2df9b442c ^

4de84024e ^




d68181246 ^

4de84024e ^

d68181246 ^

4de84024e ^




7e747d11c ^

d68181246 ^

7e747d11c ^

4de84024e ^

d68181246 ^

4de84024e ^





f3b8d9221 ^


7ebaf4489 ^

a6f90d4cd ^


7ebaf4489 ^



39ebe2175 ^

4de84024e ^



d68181246 ^

7e747d11c ^

4de84024e ^


d68181246 ^

4de84024e ^





7e747d11c ^

4de84024e ^

7ebaf4489 ^




4de84024e ^


7ebaf4489 ^



d68181246 ^

7ebaf4489 ^


d68181246 ^


4de84024e ^

7ebaf4489 ^

4de84024e ^





d68181246 ^

4de84024e ^



d68181246 ^

4de84024e ^







7ebaf4489 ^

4de84024e ^


d68181246 ^

4de84024e ^


92b8fac94 ^

4de84024e ^


f3b8d9221 ^


4de84024e ^











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
148

149

150
151

152
153

154
155
156
157
158
159
160
161
162
163
164


 
                            
                                         




                                                   
                                            
                     
 

                                           


















                                                                                       
                                                                                                                      
 
                                                                       
                  
           
                  


                                    
                                   



                   
       


                                                                                              
 
                                                
                     
             

                                                          
 
                                    



                                                          
               



                                                   
             
             
            



                         
                         
                                         
                      
            
               




                                                                          

                            
                                                                          

                                                                        


               
                              


                     
             
                   

                     
       




                               
               
 



                                                              

                                                            


                                              
                                                

                                                     

                                              
                                                     
                                       




                                                                     
                 


            
             






                                                                     
                                     

         
                                                 

                 
                                                               

                 

       










                                              
#
#
#           The Nim Compiler
#        (c) Copyright 2012 Andreas Rumpf
#
#    See the file "copying.txt", included in this
#    distribution, for details about the copyright.
#

## Serialization utilities for the compiler.
import strutils, math

# bcc on windows doesn't have C99 functions
when defined(windows) and defined(bcc):
  {.emit: """#if defined(_MSC_VER) && _MSC_VER < 1900
  #include <stdarg.h>
  static int c99_vsnprintf(char *outBuf, size_t size, const char *format, va_list ap) {
    int count = -1;
    if (size != 0) count = _vsnprintf_s(outBuf, size, _TRUNCATE, format, ap);
    if (count == -1) count = _vscprintf(format, ap);
    return count;
  }
  int snprintf(char *outBuf, size_t size, const char *format, ...) {
    int count;
    va_list ap;
    va_start(ap, format);
    count = c99_vsnprintf(outBuf, size, format, ap);
    va_end(ap);
    return count;
  }
  #endif
  """.}

proc c_snprintf(s: cstring; n:uint; frmt: cstring): cint {.importc: "snprintf", header: "<stdio.h>", nodecl, varargs.}

proc toStrMaxPrecision*(f: BiggestFloat, literalPostfix = ""): string =
  case classify(f)
  of fcNan:
    result = "NAN"
  of fcNegZero:
    result = "-0.0" & literalPostfix
  of fcZero:
    result = "0.0" & literalPostfix
  of fcInf:
    result = "INF"
  of fcNegInf:
    result = "-INF"
  else:
    result = newString(81)
    let n = c_snprintf(result.cstring, result.len.uint, "%#.16e%s", f, literalPostfix.cstring)
    setLen(result, n)

proc encodeStr*(s: string, result: var string) =
  for i in 0..<s.len:
    case s[i]
    of 'a'..'z', 'A'..'Z', '0'..'9', '_': result.add(s[i])
    else: result.add('\\' & toHex(ord(s[i]), 2))

proc hexChar(c: char, xi: var int) =
  case c
  of '0'..'9': xi = (xi shl 4) or (ord(c) - ord('0'))
  of 'a'..'f': xi = (xi shl 4) or (ord(c) - ord('a') + 10)
  of 'A'..'F': xi = (xi shl 4) or (ord(c) - ord('A') + 10)
  else: discard

proc decodeStr*(s: cstring, pos: var int): string =
  var i = pos
  result = ""
  while true:
    case s[i]
    of '\\':
      inc(i, 3)
      var xi = 0
      hexChar(s[i-2], xi)
      hexChar(s[i-1], xi)
      result.add(chr(xi))
    of 'a'..'z', 'A'..'Z', '0'..'9', '_':
      result.add(s[i])
      inc(i)
    else: break
  pos = i

const
  chars = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"

{.push overflowChecks: off.}

# since negative numbers require a leading '-' they use up 1 byte. Thus we
# subtract/add `vintDelta` here to save space for small negative numbers
# which are common in ROD files:
const
  vintDelta = 5

template encodeIntImpl(self) =
  var d: char
  var v = x
  var rem = v mod 190
  if rem < 0:
    result.add('-')
    v = - (v div 190)
    rem = - rem
  else:
    v = v div 190
  var idx = int(rem)
  if idx < 62: d = chars[idx]
  else: d = chr(idx - 62 + 128)
  if v != 0: self(v, result)
  result.add(d)

proc encodeVBiggestIntAux(x: BiggestInt, result: var string) =
  ## encode a biggest int as a variable length base 190 int.
  encodeIntImpl(encodeVBiggestIntAux)

proc encodeVBiggestInt*(x: BiggestInt, result: var string) =
  ## encode a biggest int as a variable length base 190 int.
  encodeVBiggestIntAux(x +% vintDelta, result)
  #  encodeIntImpl(encodeVBiggestInt)

proc encodeVIntAux(x: int, result: var string) =
  ## encode an int as a variable length base 190 int.
  encodeIntImpl(encodeVIntAux)

proc encodeVInt*(x: int, result: var string) =
  ## encode an int as a variable length base 190 int.
  encodeVIntAux(x +% vintDelta, result)

template decodeIntImpl() =
  var i = pos
  var sign = - 1
  assert(s[i] in {'a'..'z', 'A'..'Z', '0'..'9', '-', '\x80'..'\xFF'})
  if s[i] == '-':
    inc(i)
    sign = 1
  result = 0
  while true:
    case s[i]
    of '0'..'9': result = result * 190 - (ord(s[i]) - ord('0'))
    of 'a'..'z': result = result * 190 - (ord(s[i]) - ord('a') + 10)
    of 'A'..'Z': result = result * 190 - (ord(s[i]) - ord('A') + 36)
    of '\x80'..'\xFF': result = result * 190 - (ord(s[i]) - 128 + 62)
    else: break
    inc(i)
  result = result * sign -% vintDelta
  pos = i

proc decodeVInt*(s: cstring, pos: var int): int =
  decodeIntImpl()

proc decodeVBiggestInt*(s: cstring, pos: var int): BiggestInt =
  decodeIntImpl()

{.pop.}

iterator decodeVIntArray*(s: cstring): int =
  var i = 0
  while s[i] != '\0':
    yield decodeVInt(s, i)
    if s[i] == ' ': inc i

iterator decodeStrArray*(s: cstring): string =
  var i = 0
  while s[i] != '\0':
    yield decodeStr(s, i)
    if s[i] == ' ': inc i
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2025-02-03 20:35:09 +0000