Merge branch 'main' into dev

.JuliaFormatter.toml

@@ -0,0 +1 @@
+style = "sciml"

.gitignore

@@ -3,3 +3,4 @@
 *.jl.mem
 /Manifest.toml
 /docs/build/
+/docs/Manifest.toml

src/automata.jl

@@ -11,8 +11,8 @@ abstract type AbstractAutomaton end
 
 A minimal implementation of a deterministic automaton structure.
 """
-struct Automaton{S,T,F<:Union{S,Vector{S},Set{S}}} <: AbstractAutomaton
-    states::Dict{Tuple{S,T},S}
+struct Automaton{S, T, F <: Union{S, Vector{S}, Set{S}}} <: AbstractAutomaton
+    states::Dict{Tuple{S, T}, S}
     start::S
     finish::F
 end
@@ -22,11 +22,10 @@ end
 
 Internal method used by `accept` with `Automaton`.
 """
-at_end(a::Automaton{S,T,S}, s) where {S,T} = s == a.finish
+at_end(a::Automaton{S, T, S}, s) where {S, T} = s == a.finish
 
 at_end(a, s) = s ∈ a.finish
 
-
 """
     accept(a::Union{Automaton, MDD}, w)
 
@@ -42,15 +41,15 @@ function accept(a::Automaton, w)
 end
 
 # SECTION - Test Items for Automata
-@testitem "Automata" tags = [:automata] begin
+@testitem "Automata" tags=[:automata] begin
     states = Dict(
         (:a, 0) => :a,
         (:a, 1) => :b,
         (:b, 1) => :c,
         (:c, 0) => :d,
         (:d, 0) => :d,
         (:d, 1) => :e,
-        (:e, 0) => :e,
+        (:e, 0) => :e
     )
     start = :a
     finish_a = :e

src/diagrams.jl

@@ -11,8 +11,8 @@ abstract type AbstractMultivaluedDecisionDiagram end
 
 A minimal implementation of a multivalued decision diagram structure.
 """
-struct MDD{S,T} <: AbstractMultivaluedDecisionDiagram
-    states::Vector{Dict{Tuple{S,T},S}}
+struct MDD{S, T} <: AbstractMultivaluedDecisionDiagram
+    states::Vector{Dict{Tuple{S, T}, S}}
 end
 
 function accept(a::MDD, w)
@@ -39,22 +39,22 @@ end
 # end
 
 # SECTION - Test Items for Automata
-@testitem "MDD" tags = [:automata, :mdd] begin
+@testitem "MDD" tags=[:automata, :mdd] begin
     states = [
         Dict( # level x1
             (:r, 0) => :n1,
             (:r, 1) => :n2,
-            (:r, 2) => :n3,
+            (:r, 2) => :n3
         ),
         Dict( # level x2
             (:n1, 2) => :n4,
             (:n2, 2) => :n4,
-            (:n3, 0) => :n5,
+            (:n3, 0) => :n5
         ),
         Dict( # level x3
             (:n4, 0) => :t,
-            (:n5, 0) => :t,
-        ),
+            (:n5, 0) => :t
+        )
     ]
     a = MDD(states)
 

src/dictionaries.jl

@@ -13,11 +13,11 @@ function incsert!(d::AbstractDict, ind, val = 1)
 end
 
 # SECTION - Test Items for inscert
-@testitem "Dictionary" tags = [:dictionary, :incsert] default_imports = false begin
+@testitem "Dictionary" tags=[:dictionary, :incsert] default_imports=false begin
     using ConstraintCommons, Dictionaries, Test
 
-    counters_dict = Dictionary{Symbol,Int}()
-    witness_dict = Dictionary{Symbol,Int}([:a, :b], [2, 42])
+    counters_dict = Dictionary{Symbol, Int}()
+    witness_dict = Dictionary{Symbol, Int}([:a, :b], [2, 42])
 
     incsert!(counters_dict, :a)
     incsert!(counters_dict, :a)
@@ -27,10 +27,9 @@ end
     @test witness_dict !== counters_dict
 end
 
