How to Install and Uninstall libagrep-ocaml-dev Package on Ubuntu 20.10 (Groovy Gorilla)
Last updated: December 23,2024
1. Install "libagrep-ocaml-dev" package
In this section, we are going to explain the necessary steps to install libagrep-ocaml-dev on Ubuntu 20.10 (Groovy Gorilla)
$
sudo apt update
Copied
$
sudo apt install
libagrep-ocaml-dev
Copied
2. Uninstall "libagrep-ocaml-dev" package
Please follow the guidelines below to uninstall libagrep-ocaml-dev on Ubuntu 20.10 (Groovy Gorilla):
$
sudo apt remove
libagrep-ocaml-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libagrep-ocaml-dev package on Ubuntu 20.10 (Groovy Gorilla)
Package: libagrep-ocaml-dev
Architecture: amd64
Version: 1.0-13build1
Priority: optional
Section: universe/libdevel
Source: ocamlagrep
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OCaml Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 151
Provides: libagrep-ocaml-dev-jg377
Depends: libagrep-ocaml (= 1.0-13build1), libagrep-ocaml-jg377, ocaml-nox-4.08.1
Filename: pool/universe/o/ocamlagrep/libagrep-ocaml-dev_1.0-13build1_amd64.deb
Size: 32604
MD5sum: 4888a44c4649e87994cd81c47029c7d9
SHA1: 15653d1dd3a4d58a98e1da3d228f217628791a02
SHA256: 6916d1a449b4d35f7ef26e9014098a59f0400e7b6be9e89c3be18329d3a73881
SHA512: 42d0d88585dcbcd15ce1d9ef0406924149c3552c480fb678dae1f031708732eb4cda99971a90177e8a8c0c224d497cb55e109c01ba2059e5111563db2a0ebf22
Homepage: http://forge.ocamlcore.org/projects/ocamlagrep/
Description-en: Wu-Manber algorithm for string searching with errors
This OCaml library implements the Wu-Manber algorithm for string searching
with errors, popularized by the "agrep" Unix command and the "glimpse" file
indexing tool. It was developed as part of a search engine for a largish MP3
collection; the "with error" searching comes handy for those who can't spell
Liszt or Shostakovitch.
.
Given a search pattern and a string, this algorithm determines whether the
string contains a substring that matches the pattern up to a parameterizable
number N of "errors". An "error" is either a substitution (replace a
character of the string with another character), a deletion (remove a
character) or an insertion (add a character to the string). In more
scientific terms, the number of errors is the Levenshtein edit distance
between the pattern and the matched substring.
.
The search patterns are roughly those of the Unix shell, including
one-character wildcard (?), character classes ([0-9]) and multi-character
wildcard (*). In addition, conjunction (&) and alternative (|) are supported.
General regular expressions are not supported, however.
.
This package contains all the development stuff you need to use
the agrep OCaml library in your programs.
Description-md5: 4dfc71d02cdeb8bcdb4b4b81b3623b5a
Architecture: amd64
Version: 1.0-13build1
Priority: optional
Section: universe/libdevel
Source: ocamlagrep
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OCaml Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 151
Provides: libagrep-ocaml-dev-jg377
Depends: libagrep-ocaml (= 1.0-13build1), libagrep-ocaml-jg377, ocaml-nox-4.08.1
Filename: pool/universe/o/ocamlagrep/libagrep-ocaml-dev_1.0-13build1_amd64.deb
Size: 32604
MD5sum: 4888a44c4649e87994cd81c47029c7d9
SHA1: 15653d1dd3a4d58a98e1da3d228f217628791a02
SHA256: 6916d1a449b4d35f7ef26e9014098a59f0400e7b6be9e89c3be18329d3a73881
SHA512: 42d0d88585dcbcd15ce1d9ef0406924149c3552c480fb678dae1f031708732eb4cda99971a90177e8a8c0c224d497cb55e109c01ba2059e5111563db2a0ebf22
Homepage: http://forge.ocamlcore.org/projects/ocamlagrep/
Description-en: Wu-Manber algorithm for string searching with errors
This OCaml library implements the Wu-Manber algorithm for string searching
with errors, popularized by the "agrep" Unix command and the "glimpse" file
indexing tool. It was developed as part of a search engine for a largish MP3
collection; the "with error" searching comes handy for those who can't spell
Liszt or Shostakovitch.
.
Given a search pattern and a string, this algorithm determines whether the
string contains a substring that matches the pattern up to a parameterizable
number N of "errors". An "error" is either a substitution (replace a
character of the string with another character), a deletion (remove a
character) or an insertion (add a character to the string). In more
scientific terms, the number of errors is the Levenshtein edit distance
between the pattern and the matched substring.
.
The search patterns are roughly those of the Unix shell, including
one-character wildcard (?), character classes ([0-9]) and multi-character
wildcard (*). In addition, conjunction (&) and alternative (|) are supported.
General regular expressions are not supported, however.
.
This package contains all the development stuff you need to use
the agrep OCaml library in your programs.
Description-md5: 4dfc71d02cdeb8bcdb4b4b81b3623b5a