From 37feffc4adb5ae5cf33a6d30f47039c067880ad2 Mon Sep 17 00:00:00 2001
From: Daniel Pointon <dlp14developing@gmail.com>
Date: Wed, 31 Jan 2024 03:17:25 +0000
Subject: [PATCH] Fix linting (maybe)

---
 gap/oper.gi           | 8 ++++----
 tst/standard/oper.tst | 4 ++--
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/gap/oper.gi b/gap/oper.gi
index b9c0ee466..3a743cd08 100644
--- a/gap/oper.gi
+++ b/gap/oper.gi
@@ -2048,13 +2048,13 @@ InstallMethod(VerticesReachableFrom, "for a digraph and a list of vertices",
 function(D, roots)
     local accessible_from_node, candidate, root, i, visited, visited_as_ints, N;
     N := DigraphNrVertices(D);
-    visited := BlistList([1..N], []);
+    visited := BlistList([1 .. N], []);
     for root in roots do
       if not(visited[root]) then
         accessible_from_node := VerticesReachableFrom(D, root);
         for candidate in accessible_from_node do
           if not(visited[candidate]) then
-            visited[candidate] :=true;
+            visited[candidate] := true;
           fi;
         od;
       fi;
@@ -2062,7 +2062,7 @@ function(D, roots)
 
     visited_as_ints := [];
 
-    for i in [1..N] do
+    for i in [1 .. N] do
       if visited[i] then;
         Add(visited_as_ints, i);
       fi;
@@ -2081,7 +2081,7 @@ function(D, roots)
   fi;
 
   N := Length(roots);
-  vertex_in_subset := BlistList([1..N], []);
+  vertex_in_subset := BlistList([1 .. N], []);
   reachable := VerticesReachableFrom(D, roots);
 
   for i in roots do
diff --git a/tst/standard/oper.tst b/tst/standard/oper.tst
index 1028b80b5..10b427f90 100644
--- a/tst/standard/oper.tst
+++ b/tst/standard/oper.tst
@@ -2803,13 +2803,13 @@ gap> D2 := CompleteDigraph(10);
 <immutable complete digraph with 10 vertices>
 gap> VerticesReachableFrom(D1, [1]);
 [ 1, 2, 3, 4, 5 ]
-gap> VerticesReachableFrom(D1, [1,2]);
+gap> VerticesReachableFrom(D1, [1, 2]);
 [ 1, 2, 3, 4, 5 ]
 gap> VerticesReachableFrom(D2, [1]);
 [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]
 gap> D3 := CompleteDigraph(7);
 <immutable complete digraph with 7 vertices>
-gap> D3_edges := [1..7];
+gap> D3_edges := [1 .. 7];
 [ 1 .. 7 ]
 gap> for i in D3_edges do
 >      D3 := DigraphRemoveEdge(D3, [1, i]);