followup now that https://github.com/nim-lang/Nim/issues/15511 was fixed

.github/workflows/ci.yml

@@ -12,7 +12,8 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        nim: [0.19.6, 0.20.0, 0.20.2, 1.0.0, 1.0.2, 1.0.4, 1.0.10, 1.2.0, 1.2.2, 1.2.4, 1.2.6, 1.2.8, 1.4.0, 1.4.2]
+        # xxx trim to on use latest in each branch eg 1.0.10, 1.2.8 etc
+        nim: [1.0.0, 1.0.2, 1.0.4, 1.0.10, 1.2.0, 1.2.2, 1.2.4, 1.2.6, 1.2.8, 1.4.0, 1.4.2, 1.4.4]
     steps:
     - uses: actions/checkout@v2
     - name: Run Tests

regex.nimble

@@ -7,7 +7,7 @@ license = "MIT"
 srcDir = "src"
 skipDirs = @["tests", "bench", "docs"]
 
-requires "nim >= 0.19.6"
+requires "nim >= 1.0.0"
 requires "unicodedb >= 0.7.2"
 
 task test, "Test":
@@ -33,4 +33,5 @@ task test, "Test":
     exec "nim doc -o:./docs/ugh/ugh.html ./src/regex.nim"
 
 task docs, "Docs":
+  # xxx use --outdir:docs
   exec "nim doc --project -o:./docs ./src/regex.nim"

src/regex/nfa.nim

@@ -193,6 +193,10 @@ func teClosure(
   for s in eNfa.s[state].next:
     teClosure(result, eNfa, s, processing, zclosure)
 
+when (NimMajor, NimMinor, NimPatch) < (1,4,0) and not declared(IndexDefect):
+  # avoids a warning
+  type IndexDefect = IndexError
+
 func eRemoval*(eNfa: Enfa): Nfa {.raises: [].} =
   ## Remove e-transitions and return
   ## remaining state transtions and
@@ -220,7 +224,7 @@ func eRemoval*(eNfa: Enfa): Nfa {.raises: [].} =
   while qw.len > 0:
     try:
       qa = qw.popLast()
-    except IndexError:
+    except IndexDefect:
       doAssert false
     closure.setLen 0
     teClosure(closure, eNfa, qa, processing)

src/regex/types.nim

@@ -5,6 +5,7 @@ when NimMajor >= 1:
 import std/unicode
 import std/sets
 from std/algorithm import sorted
+from std/sequtils import toSeq
 
 import pkg/unicodedb/properties
 
@@ -186,13 +187,7 @@ func initSkipNode*(next: openArray[int16]): Node =
   ## while traversing the NFA
   result = Node(
     kind: reSkip,
-    cp: "#".toRune)
-  when false:
-    # pending https://github.com/nim-lang/Nim/issues/15511#issuecomment-719952709
-    result.next.add next
-  else:
-    for ai in next:
-      result.next.add ai
+    cp: "#".toRune, next: toSeq(next))
 
 func isEmpty*(n: Node): bool =
   ## check if a set ``Node`` is empty