From c4f01a49f5d8176876b63a2312240443103a9824 Mon Sep 17 00:00:00 2001
From: Chris Jefferson <caj21@st-andrews.ac.uk>
Date: Mon, 26 Aug 2024 16:11:10 +0100
Subject: [PATCH] Make package work without 'interface.g

---
 gap/constraint.gi | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/gap/constraint.gi b/gap/constraint.gi
index 3b446a8..15adda7 100644
--- a/gap/constraint.gi
+++ b/gap/constraint.gi
@@ -27,9 +27,9 @@ function(con)
 
     # TODO: Add an Info statement saying that a search is about to happen and might be slow.
 
-    return BTKit_SimpleSinglePermSearch(
+    return _BTKit.SimpleSinglePermSearch(
         PartitionStack(LargestRelevantPoint(con)),
-        [BTKit_RefinerFromConstraint(con)]);
+        [BTKit_RefinerFromConstraint(con)],[])[1];
 end);
 
 InstallImmediateMethod(Representative, "for a group constraint",
@@ -264,7 +264,7 @@ Constraint.Conjugate := function(G, H)
 
     con := Constraint.Transport(G, H, OnPoints);
     con!.Name := StringFormatted("<constraint: conjugate {} {} to {}>", type, G, H);
-    
+
     if IsPerm(G) and (CycleIndex(G) <> CycleIndex(H)) then
         SetIsEmptyConstraint(con, true);
     fi;
@@ -394,7 +394,7 @@ ProcessConstraints := function(args...)
         if IsGroupConstraint(con) and HasUnderlyingGroup(con) and IsNaturalAlternatingGroup(UnderlyingGroup(con)) then
             Add(constraints, Constraint.IsEven);
             constraints[i] := Constraint.MovedPoints(MovedPoints(UnderlyingGroup(con)));
-        
+
         # In coset of Sym(x) -> combination
         elif IsInCosetByGensConstraint(con) and not IsGroupConstraint(con) and IsNaturalSymmetricGroup(UnderlyingGroup(con)) then
             G := UnderlyingGroup(con);