Pinned Loading

1. Reasonably fast pairing heap impleme... Reasonably fast pairing heap implementation

   1

   struct EmptyHeap{T} end 

   2

   struct PairingTree{T}

   3

       top::T

   4

       length::Int

   5

       subheaps::Union{PairingTree{T},Nothing}

2. julia-ecs julia-ecs Public

   Julia 1

3. Quick minikanren implementation that... Quick minikanren implementation that I'm planning to grow into an rkanren with a Dataframe-based datalog-like subset when I will finally have the time

   1

   using FunctionalCollections

   2

   using MacroTools

   3

   using DataFrames

   4

   5

   # Data structures designed for this problem

4. Various modern implementations of Ta... Various modern implementations of Tarjans algorithm, for a PR to LightGraphs

   1

   using LightGraphs

   2

   using SimpleTraits

   3

   using BenchmarkTools

   4

   using GraphPlot

   5

5. Numerically stable LLL algorithm usi... Numerically stable LLL algorithm using Givens rotations

   1

   #

   2

   # Loosely based on the paper at https://core.ac.uk/download/pdf/82729885.pdf but with some significant deviation.

   3

   #

   4

   #  This implementation should be robust even for bad inputs with large condition numbers. The reduced basis of a lattice L with basis

   5

   #  vectors as columns of a matrix M is given by M*lll_unimod(M) .

6. pgxcron pgxcron Public

   A cron implementation specific to postgresql queries run on remote databases

   Go 3