Complement for VarACSets fix

src/categorical_algebra/FinSets.jl

@@ -1467,7 +1467,7 @@ predicate(A::SubFinSetVector) = A.predicate
 function predicate(A::SubobjectHom{<:VarSet}) 
   f = hom(A)
   pred = falses(length(codom(f)))
-  for x in AttrVar.(dom(f))
+  for x in dom(f)
     fx = f(x)
     if fx isa AttrVar
       pred[fx.val] = true

test/categorical_algebra/CSets.jl

@@ -721,6 +721,14 @@ B = Subobject(X, X=[2], D=[1])
 @test A ∨ B |> force == ⊤(X) |> force
 
 const VES = VELabeledGraph{Symbol}
+
+"""
+  e1    e4 
+a ↘  e3  ↗ e        A = [a,b,c,d] + [1,2,3]
+   c → d 
+b ↗     ↘ f         B = [c,d,e,f] + [3,4,5]
+  e2   e5
+"""
 X = @acset VES begin V=6; E=5; Label=5
   src=[1,2,3,4,4]; tgt=[3,3,4,5,6];
   vlabel=[:a,:b,:c,:d,:e,:f]; elabel=AttrVar.(1:5)
@@ -747,6 +755,8 @@ end
   src=[1,2]; tgt=3; vlabel=[:a,:b,:c]; elabel=AttrVar.(1:2)
 end
 
+@test nv(dom(hom(~A))) == 3
+
 # Limits of CSetTransformations between ACSets
 #---------------------------------------------
 # Example: "Reflexive graphs" where reflexive edges have weight -1