| Port details |
- intervaltree Minimal C++ interval tree implementation
- 0.1.2 devel
 =0      Package not present on quarterly.This port was created during this quarter. It will be in the next quarterly branch but not the current one. - Maintainer: jwb@FreeBSD.org
- Port Added: 2025-02-18 15:02:58
- Last Update: 2025-02-18 14:56:30
- Commit Hash: 03b4820
- License: MIT
- WWW:
- https://github.com/ekg/intervaltree
- Description:
- An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval. This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.
  ¦  ¦  ¦  ¦ 
- Manual pages:
- FreshPorts has no man page information for this port.
- pkg-plist: as obtained via:
make generate-plist - Dependency lines:
-
- intervaltree>0:devel/intervaltree
- To install the port:
- cd /usr/ports/devel/intervaltree/ && make install clean
- To add the package, run one of these commands:
- pkg install devel/intervaltree
- pkg install intervaltree
NOTE: If this package has multiple flavors (see below), then use one of them instead of the name specified above.- PKGNAME: intervaltree
- Flavors: there is no flavor information for this port.
- distinfo:
- TIMESTAMP = 1739809365
SHA256 (ekg-intervaltree-0.1-2-gaa59377_GH0.tar.gz) = 4813653eade9572ed39a70e578958ccce845506ef23f609f680040d92c1d8868
SIZE (ekg-intervaltree-0.1-2-gaa59377_GH0.tar.gz) = 72565
Packages (timestamps in pop-ups are UTC):
- This port has no dependencies.
- This port is required by:
- for Build
-
- biology/freebayes
Configuration Options:- No options to configure
- Options name:
- devel_intervaltree
- FreshPorts was unable to extract/find any pkg message
- Master Sites:
|
Number of commits found: 1
| Commit History - (may be incomplete: for full details, see links to repositories near top of page) |
| Commit | Credits | Log message |
|---|
0.1.2
18 Feb 2025 14:56:30
 |
Jason W. Bacon (jwb) |
devel/intervaltree: Minimal C++ interval tree implementation
An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval. This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.
Unbundled from biology/freebayes |
Number of commits found: 1
|
As an Amazon Associate I earn from qualifying purchases.