-@testitem "Dict" tags = [:dict, :incsert] begin
-
-    counters_dict = Dict{Int,Int}()
-    witness_dict = Dict{Int,Int}(23 => 2, 42 => 42)
+@testitem "Dict" tags=[:dict, :incsert] begin
+    counters_dict = Dict{Int, Int}()
+    witness_dict = Dict{Int, Int}(23 => 2, 42 => 42)
 
     incsert!(counters_dict, 23)
     incsert!(counters_dict, 23)

src/extrema.jl

@@ -21,7 +21,7 @@ function δ_extrema(X...)
 end
 
 # SECTION - Test Items for δ_extrema
-@testitem "δ_extrema" tags = [:δ_extrema] begin
+@testitem "δ_extrema" tags=[:δ_extrema] begin
     X = map(_ -> rand(1:100, 100), 1:3)
 
     @test 0 ≤ δ_extrema(X[1]) ≤ 100

src/nothing.jl

@@ -16,7 +16,7 @@ Extends `Base.isempty` when the set is `nothing`. Returns `true`.
 consisempty(::Nothing) = true
 consisempty(items) = isempty(items)
 
-@testitem "Set: nothing" tags = [:set, :nothing] begin
+@testitem "Set: nothing" tags=[:set, :nothing] begin
     @test !(ConstraintCommons.consin(42, nothing))
     @test ConstraintCommons.consisempty(nothing)
 end

src/parameters.jl

@@ -15,8 +15,8 @@ const USUAL_CONSTRAINT_PARAMETERS = [
 ]
 ```
 """
-const USUAL_CONSTRAINT_PARAMETERS =
-    [:bool, :dim, :id, :language, :op, :pair_vars, :val, :vals]
+const USUAL_CONSTRAINT_PARAMETERS = [
+    :bool, :dim, :id, :language, :op, :pair_vars, :val, :vals]
 
 """
     extract_parameters(m::Union{Method, Function}; parameters)
@@ -28,13 +28,13 @@ function extract_parameters(m::Method; parameters = USUAL_CONSTRAINT_PARAMETERS)
 end
 
 function extract_parameters(
-    f::F;
-    parameters = USUAL_CONSTRAINT_PARAMETERS,
-) where {F<:Function}
+        f::F;
+        parameters = USUAL_CONSTRAINT_PARAMETERS
+) where {F <: Function}
     return filter(!isempty, map(m -> extract_parameters(m; parameters), methods(f)))
 end
 
-@testitem "Parameters" tags = [:parameters] begin
+@testitem "Parameters" tags=[:parameters] begin
     import ConstraintCommons: USUAL_CONSTRAINT_PARAMETERS
 
     f(x; bool, dim, id, language, op, pair_vars, val, vals) = true

src/sampling.jl

@@ -25,7 +25,7 @@ function oversample(X, f)
     return Z
 end
 
-@testitem "Oversampling" tags = [:sampling, :oversampling] begin
+@testitem "Oversampling" tags=[:sampling, :oversampling] begin
     X = [[0, 1, 1], [0, 1, 2], [0, 0, 0]]
 
     O = oversample(X, allunique)
@@ -34,5 +34,4 @@ end
     @test count(x -> x == [0, 1, 1], O) == 1
     @test count(x -> x == [0, 0, 0], O) == 1
     @test length(O) == 4
-
 end

src/symbols.jl

@@ -7,6 +7,6 @@ function symcon(s1::Symbol, s2::Symbol, connector::AbstractString = "_")
     return Symbol(string(s1) * connector * string(s2))
 end
 
-@testitem "Symbols" tags = [:symbols] begin
+@testitem "Symbols" tags=[:symbols] begin
     @test ConstraintCommons.symcon(:a, :b) === :a_b
 end

test/Aqua.jl

@@ -8,7 +8,7 @@
         ConstraintCommons;
         ambiguities = (broken = false,),
         deps_compat = false,
-        piracies = (broken = false,),
+        piracies = (broken = false,)
     )
 
     @testset "Ambiguities: ConstraintCommons" begin
@@ -22,7 +22,7 @@
     @testset "Dependencies compatibility (no extras)" begin
         Aqua.test_deps_compat(
             ConstraintCommons;
-            check_extras = false,            # ignore = [:Random]
+            check_extras = false            # ignore = [:Random]
         )
     end
 end