Updated compat items in TOML files (#28)

* Updated compat items in TOML files
* fixed github workflow

Manifest.toml

@@ -3,16 +3,6 @@
 [[Base64]]
 uuid = "2a0f44e3-6c83-55bd-87e4-b1978d98bd5f"
 
-[[BenchmarkTools]]
-deps = ["JSON", "Printf", "Statistics", "Test"]
-git-tree-sha1 = "5d1dd8577643ba9014574cd40d9c028cd5e4b85a"
-uuid = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
-version = "0.4.2"
-
-[[Dates]]
-deps = ["Printf"]
-uuid = "ade2ca70-3891-5945-98fb-dc099432e06a"
-
 [[DelimitedFiles]]
 deps = ["Mmap"]
 uuid = "8bb1440f-4735-579b-a4ab-409b98df4dab"
@@ -25,12 +15,6 @@ uuid = "8ba89e20-285c-5b6f-9357-94700520ee1b"
 deps = ["Markdown"]
 uuid = "b77e0a4c-d291-57a0-90e8-8db25a27a240"
 
-[[JSON]]
-deps = ["Dates", "Distributed", "Mmap", "Sockets", "Test", "Unicode"]
-git-tree-sha1 = "1f7a25b53ec67f5e9422f1f551ee216503f4a0fa"
-uuid = "682c06a0-de6a-54ab-a142-c8b1cf79cde6"
-version = "0.20.0"
-
 [[Libdl]]
 uuid = "8f399da3-3557-5675-b5ff-fb832c97cbdb"
 
@@ -62,14 +46,6 @@ uuid = "9e88b42a-f829-5b0c-bbe9-9e923198166b"
 [[Sockets]]
 uuid = "6462fe0b-24de-5631-8697-dd941f90decc"
 
-[[SparseArrays]]
-deps = ["LinearAlgebra", "Random"]
-uuid = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
-
-[[Statistics]]
-deps = ["LinearAlgebra", "SparseArrays"]
-uuid = "10745b16-79ce-11e8-11f9-7d13ad32a3b2"
-
 [[Test]]
 deps = ["Distributed", "InteractiveUtils", "Logging", "Random"]
 uuid = "8dfed614-e22c-5e08-85e1-65c5234f0b40"

Project.toml

@@ -1,19 +1,15 @@
 name = "LLLplus"
 uuid = "142c1900-a1c3-58ae-a66d-b187f9ca6423"
-keywords = ["lattice reduction", "lattice basis reduction",
-            "shortest vector problem", "closest vector problem",
-            "LLL", "Lenstra-Lenstra-Lovász","Seysen", "Brun","VBLAST",
-            "subset-sum problem"]
+keywords = ["lattice reduction", "lattice basis reduction", "shortest vector problem", "closest vector problem", "LLL", "Lenstra-Lenstra-Lovász", "Seysen", "Brun", "VBLAST", "subset-sum problem"]
 license = "MIT"
 version = "1.2.4"
 
-[compat]
-julia = "1"
-
 [deps]
-BenchmarkTools = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
 DelimitedFiles = "8bb1440f-4735-579b-a4ab-409b98df4dab"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 Printf = "de0858da-6303-5e67-8744-51eddeeeb8d7"
 Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
+
+[compat]
+julia = "1"

README.md

@@ -1,7 +1,7 @@
 # LLLplus.jl
 
 [![Build Status](https://travis-ci.org/christianpeel/LLLplus.jl.svg?branch=master)](https://travis-ci.org/christianpeel/LLLplus.jl)
-[![](https://img.shields.io/badge/docs-stable-blue.svg)](https://pkg.julialang.org/docs/LLLplus/)
+[![](https://img.shields.io/badge/docs-devel-blue.svg)](https://pkg.julialang.org/docs/LLLplus/)
 
 LLLplus includes
 [Lenstra-Lenstra-Lovász](https://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz_lattice_basis_reduction_algorithm)
@@ -12,7 +12,7 @@ decomposition; and a
 used in cryptography, digital communication, and integer programming.
 The historical and practical prominence of the LLL technique in
 lattice tools is the reason for its use in the name "LLLplus".
-Also, this package is experimental; see
+This package is experimental; see
 [fplll](https://github.com/fplll/fplll) for a robust tool.
 
 LLL [1] lattice reduction is a powerful tool that is widely used in

benchmark/lrtest.jl

@@ -1,3 +1,14 @@
+macro runtwice(ex)
+    quote
+        local t0 = time_ns()
+        local val0 = $(esc(ex))
+        local t1 = time_ns()
+        local val1 = $(esc(ex))
+        local t2 = time_ns()
+        min(t1-t0,t2-t1)/1e9
+    end
+end
+
 """
     lrtest(Ns::Int, N::Array{Int,1}, L::Array{Int,1}, dataType::Array{DataType,1}, distType)
 
@@ -137,9 +148,9 @@ for ix = 1:Ns
     #
     for ax = 1:length(lrAlgs)
         if lrAlgs[ax]==l2
-            times[ax,ix] = @mytwice B = lrAlgs[ax](data)
+            times[ax,ix] = @runtwice B = lrAlgs[ax](data)
         else
-            times[ax,ix] = @mytwice (B,T) = lrAlgs[ax](data)
+            times[ax,ix] = @runtwice (B,T) = lrAlgs[ax](data)
         end
         detB = abs(det(B))
         # Hermite factor

docs/src/functions.md

@@ -9,17 +9,21 @@ end
 ```
 ```@docs
     lll
+    l2
     cvp
     svp
     gauss
     seysen
     vblast
     subsetsum
+    lagariasodlyzko
+    mdsubsetsum
     integerfeasibility
     hard_sphere
     issizereduced
     islllreduced
     orthogonalitydefect
     hermitefactor
     seysencond
+    gen_qary_b
 ```

docs/src/index.md

@@ -13,7 +13,7 @@ decomposition; and a
 used in cryptography, digital communication, and integer programming.
 The historical and practical prominence of the LLL technique in
 lattice tools is the reason for its use in the name "LLLplus".
-Also, this package is experimental; see
+This package is experimental; see
 [fplll](https://github.com/fplll/fplll) for a robust tool.
 
 LLL [1] lattice reduction is a powerful tool that is widely used in
@@ -30,10 +30,10 @@ We also include code to do a
 [Vertical-Bell Laboratories Layered Space-Time](https://en.wikipedia.org/wiki/Bell_Laboratories_Layered_Space-Time)
 (V-BLAST) [6] matrix decomposition which is used in digital
 communications. The LLL, Brun, Seysen, V-BLAST, and CVP functions are
-used to solve (exactly or approximately) CVP problems; see
-[MUMIMO.jl](https://github.com/christianpeel/MUMIMO.jl) where it is
-used to approximate CVP in encoding and decoding multi-antenna
-signals.
+used to solve (exactly or approximately) CVP problems; the
+[MUMIMO.jl](https://github.com/christianpeel/MUMIMO.jl) package
+demostrates how these functions can be used in encoding and decoding
+multi-antenna signals.
 
 Another important application is in cryptanalysis; as an example of a
 cryptanalytic attack, see the `subsetsum` function.  Another important

test/runtests.jl

@@ -65,6 +65,9 @@ println("Testing VBLAST on same $(N)x$(N) complex matrix...")
 println("Testing Brun on real part of same $(N)x$(N) matrix...")
 @time (B,T) = brun(real.(H));
 @time (B,T) = brun(real.(H));
+println("Testing l2 on real part of same $(N)x$(N) matrix...")
+@time B = l2(real.(H));
+@time B = l2(real.(H));
 
 # Test sphere decoder
 Ns = 100000;