ruby-activerecord-precounter
Yet Another N+1 COUNT Query Killer for ActiveRecord
Yet Another N+1 COUNT Query Killer for ActiveRecord, counter_cache alternative.
ActiveRecord::Precounter allows you to cache count of associated records by
eager loading.
ruby-mdurl-rb
MDUrl for motion-markdown-it in Ruby
This gem is a port of the mdurl javascript package by Vitaly Puzrin and Alex
Kocharin, that is used for the markdown-it package.
Currently synced with mdurl 1.0.5
urlextractor
Information gathering and website reconnaissance
urlextractor gathers information from the specified URL and prints it to STDOUT
gathering the following information:
- IP and hosting info like city and country (using FreegeoIP)
- DNS servers (using dig)
- ASN, Network range, ISP name (using RISwhois)
- Load balancer test
- Whois for abuse mail (using Spamcop)
- PAC (Proxy Auto Configuration) file
- Compares hashes to diff code
- robots.txt (recursively looking for hidden stuff)
- Source code (looking for passwords and users)
- External links (frames from other websites)
- Directory FUZZ (like Dirbuster and Wfuzz - using Dirbuster) directory list)
- URLvoid API - checks Google page rank, Alexa rank and possible blacklists
- Provides useful links at other websites to correlate with IP/ASN
- Option to open ALL results in browser at the end
python3-pylsp-isort
Isort plugin for the Python Language Server
This package provides a plugin to support the isort import sorter in editors
that support the Python Language Server.
libntl44
Number Theory Library, shared library
NTL is a high-performance, portable C++ library providing
data structures and algorithms for manipulating signed,
arbitrary length integers, and for vectors, matrices,
and polynomials over the integers and over finite fields.
libopenrefine-arithcode-java
Java implementation of arithmetic coding and PPM compression
Arithmetic coding is a general technique for coding the outcome of a
stochastic process based on an adaptive model. The expected bit rate is the
cross-entropy rate of the model versus the actual process. PPM, prediction by
partial matching, is an adaptive statistical model of a symbol sequence which
models the likelihood of the next byte based on a (relatively short) suffix of
the sequence of previous bytes.